Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719021
details
property
value
status
complete
benchmark
z068.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n024.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.15918493271 seconds
cpu usage
33.330278749
max memory
4.101984256E9
stage attributes
key
value
output-size
8590
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 15 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 2 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 28 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 1 ms] (10) AND (11) QDP (12) UsableRulesProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) MRRProof [EQUIVALENT, 54 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 0 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: C(x1) -> c(x1) c(c(x1)) -> x1 b(b(x1)) -> B(x1) B(B(x1)) -> b(x1) c(B(c(b(c(x1))))) -> B(c(b(c(B(c(b(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: C(x1) -> c(x1) c(c(x1)) -> x1 b(b(x1)) -> B(x1) B(B(x1)) -> b(x1) c(b(c(B(c(x1))))) -> b(c(B(c(b(c(B(x1))))))) B(b(x1)) -> x1 b(B(x1)) -> x1 C(c(x1)) -> x1 c(C(x1)) -> x1 Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(B(x_1)) = x_1 POL(C(x_1)) = 1 + x_1 POL(b(x_1)) = x_1 POL(c(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: C(x1) -> c(x1) C(c(x1)) -> x1 c(C(x1)) -> x1 ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685