Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529623
details
property
value
status
complete
benchmark
vangelder.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
talp_talp
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.05236315727 seconds
cpu usage
12.775649508
max memory
1.549668352E9
stage attributes
key
value
output-size
30923
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern q(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 4 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 17 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 164 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: e(a, b). q(X, Y) :- e(X, Y). q(X, f(f(X))) :- ','(p(X, f(f(X))), q(X, f(X))). q(X, f(f(Y))) :- p(X, f(Y)). p(X, Y) :- e(X, Y). p(X, f(Y)) :- ','(r(X, f(Y)), p(X, Y)). r(X, Y) :- e(X, Y). r(X, f(Y)) :- ','(q(X, Y), r(X, Y)). r(f(X), f(X)) :- t(f(X), f(X)). t(X, Y) :- e(X, Y). t(f(X), f(Y)) :- ','(q(f(X), f(Y)), t(X, Y)). Query: q(g,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: q_in_2: (b,b) p_in_2: (b,b) r_in_2: (b,b) t_in_2: (b,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: q_in_gg(X, Y) -> U1_gg(X, Y, e_in_gg(X, Y)) e_in_gg(a, b) -> e_out_gg(a, b) U1_gg(X, Y, e_out_gg(X, Y)) -> q_out_gg(X, Y) q_in_gg(X, f(f(X))) -> U2_gg(X, p_in_gg(X, f(f(X)))) p_in_gg(X, Y) -> U5_gg(X, Y, e_in_gg(X, Y)) U5_gg(X, Y, e_out_gg(X, Y)) -> p_out_gg(X, Y) p_in_gg(X, f(Y)) -> U6_gg(X, Y, r_in_gg(X, f(Y))) r_in_gg(X, Y) -> U8_gg(X, Y, e_in_gg(X, Y)) U8_gg(X, Y, e_out_gg(X, Y)) -> r_out_gg(X, Y) r_in_gg(X, f(Y)) -> U9_gg(X, Y, q_in_gg(X, Y)) q_in_gg(X, f(f(Y))) -> U4_gg(X, Y, p_in_gg(X, f(Y))) U4_gg(X, Y, p_out_gg(X, f(Y))) -> q_out_gg(X, f(f(Y))) U9_gg(X, Y, q_out_gg(X, Y)) -> U10_gg(X, Y, r_in_gg(X, Y)) r_in_gg(f(X), f(X)) -> U11_gg(X, t_in_gg(f(X), f(X))) t_in_gg(X, Y) -> U12_gg(X, Y, e_in_gg(X, Y)) U12_gg(X, Y, e_out_gg(X, Y)) -> t_out_gg(X, Y) t_in_gg(f(X), f(Y)) -> U13_gg(X, Y, q_in_gg(f(X), f(Y))) U13_gg(X, Y, q_out_gg(f(X), f(Y))) -> U14_gg(X, Y, t_in_gg(X, Y)) U14_gg(X, Y, t_out_gg(X, Y)) -> t_out_gg(f(X), f(Y)) U11_gg(X, t_out_gg(f(X), f(X))) -> r_out_gg(f(X), f(X)) U10_gg(X, Y, r_out_gg(X, Y)) -> r_out_gg(X, f(Y)) U6_gg(X, Y, r_out_gg(X, f(Y))) -> U7_gg(X, Y, p_in_gg(X, Y)) U7_gg(X, Y, p_out_gg(X, Y)) -> p_out_gg(X, f(Y)) U2_gg(X, p_out_gg(X, f(f(X)))) -> U3_gg(X, q_in_gg(X, f(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming