%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD030-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 : n019.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:23 PM UTC 2026
% Result : Unsatisfiable 0.39s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD030-2 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n019.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:49:30 EDT 2026
% 0.16/0.35 % CPUTime :
% 0.16/0.35 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.39/0.91 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91 Execution resolution_3 ended with status: unsatisfiable
% 0.39/0.91 Used heuristic: resolution_3
% 0.39/0.91
% 0.39/0.91 Input Clauses:
% 0.39/0.91
% 0.39/0.91 Predicates: equalish defined less_or_equal
% 0.39/0.91 Fol Constants: additive_identity multiplicative_identity a b c d
% 0.39/0.91 Fol Functions: add additive_inverse multiply multiplicative_inverse
% 0.39/0.91 Problem Properties:
% 0.39/0.91 This is a full first-order problem without equality.
% 0.39/0.91
% 0.39/0.91 After reduction: Problem Properties:
% 0.39/0.91 This is a full first-order problem without equality.
% 0.39/0.91
% 0.39/0.91
% 0.39/0.91 Reduced Input Clauses:
% 0.39/0.91
% 0.39/0.91 Most General Atoms: defined(x2) equalish(x0,x2) less_or_equal(x2,x1)
% 0.39/0.91
% 0.39/0.91 === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_3 ===
% 0.39/0.91
% 0.39/0.91 === Backtracking. Learning clause 35:2:1:[22.1,2.2]:Top: defined(x0) -> equalish(x0,add(additive_identity,x0))
% 0.39/0.91 === Backtracking. Learning clause 36:2:1:[22.1,6.2]:Top: defined(x0) -> equalish(x0,multiply(multiplicative_identity,x0))
% 0.39/0.91 === Backtracking. Learning clause 37:1:0:[22.1,32.1]:: -> equalish(c,multiply(a,b))
% 0.39/0.91 === Backtracking. Learning clause 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0)
% 0.39/0.91 === Backtracking. Learning clause 39:2:1:[22.1,3.2]:Top: defined(x0) -> equalish(additive_identity,add(x0,additive_inverse(x0)))
% 0.39/0.91 === Backtracking. Learning clause 40: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)
% 0.39/0.91 === Backtracking. Learning clause 41: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))
% 0.39/0.91 === Backtracking. Learning clause 42: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)
% 0.39/0.91 === Backtracking. Learning clause 43: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))
% 0.39/0.91 === Backtracking. Learning clause 44: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)
% 0.39/0.91 === Backtracking. Learning clause 45: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)))
% 0.39/0.91 === Backtracking. Learning clause 46: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)
% 0.39/0.91 === Clause set with instances from active satisfied. Growing active. New size: 86
% 0.39/0.91 === Restarting.
% 0.39/0.91 === Backtracking. Learning clause 47:2:1:[23.2,33.1]:Top: equalish(x0,a) -> equalish(x0,d)
% 0.39/0.91 === Conflict found: 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0) {x0 -> c}
% 0.39/0.91 === Backtracking. Learning clause 48:1:0:[38.1,37.1]:: -> equalish(c,c)
% 0.39/0.91 === Backtracking. Learning clause 49:1:0:[22.2,34.1]:: equalish(c,multiply(d,b)) ->
% 0.39/0.91 === Conflict found: 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0) {x0 -> multiply(additive_identity,b)}
% 0.39/0.91 === Backtracking. Learning clause 51:2:1:[29.0,50.0,38.1,25.3]:Top: equalish(x0,a) -> equalish(c,multiply(x0,b))
% 0.39/0.91 === Conflict found: 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0) {x0 -> multiply(b,a)}
% 0.39/0.91 === Backtracking. Learning clause 54:1:0:[29.0,52.0,28.0,53.1,38.1,8.3]:: -> equalish(c,multiply(b,a))
% 0.39/0.91 === Conflict found: 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0) {x0 -> add(additive_identity,multiply(a,b))}
% 0.39/0.91 === Backtracking. Learning clause 55:2:0:[38.1,2.2]:: defined(multiply(a,b)) -> equalish(c,add(additive_identity,multiply(a,b)))
% 0.39/0.91 === Conflict found: 38:2:1:[23.2,22.2,37.1]:Top: equalish(x0,multiply(a,b)) -> equalish(c,x0) {x0 -> multiply(multiplicative_identity,multiply(a,b))}
% 0.39/0.91 === Backtracking. Learning clause 56:2:0:[38.1,6.2]:: defined(multiply(a,b)) -> equalish(c,multiply(multiplicative_identity,multiply(a,b)))
% 0.39/0.91 === Backtracking. Learning clause 57:7:4:[18.4,46.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)
% 0.39/0.91 === Conflict found: 44: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 -> add(additive_identity,multiply(additive_identity,additive_identity))}
% 0.39/0.91 === Backtracking. Learning clause 59:5:4:[13.2,58.3,44.4,24.3]:TopTopTopTop: defined(x0),defined(x1),defined(x2),equalish(x3,multiply(x0,x2)) -> equalish(multiply(add(x0,x1),x2),add(x3,multiply(x1,x2)))
% 0.39/0.91 === Backtracking. Learning clause 61:5:4:[13.2,60.0,26.1,19.3,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)))
% 0.39/0.91 === Conflict found: 44: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 -> add(additive_identity,add(multiply(additive_identity,additive_identity),multiply(additive_identity,additive_identity)))}
% 0.39/0.91 === Backtracking. Learning clause 62:5:3:[44.4,2.2]:TopTopTop: defined(x0),defined(x1),defined(x2),defined(add(multiply(x0,x2),multiply(x1,x2))) -> equalish(multiply(add(x0,x1),x2),add(additive_identity,add(multiply(x0,x2),multiply(x1,x2))))
% 0.39/0.91 === Conflict found: 44: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)))}
% 0.39/0.91 === Backtracking. Learning clause 63:5:3:[44.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))))
% 0.39/0.91 === Clause set with instances from active satisfied. Growing active. New size: 108
% 0.39/0.91 === Restarting.
% 0.39/0.91 === Conflict found: 51:2:1:[29.0,50.0,38.1,25.3]:Top: equalish(x0,a) -> equalish(c,multiply(x0,b)) {x0 -> d}
% 0.39/0.91
% 0.39/0.91 SZS status Unsatisfiable
% 0.39/0.91
% 0.39/0.91 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.91
% 0.39/0.91 SPASS-SCL-FOL Statistics:
% 0.39/0.91 Number of learned clauses: 24
% 0.39/0.91 Number of propagations: 616
% 0.39/0.91 Number of decisions: 167
% 0.39/0.91 Number of resolutions: 31
% 0.39/0.91 Number of condensations: 0
% 0.39/0.91 Number of sub resolutions: 5
% 0.39/0.91 Number of input literals (deduplicated): 33
% 0.39/0.91 Number of grows: 2
% 0.39/0.91 Number of considered ground atoms: 108
% 0.39/0.91
% 0.39/0.91 Needed: 0:00:00.35
% 0.39/0.91
%------------------------------------------------------------------------------