Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919813
details
property
value
status
complete
benchmark
prime.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Weinert_15
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.84925603867 seconds
cpu usage
4.271185319
max memory
2.03055104E8
stage attributes
key
value
output-size
28973
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 isPrime(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 52 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: isPrime(Cand) :- ','(>(Cand, 0), isNotMultipleOfRange(2, -(Cand, 1), Cand)). isNotMultipleOfRange(Low, High, Cand) :- ','(>(Low, High), !). isNotMultipleOfRange(Low, High, Cand) :- ','(=<(Low, High), ','(!, ','(isNotMultipleOf(Low, Cand), isNotMultipleOfRange(+(Low, 1), High, Cand)))). isNotMultipleOf(Factor, Multiple) :- checkNotMultipleRange(0, Multiple, Factor, Multiple). checkNotMultipleRange(Low, High, Factor, Multiple) :- ','(>(Low, High), !). checkNotMultipleRange(Low, High, Factor, Multiple) :- ','(=<(Low, High), ','(!, ','(checkNotMultiple(Low, Factor, Multiple), checkNotMultipleRange(+(Low, 1), High, Factor, Multiple)))). checkNotMultiple(Factor1, Factor2, Multiple) :- =\=(Multiple, *(Factor1, Factor2)). Query: isPrime(g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(isPrime Cand)", "(',' (> Cand (0)) (isNotMultipleOfRange (2) (- Cand (1)) Cand))" ], [ "(isNotMultipleOfRange Low High Cand)", "(',' (> Low High) (!))" ], [ "(isNotMultipleOfRange Low High Cand)", "(',' (=< Low High) (',' (!) (',' (isNotMultipleOf Low Cand) (isNotMultipleOfRange (+ Low (1)) High Cand))))" ], [ "(isNotMultipleOf Factor Multiple)", "(checkNotMultipleRange (0) Multiple Factor Multiple)" ], [ "(checkNotMultipleRange Low High Factor Multiple)", "(',' (> Low High) (!))" ], [ "(checkNotMultipleRange Low High Factor Multiple)", "(',' (=< Low High) (',' (!) (',' (checkNotMultiple Low Factor Multiple) (checkNotMultipleRange (+ Low (1)) High Factor Multiple))))" ], [ "(checkNotMultiple Factor1 Factor2 Multiple)", "(=\\= Multiple (* Factor1 Factor2))" ] ] }, "graph": { "nodes": { "type": "Nodes", "472": { "goal": [{ "clause": -1, "scope": -1, "term": "(isNotMultipleOfRange (2) (- T4 (1)) T4)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [{ "lhs": { "type": "PlainIntegerConstant", "value": "0" }, "type": "PlainIntegerRelation", "rhs": { "name": "T4",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030