Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487519365
details
property
value
status
complete
benchmark
z067.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.82391285896 seconds
cpu usage
5.949803424
max memory
6.98277888E8
stage attributes
key
value
output-size
2530
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: P(x1) -> Q(Q(p(x1))) p(p(x1)) -> q(q(x1)) p(Q(Q(x1))) -> Q(Q(p(x1))) Q(p(q(x1))) -> q(p(Q(x1))) q(q(p(x1))) -> p(q(q(x1))) q(Q(x1)) -> x1 Q(q(x1)) -> x1 p(P(x1)) -> x1 P(p(x1)) -> x1 Proof: String Reversal Processor: P(x1) -> p(Q(Q(x1))) p(p(x1)) -> q(q(x1)) Q(Q(p(x1))) -> p(Q(Q(x1))) q(p(Q(x1))) -> Q(p(q(x1))) p(q(q(x1))) -> q(q(p(x1))) Q(q(x1)) -> x1 q(Q(x1)) -> x1 P(p(x1)) -> x1 p(P(x1)) -> x1 Matrix Interpretation Processor: dim=1 interpretation: [p](x0) = 4x0 + 2, [q](x0) = x0, [P](x0) = 4x0 + 3, [Q](x0) = x0 orientation: P(x1) = 4x1 + 3 >= 4x1 + 2 = p(Q(Q(x1))) p(p(x1)) = 16x1 + 10 >= x1 = q(q(x1)) Q(Q(p(x1))) = 4x1 + 2 >= 4x1 + 2 = p(Q(Q(x1))) q(p(Q(x1))) = 4x1 + 2 >= 4x1 + 2 = Q(p(q(x1))) p(q(q(x1))) = 4x1 + 2 >= 4x1 + 2 = q(q(p(x1))) Q(q(x1)) = x1 >= x1 = x1 q(Q(x1)) = x1 >= x1 = x1 P(p(x1)) = 16x1 + 11 >= x1 = x1 p(P(x1)) = 16x1 + 14 >= x1 = x1 problem: Q(Q(p(x1))) -> p(Q(Q(x1))) q(p(Q(x1))) -> Q(p(q(x1))) p(q(q(x1))) -> q(q(p(x1))) Q(q(x1)) -> x1 q(Q(x1)) -> x1 String Reversal Processor: p(Q(Q(x1))) -> Q(Q(p(x1))) Q(p(q(x1))) -> q(p(Q(x1))) q(q(p(x1))) -> p(q(q(x1))) q(Q(x1)) -> x1 Q(q(x1)) -> x1 Matrix Interpretation Processor: dim=1 interpretation: [p](x0) = x0 + 6, [q](x0) = x0 + 4, [Q](x0) = x0 + 5 orientation: p(Q(Q(x1))) = x1 + 16 >= x1 + 16 = Q(Q(p(x1))) Q(p(q(x1))) = x1 + 15 >= x1 + 15 = q(p(Q(x1))) q(q(p(x1))) = x1 + 14 >= x1 + 14 = p(q(q(x1))) q(Q(x1)) = x1 + 9 >= x1 = x1 Q(q(x1)) = x1 + 9 >= x1 = x1 problem: p(Q(Q(x1))) -> Q(Q(p(x1))) Q(p(q(x1))) -> q(p(Q(x1))) q(q(p(x1))) -> p(q(q(x1))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {8,5,1} transitions: Q0(4) -> 1* Q0(3) -> 4*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard