Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487520063
details
property
value
status
complete
benchmark
z100.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n012.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.51940393448 seconds
cpu usage
24.688064792
max memory
3.543261184E9
stage attributes
key
value
output-size
12994
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 19 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPOrderProof [EQUIVALENT, 19 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) QDPOrderProof [EQUIVALENT, 445 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 11 ms] (28) QDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: r1(a(x1)) -> a(a(a(r1(x1)))) r2(a(x1)) -> a(a(a(r2(x1)))) a(l1(x1)) -> l1(a(a(a(x1)))) a(a(l2(x1))) -> l2(a(a(x1))) r1(b(x1)) -> l1(b(x1)) r2(b(x1)) -> l2(a(b(x1))) b(l1(x1)) -> b(r2(x1)) b(l2(x1)) -> b(r1(x1)) a(a(x1)) -> x1 Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(r1(x1)) -> r1(a(a(a(x1)))) a(r2(x1)) -> r2(a(a(a(x1)))) l1(a(x1)) -> a(a(a(l1(x1)))) l2(a(a(x1))) -> a(a(l2(x1))) b(r1(x1)) -> b(l1(x1)) b(r2(x1)) -> b(a(l2(x1))) l1(b(x1)) -> r2(b(x1)) l2(b(x1)) -> r1(b(x1)) a(a(x1)) -> x1 Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(r1(x1)) -> A(a(a(x1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard