Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919677
details
property
value
status
complete
benchmark
append_linear.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Schneider_Kamp_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.78553199768 seconds
cpu usage
4.030154865
max memory
2.0137984E8
stage attributes
key
value
output-size
22810
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern append(g,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) BuiltinConflictTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) PrologToDTProblemTransformerProof [SOUND, 0 ms] (4) TRIPLES (5) TriplesToPiDPProof [SOUND, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: append(X, Y, Z) :- ','(=(X, []), ','(!, =(Y, Z))). append(X, Y, Z) :- ','(=(X, .(H, Xs)), ','(!, ','(=(Z, .(H, Zs)), append(Xs, Y, Zs)))). =(X, X). Query: append(g,a,a) ---------------------------------------- (1) BuiltinConflictTransformerProof (EQUIVALENT) Renamed defined predicates conflicting with built-in predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: append(X, Y, Z) :- ','(user_defined_=(X, []), ','(!, user_defined_=(Y, Z))). append(X, Y, Z) :- ','(user_defined_=(X, .(H, Xs)), ','(!, ','(user_defined_=(Z, .(H, Zs)), append(Xs, Y, Zs)))). user_defined_=(X, X). Query: append(g,a,a) ---------------------------------------- (3) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(append X Y Z)", "(',' (user_defined_= X ([])) (',' (!) (user_defined_= Y Z)))" ], [ "(append X Y Z)", "(',' (user_defined_= X (. H Xs)) (',' (!) (',' (user_defined_= Z (. H Zs)) (append Xs Y Zs))))" ], [ "(user_defined_= X X)", null ] ] }, "graph": { "nodes": { "35": { "goal": [ { "clause": 2, "scope": 2, "term": "(',' (user_defined_= T7 ([])) (',' (!_1) (user_defined_= T10 T11)))" }, { "clause": -1, "scope": 2, "term": null }, { "clause": 1,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030