Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975820
details
property
value
status
complete
benchmark
beans1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
5.32064199448 seconds
cpu usage
17.64928391
max memory
1.322258432E9
stage attributes
key
value
output-size
8630
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 32 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) MRRProof [EQUIVALENT, 74 ms] (9) QDP (10) PisEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 88 ms] (16) QDP (17) PisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 1(2(1(x1))) -> 2(0(2(x1))) 0(2(1(x1))) -> 1(0(2(x1))) L(2(1(x1))) -> L(1(0(2(x1)))) 1(2(0(x1))) -> 2(0(1(x1))) 1(2(R(x1))) -> 2(0(1(R(x1)))) 0(2(0(x1))) -> 1(0(1(x1))) L(2(0(x1))) -> L(1(0(1(x1)))) 0(2(R(x1))) -> 1(0(1(R(x1)))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: 1^1(2(1(x1))) -> 0^1(2(x1)) 0^1(2(1(x1))) -> 1^1(0(2(x1))) 0^1(2(1(x1))) -> 0^1(2(x1)) L^1(2(1(x1))) -> L^1(1(0(2(x1)))) L^1(2(1(x1))) -> 1^1(0(2(x1))) L^1(2(1(x1))) -> 0^1(2(x1)) 1^1(2(0(x1))) -> 0^1(1(x1)) 1^1(2(0(x1))) -> 1^1(x1) 1^1(2(R(x1))) -> 0^1(1(R(x1))) 1^1(2(R(x1))) -> 1^1(R(x1)) 0^1(2(0(x1))) -> 1^1(0(1(x1))) 0^1(2(0(x1))) -> 0^1(1(x1)) 0^1(2(0(x1))) -> 1^1(x1) L^1(2(0(x1))) -> L^1(1(0(1(x1)))) L^1(2(0(x1))) -> 1^1(0(1(x1))) L^1(2(0(x1))) -> 0^1(1(x1)) L^1(2(0(x1))) -> 1^1(x1) 0^1(2(R(x1))) -> 1^1(0(1(R(x1)))) 0^1(2(R(x1))) -> 0^1(1(R(x1))) 0^1(2(R(x1))) -> 1^1(R(x1)) The TRS R consists of the following rules: 1(2(1(x1))) -> 2(0(2(x1))) 0(2(1(x1))) -> 1(0(2(x1))) L(2(1(x1))) -> L(1(0(2(x1)))) 1(2(0(x1))) -> 2(0(1(x1))) 1(2(R(x1))) -> 2(0(1(R(x1)))) 0(2(0(x1))) -> 1(0(1(x1))) L(2(0(x1))) -> L(1(0(1(x1)))) 0(2(R(x1))) -> 1(0(1(R(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard