%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD007-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 : n002.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 9.87s 2.92s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD007-3 : 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 : n002.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:17 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 9.87/2.92 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92 Execution resolution_2 ended with status: unsatisfiable
% 9.87/2.92 Used heuristic: resolution_2
% 9.87/2.92
% 9.87/2.92 Input Clauses:
% 9.87/2.92
% 9.87/2.92 Predicates: sum defined product less_or_equal
% 9.87/2.92 Fol Constants: additive_identity multiplicative_identity a
% 9.87/2.92 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 9.87/2.92 Problem Properties:
% 9.87/2.92 This is a full first-order problem without equality.
% 9.87/2.92
% 9.87/2.92 After reduction: Problem Properties:
% 9.87/2.92 This is a full first-order problem without equality.
% 9.87/2.92
% 9.87/2.92
% 9.87/2.92 Reduced Input Clauses:
% 9.87/2.92
% 9.87/2.92 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 9.87/2.92
% 9.87/2.92 === Starting SPASS-SCL-FOL A Little Less Naive, considering 56 atoms initially, heuristics mode: resolution_2 ===
% 9.87/2.92
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 56
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 29:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 9.87/2.92 === Backtracking. Learning clause 30:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 60
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 31:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 9.87/2.92 === Backtracking. Learning clause 32:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 9.87/2.92 === Backtracking. Learning clause 33:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 60
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 34: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) ->
% 9.87/2.92 === Backtracking. Learning clause 35:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 67
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 36:2:0:[18.1,27.1]:: -> defined(multiplicative_inverse(a)),sum(additive_identity,a,additive_identity)
% 9.87/2.92 === Backtracking. Learning clause 37:2:0:[9.1,27.1]:: -> product(multiplicative_inverse(a),a,multiplicative_identity),sum(additive_identity,a,additive_identity)
% 9.87/2.92 === Backtracking. Learning clause 38:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0)
% 9.87/2.92 === Conflict found: 31:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> a}
% 9.87/2.92 === Backtracking. Learning clause 39:2:0:[31.1,27.1]:: -> less_or_equal(a,multiplicative_identity),less_or_equal(multiplicative_identity,a)
% 9.87/2.92 === Backtracking. Learning clause 40:1:0:[8.1,27.1]:: -> product(multiplicative_identity,a,a)
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 131
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 137
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 41:7:8:[11.5,28.1,12.5]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,a),product(x0,x3,additive_identity),sum(x4,x5,x1),product(x4,x3,x6),product(x5,x3,x7),sum(x6,x7,additive_inverse(additive_inverse(a))) ->
% 9.87/2.92 === Backtracking. Learning clause 42:2:0:[21.3,28.1]:: less_or_equal(additive_inverse(additive_inverse(a)),a),less_or_equal(a,additive_inverse(additive_inverse(a))) ->
% 9.87/2.92 === Backtracking. Learning clause 43:7:9:[2.4,28.1,1.4,1.4]:TopTopTopTopTopTopTopTopTop: sum(x0,x1,additive_identity),sum(x1,x2,x3),sum(x2,x4,additive_inverse(additive_inverse(a))),sum(x3,x4,x5),sum(x0,x6,x7),sum(x6,x8,x5),sum(x7,x8,a) ->
% 9.87/2.92 === Backtracking. Learning clause 44:1:0:[5.2,28.1]:: sum(additive_inverse(additive_inverse(a)),additive_identity,a) ->
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 137
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Conflict found: 43:7:9:[2.4,28.1,1.4,1.4]:TopTopTopTopTopTopTopTopTop: sum(x0,x1,additive_identity),sum(x1,x2,x3),sum(x2,x4,additive_inverse(additive_inverse(a))),sum(x3,x4,x5),sum(x0,x6,x7),sum(x6,x8,x5),sum(x7,x8,a) -> {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> additive_identity, x4 -> additive_identity, x5 -> additive_identity, x6 -> additive_identity, x7 -> additive_identity, x8 -> additive_identity}
% 9.87/2.92 === Backtracking. Learning clause 45:2:0:[43.1,30.1]:: sum(additive_identity,additive_identity,additive_inverse(additive_inverse(a))),sum(additive_identity,additive_identity,a) ->
% 9.87/2.92 === Conflict found: 41:7:8:[11.5,28.1,12.5]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,a),product(x0,x3,additive_identity),sum(x4,x5,x1),product(x4,x3,x6),product(x5,x3,x7),sum(x6,x7,additive_inverse(additive_inverse(a))) -> {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> additive_identity, x4 -> additive_identity, x5 -> additive_identity, x6 -> additive_identity, x7 -> additive_identity}
% 9.87/2.92 === Backtracking. Learning clause 46:5:3:[41.1,30.1]:TopTopTop: product(additive_identity,x0,a),product(additive_identity,x0,additive_identity),product(additive_identity,x0,x1),product(additive_identity,x0,x2),sum(x1,x2,additive_inverse(additive_inverse(a))) ->
% 9.87/2.92 === Conflict found: 34: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) -> {x0 -> additive_identity, x1 -> additive_identity, x2 -> additive_identity, x3 -> additive_identity}
% 9.87/2.92 === Backtracking. Learning clause 47:2:1:[34.1,30.1]:Top: product(additive_identity,x0,multiplicative_identity),product(additive_identity,x0,additive_identity) ->
% 9.87/2.92 === Backtracking. Learning clause 48:2:0:[11.5,5.1,8.2,24.3,3.2,21.2,25.4,14.1,17.1,26.1]:: product(additive_identity,additive_identity,multiplicative_identity),less_or_equal(additive_identity,additive_identity) ->
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 140
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 49:3:2:[24.2,33.1]:TopTop: less_or_equal(additive_inverse(multiplicative_identity),x0),sum(x0,multiplicative_identity,x1) -> less_or_equal(additive_identity,x1)
% 9.87/2.92 === Backtracking. Learning clause 50:3:3:[1.1,33.1]:TopTopTop: sum(multiplicative_identity,x0,x1),sum(additive_identity,x0,x2) -> sum(additive_inverse(multiplicative_identity),x1,x2)
% 9.87/2.92 === Backtracking. Learning clause 51:1:0:[1.3,3.2,5.2,26.1,17.1,30.1]:: sum(multiplicative_identity,additive_identity,additive_identity) ->
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 143
% 9.87/2.92 === Restarting.
% 9.87/2.92 === Backtracking. Learning clause 52:3:3:[6.1,40.1]:TopTopTop: product(a,x0,x1),product(a,x0,x2) -> product(multiplicative_identity,x1,x2)
% 9.87/2.92 === Backtracking. Learning clause 53:1:0:[10.1,40.1]:: -> product(a,multiplicative_identity,a)
% 9.87/2.92 === Clause set with instances from active satisfied. Growing active. New size: 207
% 9.87/2.92
% 9.87/2.92 SZS status Unsatisfiable
% 9.87/2.92
% 9.87/2.92 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.87/2.92
% 9.87/2.92 SPASS-SCL-FOL Statistics:
% 9.87/2.92 Number of learned clauses: 25
% 9.87/2.92 Number of propagations: 988
% 9.87/2.92 Number of decisions: 174
% 9.87/2.92 Number of resolutions: 46
% 9.87/2.92 Number of condensations: 1
% 9.87/2.92 Number of sub resolutions: 0
% 9.87/2.92 Number of input literals (deduplicated): 22
% 9.87/2.92 Number of grows: 10
% 9.87/2.92 Number of considered ground atoms: 207
% 9.87/2.92
% 9.87/2.92 Needed: 0:00:02.38
% 9.87/2.92
%------------------------------------------------------------------------------