Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720600
details
property
value
status
complete
benchmark
z122.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.83520793915 seconds
cpu usage
7.856700305
max memory
6.73570816E8
stage attributes
key
value
output-size
23218
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) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 90 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 2 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 1 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(c(x1)) -> b(f(x1)) d(d(d(x1))) -> a(c(x1)) f(f(x1)) -> f(b(x1)) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x1)) -> f(b(x1)) a(a(a(x1))) -> a(b(c(x1))) b(a(a(x1))) -> b(b(c(x1))) c(a(a(x1))) -> c(b(c(x1))) d(a(a(x1))) -> d(b(c(x1))) f(a(a(x1))) -> f(b(c(x1))) a(b(b(x1))) -> a(c(d(x1))) b(b(b(x1))) -> b(c(d(x1))) c(b(b(x1))) -> c(c(d(x1))) d(b(b(x1))) -> d(c(d(x1))) f(b(b(x1))) -> f(c(d(x1))) a(c(c(x1))) -> a(d(d(d(x1)))) b(c(c(x1))) -> b(d(d(d(x1)))) c(c(c(x1))) -> c(d(d(d(x1)))) d(c(c(x1))) -> d(d(d(d(x1)))) f(c(c(x1))) -> f(d(d(d(x1)))) a(d(c(x1))) -> a(b(f(x1))) b(d(c(x1))) -> b(b(f(x1))) c(d(c(x1))) -> c(b(f(x1))) d(d(c(x1))) -> d(b(f(x1))) f(d(c(x1))) -> f(b(f(x1))) a(d(d(d(x1)))) -> a(a(c(x1))) b(d(d(d(x1)))) -> b(a(c(x1))) c(d(d(d(x1)))) -> c(a(c(x1))) d(d(d(d(x1)))) -> d(a(c(x1))) f(d(d(d(x1)))) -> f(a(c(x1))) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685