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