Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529149
details
property
value
status
complete
benchmark
duplicate.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
talp_dds
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.78812098503 seconds
cpu usage
3.807873288
max memory
2.58564096E8
stage attributes
key
value
output-size
6788
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern duplicate(g,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, 1 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: duplicate([], []). duplicate(.(X, Y), .(X, .(X, Z))) :- duplicate(Y, Z). Query: duplicate(g,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: duplicate_in_2: (b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: duplicate_in_ga([], []) -> duplicate_out_ga([], []) duplicate_in_ga(.(X, Y), .(X, .(X, Z))) -> U1_ga(X, Y, Z, duplicate_in_ga(Y, Z)) U1_ga(X, Y, Z, duplicate_out_ga(Y, Z)) -> duplicate_out_ga(.(X, Y), .(X, .(X, Z))) The argument filtering Pi contains the following mapping: duplicate_in_ga(x1, x2) = duplicate_in_ga(x1) [] = [] duplicate_out_ga(x1, x2) = duplicate_out_ga(x2) .(x1, x2) = .(x1, x2) U1_ga(x1, x2, x3, x4) = U1_ga(x1, x4) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: duplicate_in_ga([], []) -> duplicate_out_ga([], []) duplicate_in_ga(.(X, Y), .(X, .(X, Z))) -> U1_ga(X, Y, Z, duplicate_in_ga(Y, Z)) U1_ga(X, Y, Z, duplicate_out_ga(Y, Z)) -> duplicate_out_ga(.(X, Y), .(X, .(X, Z))) The argument filtering Pi contains the following mapping: duplicate_in_ga(x1, x2) = duplicate_in_ga(x1) [] = [] duplicate_out_ga(x1, x2) = duplicate_out_ga(x2) .(x1, x2) = .(x1, x2) U1_ga(x1, x2, x3, x4) = U1_ga(x1, x4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming