Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919980
details
property
value
status
complete
benchmark
binomial-true-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.71962785721 seconds
cpu usage
7.858199507
max memory
1.083727872E9
stage attributes
key
value
output-size
47342
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 binomial(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 42 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 15 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 28 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 37 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 14 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: binomial(N, K, Ret) :- ','(fact(N, NFact), ','(fact(K, KFact), ','(is(NMinK, -(N, K)), ','(fact(NMinK, NMinKFact), is(Ret, //(NFact, *(KFact, NMinKFact))))))). fact(N, 1) :- =<(N, 0). fact(N, Ret) :- ','(>(N, 0), ','(is(NRec, -(N, 1)), ','(fact(NRec, RetRec), is(Ret, *(RetRec, N))))). Query: binomial(g,g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(binomial N K Ret)", "(',' (fact N NFact) (',' (fact K KFact) (',' (is NMinK (- N K)) (',' (fact NMinK NMinKFact) (is Ret (// NFact (* KFact NMinKFact)))))))" ], [ "(fact N (1))", "(=< N (0))" ], [ "(fact N Ret)", "(',' (> N (0)) (',' (is NRec (- N (1))) (',' (fact NRec RetRec) (is Ret (* RetRec N)))))" ] ] }, "graph": { "nodes": { "2199": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [{ "lhs": { "name": "T23", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "0" }, "operation": ">" }] }, "ground": ["T23"], "free": [], "exprvars": ["T23"] }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030