Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432294679
details
property
value
status
complete
benchmark
random-106.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
Waldmann_19
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.1489 seconds
cpu usage
39.8006
user time
38.1013
system time
1.69927
max virtual memory
2.115008E7
max residence set size
4110400.0
stage attributes
key
value
starexec-result
YES
output
39.28/11.00 YES 39.66/11.04 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 39.66/11.04 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 39.66/11.04 39.66/11.04 39.66/11.04 Termination w.r.t. Q of the given QTRS could be proven: 39.66/11.04 39.66/11.04 (0) QTRS 39.66/11.04 (1) FlatCCProof [EQUIVALENT, 0 ms] 39.66/11.04 (2) QTRS 39.66/11.04 (3) RootLabelingProof [EQUIVALENT, 0 ms] 39.66/11.04 (4) QTRS 39.66/11.04 (5) DependencyPairsProof [EQUIVALENT, 2 ms] 39.66/11.04 (6) QDP 39.66/11.04 (7) DependencyGraphProof [EQUIVALENT, 3 ms] 39.66/11.04 (8) QDP 39.66/11.04 (9) QDPOrderProof [EQUIVALENT, 72 ms] 39.66/11.04 (10) QDP 39.66/11.04 (11) QDPOrderProof [EQUIVALENT, 0 ms] 39.66/11.04 (12) QDP 39.66/11.04 (13) QDPOrderProof [EQUIVALENT, 417 ms] 39.66/11.04 (14) QDP 39.66/11.04 (15) PisEmptyProof [EQUIVALENT, 0 ms] 39.66/11.04 (16) YES 39.66/11.04 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (0) 39.66/11.04 Obligation: 39.66/11.04 Q restricted rewrite system: 39.66/11.04 The TRS R consists of the following rules: 39.66/11.04 39.66/11.04 b(a(b(a(x1)))) -> b(a(b(b(x1)))) 39.66/11.04 b(b(b(b(x1)))) -> b(a(a(b(x1)))) 39.66/11.04 a(a(a(b(x1)))) -> b(a(b(a(x1)))) 39.66/11.04 39.66/11.04 Q is empty. 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (1) FlatCCProof (EQUIVALENT) 39.66/11.04 We used flat context closure [ROOTLAB] 39.66/11.04 As Q is empty the flat context closure was sound AND complete. 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (2) 39.66/11.04 Obligation: 39.66/11.04 Q restricted rewrite system: 39.66/11.04 The TRS R consists of the following rules: 39.66/11.04 39.66/11.04 b(a(b(a(x1)))) -> b(a(b(b(x1)))) 39.66/11.04 b(b(b(b(x1)))) -> b(a(a(b(x1)))) 39.66/11.04 b(a(a(a(b(x1))))) -> b(b(a(b(a(x1))))) 39.66/11.04 a(a(a(a(b(x1))))) -> a(b(a(b(a(x1))))) 39.66/11.04 39.66/11.04 Q is empty. 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (3) RootLabelingProof (EQUIVALENT) 39.66/11.04 We used plain root labeling [ROOTLAB] with the following heuristic: 39.66/11.04 LabelAll: All function symbols get labeled 39.66/11.04 39.66/11.04 As Q is empty the root labeling was sound AND complete. 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (4) 39.66/11.04 Obligation: 39.66/11.04 Q restricted rewrite system: 39.66/11.04 The TRS R consists of the following rules: 39.66/11.04 39.66/11.04 b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) 39.66/11.04 b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) 39.66/11.04 b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) 39.66/11.04 b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) 39.66/11.04 b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) 39.66/11.04 b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) 39.66/11.04 a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) 39.66/11.04 a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) 39.66/11.04 39.66/11.04 Q is empty. 39.66/11.04 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (5) DependencyPairsProof (EQUIVALENT) 39.66/11.04 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 39.66/11.04 ---------------------------------------- 39.66/11.04 39.66/11.04 (6) 39.66/11.04 Obligation: 39.66/11.04 Q DP problem: 39.66/11.04 The TRS P consists of the following rules: 39.66/11.04 39.66/11.04 B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) 39.66/11.04 B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) 39.66/11.04 B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) 39.66/11.04 B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Standard 2019-03-29 03.29