%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : ANA002-4 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n021.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 4.88s 1.48s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA002-4 : TPTP v9.2.1. Released v1.1.0.
% 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % Computer : n021.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Thu May 7 14:05:58 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 SPASS-SCL-FOL version:
% 0.19/0.39 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.88/1.48 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48 Execution resolution_3 ended with status: unsatisfiable
% 4.88/1.48 Used heuristic: resolution_3
% 4.88/1.48
% 4.88/1.48 Input Clauses:
% 4.88/1.48
% 4.88/1.48 Predicates: less_than_or_equal
% 4.88/1.48 Fol Constants: n0 lower_bound upper_bound l
% 4.88/1.48 Fol Functions: q f h k g
% 4.88/1.48 Problem Properties:
% 4.88/1.48 This is a full first-order problem without equality.
% 4.88/1.48
% 4.88/1.48 After reduction: Problem Properties:
% 4.88/1.48 This is a full first-order problem without equality.
% 4.88/1.48
% 4.88/1.48
% 4.88/1.48 Reduced Input Clauses:
% 4.88/1.48
% 4.88/1.48 Most General Atoms: less_than_or_equal(x0,x2)
% 4.88/1.48
% 4.88/1.48 === Starting SPASS-SCL-FOL A Little Less Naive, considering 42 atoms initially, heuristics mode: resolution_3 ===
% 4.88/1.48
% 4.88/1.48 === 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)
% 4.88/1.48 === Backtracking. Learning clause 19:2:1:[10.2,15.1,3.2,14.1]:Top: less_than_or_equal(x0,lower_bound) -> less_than_or_equal(x0,l)
% 4.88/1.48 === Backtracking. Learning clause 20:2:1:[3.1,11.1,13.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0)
% 4.88/1.48 === Backtracking. Learning clause 22:7:1:[18.3,21.0,7.5,17.1,6.4]:Top: less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)),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,h(l))
% 4.88/1.48 === Backtracking. Learning clause 23:7:1:[6.4,17.1,3.3,22.7]:Top: less_than_or_equal(l,x0),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)),less_than_or_equal(x0,h(x0)),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound) ->
% 4.88/1.48 === Backtracking. Learning clause 24:6:1:[7.5,17.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l))
% 4.88/1.48 === Backtracking. Learning clause 25:9:2:[7.2,15.1,24.2,3.2]:TopTop: less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(x0,l),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)),less_than_or_equal(x1,lower_bound) -> less_than_or_equal(x0,h(l)),less_than_or_equal(x1,h(x0))
% 4.88/1.48 === Backtracking. Learning clause 29:5:1:[19.1,26.0,3.2,27.4,3.2,28.6,6.4,17.1,3.3,25.8,23.5]:Top: less_than_or_equal(x0,lower_bound),less_than_or_equal(l,x0),less_than_or_equal(lower_bound,l),less_than_or_equal(n0,f(l)),less_than_or_equal(x0,upper_bound) ->
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 86
% 4.88/1.48 === Restarting.
% 4.88/1.48 === Conflict found: 19: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)}
% 4.88/1.48 === Backtracking. Learning clause 30:4:0:[19.2,8.1]:: less_than_or_equal(k(l),lower_bound),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound) -> less_than_or_equal(n0,f(l))
% 4.88/1.48 === Backtracking. Learning clause 31: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))
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 93
% 4.88/1.48 === Restarting.
% 4.88/1.48 === Backtracking. Learning clause 32:8:2:[9.6,31.1,29.4]:TopTop: less_than_or_equal(l,x0),less_than_or_equal(n0,f(x0)),less_than_or_equal(x0,l),less_than_or_equal(l,upper_bound),less_than_or_equal(x1,lower_bound),less_than_or_equal(l,x1),less_than_or_equal(lower_bound,l),less_than_or_equal(x1,upper_bound) ->
% 4.88/1.48 === Backtracking. Learning clause 33:5:2:[2.2,31.1]:TopTop: less_than_or_equal(x0,x1),less_than_or_equal(lower_bound,x1),less_than_or_equal(x1,upper_bound) -> less_than_or_equal(x0,k(x1)),less_than_or_equal(n0,f(x1))
% 4.88/1.48 === Backtracking. Learning clause 35:5:1:[19.1,34.1,9.6,31.1,16.1,32.2,3.3,20.2]:Top: less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,l),less_than_or_equal(x0,upper_bound),less_than_or_equal(upper_bound,x0) ->
% 4.88/1.48 === Backtracking. Learning clause 36:3:2:[3.2,11.1]:TopTop: less_than_or_equal(x0,g(x1)) -> less_than_or_equal(x0,upper_bound),less_than_or_equal(l,x1)
% 4.88/1.48 === Backtracking. Learning clause 37:1:0:[13.1,11.1]:: -> less_than_or_equal(l,upper_bound)
% 4.88/1.48 === Conflict found: 20:2:1:[3.1,11.1,13.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0) {x0 -> h(l)}
% 4.88/1.48 === Backtracking. Learning clause 39:4:0:[37.0,38.4,20.2,23.5]:: less_than_or_equal(upper_bound,h(l)),less_than_or_equal(l,l),less_than_or_equal(n0,f(l)),less_than_or_equal(lower_bound,l) ->
% 4.88/1.48 === Conflict found: 20:2:1:[3.1,11.1,13.1]:Top: less_than_or_equal(upper_bound,x0) -> less_than_or_equal(l,x0) {x0 -> q(n0,l)}
% 4.88/1.48 === Backtracking. Learning clause 40:2:1:[20.2,4.1]:Top: less_than_or_equal(upper_bound,q(x0,l)) -> less_than_or_equal(l,x0)
% 4.88/1.48 === Backtracking. Learning clause 42:2:1:[11.0,41.0,10.2,12.1]:Top: -> less_than_or_equal(g(x0),l),less_than_or_equal(l,x0)
% 4.88/1.48 === Conflict found: 24:6:1:[7.5,17.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> g(n0)}
% 4.88/1.48 === Backtracking. Learning clause 44:5:2:[37.0,43.1,24.2,12.1,3.2,42.1]:TopTop: less_than_or_equal(lower_bound,l),less_than_or_equal(n0,f(l)),less_than_or_equal(x0,g(x1)) -> less_than_or_equal(x0,h(l)),less_than_or_equal(l,x1)
% 4.88/1.48 === Conflict found: 24:6:1:[7.5,17.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> g(n0)}
% 4.88/1.48 === Backtracking. Learning clause 46:4:1:[37.0,45.1,24.2,12.1,3.1,42.1,13.1]:Top: less_than_or_equal(lower_bound,l),less_than_or_equal(n0,f(l)),less_than_or_equal(h(l),x0) -> less_than_or_equal(l,x0)
% 4.88/1.48 === Conflict found: 24:6:1:[7.5,17.1]:Top: less_than_or_equal(x0,l),less_than_or_equal(f(x0),n0),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)) -> less_than_or_equal(x0,h(l)) {x0 -> g(n0)}
% 4.88/1.48 === Backtracking. Learning clause 49:4:1:[42.0,47.0,37.0,48.2,24.2,12.1]:Top: less_than_or_equal(lower_bound,l),less_than_or_equal(n0,f(l)) -> less_than_or_equal(g(x0),h(l)),less_than_or_equal(l,x0)
% 4.88/1.48 === Conflict found: 25:9:2:[7.2,15.1,24.2,3.2]:TopTop: less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(x0,l),less_than_or_equal(lower_bound,l),less_than_or_equal(l,upper_bound),less_than_or_equal(n0,f(l)),less_than_or_equal(x1,lower_bound) -> less_than_or_equal(x0,h(l)),less_than_or_equal(x1,h(x0)) {x0 -> k(h(l)), x1 -> n0}
% 4.88/1.48 === Backtracking. Learning clause 51:10:1:[46.3,50.4,25.8,8.1]:Top: less_than_or_equal(lower_bound,k(h(l))),less_than_or_equal(k(h(l)),upper_bound),less_than_or_equal(k(h(l)),l),less_than_or_equal(lower_bound,l),less_than_or_equal(n0,f(l)),less_than_or_equal(x0,lower_bound),less_than_or_equal(lower_bound,h(l)),less_than_or_equal(h(l),upper_bound) -> less_than_or_equal(x0,h(k(h(l)))),less_than_or_equal(n0,f(h(l)))
% 4.88/1.48 === Backtracking. Learning clause 52: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)
% 4.88/1.48 === Backtracking. Learning clause 54:3:0:[37.0,53.3,13.1,49.3,23.5]:: less_than_or_equal(l,l),less_than_or_equal(n0,f(l)),less_than_or_equal(lower_bound,l) ->
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 137
% 4.88/1.48 === Restarting.
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 201
% 4.88/1.48 === Backtracking. Learning clause 55:2:0:[9.6,31.1,54.2,16.1,1.1,37.1]:: less_than_or_equal(upper_bound,l),less_than_or_equal(lower_bound,l) ->
% 4.88/1.48 === Conflict found: 54:3:0:[37.0,53.3,13.1,49.3,23.5]:: less_than_or_equal(l,l),less_than_or_equal(n0,f(l)),less_than_or_equal(lower_bound,l) -> {}
% 4.88/1.48 === Backtracking. Learning clause 56:2:0:[54.1,1.1]:: less_than_or_equal(n0,f(l)),less_than_or_equal(lower_bound,l) ->
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 265
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 329
% 4.88/1.48 === Backtracking. Learning clause 57:3:1:[10.2,2.1]:Top: less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,l),less_than_or_equal(n0,f(x0))
% 4.88/1.48 === Conflict found: 32:8:2:[9.6,31.1,29.4]:TopTop: less_than_or_equal(l,x0),less_than_or_equal(n0,f(x0)),less_than_or_equal(x0,l),less_than_or_equal(l,upper_bound),less_than_or_equal(x1,lower_bound),less_than_or_equal(l,x1),less_than_or_equal(lower_bound,l),less_than_or_equal(x1,upper_bound) -> {x0 -> h(l), x1 -> h(l)}
% 4.88/1.48 === Backtracking. Learning clause 60:9:4:[37.0,58.0,3.2,59.4,32.2,8.4,3.3,3.3,3.3]:TopTopTopTop: less_than_or_equal(l,x0),less_than_or_equal(lower_bound,l),less_than_or_equal(k(x0),x0),less_than_or_equal(x0,x1),less_than_or_equal(x1,lower_bound),less_than_or_equal(x0,x2),less_than_or_equal(x2,l),less_than_or_equal(x0,x3),less_than_or_equal(x3,upper_bound) ->
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 393
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 457
% 4.88/1.48 === Clause set with instances from active satisfied. Growing active. New size: 521
% 4.88/1.48 === Backtracking. Learning clause 61:3:3:[2.2,3.2]:TopTopTop: less_than_or_equal(x0,x1) -> less_than_or_equal(x2,x1),less_than_or_equal(x0,x2)
% 4.88/1.48 === Backtracking. Learning clause 62:1:0:[10.3,56.2,14.1,15.1]:: less_than_or_equal(n0,f(l)) ->
% 4.88/1.48 === Conflict found: 57:3:1:[10.2,2.1]:Top: less_than_or_equal(x0,upper_bound) -> less_than_or_equal(x0,l),less_than_or_equal(n0,f(x0)) {x0 -> f(l)}
% 4.88/1.48 === Backtracking. Learning clause 63:8:3:[57.3,9.2,61.2]:TopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(x2,upper_bound) -> less_than_or_equal(x1,l),less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),x1),less_than_or_equal(x2,x1)
% 4.88/1.48 === Conflict found: 63:8:3:[57.3,9.2,61.2]:TopTopTop: less_than_or_equal(x0,x1),less_than_or_equal(lower_bound,x0),less_than_or_equal(x0,upper_bound),less_than_or_equal(x2,upper_bound) -> less_than_or_equal(x1,l),less_than_or_equal(n0,f(x0)),less_than_or_equal(k(x0),x1),less_than_or_equal(x2,x1) {x0 -> l, x1 -> q(l,k(l)), x2 -> k(l)}
% 4.88/1.48
% 4.88/1.48 SZS status Unsatisfiable
% 4.88/1.48
% 4.88/1.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.48
% 4.88/1.48 SPASS-SCL-FOL Statistics:
% 4.88/1.48 Number of learned clauses: 31
% 4.88/1.48 Number of propagations: 1848
% 4.88/1.48 Number of decisions: 716
% 4.88/1.48 Number of resolutions: 75
% 4.88/1.48 Number of condensations: 0
% 4.88/1.48 Number of sub resolutions: 15
% 4.88/1.48 Number of input literals (deduplicated): 22
% 4.88/1.48 Number of grows: 9
% 4.88/1.48 Number of considered ground atoms: 521
% 4.88/1.48
% 4.88/1.48 Needed: 0:00:01.00
% 4.88/1.48
%------------------------------------------------------------------------------