%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : ANA002-2 : TPTP v9.2.1. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu May 7 07:17:50 PM UTC 2026
% Result : Unsatisfiable 54.71s 11.47s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA002-2 : TPTP v9.2.1. Bugfixed v1.0.1.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.33 % Computer : n025.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Thu May 7 14:05:14 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.33 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 54.71/11.47 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47 Execution resolution_1 ended with status: unsatisfiable
% 54.71/11.47 Used heuristic: resolution_1
% 54.71/11.47
% 54.71/11.47 Input Clauses:
% 54.71/11.47
% 54.71/11.47 Predicates: in_interval less_than_or_equal
% 54.71/11.47 Fol Constants: n0 lower_bound upper_bound l
% 54.71/11.47 Fol Functions: q f h k g
% 54.71/11.47 Problem Properties:
% 54.71/11.47 This is a full first-order problem without equality.
% 54.71/11.47
% 54.71/11.47 After reduction: Problem Properties:
% 54.71/11.47 This is a full first-order problem without equality.
% 54.71/11.47
% 54.71/11.47
% 54.71/11.47 Reduced Input Clauses:
% 54.71/11.47
% 54.71/11.47 Most General Atoms: in_interval(x0,x1,x2) less_than_or_equal(x0,x2)
% 54.71/11.47
% 54.71/11.47 === Starting SPASS-SCL-FOL A Little Less Naive, considering 41 atoms initially, heuristics mode: resolution_1 ===
% 54.71/11.47
% 54.71/11.47 === Backtracking. Learning clause 19:4:1:[7.3,11.2]:Top: less_than_or_equal(x0,h(x0)),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,l)
% 54.71/11.47 === Backtracking. Learning clause 20:2:1:[11.2,16.1,4.2,15.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l)
% 54.71/11.47 === Backtracking. Learning clause 21:2:1:[4.1,12.1,14.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0)
% 54.71/11.47 === Backtracking. Learning clause 22:2:0:[1.3,18.1]:: less_than_or_equal(f(l),n0),less_than_or_equal(n0,f(l)) ->
% 54.71/11.47 === Backtracking. Learning clause 23:4:2:[7.1,4.3]:TopTop: in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x1),less_than_or_equal(x1,h(x0)) -> less_than_or_equal(f(x0),n0)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 59
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Backtracking. Learning clause 24:2:1:[14.1,12.1,4.2]:Top: less_than_or_equal(x0,l) -> less_than_or_equal(x0,upper_bound)
% 54.71/11.47 === Conflict found: 23:4:2:[7.1,4.3]:TopTop: in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x1),less_than_or_equal(x1,h(x0)) -> less_than_or_equal(f(x0),n0) {x0 -> l, x1 -> l}
% 54.71/11.47 === Backtracking. Learning clause 25:4:1:[23.4,22.1]:Top: in_interval(lower_bound,l,upper_bound),less_than_or_equal(l,x0),less_than_or_equal(x0,h(l)),less_than_or_equal(n0,f(l)) ->
% 54.71/11.47 === Conflict found: 20:2:1:[11.2,16.1,4.2,15.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l) {x0 -> q(l,n0)}
% 54.71/11.47 === Backtracking. Learning clause 26:2:1:[20.2,6.1]:Top: less_than_or_equal(q(l,x0),lower_bound) -> less_than_or_equal(x0,l)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 66
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 20:2:1:[11.2,16.1,4.2,15.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l) {x0 -> k(l)}
% 54.71/11.47 === Backtracking. Learning clause 27:3:0:[20.2,9.1]:: less_than_or_equal(k(l),lower_bound),in_interval(lower_bound,l,upper_bound) -> less_than_or_equal(n0,f(l))
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 69
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Backtracking. Learning clause 28:3:1:[3.2,9.1]:Top: in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(x0,k(x0)),less_than_or_equal(n0,f(x0))
% 54.71/11.47 === Backtracking. Learning clause 29:4:1:[4.1,10.5,9.1,17.1]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(x0,upper_bound),in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(n0,f(x0))
% 54.71/11.47 === Backtracking. Learning clause 30:7:2:[8.4,22.1,23.4,25.3]:TopTop: less_than_or_equal(x0,l),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x1),less_than_or_equal(x1,h(x0)),in_interval(lower_bound,l,upper_bound),less_than_or_equal(l,x0),less_than_or_equal(n0,f(l)) ->
% 54.71/11.47 === Backtracking. Learning clause 31:7:3:[8.2,23.4]:TopTopTop: less_than_or_equal(x0,x1),in_interval(lower_bound,x1,upper_bound),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x2),less_than_or_equal(x2,h(x0)) -> less_than_or_equal(f(x1),n0),less_than_or_equal(x0,h(x1))
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 84
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 24:2:1:[14.1,12.1,4.2]:Top: less_than_or_equal(x0,l) -> less_than_or_equal(x0,upper_bound) {x0 -> n0}
% 54.71/11.47 === Backtracking. Learning clause 32:2:1:[24.1,20.2]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,upper_bound)
% 54.71/11.47 === Backtracking. Learning clause 33:4:1:[8.2,16.1]:Top: less_than_or_equal(lower_bound,x0),in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,h(x0))
% 54.71/11.47 === Backtracking. Learning clause 36:4:1:[20.1,34.0,32.1,35.4,8.4,22.1,33.3,30.4,30.4,29.4,1.3,1.3,2.1,4.3,21.2,4.3]:Top: less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,l),less_than_or_equal(lower_bound,x0),less_than_or_equal(upper_bound,x0) ->
% 54.71/11.47 === Backtracking. Learning clause 37:2:1:[3.1,14.1]:Top: -> less_than_or_equal(x0,g(x0)),less_than_or_equal(l,x0)
% 54.71/11.47 === Backtracking. Learning clause 38:3:3:[4.1,3.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 98
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Backtracking. Learning clause 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l))
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 99
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 36:4:1:[20.1,34.0,32.1,35.4,8.4,22.1,33.3,30.4,30.4,29.4,1.3,1.3,2.1,4.3,21.2,4.3]:Top: less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,l),less_than_or_equal(lower_bound,x0),less_than_or_equal(upper_bound,x0) -> {x0 -> upper_bound}
% 54.71/11.47 === Backtracking. Learning clause 41:2:0:[15.0,40.2,36.4,2.1]:: less_than_or_equal(upper_bound,lower_bound),less_than_or_equal(lower_bound,l) ->
% 54.71/11.47 === Conflict found: 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> lower_bound}
% 54.71/11.47 === Backtracking. Learning clause 42:5:0:[39.2,16.1,30.4]:: less_than_or_equal(lower_bound,l),less_than_or_equal(l,lower_bound),in_interval(lower_bound,l,upper_bound),less_than_or_equal(l,l),less_than_or_equal(n0,f(l)) ->
% 54.71/11.47 === Conflict found: 27:3:0:[20.2,9.1]:: less_than_or_equal(k(l),lower_bound),in_interval(lower_bound,l,upper_bound) -> less_than_or_equal(n0,f(l)) {}
% 54.71/11.47 === Backtracking. Learning clause 43:5:0:[27.1,10.5,42.5]:: less_than_or_equal(n0,f(lower_bound)),less_than_or_equal(lower_bound,l),less_than_or_equal(l,lower_bound),in_interval(lower_bound,l,upper_bound),less_than_or_equal(l,l) ->
% 54.71/11.47 === Conflict found: 38:3:3:[4.1,3.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> upper_bound, x1 -> q(n0,l), x2 -> l}
% 54.71/11.47 === Backtracking. Learning clause 44:3:3:[38.2,5.1]:TopTopTop: less_than_or_equal(x0,q(x1,x2)) -> less_than_or_equal(x0,x2),less_than_or_equal(x2,x1)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 105
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 20:2:1:[11.2,16.1,4.2,15.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l) {x0 -> upper_bound}
% 54.71/11.47 === Backtracking. Learning clause 45:3:2:[20.2,4.2]:TopTop: less_than_or_equal(x0,lower_bound),less_than_or_equal(x1,x0) -> less_than_or_equal(x1,l)
% 54.71/11.47 === Conflict found: 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> n0}
% 54.71/11.47 === Backtracking. Learning clause 46:7:2:[39.2,38.2,30.4]:TopTop: less_than_or_equal(x0,l),less_than_or_equal(x1,n0),less_than_or_equal(l,x0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(l,l),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x1,f(x0))
% 54.71/11.47 === Backtracking. Learning clause 48:1:0:[15.0,47.0,11.2,16.1]:: -> less_than_or_equal(lower_bound,l)
% 54.71/11.47 === Conflict found: 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> n0}
% 54.71/11.47 === Backtracking. Learning clause 49:6:2:[39.2,38.2]:TopTop: less_than_or_equal(x0,l),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)),less_than_or_equal(x1,n0) -> less_than_or_equal(x0,h(l)),less_than_or_equal(x1,f(x0))
% 54.71/11.47 === Conflict found: 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> lower_bound}
% 54.71/11.47 === Backtracking. Learning clause 51:3:0:[48.0,50.0,39.2,16.1]:: in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(lower_bound,h(l))
% 54.71/11.47 === Backtracking. Learning clause 53:2:1:[12.0,52.0,11.2,13.1]:Top: -> less_than_or_equal(g(x0),l),less_than_or_equal(l,x0)
% 54.71/11.47 === Conflict found: 39:5:1:[8.4,22.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> g(n0)}
% 54.71/11.47 === Backtracking. Learning clause 55:4:1:[53.0,54.0,39.2,13.1]:Top: in_interval(lower_bound,l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(g(x0),h(l)),less_than_or_equal(l,x0)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 129
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 38:3:3:[4.1,3.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> lower_bound, x1 -> lower_bound, x2 -> k(l)}
% 54.71/11.47 === Backtracking. Learning clause 56:5:2:[38.2,27.1,38.1]:TopTop: less_than_or_equal(x0,lower_bound),in_interval(lower_bound,l,upper_bound) -> less_than_or_equal(n0,f(l)),less_than_or_equal(x1,k(l)),less_than_or_equal(x0,x1)
% 54.71/11.47 === Conflict found: 31:7:3:[8.2,23.4]:TopTopTop: less_than_or_equal(x0,x1),in_interval(lower_bound,x1,upper_bound),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x2),less_than_or_equal(x2,h(x0)) -> less_than_or_equal(f(x1),n0),less_than_or_equal(x0,h(x1)) {x0 -> n0, x1 -> k(n0), x2 -> l}
% 54.71/11.47 === Backtracking. Learning clause 57:8:3:[31.6,11.2]:TopTopTop: less_than_or_equal(x0,x1),in_interval(lower_bound,x1,upper_bound),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(x0,x2),less_than_or_equal(x2,h(x0)),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(x0,h(x1)),less_than_or_equal(x1,l)
% 54.71/11.47 === Backtracking. Learning clause 58:4:2:[4.3,9.1]:TopTop: less_than_or_equal(k(x0),x1),less_than_or_equal(x1,x0),in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(n0,f(x0))
% 54.71/11.47 === Backtracking. Learning clause 59:5:2:[10.5,5.1]:TopTop: less_than_or_equal(x0,q(x1,k(x0))),less_than_or_equal(n0,f(q(x1,k(x0)))),in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),x1)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 155
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Backtracking. Learning clause 60:4:2:[4.2,28.2]:TopTop: less_than_or_equal(x0,x1),in_interval(lower_bound,x1,upper_bound) -> less_than_or_equal(x0,k(x1)),less_than_or_equal(n0,f(x1))
% 54.71/11.47 === Backtracking. Learning clause 61:5:2:[10.5,58.1]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(n0,f(x1)),less_than_or_equal(x1,x0),in_interval(lower_bound,x0,upper_bound) -> less_than_or_equal(n0,f(x0))
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 162
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 38:3:3:[4.1,3.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> l, x1 -> n0, x2 -> q(n0,k(n0))}
% 54.71/11.47 === Backtracking. Learning clause 62:3:3:[38.2,6.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x0,q(x1,x2)),less_than_or_equal(x2,x1)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 169
% 54.71/11.47 === Restarting.
% 54.71/11.47 === Conflict found: 38:3:3:[4.1,3.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> n0, x1 -> n0, x2 -> f(g(n0))}
% 54.71/11.47 === Backtracking. Learning clause 63:4:2:[38.2,11.2]:TopTop: less_than_or_equal(x0,n0),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(x0,f(x1)),less_than_or_equal(x1,l)
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 233
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 297
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 361
% 54.71/11.47 === Backtracking. Learning clause 64:2:2:[3.2,5.1]:TopTop: -> less_than_or_equal(q(x0,x1),x1),less_than_or_equal(x1,x0)
% 54.71/11.47 === Backtracking. Learning clause 66:2:0:[48.0,65.1,14.1,55.3,30.4,1.3,2.1]:: less_than_or_equal(n0,f(l)),less_than_or_equal(l,upper_bound) ->
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 425
% 54.71/11.47 === Backtracking. Learning clause 67:4:4:[1.1,38.2]:TopTopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(x2,x0) -> in_interval(x3,x0,x1),less_than_or_equal(x2,x3)
% 54.71/11.47 === Conflict found: 66:2:0:[48.0,65.1,14.1,55.3,30.4,1.3,2.1]:: less_than_or_equal(n0,f(l)),less_than_or_equal(l,upper_bound) -> {}
% 54.71/11.47 === Backtracking. Learning clause 68:2:0:[66.2,24.2]:: less_than_or_equal(n0,f(l)),less_than_or_equal(l,l) ->
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 489
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 553
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 617
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 681
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 745
% 54.71/11.47 === Backtracking. Learning clause 69:6:2:[4.2,10.5,14.2]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(n0,f(x1)),in_interval(lower_bound,x0,upper_bound),less_than_or_equal(g(k(x0)),k(x0)) -> less_than_or_equal(l,x1),less_than_or_equal(n0,f(x0))
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 809
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 873
% 54.71/11.47 === Clause set with instances from active satisfied. Growing active. New size: 937
% 54.71/11.47 === Conflict found: 63:4:2:[38.2,11.2]:TopTop: less_than_or_equal(x0,n0),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(x0,f(x1)),less_than_or_equal(x1,l) {x0 -> n0, x1 -> q(l,k(l))}
% 54.71/11.47
% 54.71/11.47 SZS status Unsatisfiable
% 54.71/11.47
% 54.71/11.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.71/11.47
% 54.71/11.47 SPASS-SCL-FOL Statistics:
% 54.71/11.47 Number of learned clauses: 43
% 54.71/11.47 Number of propagations: 2696
% 54.71/11.47 Number of decisions: 1743
% 54.71/11.47 Number of resolutions: 83
% 54.71/11.47 Number of condensations: 1
% 54.71/11.47 Number of sub resolutions: 8
% 54.71/11.47 Number of input literals (deduplicated): 22
% 54.71/11.47 Number of grows: 23
% 54.71/11.47 Number of considered ground atoms: 937
% 54.71/11.47
% 54.71/11.47 Needed: 0:0:10.92
% 54.71/11.47
%------------------------------------------------------------------------------