Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719900
details
property
value
status
complete
benchmark
z075.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.82037305832 seconds
cpu usage
23.660012162
max memory
2.643456E9
stage attributes
key
value
output-size
10831
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, 16 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 9 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 2 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 1 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 1 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) UsableRulesProof [EQUIVALENT, 2 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 0 ms] (28) QDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: t(f(x1)) -> t(c(n(x1))) n(f(x1)) -> f(n(x1)) o(f(x1)) -> f(o(x1)) n(s(x1)) -> f(s(x1)) o(s(x1)) -> f(s(x1)) c(f(x1)) -> f(c(x1)) c(n(x1)) -> n(c(x1)) c(o(x1)) -> o(c(x1)) c(o(x1)) -> o(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: f(t(x1)) -> n(c(t(x1))) f(n(x1)) -> n(f(x1)) f(o(x1)) -> o(f(x1)) s(n(x1)) -> s(f(x1)) s(o(x1)) -> s(f(x1)) f(c(x1)) -> c(f(x1)) n(c(x1)) -> c(n(x1)) o(c(x1)) -> c(o(x1)) o(c(x1)) -> o(x1) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(c(x_1)) = x_1 POL(f(x_1)) = x_1 POL(n(x_1)) = x_1 POL(o(x_1)) = 1 + x_1 POL(s(x_1)) = x_1 POL(t(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685