Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Outermost 2019-04-01 06.45 pair #433314839
details
property
value
status
complete
benchmark
f_2_1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n131.star.cs.uiowa.edu
space
Zantema_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.92056 seconds
cpu usage
8.47617
user time
8.0576
system time
0.418568
max virtual memory
1.868014E7
max residence set size
761752.0
stage attributes
key
value
starexec-result
YES
output
7.86/2.76 YES 8.29/2.78 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 8.29/2.78 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.29/2.78 8.29/2.78 8.29/2.78 Outermost Termination of the given OTRS could be proven: 8.29/2.78 8.29/2.78 (0) OTRS 8.29/2.78 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 8.29/2.78 (2) QTRS 8.29/2.78 (3) DependencyPairsProof [EQUIVALENT, 2 ms] 8.29/2.78 (4) QDP 8.29/2.78 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 8.29/2.78 (6) AND 8.29/2.78 (7) QDP 8.29/2.78 (8) UsableRulesProof [EQUIVALENT, 0 ms] 8.29/2.78 (9) QDP 8.29/2.78 (10) QReductionProof [EQUIVALENT, 0 ms] 8.29/2.78 (11) QDP 8.29/2.78 (12) MRRProof [EQUIVALENT, 0 ms] 8.29/2.78 (13) QDP 8.29/2.78 (14) PisEmptyProof [EQUIVALENT, 0 ms] 8.29/2.78 (15) YES 8.29/2.78 (16) QDP 8.29/2.78 (17) UsableRulesProof [EQUIVALENT, 0 ms] 8.29/2.78 (18) QDP 8.29/2.78 (19) QReductionProof [EQUIVALENT, 0 ms] 8.29/2.78 (20) QDP 8.29/2.78 (21) TransformationProof [EQUIVALENT, 0 ms] 8.29/2.78 (22) QDP 8.29/2.78 (23) UsableRulesProof [EQUIVALENT, 0 ms] 8.29/2.78 (24) QDP 8.29/2.78 (25) QDPOrderProof [EQUIVALENT, 8 ms] 8.29/2.78 (26) QDP 8.29/2.78 (27) QDPOrderProof [EQUIVALENT, 0 ms] 8.29/2.78 (28) QDP 8.29/2.78 (29) QDPOrderProof [EQUIVALENT, 19 ms] 8.29/2.78 (30) QDP 8.29/2.78 (31) PisEmptyProof [EQUIVALENT, 0 ms] 8.29/2.78 (32) YES 8.29/2.78 8.29/2.78 8.29/2.78 ---------------------------------------- 8.29/2.78 8.29/2.78 (0) 8.29/2.78 Obligation: 8.29/2.78 Term rewrite system R: 8.29/2.78 The TRS R consists of the following rules: 8.29/2.78 8.29/2.78 a -> f(a) 8.29/2.78 g(f(x)) -> f(g(x)) 8.29/2.78 f(f(x)) -> b 8.29/2.78 8.29/2.78 8.29/2.78 8.29/2.78 Outermost Strategy. 8.29/2.78 8.29/2.78 ---------------------------------------- 8.29/2.78 8.29/2.78 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 8.29/2.78 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 8.29/2.78 ---------------------------------------- 8.29/2.78 8.29/2.78 (2) 8.29/2.78 Obligation: 8.29/2.78 Q restricted rewrite system: 8.29/2.78 The TRS R consists of the following rules: 8.29/2.78 8.29/2.78 top(go_up(x)) -> top(reduce(x)) 8.29/2.78 reduce(g(x_1)) -> check_g(redex_g(x_1)) 8.29/2.78 reduce(f(x_1)) -> check_f(redex_f(x_1)) 8.29/2.78 reduce(a) -> go_up(f(a)) 8.29/2.78 redex_g(f(x)) -> result_g(f(g(x))) 8.29/2.78 redex_f(f(x)) -> result_f(b) 8.29/2.78 check_g(result_g(x)) -> go_up(x) 8.29/2.78 check_f(result_f(x)) -> go_up(x) 8.29/2.78 check_g(redex_g(x_1)) -> in_g_1(reduce(x_1)) 8.29/2.78 check_f(redex_f(x_1)) -> in_f_1(reduce(x_1)) 8.29/2.78 in_f_1(go_up(x_1)) -> go_up(f(x_1)) 8.29/2.78 in_g_1(go_up(x_1)) -> go_up(g(x_1)) 8.29/2.78 8.29/2.78 The set Q consists of the following terms: 8.29/2.78 8.29/2.78 top(go_up(x0)) 8.29/2.78 reduce(g(x0)) 8.29/2.78 reduce(f(x0)) 8.29/2.78 reduce(a) 8.29/2.78 redex_g(f(x0)) 8.29/2.78 redex_f(f(x0)) 8.29/2.78 check_g(result_g(x0)) 8.29/2.78 check_f(result_f(x0)) 8.29/2.78 check_g(redex_g(x0)) 8.29/2.78 check_f(redex_f(x0)) 8.29/2.78 in_f_1(go_up(x0)) 8.29/2.78 in_g_1(go_up(x0)) 8.29/2.78 8.29/2.78 8.29/2.78 ---------------------------------------- 8.29/2.78 8.29/2.78 (3) DependencyPairsProof (EQUIVALENT)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Outermost 2019-04-01 06.45