Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919806
details
property
value
status
complete
benchmark
gcd.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Euler_queensu-cs260
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.72096419334 seconds
cpu usage
11.747156623
max memory
1.669373952E9
stage attributes
key
value
output-size
311007
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 gcd(a,a,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 99 ms] (2) AND (3) IRSwT (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 2 ms] (5) IRSwT (6) IntTRSCompressionProof [EQUIVALENT, 13 ms] (7) IRSwT (8) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (9) IRSwT (10) IRSwTTerminationDigraphProof [EQUIVALENT, 15 ms] (11) TRUE (12) IRSwT (13) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (14) IRSwT (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (18) IRSwT (19) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (20) TRUE ---------------------------------------- (0) Obligation: Clauses: gcd(X, 0, X) :- !. gcd(0, X, X) :- !. gcd(X, Y, Divisor) :- ','(>=(X, Y), ','(!, ','(>(Y, 0), ','(is(Remainder, mod(X, Y)), gcd(Y, Remainder, Divisor))))). gcd(X, Y, Divisor) :- ','(<(X, Y), ','(!, ','(>(X, 0), gcd(Y, X, Divisor)))). Query: gcd(a,a,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 5, "program": { "directives": [], "clauses": [ [ "(gcd X (0) X)", "(!)" ], [ "(gcd (0) X X)", "(!)" ], [ "(gcd X Y Divisor)", "(',' (>= X Y) (',' (!) (',' (> Y (0)) (',' (is Remainder (mod X Y)) (gcd Y Remainder Divisor)))))" ], [ "(gcd X Y Divisor)", "(',' (< X Y) (',' (!) (',' (> X (0)) (gcd Y X Divisor))))" ] ] }, "graph": { "nodes": { "5185": { "goal": [{ "clause": -1, "scope": -1, "term": "(gcd T82 T81 T80)" }], "kb": { "nonunifying": [ [ "(gcd T1 T2 T80)", "(gcd X3 (0) X3)" ], [ "(gcd T1 T2 T80)", "(gcd (0) X6 X6)" ] ],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030