Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919968
details
property
value
status
complete
benchmark
program-8-4.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Art-of-prolog
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.76301717758 seconds
cpu usage
4.073560467
max memory
3.1623168E8
stage attributes
key
value
output-size
55978
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 factorial(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 47 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: factorial(N, F) :- factorial(N, 1, F). factorial(N, T, F) :- ','(>(N, 0), ','(is(T1, *(T, N)), ','(is(N1, -(N, 1)), factorial(N1, T1, F)))). factorial(0, F, F). Query: factorial(g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(factorial N F)", "(factorial N (1) F)" ], [ "(factorial N T F)", "(',' (> N (0)) (',' (is T1 (* T N)) (',' (is N1 (- N (1))) (factorial N1 T1 F))))" ], [ "(factorial (0) F F)", null ] ] }, "graph": { "nodes": { "13": { "goal": [ { "clause": 1, "scope": 2, "term": "(factorial T11 (1) T13)" }, { "clause": 2, "scope": 2, "term": "(factorial T11 (1) T13)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T11"], "free": [], "exprvars": [] } }, "15": { "goal": [{ "clause": 1, "scope": 2, "term": "(factorial T11 (1) T13)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T11"], "free": [],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030