Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920093
details
property
value
status
complete
benchmark
svcomp-b-18-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.40392208099 seconds
cpu usage
11.977187873
max memory
9.05068544E8
stage attributes
key
value
output-size
148007
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 test_fun(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 59 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 5 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 62 ms] (10) AND (11) IRSwT (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] (13) IRSwT (14) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 33 ms] (17) IntTRS (18) RankingReductionPairProof [EQUIVALENT, 8 ms] (19) YES (20) IRSwT (21) IntTRSCompressionProof [EQUIVALENT, 0 ms] (22) IRSwT (23) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (24) IRSwT (25) TempFilterProof [SOUND, 9 ms] (26) IntTRS (27) RankingReductionPairProof [EQUIVALENT, 1 ms] (28) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- loop1(X, Y). loop1(X, Y) :- ','(>(X, 0), ','(>(Y, 0), ','(>(X, Y), loop2(X, Y)))). loop1(X, Y) :- ','(>(X, 0), ','(>(Y, 0), ','(=<(X, Y), loop3(X, Y)))). loop1(X, Y) :- >=(X, 0). loop1(X, Y) :- >=(Y, 0). loop2(X, Y) :- ','(>(X, 0), ','(is(X1, -(X, 1)), loop2(X1, Y))). loop2(X, Y) :- ','(=<(X, 0), loop1(X, Y)). loop3(X, Y) :- ','(>(Y, 0), ','(is(Y1, -(Y, 1)), loop3(X, Y1))). loop3(X, Y) :- ','(=<(Y, 0), loop1(X, Y)). Query: test_fun(g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(test_fun X Y)", "(loop1 X Y)" ], [ "(loop1 X Y)", "(',' (> X (0)) (',' (> Y (0)) (',' (> X Y) (loop2 X Y))))" ], [ "(loop1 X Y)", "(',' (> X (0)) (',' (> Y (0)) (',' (=< X Y) (loop3 X Y))))" ], [ "(loop1 X Y)", "(>= X (0))" ], [ "(loop1 X Y)", "(>= Y (0))" ], [ "(loop2 X Y)", "(',' (> X (0)) (',' (is X1 (- X (1))) (loop2 X1 Y)))" ],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030