%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD030-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 : n028.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 8.69s 2.29s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD030-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.33 % Computer : n028.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Thu May 7 11:49:31 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.33 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 8.69/2.29 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29 Execution resolution_2 ended with status: unsatisfiable
% 8.69/2.29 Used heuristic: resolution_2
% 8.69/2.29
% 8.69/2.29 Input Clauses:
% 8.69/2.29
% 8.69/2.29 Predicates: sum defined product less_or_equal
% 8.69/2.29 Fol Constants: additive_identity multiplicative_identity a b d
% 8.69/2.29 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 8.69/2.29 Problem Properties:
% 8.69/2.29 This is a full first-order problem without equality.
% 8.69/2.29
% 8.69/2.29 After reduction: Problem Properties:
% 8.69/2.29 This is a full first-order problem without equality.
% 8.69/2.29
% 8.69/2.29
% 8.69/2.29 Reduced Input Clauses:
% 8.69/2.29
% 8.69/2.29 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 8.69/2.29
% 8.69/2.29 === Starting SPASS-SCL-FOL A Little Less Naive, considering 42 atoms initially, heuristics mode: resolution_2 ===
% 8.69/2.29
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 42
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 32:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 33:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 47
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 34:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 8.69/2.29 === Backtracking. Learning clause 35:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 36:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 47
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 37: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) ->
% 8.69/2.29 === Backtracking. Learning clause 38:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 56
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 39:2:0:[18.1,27.1]:: -> defined(multiplicative_inverse(a)),sum(additive_identity,a,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 40:2:0:[9.1,27.1]:: -> product(multiplicative_inverse(a),a,multiplicative_identity),sum(additive_identity,a,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 41:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0)
% 8.69/2.29 === Conflict found: 34:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> a}
% 8.69/2.29 === Backtracking. Learning clause 42:2:0:[34.1,27.1]:: -> less_or_equal(a,multiplicative_identity),less_or_equal(multiplicative_identity,a)
% 8.69/2.29 === Backtracking. Learning clause 43:1:0:[8.1,27.1]:: -> product(multiplicative_identity,a,a)
% 8.69/2.29 === Backtracking. Learning clause 44:4:2:[25.4,38.1]:TopTop: less_or_equal(additive_identity,x0),less_or_equal(additive_identity,x1),product(x0,x1,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 120
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 129
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 45:2:0:[18.1,28.1]:: -> defined(multiplicative_inverse(b)),sum(additive_identity,b,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 46:2:0:[9.1,28.1]:: -> product(multiplicative_inverse(b),b,multiplicative_identity),sum(additive_identity,b,additive_identity)
% 8.69/2.29 === Conflict found: 34:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> b}
% 8.69/2.29 === Backtracking. Learning clause 47:2:0:[34.1,28.1]:: -> less_or_equal(b,multiplicative_identity),less_or_equal(multiplicative_identity,b)
% 8.69/2.29 === Backtracking. Learning clause 48:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0)
% 8.69/2.29 === Conflict found: 41:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> b}
% 8.69/2.29 === Backtracking. Learning clause 49:2:0:[41.1,28.1]:: -> less_or_equal(b,a),less_or_equal(a,b)
% 8.69/2.29 === Backtracking. Learning clause 50:1:0:[15.1,28.1]:: -> defined(additive_inverse(b))
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 140
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 51:2:0:[18.1,29.1]:: -> defined(multiplicative_inverse(d)),sum(additive_identity,d,additive_identity)
% 8.69/2.29 === Backtracking. Learning clause 52:2:0:[9.1,29.1]:: -> product(multiplicative_inverse(d),d,multiplicative_identity),sum(additive_identity,d,additive_identity)
% 8.69/2.29 === Conflict found: 34:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> d}
% 8.69/2.29 === Backtracking. Learning clause 53:2:0:[34.1,29.1]:: -> less_or_equal(d,multiplicative_identity),less_or_equal(multiplicative_identity,d)
% 8.69/2.29 === Conflict found: 41:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> d}
% 8.69/2.29 === Backtracking. Learning clause 54:2:0:[41.1,29.1]:: -> less_or_equal(d,a),less_or_equal(a,d)
% 8.69/2.29 === Backtracking. Learning clause 55:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,d),less_or_equal(d,x0)
% 8.69/2.29 === Conflict found: 48:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> d}
% 8.69/2.29 === Backtracking. Learning clause 56:2:0:[48.1,29.1]:: -> less_or_equal(d,b),less_or_equal(b,d)
% 8.69/2.29 === Backtracking. Learning clause 57:2:1:[20.1,29.1]:Top: defined(x0) -> product(d,x0,multiply(d,x0))
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 146
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 58:3:0:[25.3,30.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(additive_identity,a) -> less_or_equal(additive_identity,d)
% 8.69/2.29 === Backtracking. Learning clause 59:3:3:[6.1,30.1]:TopTopTop: product(a,x0,x1),product(d,x0,x2) -> product(multiplicative_identity,x1,x2)
% 8.69/2.29 === Backtracking. Learning clause 60:1:0:[10.1,30.1]:: -> product(a,multiplicative_identity,d)
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 150
% 8.69/2.29 === Restarting.
% 8.69/2.29 === Backtracking. Learning clause 61:4:4:[12.5,31.1]:TopTopTopTop: sum(x0,x1,d),product(x0,b,x2),product(x1,b,x3),sum(x2,x3,multiply(a,b)) ->
% 8.69/2.29 === Backtracking. Learning clause 62:5:6:[7.4,31.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,multiply(a,b)),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) ->
% 8.69/2.29 === Backtracking. Learning clause 63:1:0:[10.2,31.1]:: product(b,d,multiply(a,b)) ->
% 8.69/2.29 === Clause set with instances from active satisfied. Growing active. New size: 214
% 8.69/2.29 === Conflict found: 62:5:6:[7.4,31.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,multiply(a,b)),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) -> {x0 -> a, x1 -> multiplicative_identity, x2 -> b, x3 -> multiplicative_identity, x4 -> multiplicative_identity, x5 -> b}
% 8.69/2.29
% 8.69/2.29 SZS status Unsatisfiable
% 8.69/2.29
% 8.69/2.29 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.29
% 8.69/2.29 SPASS-SCL-FOL Statistics:
% 8.69/2.29 Number of learned clauses: 32
% 8.69/2.29 Number of propagations: 840
% 8.69/2.29 Number of decisions: 200
% 8.69/2.29 Number of resolutions: 40
% 8.69/2.29 Number of condensations: 0
% 8.69/2.29 Number of sub resolutions: 0
% 8.69/2.29 Number of input literals (deduplicated): 25
% 8.69/2.29 Number of grows: 10
% 8.69/2.29 Number of considered ground atoms: 214
% 8.69/2.29
% 8.69/2.29 Needed: 0:00:01.74
% 8.69/2.29
%------------------------------------------------------------------------------