Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920158
details
property
value
status
complete
benchmark
fold3.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.86206889153 seconds
cpu usage
4.354528722
max memory
3.71523584E8
stage attributes
key
value
output-size
23763
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern fold(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) ATransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: fold(X, [], Z) :- ','(!, eq(X, Z)). fold(X, Y, Z) :- ','(head(Y, H), ','(tail(Y, T), ','(myop(X, H, V), fold(V, T, Z)))). myop(a, b, a). head([], X1). head(.(H, X2), H). tail([], []). tail(.(X3, T), T). eq(X, X). Query: fold(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(fold X ([]) Z)", "(',' (!) (eq X Z))" ], [ "(fold X Y Z)", "(',' (head Y H) (',' (tail Y T) (',' (myop X H V) (fold V T Z))))" ], [ "(myop (a) (b) (a))", null ], [ "(head ([]) X1)", null ], [ "(head (. H X2) H)", null ], [ "(tail ([]) ([]))", null ], [ "(tail (. X3 T) T)", null ], [ "(eq X X)", null ] ] }, "graph": { "nodes": { "type": "Nodes", "282": { "goal": [ { "clause": -1,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030