Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529331
details
property
value
status
complete
benchmark
som.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
terminweb_new
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.77778291702 seconds
cpu usage
3.990542271
max memory
2.7817984E8
stage attributes
key
value
output-size
7527
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 som3(g,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: som3([], Bs, Bs). som3(As, [], As). som3(.(A, As), .(B, Bs), .(+(A, B), Cs)) :- som3(As, Bs, Cs). som4_1(As, Bs, Cs, Ds) :- ','(som3(As, Bs, Es), som3(Es, Cs, Ds)). som4_2(As, Bs, Cs, Ds) :- ','(som3(Es, Cs, Ds), som3(As, Bs, Es)). Query: som3(g,a,a) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: som3_in_3: (b,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: som3_in_gaa([], Bs, Bs) -> som3_out_gaa([], Bs, Bs) som3_in_gaa(As, [], As) -> som3_out_gaa(As, [], As) som3_in_gaa(.(A, As), .(B, Bs), .(+(A, B), Cs)) -> U1_gaa(A, As, B, Bs, Cs, som3_in_gaa(As, Bs, Cs)) U1_gaa(A, As, B, Bs, Cs, som3_out_gaa(As, Bs, Cs)) -> som3_out_gaa(.(A, As), .(B, Bs), .(+(A, B), Cs)) The argument filtering Pi contains the following mapping: som3_in_gaa(x1, x2, x3) = som3_in_gaa(x1) [] = [] som3_out_gaa(x1, x2, x3) = som3_out_gaa(x1) .(x1, x2) = .(x1, x2) U1_gaa(x1, x2, x3, x4, x5, x6) = U1_gaa(x1, x2, x6) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: som3_in_gaa([], Bs, Bs) -> som3_out_gaa([], Bs, Bs) som3_in_gaa(As, [], As) -> som3_out_gaa(As, [], As) som3_in_gaa(.(A, As), .(B, Bs), .(+(A, B), Cs)) -> U1_gaa(A, As, B, Bs, Cs, som3_in_gaa(As, Bs, Cs)) U1_gaa(A, As, B, Bs, Cs, som3_out_gaa(As, Bs, Cs)) -> som3_out_gaa(.(A, As), .(B, Bs), .(+(A, B), Cs)) The argument filtering Pi contains the following mapping: som3_in_gaa(x1, x2, x3) = som3_in_gaa(x1) [] = [] som3_out_gaa(x1, x2, x3) = som3_out_gaa(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming