%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD009-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 : n007.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:20 PM UTC 2026
% Result : Unsatisfiable 56.76s 11.86s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD009-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 : n007.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:48:25 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 56.76/11.86 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86 Execution resolution_2 ended with status: unsatisfiable
% 56.76/11.86 Used heuristic: resolution_2
% 56.76/11.86
% 56.76/11.86 Input Clauses:
% 56.76/11.86
% 56.76/11.86 Predicates: sum defined product less_or_equal
% 56.76/11.86 Fol Constants: additive_identity multiplicative_identity a b
% 56.76/11.86 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 56.76/11.86 Problem Properties:
% 56.76/11.86 This is a full first-order problem without equality.
% 56.76/11.86
% 56.76/11.86 After reduction: Problem Properties:
% 56.76/11.86 This is a full first-order problem without equality.
% 56.76/11.86
% 56.76/11.86
% 56.76/11.86 Reduced Input Clauses:
% 56.76/11.86
% 56.76/11.86 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 56.76/11.86
% 56.76/11.86 === Starting SPASS-SCL-FOL A Little Less Naive, considering 60 atoms initially, heuristics mode: resolution_2 ===
% 56.76/11.86
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 60
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 31:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 56.76/11.86 === Backtracking. Learning clause 32:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 64
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 33:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 56.76/11.86 === Backtracking. Learning clause 34:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 56.76/11.86 === Backtracking. Learning clause 35:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 64
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 36:4:4:[11.5,26.1]:TopTopTopTop: sum(x0,x1,x2),product(x2,x3,multiplicative_identity),product(x0,x3,additive_identity),product(x1,x3,additive_identity) ->
% 56.76/11.86 === Backtracking. Learning clause 37:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 71
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 39:1:0:[29.0,38.1,18.1,27.1]:: -> defined(multiplicative_inverse(a))
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 135
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 141
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 40:2:0:[18.1,28.1]:: -> defined(multiplicative_inverse(b)),sum(additive_identity,b,additive_identity)
% 56.76/11.86 === Backtracking. Learning clause 41:2:0:[9.1,28.1]:: -> product(multiplicative_inverse(b),b,multiplicative_identity),sum(additive_identity,b,additive_identity)
% 56.76/11.86 === Backtracking. Learning clause 42:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0)
% 56.76/11.86 === Conflict found: 33:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> b}
% 56.76/11.86 === Backtracking. Learning clause 43:2:0:[33.1,28.1]:: -> less_or_equal(b,multiplicative_identity),less_or_equal(multiplicative_identity,b)
% 56.76/11.86 === Backtracking. Learning clause 44:1:0:[8.1,28.1]:: -> product(multiplicative_identity,b,b)
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 142
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 45:7:8:[11.5,29.1,12.5]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,additive_identity),product(x0,x3,additive_identity),sum(x4,x5,x1),product(x4,x3,x6),product(x5,x3,x7),sum(x6,x7,a) ->
% 56.76/11.86 === Backtracking. Learning clause 46:3:3:[1.4,29.1]:TopTopTop: sum(additive_identity,x0,x1),sum(x0,x2,a),sum(x1,x2,additive_identity) ->
% 56.76/11.86 === Backtracking. Learning clause 47:1:0:[5.2,29.1]:: sum(a,additive_identity,additive_identity) ->
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 144
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 48:4:5:[12.5,30.1]:TopTopTopTopTop: sum(x0,x1,a),product(x0,x2,x3),product(x1,x2,x4),sum(x3,x4,b) ->
% 56.76/11.86 === Backtracking. Learning clause 49:4:4:[11.5,29.1]:TopTopTopTop: sum(x0,x1,x2),product(x2,x3,additive_identity),product(x0,x3,additive_identity),product(x1,x3,a) ->
% 56.76/11.86 === Backtracking. Learning clause 50:3:4:[7.4,30.1]:TopTopTopTop: product(x0,x1,a),product(x1,x2,x3),product(x0,x3,b) ->
% 56.76/11.86 === Backtracking. Learning clause 51:1:1:[10.2,30.1]:Top: product(x0,a,b) ->
% 56.76/11.86 === Conflict found: 46:3:3:[1.4,29.1]:TopTopTop: sum(additive_identity,x0,x1),sum(x0,x2,a),sum(x1,x2,additive_identity) -> {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity}
% 56.76/11.86 === Backtracking. Learning clause 52:1:0:[46.1,32.1]:: sum(additive_identity,additive_identity,a) ->
% 56.76/11.86 === Backtracking. Learning clause 54:2:1:[17.0,53.1,11.1,3.2,8.2,14.1]:Top: product(additive_identity,additive_identity,x0) -> sum(x0,additive_identity,additive_identity)
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 151
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 55:6:7:[12.5,36.3]:TopTopTopTopTopTopTop: sum(x0,x1,x2),product(x0,x3,x4),product(x1,x3,x5),sum(x4,x5,additive_identity),sum(x2,x2,x6),product(x6,x3,multiplicative_identity) ->
% 56.76/11.86 === Backtracking. Learning clause 56:5:4:[8.1,14.1,55.2]:TopTopTopTop: sum(multiplicative_identity,x0,x1),product(x0,additive_identity,x2),sum(additive_identity,x2,additive_identity),sum(x1,x1,x3),product(x3,additive_identity,multiplicative_identity) ->
% 56.76/11.86 === Backtracking. Learning clause 57:1:0:[3.1,17.1,1.3,26.1,5.2,32.1]:: sum(multiplicative_identity,additive_identity,additive_identity) ->
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 215
% 56.76/11.86 === Backtracking. Learning clause 58:7:10:[7.4,11.4]:TopTopTopTopTopTopTopTopTopTop: product(x0,x1,x2),product(x1,x3,x4),product(x0,x4,x5),sum(x6,x2,x7),product(x7,x3,x8),product(x6,x3,x9) -> sum(x9,x5,x8)
% 56.76/11.86 === Backtracking. Learning clause 59:5:7:[12.2,10.2]:TopTopTopTopTopTopTop: sum(x0,x1,x2),product(x1,x3,x4),sum(x5,x4,x6),product(x3,x0,x5) -> product(x2,x3,x6)
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 224
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 60:2:0:[18.1,39.1]:: -> defined(multiplicative_inverse(multiplicative_inverse(a))),sum(additive_identity,multiplicative_inverse(a),additive_identity)
% 56.76/11.86 === Backtracking. Learning clause 61:2:0:[9.1,39.1]:: -> product(multiplicative_inverse(multiplicative_inverse(a)),multiplicative_inverse(a),multiplicative_identity),sum(additive_identity,multiplicative_inverse(a),additive_identity)
% 56.76/11.86 === Conflict found: 33:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> multiplicative_inverse(a)}
% 56.76/11.86 === Backtracking. Learning clause 62:2:0:[33.1,39.1]:: -> less_or_equal(multiplicative_inverse(a),multiplicative_identity),less_or_equal(multiplicative_identity,multiplicative_inverse(a))
% 56.76/11.86 === Backtracking. Learning clause 63:3:1:[23.2,39.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_inverse(a)),less_or_equal(multiplicative_inverse(a),x0)
% 56.76/11.86 === Conflict found: 42:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> multiplicative_inverse(a)}
% 56.76/11.86 === Backtracking. Learning clause 64:2:0:[42.1,39.1]:: -> less_or_equal(multiplicative_inverse(a),b),less_or_equal(b,multiplicative_inverse(a))
% 56.76/11.86 === Backtracking. Learning clause 65:2:1:[20.1,39.1]:Top: defined(x0) -> product(multiplicative_inverse(a),x0,multiply(multiplicative_inverse(a),x0))
% 56.76/11.86 === Backtracking. Learning clause 66:1:0:[15.1,39.1]:: -> defined(additive_inverse(multiplicative_inverse(a)))
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 231
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 67:4:4:[11.1,32.1]:TopTopTopTop: product(additive_identity,x0,x1),product(additive_identity,x0,x2),product(additive_identity,x0,x3) -> sum(x2,x3,x1)
% 56.76/11.86 === Backtracking. Learning clause 68:1:0:[10.2,49.2,8.2,14.1,32.1]:: product(additive_identity,multiplicative_identity,a) ->
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 231
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Conflict found: 54:2:1:[17.0,53.1,11.1,3.2,8.2,14.1]:Top: product(additive_identity,additive_identity,x0) -> sum(x0,additive_identity,additive_identity) {x0 -> a}
% 56.76/11.86 === Backtracking. Learning clause 69:1:0:[54.2,47.1]:: product(additive_identity,additive_identity,a) ->
% 56.76/11.86 === Clause set with instances from active satisfied. Growing active. New size: 232
% 56.76/11.86 === Restarting.
% 56.76/11.86 === Backtracking. Learning clause 70:3:4:[6.4,30.1,10.2]:TopTopTopTop: product(x0,x1,x2),product(x3,x1,b),product(x0,a,x3) ->
% 56.76/11.86 === Conflict found: 70:3:4:[6.4,30.1,10.2]:TopTopTopTop: product(x0,x1,x2),product(x3,x1,b),product(x0,a,x3) -> {x0 -> multiplicative_inverse(a), x1 -> b, x2 -> multiply(multiplicative_inverse(a),b), x3 -> multiplicative_identity}
% 56.76/11.86
% 56.76/11.86 SZS status Unsatisfiable
% 56.76/11.86
% 56.76/11.86 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.76/11.86
% 56.76/11.86 SPASS-SCL-FOL Statistics:
% 56.76/11.86 Number of learned clauses: 38
% 56.76/11.86 Number of propagations: 2137
% 56.76/11.86 Number of decisions: 304
% 56.76/11.86 Number of resolutions: 56
% 56.76/11.86 Number of condensations: 0
% 56.76/11.86 Number of sub resolutions: 2
% 56.76/11.86 Number of input literals (deduplicated): 24
% 56.76/11.86 Number of grows: 14
% 56.76/11.86 Number of considered ground atoms: 232
% 56.76/11.86
% 56.76/11.86 Needed: 0:0:11.33
% 56.76/11.86
%------------------------------------------------------------------------------