Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920170
details
property
value
status
complete
benchmark
gopher1.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)
1.71649909019 seconds
cpu usage
3.921868952
max memory
2.5628672E8
stage attributes
key
value
output-size
75415
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, 64 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Clauses: gopher(nil, L) :- ','(!, eq(L, nil)). gopher(X, Y) :- ','(head(X, nil), ','(!, ','(tail(X, T), eq(Y, cons(nil, T))))). gopher(X, Y) :- ','(head(X, 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). eq(X, X). Query: gopher(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(gopher (nil) L)", "(',' (!) (eq L (nil)))" ], [ "(gopher X Y)", "(',' (head X (nil)) (',' (!) (',' (tail X T) (eq Y (cons (nil) T)))))" ], [ "(gopher X Y)", "(',' (head X 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 ], [ "(eq X X)", null ] ] }, "graph": { "nodes": { "46": { "goal": [ { "clause": 4, "scope": 3, "term": "(',' (head T11 (nil)) (',' (!_1) (',' (tail T11 X13) (eq T13 (cons (nil) X13)))))" }, { "clause": -1, "scope": 3, "term": null
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030