%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD001-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n023.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:21:19 PM UTC 2026
% Result : Unsatisfiable 34.60s 7.49s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD001-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n023.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 11:49:54 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 34.60/7.49 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49 Execution resolution_1 ended with status: unsatisfiable
% 34.60/7.49 Used heuristic: resolution_1
% 34.60/7.49
% 34.60/7.49 Input Clauses:
% 34.60/7.49
% 34.60/7.49 Predicates: sum defined product less_or_equal
% 34.60/7.49 Fol Constants: additive_identity multiplicative_identity a b
% 34.60/7.49 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 34.60/7.49 Problem Properties:
% 34.60/7.49 This is a full first-order problem without equality.
% 34.60/7.49
% 34.60/7.49 After reduction: Problem Properties:
% 34.60/7.49 This is a full first-order problem without equality.
% 34.60/7.49
% 34.60/7.49
% 34.60/7.49 Reduced Input Clauses:
% 34.60/7.49
% 34.60/7.49 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 34.60/7.49
% 34.60/7.49 === Starting SPASS-SCL-FOL A Little Less Naive, considering 45 atoms initially, heuristics mode: resolution_1 ===
% 34.60/7.49
% 34.60/7.49 === Backtracking. Learning clause 31:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 34.60/7.49 === Backtracking. Learning clause 32:5:5:[24.2,29.1,1.4]:TopTopTopTopTop: less_or_equal(additive_identity,x0),sum(x0,x1,x2),sum(x1,x3,a),sum(x2,x3,x4) -> less_or_equal(b,x4)
% 34.60/7.49 === Backtracking. Learning clause 33:3:2:[24.2,29.1]:TopTop: less_or_equal(additive_identity,x0),sum(x0,a,x1) -> less_or_equal(b,x1)
% 34.60/7.49 === Backtracking. Learning clause 34:5:4:[24.2,19.3]:TopTopTopTop: less_or_equal(x0,x1),sum(x1,x2,x3),defined(x0),defined(x2) -> less_or_equal(add(x0,x2),x3)
% 34.60/7.49 === Backtracking. Learning clause 35:5:4:[24.3,19.3]:TopTopTopTop: less_or_equal(x0,x1),sum(x0,x2,x3),defined(x1),defined(x2) -> less_or_equal(x3,add(x1,x2))
% 34.60/7.49 === Backtracking. Learning clause 36:6:6:[11.3,20.3,5.1]:TopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,x4),product(x1,x3,x5),defined(x0),defined(x3) -> sum(x5,multiply(x0,x3),x4)
% 34.60/7.49 === Backtracking. Learning clause 37:8:8:[11.2,20.3,24.3]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x0,x3,x4),product(x1,x3,x5),defined(x2),defined(x3),less_or_equal(x6,x4),sum(x6,x5,x7) -> less_or_equal(x7,multiply(x2,x3))
% 34.60/7.49 === Backtracking. Learning clause 38:6:6:[11.2,20.3]:TopTopTopTopTopTop: sum(x0,x1,x2),product(x0,x3,x4),product(x1,x3,x5),defined(x2),defined(x3) -> sum(x4,x5,multiply(x2,x3))
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 62
% 34.60/7.49 === Restarting.
% 34.60/7.49 === Conflict found: 33:3:2:[24.2,29.1]:TopTop: less_or_equal(additive_identity,x0),sum(x0,a,x1) -> less_or_equal(b,x1) {x0 -> additive_identity, x1 -> additive_identity}
% 34.60/7.49 === Backtracking. Learning clause 40:3:0:[27.0,39.1,33.2,18.3]:: less_or_equal(additive_identity,additive_identity) -> less_or_equal(b,additive_identity),defined(multiplicative_inverse(a))
% 34.60/7.49 === Conflict found: 32:5:5:[24.2,29.1,1.4]:TopTopTopTopTop: less_or_equal(additive_identity,x0),sum(x0,x1,x2),sum(x1,x3,a),sum(x2,x3,x4) -> less_or_equal(b,x4) {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> a, x4 -> a}
% 34.60/7.49 === Backtracking. Learning clause 43:2:0:[27.0,41.1,14.0,42.2,32.3,3.2,3.2]:: less_or_equal(additive_identity,additive_identity) -> less_or_equal(b,a)
% 34.60/7.49 === Backtracking. Learning clause 44:4:1:[24.3,3.2,18.3]:Top: less_or_equal(additive_identity,additive_identity),defined(x0) -> less_or_equal(additive_identity,x0),defined(multiplicative_inverse(x0))
% 34.60/7.49 === Backtracking. Learning clause 45:4:1:[24.2,3.2,18.3]:Top: less_or_equal(additive_identity,additive_identity),defined(x0) -> less_or_equal(x0,additive_identity),defined(multiplicative_inverse(x0))
% 34.60/7.49 === Backtracking. Learning clause 48:3:0:[27.0,46.0,14.0,47.2,1.3,29.1,18.3,24.3,3.2]:: less_or_equal(additive_identity,additive_identity) -> defined(multiplicative_inverse(a)),less_or_equal(additive_identity,b)
% 34.60/7.49 === Backtracking. Learning clause 49:4:4:[6.3,8.2]:TopTopTopTop: product(x0,x1,multiplicative_identity),product(x1,x2,x3),defined(x2) -> product(x0,x3,x2)
% 34.60/7.49 === Backtracking. Learning clause 50:5:5:[12.2,8.2]:TopTopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,x2,x3),sum(x2,x3,x4),defined(x2) -> product(x1,x2,x4)
% 34.60/7.49 === Backtracking. Learning clause 51:2:1:[10.1,8.2]:Top: defined(x0) -> product(x0,multiplicative_identity,x0)
% 34.60/7.49 === Backtracking. Learning clause 52:2:1:[5.1,4.2]:Top: defined(x0) -> sum(x0,additive_inverse(x0),additive_identity)
% 34.60/7.49 === Conflict found: 50:5:5:[12.2,8.2]:TopTopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,x2,x3),sum(x2,x3,x4),defined(x2) -> product(x1,x2,x4) {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> multiply(additive_identity,additive_identity), x4 -> a}
% 34.60/7.49 === Backtracking. Learning clause 53:8:6:[50.2,20.3,1.4,21.3]:TopTopTopTopTopTop: sum(multiplicative_identity,x0,x1),defined(x0),defined(x2),sum(x2,additive_identity,x3),sum(x3,x4,x5),less_or_equal(x4,multiply(x0,x2)),less_or_equal(multiply(x0,x2),x4) -> product(x1,x2,x5)
% 34.60/7.49 === Conflict found: 50:5:5:[12.2,8.2]:TopTopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,x2,x3),sum(x2,x3,x4),defined(x2) -> product(x1,x2,x4) {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> multiply(additive_identity,additive_identity), x4 -> a}
% 34.60/7.49 === Backtracking. Learning clause 54:7:7:[50.2,20.3,2.4]:TopTopTopTopTopTopTop: sum(multiplicative_identity,x0,x1),defined(x0),defined(x2),sum(x3,x4,x2),sum(x4,multiply(x0,x2),x5),sum(x3,x5,x6) -> product(x1,x2,x6)
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 83
% 34.60/7.49 === Restarting.
% 34.60/7.49 === Backtracking. Learning clause 55:3:1:[22.1,43.2]:Top: less_or_equal(a,x0),less_or_equal(additive_identity,additive_identity) -> less_or_equal(b,x0)
% 34.60/7.49 === Backtracking. Learning clause 56:9:10:[6.4,30.1,8.2,12.5,12.5]:TopTopTopTopTopTopTopTopTopTop: defined(x0),sum(x1,x2,x0),product(x1,x3,x4),product(x2,x3,x5),sum(x4,x5,b),sum(x6,x7,x0),product(x6,x3,x8),product(x7,x3,x9),sum(x8,x9,a) ->
% 34.60/7.49 === Conflict found: 56:9:10:[6.4,30.1,8.2,12.5,12.5]:TopTopTopTopTopTopTopTopTopTop: defined(x0),sum(x1,x2,x0),product(x1,x3,x4),product(x2,x3,x5),sum(x4,x5,b),sum(x6,x7,x0),product(x6,x3,x8),product(x7,x3,x9),sum(x8,x9,a) -> {x0 -> b, x1 -> additive_identity, x2 -> additive_identity, x3 -> multiplicative_identity, x4 -> additive_identity, x5 -> additive_identity, x6 -> additive_identity, x7 -> additive_identity, x8 -> additive_identity, x9 -> additive_identity}
% 34.60/7.49 === Backtracking. Learning clause 60:3:0:[28.0,57.0,14.0,58.1,22.2,59.5,56.3,51.2,21.3,21.3,55.3]:: less_or_equal(additive_identity,b),less_or_equal(additive_identity,a),less_or_equal(a,additive_identity) ->
% 34.60/7.49 === Backtracking. Learning clause 61:9:9:[24.2,38.6,22.2]:TopTopTopTopTopTopTopTopTop: less_or_equal(x0,x1),sum(x1,x2,x3),sum(x4,x5,x6),product(x4,x7,x0),product(x5,x7,x2),defined(x6),defined(x7),less_or_equal(x8,multiply(x6,x7)) -> less_or_equal(x8,x3)
% 34.60/7.49 === Backtracking. Learning clause 62:5:5:[1.2,19.3]:TopTopTopTopTop: sum(x0,x1,x2),sum(x2,x3,x4),defined(x1),defined(x3) -> sum(x0,add(x1,x3),x4)
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 93
% 34.60/7.49 === Restarting.
% 34.60/7.49 === Conflict found: 31:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) -> {}
% 34.60/7.49 === Backtracking. Learning clause 65:1:0:[17.0,63.0,14.0,64.1,31.2,45.3,44.3,23.3]:: -> defined(multiplicative_inverse(multiplicative_identity))
% 34.60/7.49 === Conflict found: 60:3:0:[28.0,57.0,14.0,58.1,22.2,59.5,56.3,51.2,21.3,21.3,55.3]:: less_or_equal(additive_identity,b),less_or_equal(additive_identity,a),less_or_equal(a,additive_identity) -> {}
% 34.60/7.49 === Backtracking. Learning clause 68:1:0:[27.0,66.0,14.0,67.1,60.3,45.3,48.3,44.3,23.3]:: -> defined(multiplicative_inverse(a))
% 34.60/7.49 === Backtracking. Learning clause 69:3:1:[22.2,43.2]:Top: less_or_equal(x0,b),less_or_equal(additive_identity,additive_identity) -> less_or_equal(x0,a)
% 34.60/7.49 === Backtracking. Learning clause 70:4:5:[5.2,24.3]:TopTopTopTopTop: sum(x0,x1,x2),less_or_equal(x3,x1),sum(x3,x0,x4) -> less_or_equal(x4,x2)
% 34.60/7.49 === Conflict found: 50:5:5:[12.2,8.2]:TopTopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,x2,x3),sum(x2,x3,x4),defined(x2) -> product(x1,x2,x4) {x0 -> multiplicative_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> additive_identity, x4 -> additive_identity}
% 34.60/7.49 === Backtracking. Learning clause 71:4:3:[50.2,8.2]:TopTopTop: sum(multiplicative_identity,multiplicative_identity,x0),sum(x1,x1,x2),defined(x1) -> product(x0,x1,x2)
% 34.60/7.49 === Conflict found: 70:4:5:[5.2,24.3]:TopTopTopTopTop: sum(x0,x1,x2),less_or_equal(x3,x1),sum(x3,x0,x4) -> less_or_equal(x4,x2) {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> additive_identity, x4 -> multiply(additive_identity,additive_identity)}
% 34.60/7.49 === Backtracking. Learning clause 72:8:8:[70.3,38.6]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),less_or_equal(x3,x1),sum(x4,x5,x6),product(x4,x7,x3),product(x5,x7,x0),defined(x6),defined(x7) -> less_or_equal(multiply(x6,x7),x2)
% 34.60/7.49 === Backtracking. Learning clause 73:8:9:[2.3,36.6]:TopTopTopTopTopTopTopTopTop: sum(x0,x1,x2),sum(x1,x3,multiply(x4,x5)),sum(x4,x6,x7),product(x7,x5,x8),product(x6,x5,x0),defined(x4),defined(x5) -> sum(x2,x3,x8)
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 107
% 34.60/7.49 === Restarting.
% 34.60/7.49 === Conflict found: 69:3:1:[22.2,43.2]:Top: less_or_equal(x0,b),less_or_equal(additive_identity,additive_identity) -> less_or_equal(x0,a) {x0 -> additive_identity}
% 34.60/7.49 === Backtracking. Learning clause 75:3:0:[28.0,74.1,69.1,44.3]:: less_or_equal(additive_identity,additive_identity) -> less_or_equal(additive_identity,a),defined(multiplicative_inverse(b))
% 34.60/7.49 === Backtracking. Learning clause 76:5:2:[22.2,45.3]:TopTop: less_or_equal(x0,x1),less_or_equal(additive_identity,additive_identity),defined(x1) -> less_or_equal(x0,additive_identity),defined(multiplicative_inverse(x1))
% 34.60/7.49 === Backtracking. Learning clause 77:4:3:[24.2,3.2]:TopTopTop: less_or_equal(additive_identity,x0),sum(x0,x1,x2),defined(x1) -> less_or_equal(x1,x2)
% 34.60/7.49 === Conflict found: 77:4:3:[24.2,3.2]:TopTopTop: less_or_equal(additive_identity,x0),sum(x0,x1,x2),defined(x1) -> less_or_equal(x1,x2) {x0 -> additive_identity, x1 -> a, x2 -> b}
% 34.60/7.49 === Backtracking. Learning clause 81:1:0:[27.0,78.0,28.0,79.1,14.0,80.2,77.2,29.1,76.1,60.3,44.3,75.2,23.3]:: -> defined(multiplicative_inverse(b))
% 34.60/7.49 === Backtracking. Learning clause 82:4:3:[24.3,3.2]:TopTopTop: less_or_equal(x0,additive_identity),sum(x0,x1,x2),defined(x1) -> less_or_equal(x2,x1)
% 34.60/7.49 === Conflict found: 50:5:5:[12.2,8.2]:TopTopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,x2,x3),sum(x2,x3,x4),defined(x2) -> product(x1,x2,x4) {x0 -> additive_identity, x1 -> multiplicative_identity, x2 -> a, x3 -> additive_identity, x4 -> b}
% 34.60/7.49 === Backtracking. Learning clause 84:3:2:[27.0,83.3,50.5,30.1]:TopTop: sum(multiplicative_identity,x0,multiplicative_identity),product(x0,a,x1),sum(a,x1,b) ->
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 117
% 34.60/7.49 === Restarting.
% 34.60/7.49 === Conflict found: 77:4:3:[24.2,3.2]:TopTopTop: less_or_equal(additive_identity,x0),sum(x0,x1,x2),defined(x1) -> less_or_equal(x1,x2) {x0 -> additive_identity, x1 -> additive_inverse(additive_identity), x2 -> additive_identity}
% 34.60/7.49 === Backtracking. Learning clause 86:3:1:[15.1,85.1,77.2,52.2]:Top: less_or_equal(additive_identity,x0),defined(x0) -> less_or_equal(additive_inverse(x0),additive_identity)
% 34.60/7.49 === Backtracking. Learning clause 87:6:9:[1.2,2.4]:TopTopTopTopTopTopTopTopTop: sum(x0,x1,x2),sum(x2,x3,x4),sum(x5,x6,x1),sum(x6,x3,x7),sum(x5,x7,x8) -> sum(x0,x8,x4)
% 34.60/7.49 === Clause set with instances from active satisfied. Growing active. New size: 181
% 34.60/7.49 === Conflict found: 56:9:10:[6.4,30.1,8.2,12.5,12.5]:TopTopTopTopTopTopTopTopTopTop: defined(x0),sum(x1,x2,x0),product(x1,x3,x4),product(x2,x3,x5),sum(x4,x5,b),sum(x6,x7,x0),product(x6,x3,x8),product(x7,x3,x9),sum(x8,x9,a) -> {x0 -> add(additive_identity,multiplicative_identity), x1 -> additive_identity, x2 -> multiplicative_identity, x3 -> a, x4 -> additive_identity, x5 -> a, x6 -> additive_identity, x7 -> multiplicative_identity, x8 -> additive_identity, x9 -> a}
% 34.60/7.49 === Backtracking. Learning clause 89:6:4:[17.0,88.5,56.1,13.3,19.3,8.2]:TopTopTopTop: product(x0,x1,x2),sum(x2,x1,b),product(x0,x1,x3),sum(x3,x1,a),defined(x0),defined(x1) ->
% 34.60/7.49 === Conflict found: 56:9:10:[6.4,30.1,8.2,12.5,12.5]:TopTopTopTopTopTopTopTopTopTop: defined(x0),sum(x1,x2,x0),product(x1,x3,x4),product(x2,x3,x5),sum(x4,x5,b),sum(x6,x7,x0),product(x6,x3,x8),product(x7,x3,x9),sum(x8,x9,a) -> {x0 -> add(additive_identity,a), x1 -> additive_identity, x2 -> a, x3 -> multiplicative_identity, x4 -> additive_identity, x5 -> a, x6 -> additive_identity, x7 -> a, x8 -> additive_identity, x9 -> a}
% 34.60/7.49
% 34.60/7.49 SZS status Unsatisfiable
% 34.60/7.49
% 34.60/7.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.60/7.49
% 34.60/7.49 SPASS-SCL-FOL Statistics:
% 34.60/7.49 Number of learned clauses: 40
% 34.60/7.49 Number of propagations: 1152
% 34.60/7.49 Number of decisions: 344
% 34.60/7.49 Number of resolutions: 79
% 34.60/7.49 Number of condensations: 0
% 34.60/7.49 Number of sub resolutions: 19
% 34.60/7.49 Number of input literals (deduplicated): 24
% 34.60/7.49 Number of grows: 6
% 34.60/7.49 Number of considered ground atoms: 181
% 34.60/7.49
% 34.60/7.49 Needed: 0:00:06.90
% 34.60/7.49
%------------------------------------------------------------------------------