%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD006-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 : n005.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 2.85s 1.07s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD006-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n005.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:01 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.18/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.85/1.07 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07 Execution resolution_3 ended with status: unsatisfiable
% 2.85/1.07 Used heuristic: resolution_3
% 2.85/1.07
% 2.85/1.07 Input Clauses:
% 2.85/1.07
% 2.85/1.07 Predicates: equalish defined less_or_equal
% 2.85/1.07 Fol Constants: additive_identity multiplicative_identity
% 2.85/1.07 Fol Functions: add additive_inverse multiply multiplicative_inverse
% 2.85/1.07 Problem Properties:
% 2.85/1.07 This is a full first-order problem without equality.
% 2.85/1.07
% 2.85/1.07 After reduction: Problem Properties:
% 2.85/1.07 This is a full first-order problem without equality.
% 2.85/1.07
% 2.85/1.07
% 2.85/1.07 Reduced Input Clauses:
% 2.85/1.07
% 2.85/1.07 Most General Atoms: defined(x2) equalish(x0,x2) less_or_equal(x2,x1)
% 2.85/1.07
% 2.85/1.07 === Starting SPASS-SCL-FOL A Little Less Naive, considering 48 atoms initially, heuristics mode: resolution_3 ===
% 2.85/1.07
% 2.85/1.07 === Backtracking. Learning clause 29:1:0:[22.2,28.1]:: equalish(additive_identity,additive_inverse(additive_identity)) ->
% 2.85/1.07 === Backtracking. Learning clause 30:2:1:[22.1,2.2]:Top: defined(x0) -> equalish(x0,add(additive_identity,x0))
% 2.85/1.07 === Backtracking. Learning clause 31:2:1:[22.1,6.2]:Top: defined(x0) -> equalish(x0,multiply(multiplicative_identity,x0))
% 2.85/1.07 === Backtracking. Learning clause 32:2:1:[22.1,3.2]:Top: defined(x0) -> equalish(additive_identity,add(x0,additive_inverse(x0)))
% 2.85/1.07 === Backtracking. Learning clause 33: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)
% 2.85/1.07 === Backtracking. Learning clause 34: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))
% 2.85/1.07 === Backtracking. Learning clause 35: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)
% 2.85/1.07 === Backtracking. Learning clause 36: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))
% 2.85/1.07 === Backtracking. Learning clause 37: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)
% 2.85/1.07 === Backtracking. Learning clause 38: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)))
% 2.85/1.07 === Backtracking. Learning clause 39: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)
% 2.85/1.07 === Clause set with instances from active satisfied. Growing active. New size: 63
% 2.85/1.07 === Restarting.
% 2.85/1.07 === Backtracking. Learning clause 40:7:4:[18.4,39.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)
% 2.85/1.07 === Conflict found: 37: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))}
% 2.85/1.07 === Backtracking. Learning clause 42:5:4:[13.2,41.3,37.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)))
% 2.85/1.07 === Backtracking. Learning clause 44:5:4:[13.2,43.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)))
% 2.85/1.07 === Conflict found: 37: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)))}
% 2.85/1.07 === Backtracking. Learning clause 45:5:3:[37.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))))
% 2.85/1.07 === Conflict found: 37: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)))}
% 2.85/1.07 === Backtracking. Learning clause 46:5:3:[37.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))))
% 2.85/1.07 === Clause set with instances from active satisfied. Growing active. New size: 78
% 2.85/1.07 === Restarting.
% 2.85/1.07 === Backtracking. Learning clause 47:5:4:[22.1,42.5]:TopTopTopTop: defined(x0),defined(x1),defined(x2),equalish(x3,multiply(x0,x2)) -> equalish(add(x3,multiply(x1,x2)),multiply(add(x0,x1),x2))
% 2.85/1.07 === Backtracking. Learning clause 48:7:4:[17.2,44.5,20.3]:TopTopTopTop: less_or_equal(multiply(x0,x1),x2),defined(x0),defined(x3),defined(x1),less_or_equal(additive_identity,add(x0,x3)),less_or_equal(additive_identity,x1) -> less_or_equal(additive_identity,add(x2,multiply(x3,x1)))
% 2.85/1.07 === Backtracking. Learning clause 49:3:2:[26.1,18.3]:TopTop: equalish(x0,x1),defined(x0) -> less_or_equal(x1,x0)
% 2.85/1.07 === Clause set with instances from active satisfied. Growing active. New size: 82
% 2.85/1.07 === Restarting.
% 2.85/1.07 === Conflict found: 48:7:4:[17.2,44.5,20.3]:TopTopTopTop: less_or_equal(multiply(x0,x1),x2),defined(x0),defined(x3),defined(x1),less_or_equal(additive_identity,add(x0,x3)),less_or_equal(additive_identity,x1) -> less_or_equal(additive_identity,add(x2,multiply(x3,x1))) {x0 -> add(additive_identity,additive_identity), x1 -> additive_identity, x2 -> add(additive_identity,multiply(additive_identity,additive_identity)), x3 -> additive_identity}
% 2.85/1.07 === Backtracking. Learning clause 51:8:5:[10.2,50.0,48.1,44.5]:TopTopTopTopTop: defined(x0),less_or_equal(additive_identity,add(add(x1,x2),x0)),less_or_equal(additive_identity,x3),less_or_equal(multiply(x1,x3),x4),defined(x1),defined(x2),defined(x3) -> less_or_equal(additive_identity,add(add(x4,multiply(x2,x3)),multiply(x0,x3)))
% 2.85/1.07 === Clause set with instances from active satisfied. Growing active. New size: 84
% 2.85/1.07 === Restarting.
% 2.85/1.07 === Clause set with instances from active satisfied. Growing active. New size: 148
% 2.85/1.07
% 2.85/1.07 SZS status Unsatisfiable
% 2.85/1.07
% 2.85/1.07 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.07
% 2.85/1.07 SPASS-SCL-FOL Statistics:
% 2.85/1.07 Number of learned clauses: 20
% 2.85/1.07 Number of propagations: 691
% 2.85/1.07 Number of decisions: 169
% 2.85/1.07 Number of resolutions: 29
% 2.85/1.07 Number of condensations: 0
% 2.85/1.07 Number of sub resolutions: 3
% 2.85/1.07 Number of input literals (deduplicated): 27
% 2.85/1.07 Number of grows: 5
% 2.85/1.07 Number of considered ground atoms: 148
% 2.85/1.07
% 2.85/1.07 Needed: 0:00:00.50
% 2.85/1.07
%------------------------------------------------------------------------------