%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD067-1 : 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 : n022.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:29 PM UTC 2026
% Result : Unsatisfiable 3.28s 1.20s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD067-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n022.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 11:51:51 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.28/1.20 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20 Execution resolution_1 ended with status: unsatisfiable
% 3.28/1.20 Used heuristic: resolution_1
% 3.28/1.20
% 3.28/1.20 Input Clauses:
% 3.28/1.20
% 3.28/1.20 Predicates: equalish defined less_or_equal
% 3.28/1.20 Fol Constants: additive_identity multiplicative_identity a b
% 3.28/1.20 Fol Functions: add additive_inverse multiply multiplicative_inverse
% 3.28/1.20 Problem Properties:
% 3.28/1.20 This is a full first-order problem without equality.
% 3.28/1.20
% 3.28/1.20 After reduction: Problem Properties:
% 3.28/1.20 This is a full first-order problem without equality.
% 3.28/1.20
% 3.28/1.20
% 3.28/1.20 Reduced Input Clauses:
% 3.28/1.20
% 3.28/1.20 Most General Atoms: defined(x2) equalish(x0,x2) less_or_equal(x2,x1)
% 3.28/1.20
% 3.28/1.20 === Starting SPASS-SCL-FOL A Little Less Naive, considering 50 atoms initially, heuristics mode: resolution_1 ===
% 3.28/1.20
% 3.28/1.20 === Backtracking. Learning clause 32:2:1:[26.1,30.1]:Top: equalish(a,x0) -> less_or_equal(x0,b)
% 3.28/1.20 === Backtracking. Learning clause 33:2:1:[22.1,2.2]:Top: defined(x0) -> equalish(x0,add(additive_identity,x0))
% 3.28/1.20 === Backtracking. Learning clause 34:2:1:[22.1,6.2]:Top: defined(x0) -> equalish(x0,multiply(multiplicative_identity,x0))
% 3.28/1.20 === Backtracking. Learning clause 35:2:1:[22.1,3.2]:Top: defined(x0) -> equalish(additive_identity,add(x0,additive_inverse(x0)))
% 3.28/1.20 === Backtracking. Learning clause 36:5:4:[26.2,1.4]:TopTopTopTop: less_or_equal(add(x0,add(x1,x2)),x3),defined(x0),defined(x1),defined(x2) -> less_or_equal(add(add(x0,x1),x2),x3)
% 3.28/1.20 === Backtracking. Learning clause 37:5:4:[23.2,1.4]:TopTopTopTop: equalish(x0,add(x1,add(x2,x3))),defined(x1),defined(x2),defined(x3) -> equalish(x0,add(add(x1,x2),x3))
% 3.28/1.20 === Backtracking. Learning clause 38:5:4:[26.2,5.4]:TopTopTopTop: less_or_equal(multiply(x0,multiply(x1,x2)),x3),defined(x0),defined(x1),defined(x2) -> less_or_equal(multiply(multiply(x0,x1),x2),x3)
% 3.28/1.20 === Backtracking. Learning clause 39:5:4:[23.2,5.4]:TopTopTopTop: equalish(x0,multiply(x1,multiply(x2,x3))),defined(x1),defined(x2),defined(x3) -> equalish(x0,multiply(multiply(x1,x2),x3))
% 3.28/1.20 === Backtracking. Learning clause 40:5:4:[22.1,9.4,23.1,22.2]:TopTopTopTop: defined(x0),defined(x1),defined(x2),equalish(x3,add(multiply(x0,x2),multiply(x1,x2))) -> equalish(multiply(add(x0,x1),x2),x3)
% 3.28/1.20 === Backtracking. Learning clause 41:4:3:[22.1,9.4]:TopTopTop: defined(x0),defined(x1),defined(x2) -> equalish(multiply(add(x0,x1),x2),add(multiply(x0,x2),multiply(x1,x2)))
% 3.28/1.20 === Backtracking. Learning clause 42:5:4:[26.2,9.4]:TopTopTopTop: less_or_equal(add(multiply(x0,x1),multiply(x2,x1)),x3),defined(x0),defined(x2),defined(x1) -> less_or_equal(multiply(add(x0,x2),x1),x3)
% 3.28/1.20 === Clause set with instances from active satisfied. Growing active. New size: 69
% 3.28/1.20 === Restarting.
% 3.28/1.20 === Backtracking. Learning clause 43:4:4:[26.1,19.3]:TopTopTopTop: equalish(add(x0,x1),x2),defined(x1),less_or_equal(x0,x3) -> less_or_equal(x2,add(x3,x1))
% 3.28/1.20 === Backtracking. Learning clause 44:7:4:[18.4,42.1]:TopTopTopTop: defined(x0),defined(add(multiply(x1,x2),multiply(x3,x2))),defined(x1),defined(x3),defined(x2) -> less_or_equal(x0,add(multiply(x1,x2),multiply(x3,x2))),less_or_equal(multiply(add(x1,x3),x2),x0)
% 3.28/1.20 === Conflict found: 32:2:1:[26.1,30.1]:Top: equalish(a,x0) -> less_or_equal(x0,b) {x0 -> add(multiply(additive_identity,additive_identity),multiply(additive_identity,additive_identity))}
% 3.28/1.20 === Backtracking. Learning clause 45:5:3:[32.2,42.1]:TopTopTop: equalish(a,add(multiply(x0,x1),multiply(x2,x1))),defined(x0),defined(x2),defined(x1) -> less_or_equal(multiply(add(x0,x2),x1),b)
% 3.28/1.20 === Conflict found: 40:5:4:[22.1,9.4,23.1,22.2]:TopTopTopTop: defined(x0),defined(x1),defined(x2),equalish(x3,add(multiply(x0,x2),multiply(x1,x2))) -> equalish(multiply(add(x0,x1),x2),x3) {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> multiply(multiplicative_identity,add(multiply(additive_identity,additive_identity),multiply(additive_identity,additive_identity)))}
% 3.28/1.20 === Backtracking. Learning clause 46:5:3:[40.4,6.2]:TopTopTop: defined(x0),defined(x1),defined(x2),defined(add(multiply(x0,x2),multiply(x1,x2))) -> equalish(multiply(add(x0,x1),x2),multiply(multiplicative_identity,add(multiply(x0,x2),multiply(x1,x2))))
% 3.28/1.20 === Clause set with instances from active satisfied. Growing active. New size: 79
% 3.28/1.20 === Restarting.
% 3.28/1.20 === Backtracking. Learning clause 47:3:3:[23.2,22.2]:TopTopTop: equalish(x0,x1),equalish(x2,x1) -> equalish(x0,x2)
% 3.28/1.20 === Conflict found: 43:4:4:[26.1,19.3]:TopTopTopTop: equalish(add(x0,x1),x2),defined(x1),less_or_equal(x0,x3) -> less_or_equal(x2,add(x3,x1)) {x0 -> additive_identity, x1 -> additive_inverse(a), x2 -> additive_identity, x3 -> b}
% 3.28/1.20 === Backtracking. Learning clause 48:3:1:[43.4,31.1]:Top: equalish(add(x0,additive_inverse(a)),additive_identity),defined(additive_inverse(a)),less_or_equal(x0,b) ->
% 3.28/1.20 === Conflict found: 47:3:3:[23.2,22.2]:TopTopTop: equalish(x0,x1),equalish(x2,x1) -> equalish(x0,x2) {x0 -> add(additive_identity,add(additive_identity,additive_identity)), x1 -> add(add(additive_identity,additive_identity),additive_identity), x2 -> additive_identity}
% 3.28/1.20 === Backtracking. Learning clause 49:5:4:[47.1,1.4,22.1]:TopTopTopTop: equalish(x0,add(add(x1,x2),x3)),defined(x1),defined(x2),defined(x3) -> equalish(x0,add(x1,add(x2,x3)))
% 3.28/1.20 === Backtracking. Learning clause 50:8:6:[26.2,41.4,17.1,16.1,26.3]:TopTopTopTopTopTop: defined(x0),defined(x1),defined(x2),less_or_equal(x3,x4),less_or_equal(x4,add(multiply(x0,x2),multiply(x1,x2))),less_or_equal(x5,x3),equalish(x5,multiply(add(x0,x1),x2)) -> equalish(add(multiply(x0,x2),multiply(x1,x2)),x4)
% 3.28/1.20 === Backtracking. Learning clause 51:5:4:[23.2,41.4]:TopTopTopTop: equalish(x0,multiply(add(x1,x2),x3)),defined(x1),defined(x2),defined(x3) -> equalish(x0,add(multiply(x1,x3),multiply(x2,x3)))
% 3.28/1.20 === Conflict found: 43:4:4:[26.1,19.3]:TopTopTopTop: equalish(add(x0,x1),x2),defined(x1),less_or_equal(x0,x3) -> less_or_equal(x2,add(x3,x1)) {x0 -> multiply(additive_identity,additive_identity), x1 -> multiply(additive_identity,additive_identity), x2 -> multiply(add(additive_identity,additive_identity),additive_identity), x3 -> additive_identity}
% 3.28/1.20 === Backtracking. Learning clause 53:5:4:[13.2,52.0,43.1,9.4]:TopTopTopTop: less_or_equal(multiply(x0,x1),x2),defined(x0),defined(x3),defined(x1) -> less_or_equal(multiply(add(x0,x3),x1),add(x2,multiply(x3,x1)))
% 3.28/1.20 === Conflict found: 47:3:3:[23.2,22.2]:TopTopTop: equalish(x0,x1),equalish(x2,x1) -> equalish(x0,x2) {x0 -> multiply(add(additive_identity,additive_identity),additive_identity), x1 -> add(multiply(additive_identity,additive_identity),multiply(additive_identity,additive_identity)), x2 -> add(additive_identity,add(multiply(additive_identity,additive_identity),multiply(additive_identity,additive_identity)))}
% 3.28/1.20 === Backtracking. Learning clause 54:3:2:[47.2,2.2]:TopTop: equalish(x0,x1),defined(x1) -> equalish(x0,add(additive_identity,x1))
% 3.28/1.20 === Clause set with instances from active satisfied. Growing active. New size: 121
% 3.28/1.20 === Restarting.
% 3.28/1.20 === Conflict found: 48:3:1:[43.4,31.1]:Top: equalish(add(x0,additive_inverse(a)),additive_identity),defined(additive_inverse(a)),less_or_equal(x0,b) -> {x0 -> a}
% 3.28/1.20
% 3.28/1.20 SZS status Unsatisfiable
% 3.28/1.20
% 3.28/1.20 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.20
% 3.28/1.20 SPASS-SCL-FOL Statistics:
% 3.28/1.20 Number of learned clauses: 22
% 3.28/1.20 Number of propagations: 557
% 3.28/1.20 Number of decisions: 167
% 3.28/1.20 Number of resolutions: 32
% 3.28/1.20 Number of condensations: 0
% 3.28/1.20 Number of sub resolutions: 1
% 3.28/1.20 Number of input literals (deduplicated): 30
% 3.28/1.20 Number of grows: 3
% 3.28/1.20 Number of considered ground atoms: 121
% 3.28/1.20
% 3.28/1.20 Needed: 0:00:00.63
% 3.28/1.20
%------------------------------------------------------------------------------