Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720240
details
property
value
status
complete
benchmark
z065.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.32642483711 seconds
cpu usage
14.134059069
max memory
1.869582336E9
stage attributes
key
value
output-size
9729
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, 28 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 3 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 1 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 1 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 1 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) MRRProof [EQUIVALENT, 11 ms] (28) QDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(*(x1)) -> *(1(x1)) 1(*(x1)) -> 0(#(x1)) #(0(x1)) -> 0(#(x1)) #(1(x1)) -> 1(#(x1)) #($(x1)) -> *($(x1)) #(#(x1)) -> #(x1) #(*(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: *(0(x1)) -> 1(*(x1)) *(1(x1)) -> #(0(x1)) 0(#(x1)) -> #(0(x1)) 1(#(x1)) -> #(1(x1)) $(#(x1)) -> $(*(x1)) #(#(x1)) -> #(x1) *(#(x1)) -> *(x1) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(#(x_1)) = 1 + x_1 POL($(x_1)) = x_1 POL(*(x_1)) = 1 + x_1 POL(0(x_1)) = x_1 POL(1(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: #(#(x1)) -> #(x1) *(#(x1)) -> *(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685