%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD071-2 : 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 : n012.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:30 PM UTC 2026
% Result : Unsatisfiable 71.56s 14.75s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : FLD071-2 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 % Computer : n012.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Thu May 7 11:51:31 EDT 2026
% 0.09/0.29 % CPUTime :
% 0.09/0.29 SPASS-SCL-FOL version:
% 0.14/0.34 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 71.56/14.75 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75 Execution lmodel_grow ended with status: unsatisfiable
% 71.56/14.75 Used heuristic: lmodel_grow
% 71.56/14.75
% 71.56/14.75 Input Clauses:
% 71.56/14.75
% 71.56/14.75 Predicates: equalish defined less_or_equal
% 71.56/14.75 Fol Constants: additive_identity multiplicative_identity a b u
% 71.56/14.75 Fol Functions: add additive_inverse multiply multiplicative_inverse
% 71.56/14.75 Problem Properties:
% 71.56/14.75 This is a full first-order problem without equality.
% 71.56/14.75
% 71.56/14.75 After reduction: Problem Properties:
% 71.56/14.75 This is a full first-order problem without equality.
% 71.56/14.75
% 71.56/14.75
% 71.56/14.75 Reduced Input Clauses:
% 71.56/14.75
% 71.56/14.75 Most General Atoms: defined(x2) equalish(x0,x2) less_or_equal(x2,x1)
% 71.56/14.75
% 71.56/14.75 === Starting SPASS-SCL-FOL A Little Less Naive, considering 56 atoms initially, heuristics mode: lmodel_grow ===
% 71.56/14.75
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 70
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 84
% 71.56/14.75 === Backtracking. Learning clause 35:5:3:[18.3,17.2]:TopTopTop: defined(x0),defined(x1),less_or_equal(x2,x0) -> less_or_equal(x1,x0),less_or_equal(x2,x1)
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 104
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 123
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 139
% 71.56/14.75 === Backtracking. Learning clause 36:7:4:[19.2,35.4,16.2]:TopTopTopTop: defined(x0),defined(x1),defined(x2),less_or_equal(x3,x1),less_or_equal(add(x1,x0),add(x2,x0)) -> less_or_equal(x3,x2),equalish(add(x1,x0),add(x2,x0))
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 153
% 71.56/14.75 === Backtracking. Learning clause 37:6:4:[19.2,35.5]:TopTopTopTop: defined(x0),defined(x1),defined(x2),less_or_equal(x3,x1) -> less_or_equal(add(x3,x0),add(x2,x0)),less_or_equal(x2,x1)
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 165
% 71.56/14.75 === Backtracking. Learning clause 38:4:3:[16.3,23.1]:TopTopTop: less_or_equal(x0,x1),less_or_equal(x1,x0),equalish(x1,x2) -> equalish(x0,x2)
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 182
% 71.56/14.75 === Backtracking. Learning clause 39:3:3:[22.2,24.2]:TopTopTop: equalish(x0,x1),defined(x2) -> equalish(add(x1,x2),add(x0,x2))
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 198
% 71.56/14.75 === Backtracking. Learning clause 40:3:3:[22.2,23.2]:TopTopTop: equalish(x0,x1),equalish(x2,x1) -> equalish(x2,x0)
% 71.56/14.75 === Conflict found: 38:4:3:[16.3,23.1]:TopTopTop: less_or_equal(x0,x1),less_or_equal(x1,x0),equalish(x1,x2) -> equalish(x0,x2) {x0 -> additive_identity, x1 -> multiply(additive_identity,additive_identity), x2 -> u}
% 71.56/14.75 === Backtracking. Learning clause 41:6:5:[38.2,26.3,40.3]:TopTopTopTopTop: less_or_equal(x0,x1),less_or_equal(x2,x0),equalish(x2,x1),equalish(x3,x4),equalish(x1,x4) -> equalish(x0,x3)
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 208
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 225
% 71.56/14.75 === Clause set with instances from active satisfied. Growing active. New size: 245
% 71.56/14.75 === Conflict found: 41:6:5:[38.2,26.3,40.3]:TopTopTopTopTop: less_or_equal(x0,x1),less_or_equal(x2,x0),equalish(x2,x1),equalish(x3,x4),equalish(x1,x4) -> equalish(x0,x3) {x0 -> additive_identity, x1 -> multiply(a,b), x2 -> u, x3 -> additive_inverse(additive_identity), x4 -> u}
% 71.56/14.75 === Backtracking. Learning clause 42:10:8:[41.3,22.2,41.5,22.2]:TopTopTopTopTopTopTopTop: less_or_equal(x0,x1),less_or_equal(x2,x0),equalish(x1,x3),equalish(x1,x2),less_or_equal(x4,x0),less_or_equal(x5,x4),equalish(x5,x0),equalish(x6,x7),equalish(x3,x7) -> equalish(x4,x6)
% 71.56/14.75 === Conflict found: 42:10:8:[41.3,22.2,41.5,22.2]:TopTopTopTopTopTopTopTop: less_or_equal(x0,x1),less_or_equal(x2,x0),equalish(x1,x3),equalish(x1,x2),less_or_equal(x4,x0),less_or_equal(x5,x4),equalish(x5,x0),equalish(x6,x7),equalish(x3,x7) -> equalish(x4,x6) {x0 -> additive_identity, x1 -> multiply(a,b), x2 -> u, x3 -> u, x4 -> additive_identity, x5 -> additive_identity, x6 -> additive_inverse(additive_identity), x7 -> u}
% 71.56/14.75 === Backtracking. Learning clause 44:4:2:[11.0,43.3,42.1,20.3,41.4,26.2,26.3,35.5,34.1,40.3,32.1,33.1,18.3,31.1,30.1,22.2]:TopTop: less_or_equal(additive_identity,additive_identity),less_or_equal(x0,additive_identity),equalish(x0,additive_identity),equalish(u,x1) ->
% 71.56/14.75
% 71.56/14.75 SZS status Unsatisfiable
% 71.56/14.75
% 71.56/14.75 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 71.56/14.75
% 71.56/14.75 SPASS-SCL-FOL Statistics:
% 71.56/14.75 Number of learned clauses: 9
% 71.56/14.75 Number of propagations: 901
% 71.56/14.75 Number of decisions: 236
% 71.56/14.75 Number of resolutions: 30
% 71.56/14.75 Number of condensations: 1
% 71.56/14.75 Number of sub resolutions: 1
% 71.56/14.75 Number of input literals (deduplicated): 33
% 71.56/14.75 Number of grows: 12
% 71.56/14.75 Number of considered ground atoms: 245
% 71.56/14.75
% 71.56/14.75 Needed: 0:0:14.28
% 71.56/14.75
%------------------------------------------------------------------------------