Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529508
details
property
value
status
complete
benchmark
suffix-bf.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
BCGGV05
run statistics
property
value
solver
NTI_20
configuration
default
runtime (wallclock)
0.191861152649 seconds
cpu usage
0.18667574
max memory
3.3501184E7
stage attributes
key
value
output-size
1138
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Prover = LP(tech=TOPLAS06, unlimited) ** BEGIN proof argument ** suffix(i,o): ([suffix(_0,[_1|_2]) :- app(_3,_0,_2), app([_0|_1],_2,[_0|_3]) :- app(_1,_2,_3)], {suffix/2->(0->_0), app/3->(1->_1)}) ** END proof argument ** ** BEGIN proof description ** * Iteration = 0: 0 unfolded rule generated, 0 loop generated * Iteration = 1: 3 new unfolded rule(s) generated, 1 new loop(s) generated * Iteration = 2: 4 new unfolded rule(s) generated, 3 new loop(s) generated The mode suffix(i,o) is non-terminating because of the generated looping pair: ([suffix(_0,[_1|_2]) :- app(_3,_0,_2), app([_0|_1],_2,[_0|_3]) :- app(_1,_2,_3)], {suffix/2->(0->_0), app/3->(1->_1)}) * All specified modes do not terminate: suffix(i,o) ** END proof description ** Proof stopped at iteration 2 Number of unfolded rules generated by this proof = 7 Number of unfolded rules generated by all the parallel proofs = 7
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming