Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919655
details
property
value
status
complete
benchmark
star1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Schneider_Kamp_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.33738493919 seconds
cpu usage
6.18334195
max memory
5.43494144E8
stage attributes
key
value
output-size
36782
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 star(g,g) 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) AND (9) PiDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) PiDP (12) PiDPToQDPProof [SOUND, 3 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 1 ms] (15) YES (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 0 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) TRUE ---------------------------------------- (0) Obligation: Clauses: star(U, []) :- !. star([], W) :- ','(!, =(W, [])). star(U, W) :- ','(app(U, V, W), star(U, V)). app([], L, L). app(.(X, L), M, .(X, N)) :- app(L, M, N). =(X, X). Query: star(g,g) ---------------------------------------- (1) BuiltinConflictTransformerProof (EQUIVALENT) Renamed defined predicates conflicting with built-in predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: star(U, []) :- !. star([], W) :- ','(!, user_defined_=(W, [])). star(U, W) :- ','(app(U, V, W), star(U, V)). app([], L, L). app(.(X, L), M, .(X, N)) :- app(L, M, N). user_defined_=(X, X). Query: star(g,g) ---------------------------------------- (3) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(star U ([]))", "(!)" ], [ "(star ([]) W)", "(',' (!) (user_defined_= W ([])))" ], [ "(star U W)", "(',' (app U V W) (star U V))" ], [ "(app ([]) L L)",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030