Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920094
details
property
value
status
complete
benchmark
gopher2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.6781270504 seconds
cpu usage
4.080635564
max memory
2.45723136E8
stage attributes
key
value
output-size
202475
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 gopher(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 56 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Clauses: gopher(nil, nil). gopher(X, cons(nil, T)) :- ','(no(empty(X)), ','(head(X, nil), tail(X, T))). gopher(X, Y) :- ','(no(empty(X)), ','(head(X, H), ','(no(empty(H)), ','(head(H, U), ','(tail(H, V), ','(tail(X, W), gopher(cons(U, cons(V, W)), Y))))))). head([], X1). head(.(X, X2), X). tail([], []). tail(.(X3, X), X). empty([]). no(X) :- ','(X, ','(!, failure(a))). no(X4). failure(b). Query: gopher(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 3, "program": { "directives": [], "clauses": [ [ "(gopher (nil) (nil))", null ], [ "(gopher X (cons (nil) T))", "(',' (no (empty X)) (',' (head X (nil)) (tail X T)))" ], [ "(gopher X Y)", "(',' (no (empty X)) (',' (head X H) (',' (no (empty H)) (',' (head H U) (',' (tail H V) (',' (tail X W) (gopher (cons U (cons V W)) Y)))))))" ], [ "(head ([]) X1)", null ], [ "(head (. X X2) X)", null ], [ "(tail ([]) ([]))", null ], [ "(tail (. X3 X) X)", null ], [ "(empty ([]))", null ], [ "(no X)", "(',' X (',' (!) (failure (a))))" ], [ "(no X4)", null ], [ "(failure (b))", null ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030