details

property	value
status	complete
benchmark	read.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	talp_maria

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.86959695816 seconds
cpu usage	4.104417693
max memory	2.38833664E8

stage attributes

key	value
output-size	52184
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern parse(g,a) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) FailTransformerProof [EQUIVALENT, 0 ms] (4) Prolog (5) UnifyTransformerProof [EQUIVALENT, 0 ms] (6) Prolog (7) OrTransformerProof [EQUIVALENT, 0 ms] (8) Prolog (9) UndefinedPredicateHandlerProof [SOUND, 0 ms] (10) Prolog ---------------------------------------- (0) Obligation: Clauses: goal :- parse(.(some, .(tokens, .(here, []))), ParseTree). parse(Tokens, Answer) :- ','(;(','(read(Tokens, 1200, Term, LeftOver), all_read(LeftOver)), syntax_error(Tokens)), ','(!, =(Answer, Term))). all_read([]) :- !. all_read(S) :- syntax_error(.(operator, .(expected, .(after, .(expression, [])))), S). expect(Token, .(Token, Rest), Rest) :- !. expect(Token, S0, _M) :- syntax_error(.(Token, .(or, .(operator, .(expected, [])))), S0). prefixop(Op, Prec, Prec) :- ','(current_op(Prec, fy, Op), !). prefixop(Op, Prec, Less) :- ','(current_op(Prec, fx, Op), ','(!, is(Less, -(Prec, 1)))). postfixop(Op, Prec, Prec) :- ','(current_op(Prec, yf, Op), !). postfixop(Op, Less, Prec) :- ','(current_op(Prec, xf, Op), ','(!, is(Less, -(Prec, 1)))). infixop(Op, Less, Prec, Less) :- ','(current_op(Prec, xfx, Op), ','(!, is(Less, -(Prec, 1)))). infixop(Op, Less, Prec, Prec) :- ','(current_op(Prec, xfy, Op), ','(!, is(Less, -(Prec, 1)))). infixop(Op, Prec, Prec, Less) :- ','(current_op(Prec, yfx, Op), ','(!, is(Less, -(Prec, 1)))). ambigop(F, L1, O1, R1, L2, O2) :- ','(postfixop(F, L2, O2), ','(infixop(F, L1, O1, R1), !)). read(.(Token, RestTokens), Precedence, Term, LeftOver) :- read(Token, RestTokens, Precedence, Term, LeftOver). read([], _X, _Y, _Z) :- syntax_error(.(expression, .(expected, [])), []). read(var(Variable, _M), .('(', S1), Precedence, Answer, S) :- ','(!, ','(read(S1, 999, Arg1, S2), ','(read_args(S2, RestArgs, S3), ','(!, exprtl0(S3, apply(Variable, .(Arg1, RestArgs)), Precedence, Answer, S))))). read(var(Variable, _M), S0, Precedence, Answer, S) :- ','(!, exprtl0(S0, Variable, Precedence, Answer, S)). read(atom(-), .(integer(Integer), S1), Precedence, Answer, S) :- ','(is(Negative, -(Integer)), ','(!, exprtl0(S1, Negative, Precedence, Answer, S))). read(atom(Functor), .('(', S1), Precedence, Answer, S) :- ','(!, ','(read(S1, 999, Arg1, S2), ','(read_args(S2, RestArgs, S3), ','(=..(Term, .(Functor, .(Arg1, RestArgs))), ','(!, exprtl0(S3, Term, Precedence, Answer, S)))))). read(atom(Functor), S0, Precedence, Answer, S) :- ','(prefixop(Functor, Prec, Right), ','(!, after_prefix_op(Functor, Prec, Right, S0, Precedence, Answer, S))). read(atom(Atom), S0, Precedence, Answer, S) :- ','(!, exprtl0(S0, Atom, Precedence, Answer, S)). read(integer(Integer), S0, Precedence, Answer, S) :- ','(!, exprtl0(S0, Integer, Precedence, Answer, S)). read('[', .(']', S1), Precedence, Answer, S) :- ','(!, exprtl0(S1, [], Precedence, Answer, S)). read('[', S1, Precedence, Answer, S) :- ','(!, ','(read(S1, 999, Arg1, S2), ','(read_list(S2, RestArgs, S3), ','(!, exprtl0(S3, .(Arg1, RestArgs), Precedence, Answer, S))))). read('(', S1, Precedence, Answer, S) :- ','(!, ','(read(S1, 1200, Term, S2), ','(expect(')', S2, S3), ','(!, exprtl0(S3, Term, Precedence, Answer, S))))). read(' (', S1, Precedence, Answer, S) :- ','(!, ','(read(S1, 1200, Term, S2), ','(expect(')', S2, S3), ','(!, exprtl0(S3, Term, Precedence, Answer, S))))). read('{', .('}', S1), Precedence, Answer, S) :- ','(!, exprtl0(S1, '{}', Precedence, Answer, S)). read('{', S1, Precedence, Answer, S) :- ','(!, ','(read(S1, 1200, Term, S2), ','(expect('}', S2, S3), ','(!, exprtl0(S3, '{}'(Term), Precedence, Answer, S))))). read(string(List), S0, Precedence, Answer, S) :- ','(!, exprtl0(S0, List, Precedence, Answer, S)). read(Token, S0, _X, _Y, _Z) :- syntax_error(.(Token, .(cannot, .(start, .(an, .(expression, []))))), S0). read_args(.(',', S1), .(Term, Rest), S) :- ','(!, ','(read(S1, 999, Term, S2), ','(!, read_args(S2, Rest, S)))). read_args(.(')', S), [], S) :- !. read_args(S, _X, _Y) :- syntax_error(.(', or )', .(expected, .(in, .(arguments, [])))), S). read_list(.(',', S1), .(Term, Rest), S) :- ','(!, ','(read(S1, 999, Term, S2), ','(!, read_list(S2, Rest, S)))). read_list(.('|', S1), Rest, S) :- ','(!, ','(read(S1, 999, Rest, S2), ','(!, expect(']', S2, S)))). read_list(.(']', S), [], S) :- !. read_list(S, _X, _Y) :- syntax_error(.(', | or ]', .(expected, .(in, .(list, [])))), S). after_prefix_op(Op, Oprec, _Aprec, S0, Precedence, _X, _Y) :- ','(<(Precedence, Oprec), ','(!, syntax_error(.(prefix, .(operator, .(Op, .(in, .(context, .(with, .(precedence, .(Precedence, [])))))))), S0))). after_prefix_op(Op, Oprec, _Aprec, S0, Precedence, Answer, S) :- ','(peepop(S0, S1), ','(prefix_is_atom(S1, Oprec), exprtl(S1, Oprec, Op, Precedence, Answer, S))). after_prefix_op(Op, Oprec, Aprec, S1, Precedence, Answer, S) :- ','(read(S1, Aprec, Arg, S2), ','(=..(Term, .(Op, .(Arg, []))), ','(!, exprtl(S2, Oprec, Term, Precedence, Answer, S)))). peepop(.(atom(F), .('(', S1)), .(atom(F), .('(', S1))) :- !. peepop(.(atom(F), S1), .(infixop(F, L, P, R), S1)) :- infixop(F, L, P, R). peepop(.(atom(F), S1), .(postfixop(F, L, P), S1)) :- postfixop(F, L, P). peepop(S0, S0). prefix_is_atom(.(Token, _M), Precedence) :- prefix_is_atom(Token, Precedence). prefix_is_atom(infixop(_X, L, _Y, _Z), P) :- >=(L, P). prefix_is_atom(postfixop(_X, L, _Y), P) :- >=(L, P). prefix_is_atom(')', X1). prefix_is_atom(']', X2). prefix_is_atom('}', X3). prefix_is_atom('|', P) :- >=(1100, P). prefix_is_atom(',', P) :- >=(1000, P). prefix_is_atom([], X4). exprtl0(.(atom(F), S1), Term, Precedence, Answer, S) :- ','(ambigop(F, L1, O1, R1, L2, O2), ','(!, ;(exprtl(.(infixop(F, L1, O1, R1), S1), 0, Term, Precedence, Answer, S), exprtl(.(postfixop(F, L2, O2), S1), 0, Term, Precedence, Answer, S)))). exprtl0(.(atom(F), S1), Term, Precedence, Answer, S) :- ','(infixop(F, L1, O1, R1), ','(!, exprtl(.(infixop(F, L1, O1, R1), S1), 0, Term, Precedence, Answer, S))). exprtl0(.(atom(F), S1), Term, Precedence, Answer, S) :- ','(postfixop(F, L2, O2), ','(!, exprtl(.(postfixop(F, L2, O2), S1), 0, Term, Precedence, Answer, S))). exprtl0(.(',', S1), Term, Precedence, Answer, S) :- ','(>=(Precedence, 1000), ','(!, ','(read(S1, 1000, Next, S2), ','(!, exprtl(S2, 1000, ','(Term, Next), Precedence, Answer, S))))). exprtl0(.('|', S1), Term, Precedence, Answer, S) :- ','(>=(Precedence, 1100), ','(!, ','(read(S1, 1100, Next, S2), ','(!, exprtl(S2, 1100, ;(Term, Next), Precedence, Answer, S))))). exprtl0(.(atom(end_of_file), []), '<eof>', X5, [], []) :- !. exprtl0(.(atom(end_of_file), []), Term, X6, Term, []) :- !. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Progr 19030