Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720720
details
property
value
status
complete
benchmark
z070.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.5537250042 seconds
cpu usage
26.111832025
max memory
2.259718144E9
stage attributes
key
value
output-size
7612
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) QTRSRRRProof [EQUIVALENT, 45 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 4 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 28 ms] (8) QDP (9) MRRProof [EQUIVALENT, 145 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(x1)) -> C(x1) b(c(x1)) -> A(x1) c(a(x1)) -> B(x1) A(C(x1)) -> b(x1) C(B(x1)) -> a(x1) B(A(x1)) -> c(x1) a(a(a(a(a(x1))))) -> A(A(A(x1))) A(A(A(A(x1)))) -> a(a(a(a(x1)))) b(b(b(b(b(x1))))) -> B(B(B(x1))) B(B(B(B(x1)))) -> b(b(b(b(x1)))) c(c(c(c(c(x1))))) -> C(C(C(x1))) C(C(C(C(x1)))) -> c(c(c(c(x1)))) B(a(a(a(a(x1))))) -> c(A(A(A(x1)))) A(A(A(b(x1)))) -> a(a(a(a(C(x1))))) C(b(b(b(b(x1))))) -> a(B(B(B(x1)))) B(B(B(c(x1)))) -> b(b(b(b(A(x1))))) A(c(c(c(c(x1))))) -> b(C(C(C(x1)))) C(C(C(a(x1)))) -> c(c(c(c(B(x1))))) a(A(x1)) -> x1 A(a(x1)) -> x1 b(B(x1)) -> x1 B(b(x1)) -> x1 c(C(x1)) -> x1 C(c(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: b(a(x1)) -> C(x1) c(b(x1)) -> A(x1) a(c(x1)) -> B(x1) C(A(x1)) -> b(x1) B(C(x1)) -> a(x1) A(B(x1)) -> c(x1) a(a(a(a(a(x1))))) -> A(A(A(x1))) A(A(A(A(x1)))) -> a(a(a(a(x1)))) b(b(b(b(b(x1))))) -> B(B(B(x1))) B(B(B(B(x1)))) -> b(b(b(b(x1)))) c(c(c(c(c(x1))))) -> C(C(C(x1))) C(C(C(C(x1)))) -> c(c(c(c(x1)))) a(a(a(a(B(x1))))) -> A(A(A(c(x1)))) b(A(A(A(x1)))) -> C(a(a(a(a(x1))))) b(b(b(b(C(x1))))) -> B(B(B(a(x1)))) c(B(B(B(x1)))) -> A(b(b(b(b(x1))))) c(c(c(c(A(x1))))) -> C(C(C(b(x1)))) a(C(C(C(x1)))) -> B(c(c(c(c(x1))))) A(a(x1)) -> x1 a(A(x1)) -> x1 B(b(x1)) -> x1 b(B(x1)) -> x1 C(c(x1)) -> x1 c(C(x1)) -> x1 Q is empty.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685