%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : ANA002-3 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n031.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 26.42s 7.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA002-3 : TPTP v9.2.1. Released v1.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n031.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 14:07:11 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 26.42/7.03 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03 Execution resolution_1 ended with status: unsatisfiable
% 26.42/7.03 Used heuristic: resolution_1
% 26.42/7.03
% 26.42/7.03 Input Clauses:
% 26.42/7.03
% 26.42/7.03 Predicates: less_than_or_equal
% 26.42/7.03 Fol Constants: n0 lower_bound upper_bound l
% 26.42/7.03 Fol Functions: q f h k g
% 26.42/7.03 Problem Properties:
% 26.42/7.03 This is a full first-order problem without equality.
% 26.42/7.03
% 26.42/7.03 After reduction: Problem Properties:
% 26.42/7.03 This is a full first-order problem without equality.
% 26.42/7.03
% 26.42/7.03
% 26.42/7.03 Reduced Input Clauses:
% 26.42/7.03
% 26.42/7.03 Most General Atoms: less_than_or_equal(x0,x2)
% 26.42/7.03
% 26.42/7.03 === Starting SPASS-SCL-FOL A Little Less Naive, considering 38 atoms initially, heuristics mode: resolution_1 ===
% 26.42/7.03
% 26.42/7.03 === Backtracking. Learning clause 18:4:1:[6.4,10.2]:Top: less_than_or_equal(x0,h(x0)),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,l)
% 26.42/7.03 === Backtracking. Learning clause 19:1:0:[17.1,15.1]:: less_than_or_equal(n0,f(lower_bound)) ->
% 26.42/7.03 === Backtracking. Learning clause 20:2:1:[10.2,15.1,3.2,14.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l)
% 26.42/7.03 === Backtracking. Learning clause 21:4:1:[6.4,17.1]:Top: less_than_or_equal(x0,h(x0)),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(n0,f(x0)) ->
% 26.42/7.03 === Backtracking. Learning clause 22:4:1:[7.2,15.1,17.1,3.2,21.1]:Top: less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(n0,f(x0)) ->
% 26.42/7.03 === Backtracking. Learning clause 23:4:1:[2.2,8.1]:Top: less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,k(x0)),less_than_or_equal(n0,f(x0))
% 26.42/7.03 === Backtracking. Learning clause 24:4:1:[3.1,9.6,8.1,16.1,22.4]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) ->
% 26.42/7.03 === Backtracking. Learning clause 25:1:0:[13.1,11.1]:: -> less_than_or_equal(l,upper_bound)
% 26.42/7.03 === Backtracking. Learning clause 26:2:1:[17.1,12.1]:Top: less_than_or_equal(n0,f(g(x0))) -> less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 28:2:1:[11.0,27.0,10.2,12.1]:Top: -> less_than_or_equal(g(x0),l),less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 29:8:1:[9.6,6.1]:Top: less_than_or_equal(x0,h(k(x0))),less_than_or_equal(n0,f(h(k(x0)))),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(lower_bound,k(x0)),less_than_or_equal(k(x0),upper_bound) -> less_than_or_equal(n0,f(x0)),less_than_or_equal(f(k(x0)),n0)
% 26.42/7.03 === Backtracking. Learning clause 30:6:2:[9.6,4.1]:TopTop: less_than_or_equal(x0,q(x1,k(x0))),less_than_or_equal(n0,f(q(x1,k(x0)))),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),x1)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 67
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Backtracking. Learning clause 31:2:1:[3.2,25.1]:Top: less_than_or_equal(x0,l) -> less_than_or_equal(x0,upper_bound)
% 26.42/7.03 === Backtracking. Learning clause 33:1:0:[14.0,32.0,10.2,15.1]:: -> less_than_or_equal(lower_bound,l)
% 26.42/7.03 === Conflict found: 20:2:1:[10.2,15.1,3.2,14.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l) {x0 -> q(l,n0)}
% 26.42/7.03 === Backtracking. Learning clause 34:2:1:[20.2,5.1]:Top: less_than_or_equal(q(l,x0),lower_bound) -> less_than_or_equal(x0,l)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 69
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Conflict found: 20:2:1:[10.2,15.1,3.2,14.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l) {x0 -> k(l)}
% 26.42/7.03 === Backtracking. Learning clause 37:2:0:[33.0,35.1,25.0,36.2,20.2,8.1]:: less_than_or_equal(k(l),lower_bound) -> less_than_or_equal(n0,f(l))
% 26.42/7.03 === Backtracking. Learning clause 38:2:1:[2.1,13.1]:Top: -> less_than_or_equal(x0,g(x0)),less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 39:3:2:[3.2,28.1]:TopTop: less_than_or_equal(x0,g(x1)) -> less_than_or_equal(x0,l),less_than_or_equal(l,x1)
% 26.42/7.03 === Backtracking. Learning clause 40:6:2:[7.5,10.2]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(x0,h(x1)),less_than_or_equal(x1,l)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 73
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Backtracking. Learning clause 41:2:1:[3.1,25.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 42:4:1:[3.1,9.6,8.1,16.1]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0))
% 26.42/7.03 === Backtracking. Learning clause 43:3:3:[3.1,2.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 87
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Conflict found: 31:2:1:[3.2,25.1]:Top: less_than_or_equal(x0,l) -> less_than_or_equal(x0,upper_bound) {x0 -> n0}
% 26.42/7.03 === Backtracking. Learning clause 44:2:1:[31.1,20.2]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,upper_bound)
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.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)}
% 26.42/7.03 === Backtracking. Learning clause 45:4:2:[43.2,37.1,3.2]:TopTop: less_than_or_equal(x0,lower_bound),less_than_or_equal(x1,x0) -> less_than_or_equal(n0,f(l)),less_than_or_equal(x1,k(l))
% 26.42/7.03 === Backtracking. Learning clause 46:3:1:[3.3,37.1]:Top: less_than_or_equal(k(l),x0),less_than_or_equal(x0,lower_bound) -> less_than_or_equal(n0,f(l))
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.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(k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 47:4:2:[43.2,10.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)
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> k(n0), x1 -> upper_bound, x2 -> h(k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 48:5:2:[43.3,18.1]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(h(x0),x1),less_than_or_equal(x0,l)
% 26.42/7.03 === Conflict found: 42:4:1:[3.1,9.6,8.1,16.1]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0)) {x0 -> h(k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 49:9:1:[42.4,29.2,48.4,10.2]:Top: less_than_or_equal(upper_bound,h(k(x0))),less_than_or_equal(lower_bound,h(k(x0))),less_than_or_equal(x0,h(k(x0))),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(lower_bound,k(x0)),less_than_or_equal(k(x0),upper_bound) -> less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),l)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 152
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Conflict found: 41:2:1:[3.1,25.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0) {x0 -> q(n0,l)}
% 26.42/7.03 === Backtracking. Learning clause 50:2:1:[41.2,4.1]:Top: less_than_or_equal(upper_bound,q(x0,l)) -> less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 51:4:3:[3.1,38.1,43.3]:TopTopTop: less_than_or_equal(g(x0),x1) -> less_than_or_equal(x0,x2),less_than_or_equal(l,x0),less_than_or_equal(x2,x1)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 159
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Backtracking. Learning clause 52:5:2:[3.3,21.1]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(x1,h(x0)),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(n0,f(x0)) ->
% 26.42/7.03 === Conflict found: 42:4:1:[3.1,9.6,8.1,16.1]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0)) {x0 -> g(n0)}
% 26.42/7.03 === Backtracking. Learning clause 53:3:1:[42.4,26.1,11.1]:Top: less_than_or_equal(upper_bound,g(x0)),less_than_or_equal(lower_bound,g(x0)) -> less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 54:3:2:[3.2,38.1]:TopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x0,g(x1)),less_than_or_equal(l,x1)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 171
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Backtracking. Learning clause 55:3:3:[3.3,5.1]:TopTopTop: less_than_or_equal(q(x0,x1),x2),less_than_or_equal(x2,x0) -> less_than_or_equal(x1,x0)
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.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 -> q(l,n0)}
% 26.42/7.03 === Backtracking. Learning clause 56:3:2:[43.2,34.1]:TopTop: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,q(l,x1)),less_than_or_equal(x1,l)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 198
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Conflict found: 47:4:2:[43.2,10.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 -> h(k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 57:10:1:[47.3,29.2]:Top: less_than_or_equal(n0,n0),less_than_or_equal(h(k(x0)),upper_bound),less_than_or_equal(x0,h(k(x0))),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(lower_bound,k(x0)),less_than_or_equal(k(x0),upper_bound) -> less_than_or_equal(h(k(x0)),l),less_than_or_equal(n0,f(x0)),less_than_or_equal(f(k(x0)),n0)
% 26.42/7.03 === Backtracking. Learning clause 58:7:3:[3.2,40.5]:TopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(x1,x2),less_than_or_equal(f(x1),n0),less_than_or_equal(lower_bound,x2),less_than_or_equal(x2,upper_bound) -> less_than_or_equal(x0,h(x2)),less_than_or_equal(x2,l)
% 26.42/7.03 === Conflict found: 42:4:1:[3.1,9.6,8.1,16.1]:Top: less_than_or_equal(upper_bound,x0),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0)) {x0 -> q(n0,k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 59:8:2:[42.4,30.2]:TopTop: less_than_or_equal(upper_bound,q(x0,k(x1))),less_than_or_equal(lower_bound,q(x0,k(x1))),less_than_or_equal(q(x0,k(x1)),upper_bound),less_than_or_equal(x1,q(x0,k(x1))),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(n0,f(x1)),less_than_or_equal(k(x1),x0)
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> k(n0), x1 -> upper_bound, x2 -> q(n0,k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 60:8:2:[43.3,4.1,59.3]:TopTop: less_than_or_equal(k(x0),upper_bound),less_than_or_equal(upper_bound,q(x1,k(x0))),less_than_or_equal(lower_bound,q(x1,k(x0))),less_than_or_equal(x0,q(x1,k(x0))),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),x1)
% 26.42/7.03 === Conflict found: 47:4:2:[43.2,10.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(n0,k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 61:9:2:[47.3,30.2,55.1,43.2,60.2,3.3]:TopTop: less_than_or_equal(n0,n0),less_than_or_equal(l,x0),less_than_or_equal(upper_bound,upper_bound),less_than_or_equal(k(x1),upper_bound),less_than_or_equal(x1,q(x0,k(x1))),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(n0,f(x1)),less_than_or_equal(k(x1),x0)
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> lower_bound, x1 -> l, x2 -> q(n0,k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 63:8:3:[44.1,62.8,43.2,55.1,3.2,61.5,9.6,8.1,16.1,22.4]:TopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(x1,x2),less_than_or_equal(x2,x0),less_than_or_equal(n0,n0),less_than_or_equal(l,x2),less_than_or_equal(upper_bound,upper_bound),less_than_or_equal(x2,lower_bound),less_than_or_equal(lower_bound,x2) ->
% 26.42/7.03 === Conflict found: 58:7:3:[3.2,40.5]:TopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(x1,x2),less_than_or_equal(f(x1),n0),less_than_or_equal(lower_bound,x2),less_than_or_equal(x2,upper_bound) -> less_than_or_equal(x0,h(x2)),less_than_or_equal(x2,l) {x0 -> l, x1 -> g(n0), x2 -> k(l)}
% 26.42/7.03 === Backtracking. Learning clause 64:8:4:[58.3,12.1,43.3]:TopTopTopTop: less_than_or_equal(x0,g(x1)),less_than_or_equal(lower_bound,x2),less_than_or_equal(x2,upper_bound),less_than_or_equal(g(x1),x3) -> less_than_or_equal(x0,h(x2)),less_than_or_equal(x2,l),less_than_or_equal(l,x1),less_than_or_equal(x2,x3)
% 26.42/7.03 === Conflict found: 47:4:2:[43.2,10.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(n0,k(n0))}
% 26.42/7.03 === Backtracking. Learning clause 65:8:2:[47.3,30.2]:TopTop: less_than_or_equal(n0,n0),less_than_or_equal(q(x0,k(x1)),upper_bound),less_than_or_equal(x1,q(x0,k(x1))),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(q(x0,k(x1)),l),less_than_or_equal(n0,f(x1)),less_than_or_equal(k(x1),x0)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 232
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Backtracking. Learning clause 66:5:2:[3.1,23.3,2.1]:TopTop: less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,x1),less_than_or_equal(n0,f(x0)),less_than_or_equal(x1,k(x0))
% 26.42/7.03 === Backtracking. Learning clause 67:3:2:[3.3,13.1]:TopTop: less_than_or_equal(g(x0),x1),less_than_or_equal(x1,x0) -> less_than_or_equal(l,x0)
% 26.42/7.03 === Backtracking. Learning clause 68:5:2:[3.3,8.1]:TopTop: less_than_or_equal(k(x0),x1),less_than_or_equal(x1,x0),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) -> less_than_or_equal(n0,f(x0))
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 248
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Conflict found: 43:3:3:[3.1,2.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2) {x0 -> l, x1 -> l, x2 -> q(l,n0)}
% 26.42/7.03 === Backtracking. Learning clause 69:3:3:[43.2,5.1]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x0,q(x1,x2)),less_than_or_equal(x2,x1)
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 255
% 26.42/7.03 === Restarting.
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 319
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 383
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 447
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 511
% 26.42/7.03 === Backtracking. Learning clause 71:1:0:[33.0,70.1,7.6,13.1,12.1,28.1,17.1,52.2,42.4,1.1,25.1]:: less_than_or_equal(upper_bound,l) ->
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 575
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 639
% 26.42/7.03 === Clause set with instances from active satisfied. Growing active. New size: 703
% 26.42/7.03 === Conflict found: 61:9:2:[47.3,30.2,55.1,43.2,60.2,3.3]:TopTop: less_than_or_equal(n0,n0),less_than_or_equal(l,x0),less_than_or_equal(upper_bound,upper_bound),less_than_or_equal(k(x1),upper_bound),less_than_or_equal(x1,q(x0,k(x1))),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(n0,f(x1)),less_than_or_equal(k(x1),x0) {x0 -> l, x1 -> l}
% 26.42/7.03 === Backtracking. Learning clause 74:3:1:[16.0,72.1,25.0,73.3,61.5,69.2,1.1,1.1,9.6,68.1,17.2,7.5,33.1,13.1,12.1,28.1]:Top: less_than_or_equal(l,x0),less_than_or_equal(x0,l) -> less_than_or_equal(l,h(l))
% 26.42/7.03
% 26.42/7.03 SZS status Unsatisfiable
% 26.42/7.03
% 26.42/7.03 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.42/7.03
% 26.42/7.03 SPASS-SCL-FOL Statistics:
% 26.42/7.03 Number of learned clauses: 49
% 26.42/7.03 Number of propagations: 3282
% 26.42/7.03 Number of decisions: 1711
% 26.42/7.03 Number of resolutions: 105
% 26.42/7.03 Number of condensations: 1
% 26.42/7.03 Number of sub resolutions: 8
% 26.42/7.03 Number of input literals (deduplicated): 20
% 26.42/7.03 Number of grows: 18
% 26.42/7.03 Number of considered ground atoms: 703
% 26.42/7.03
% 26.42/7.03 Needed: 0:00:06.49
% 26.42/7.03
%------------------------------------------------------------------------------