Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487096422
details
property
value
status
complete
benchmark
insert-bfb.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
BCGGV05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.8692 seconds
cpu usage
4.35035
user time
4.16333
system time
0.187012
max virtual memory
1.8809476E7
max residence set size
329904.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern insert(g,a,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 9 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Clauses: insert(X, void, tree(X, void, void)). insert(X, tree(X, Left, Right), tree(X, Left, Right)). insert(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), insert(X, Left, Left1)). insert(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), insert(X, Right, Right1)). less(0, s(X1)). less(s(X), s(Y)) :- less(X, Y). Query: insert(g,a,g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: insert_in_3: (b,f,b) less_in_2: (b,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: insert_in_gag(X, void, tree(X, void, void)) -> insert_out_gag(X, void, tree(X, void, void)) insert_in_gag(X, tree(X, Left, Right), tree(X, Left, Right)) -> insert_out_gag(X, tree(X, Left, Right), tree(X, Left, Right)) insert_in_gag(X, tree(Y, Left, Right), tree(Y, Left1, Right)) -> U1_gag(X, Y, Left, Right, Left1, less_in_gg(X, Y)) less_in_gg(0, s(X1)) -> less_out_gg(0, s(X1)) less_in_gg(s(X), s(Y)) -> U5_gg(X, Y, less_in_gg(X, Y)) U5_gg(X, Y, less_out_gg(X, Y)) -> less_out_gg(s(X), s(Y)) U1_gag(X, Y, Left, Right, Left1, less_out_gg(X, Y)) -> U2_gag(X, Y, Left, Right, Left1, insert_in_gag(X, Left, Left1)) insert_in_gag(X, tree(Y, Left, Right), tree(Y, Left, Right1)) -> U3_gag(X, Y, Left, Right, Right1, less_in_gg(Y, X)) U3_gag(X, Y, Left, Right, Right1, less_out_gg(Y, X)) -> U4_gag(X, Y, Left, Right, Right1, insert_in_gag(X, Right, Right1)) U4_gag(X, Y, Left, Right, Right1, insert_out_gag(X, Right, Right1)) -> insert_out_gag(X, tree(Y, Left, Right), tree(Y, Left, Right1)) U2_gag(X, Y, Left, Right, Left1, insert_out_gag(X, Left, Left1)) -> insert_out_gag(X, tree(Y, Left, Right), tree(Y, Left1, Right)) The argument filtering Pi contains the following mapping: insert_in_gag(x1, x2, x3) = insert_in_gag(x1, x3) tree(x1, x2, x3) = tree(x1, x2, x3) void = void insert_out_gag(x1, x2, x3) = insert_out_gag(x2) U1_gag(x1, x2, x3, x4, x5, x6) = U1_gag(x1, x2, x4, x5, x6) less_in_gg(x1, x2) = less_in_gg(x1, x2) 0 = 0 s(x1) = s(x1) less_out_gg(x1, x2) = less_out_gg U5_gg(x1, x2, x3) = U5_gg(x3) U2_gag(x1, x2, x3, x4, x5, x6) = U2_gag(x2, x4, x6) U3_gag(x1, x2, x3, x4, x5, x6) = U3_gag(x1, x2, x3, x5, x6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming