Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919923
details
property
value
status
complete
benchmark
kay4.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
prolog_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.61836385727 seconds
cpu usage
3.513126627
max memory
2.11103744E8
stage attributes
key
value
output-size
6221
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 kay4(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 0 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: kay4(I) :- ','(length(.(X1, .(X2, L)), I), ','(top(L), ','(mid([], L), bot(L)))). top(L) :- ','(write(a), ','(mwrite('-', L), ','(write(b), nl))). bot(L) :- ','(write(c), ','(mwrite('-', L), ','(write(d), nl))). mid(X, []). mid(X, .(X3, [])) :- ','(write('|'), ','(mwrite(' ', X), ','(write('X'), ','(mwrite(' ', X), ','(write('|'), nl))))). mid(X, .(X4, .(X5, Y))) :- ','(write('|'), ','(mwrite(' ', X), ','(write('\\'), ','(mwrite(' ', Y), ','(write('/'), ','(mwrite(' ', X), ','(write('|'), ','(nl, ','(mid(.(X6, X), Y), ','(write('|'), ','(mwrite(' ', X), ','(write('/'), ','(mwrite(' ', Y), ','(write('\\'), ','(mwrite(' ', X), ','(write('|'), nl)))))))))))))))). mwrite(Char, L) :- findall(X7, ','(member(X8, L), write(Char)), X9). member(X, .(X, X10)). member(X, .(X11, Xs)) :- member(X, Xs). Query: kay4(g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 1, "program": { "directives": [], "clauses": [ [ "(kay4 I)", "(',' (length (. X1 (. X2 L)) I) (',' (top L) (',' (mid ([]) L) (bot L))))" ], [ "(top L)", "(',' (write (a)) (',' (mwrite ('-') L) (',' (write (b)) (nl))))" ], [ "(bot L)", "(',' (write (c)) (',' (mwrite ('-') L) (',' (write (d)) (nl))))" ], [ "(mid X ([]))", null ], [ "(mid X (. X3 ([])))", "(',' (write ('|')) (',' (mwrite (' ') X) (',' (write ('X')) (',' (mwrite (' ') X) (',' (write ('|')) (nl))))))" ], [ "(mid X (. X4 (. X5 Y)))", "(',' (write ('|')) (',' (mwrite (' ') X) (',' (write ('\\\\')) (',' (mwrite (' ') Y) (',' (write ('/')) (',' (mwrite (' ') X) (',' (write ('|')) (',' (nl) (',' (mid (. X6 X) Y) (',' (write ('|')) (',' (mwrite (' ') X) (',' (write ('/')) (',' (mwrite (' ') Y) (',' (write ('\\\\')) (',' (mwrite (' ') X) (',' (write ('|')) (nl)))))))))))))))))" ], [ "(mwrite Char L)", "(findall X7 (',' (member X8 L) (write Char)) X9)" ], [ "(member X (. X X10))", null ], [ "(member X (. X11 Xs))", "(member X Xs)" ] ] }, "graph": { "nodes": { "1": { "goal": [{ "clause": -1, "scope": -1, "term": "(kay4 T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030