Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920039
details
property
value
status
complete
benchmark
browse.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
talp_maria
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.8200750351 seconds
cpu usage
4.167569243
max memory
2.31325696E8
stage attributes
key
value
output-size
105007
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 investigate(g,a) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) IntegerArithmeticTransformerProof [SOUND, 0 ms] (2) Prolog (3) CutEliminatorProof [SOUND, 0 ms] (4) Prolog (5) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (6) Prolog (7) CallTransformerProof [EQUIVALENT, 0 ms] (8) Prolog (9) CutEliminatorProof [SOUND, 0 ms] (10) Prolog (11) FailTransformerProof [EQUIVALENT, 0 ms] (12) Prolog (13) UnifyTransformerProof [EQUIVALENT, 0 ms] (14) Prolog (15) OrTransformerProof [EQUIVALENT, 0 ms] (16) Prolog (17) UndefinedPredicateHandlerProof [SOUND, 0 ms] (18) Prolog (19) CutEliminatorProof [SOUND, 0 ms] (20) Prolog (21) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (22) Prolog (23) CallTransformerProof [EQUIVALENT, 0 ms] (24) Prolog (25) CutEliminatorProof [SOUND, 0 ms] (26) Prolog (27) FailTransformerProof [EQUIVALENT, 0 ms] (28) Prolog (29) UnifyTransformerProof [EQUIVALENT, 0 ms] (30) Prolog (31) OrTransformerProof [EQUIVALENT, 0 ms] (32) Prolog (33) UndefinedPredicateHandlerProof [SOUND, 0 ms] (34) Prolog ---------------------------------------- (0) Obligation: Clauses: main(V1, V2) :- ','(init(100, 10, 4, V1, Symbols), ','(randomize(Symbols, RSymbols, 21), investigate(RSymbols, V2))). investigate([], X1). investigate(.(U, Units), Patterns) :- ','(property(U, pattern, Data), ','(p_investigate(Data, Patterns), investigate(Units, Patterns))). property([], _X, _Y) :- fail. property(.(Prop, RProps), P, Val) :- ','(functor(Prop, P, _X), ','(!, arg(1, Prop, Val))). property(.(_X, RProps), P, Val) :- property(RProps, P, Val). p_investigate([], _X). p_investigate(.(D, Data), Patterns) :- ','(p_match(Patterns, D), p_investigate(Data, Patterns)). p_match([], X2). p_match(.(P, Patterns), D) :- ','(;(','(match(D, P), fail), true), p_match(Patterns, D)). match([], []) :- !. match(.(X, PRest), .(Y, SRest)) :- ','(var(Y), ','(!, ','(=(X, Y), match(PRest, SRest)))). match(List, .(Y, Rest)) :- ','(nonvar(Y), ','(=(Y, star(X)), ','(!, ','(concat(X, SRest, List), match(SRest, Rest))))). match(.(X, PRest), .(Y, SRest)) :- ','(;(->(atom(X), =(X, Y)), match(X, Y)), match(PRest, SRest)). concat([], L, L). concat(.(X, L1), L2, .(X, L3)) :- concat(L1, L2, L3). main :- ','(init(100, 10, 4, .(.(a, .(a, .(a, .(b, .(b, .(b, .(b, .(a, .(a, .(a, .(a, .(a, .(b, .(b, .(a, .(a, .(a, []))))))))))))))))), .(.(a, .(a, .(b, .(b, .(b, .(b, .(a, .(a, .(.(a, .(a, [])), .(.(b, .(b, [])), [])))))))))), .(.(a, .(a, .(a, .(b, .(.(b, .(a, [])), .(b, .(a, .(b, .(a, []))))))))), []))), Symbols), ','(randomize(Symbols, RSymbols, 21), ','(!, investigate(RSymbols, .(.(star(SA), .(B, .(star(SB), .(B, .(a, .(star(SA), .(a, .(star(SB), .(star(SA), []))))))))), .(.(star(SA), .(star(SB), .(star(SB), .(star(SA), .(.(star(SA), []), .(.(star(SB), []), [])))))), .(.(_X, .(_Y, .(star(_Z), .(.(b, .(a, [])), .(star(_A), .(_B, .(_C, []))))))), []))))))). init(N, M, Npats, Ipats, Result) :- init(N, M, M, Npats, Ipats, Result). init(0, _X, _Y, _Z, _W, _L) :- !. init(N, I, M, Npats, Ipats, .(Symb, Rest)) :- ','(fill(I, [], L), ','(get_pats(Npats, Ipats, Ppats), ','(is(J, -(M, I)), ','(fill(J, .(pattern(Ppats), L), Symb), ','(is(N1, -(N, 1)), ','(;(->(==(I, 0), is(I1, M)), is(I1, -(I, 1))), init(N1, I1, M, Npats, Ipats, Rest))))))). get_pats(Npats, Ipats, Result) :- get_pats(Npats, Ipats, Result, Ipats). get_pats(0, _X, [], _Y) :- !. get_pats(N, .(X, Xs), .(X, Ys), Ipats) :- ','(is(N1, -(N, 1)), get_pats(N1, Xs, Ys, Ipats)). get_pats(N, [], Ys, Ipats) :- get_pats(N, Ipats, Ys, Ipats). fill(0, L, L) :- !. fill(N, L, .(dummy([]), Rest)) :- ','(is(N1, -(N, 1)), fill(N1, L, Rest)). randomize([], [], X3) :- !. randomize(In, .(X, Out), Rand) :- ','(length(In, Lin), ','(is(Rand1, mod(*(Rand, 17), 251)), ','(is(N, mod(Rand1, Lin)), ','(split(N, In, X, In1), randomize(In1, Out, Rand1))))). split(0, .(X, Xs), X, Xs) :- !. split(N, .(X, Xs), RemovedElt, .(X, Ys)) :- ','(is(N1, -(N, 1)), split(N1, Xs, RemovedElt, Ys)). Query: investigate(g,a) ---------------------------------------- (1) IntegerArithmeticTransformerProof (SOUND) Added definitions of predefined predicates [PROLOG].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030