%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD028-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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 3.07s 1.22s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD028-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n008.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:49:29 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.07/1.22 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22 Execution resolution_1 ended with status: unsatisfiable
% 3.07/1.22 Used heuristic: resolution_1
% 3.07/1.22
% 3.07/1.22 Input Clauses:
% 3.07/1.22
% 3.07/1.22 Predicates: sum defined product less_or_equal
% 3.07/1.22 Fol Constants: additive_identity multiplicative_identity a b u v
% 3.07/1.22 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 3.07/1.22 Problem Properties:
% 3.07/1.22 This is a full first-order problem without equality.
% 3.07/1.22
% 3.07/1.22 After reduction: Problem Properties:
% 3.07/1.22 This is a full first-order problem without equality.
% 3.07/1.22
% 3.07/1.22
% 3.07/1.22 Reduced Input Clauses:
% 3.07/1.22
% 3.07/1.22 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 3.07/1.22
% 3.07/1.22 === Starting SPASS-SCL-FOL A Little Less Naive, considering 55 atoms initially, heuristics mode: resolution_1 ===
% 3.07/1.22
% 3.07/1.22 === Backtracking. Learning clause 35:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 3.07/1.22 === Backtracking. Learning clause 37:2:0:[14.0,36.2,1.4,31.1,21.3,3.2]:: less_or_equal(additive_identity,a),less_or_equal(a,additive_identity) ->
% 3.07/1.22 === Backtracking. Learning clause 39:1:0:[27.0,38.0,18.3,31.1]:: -> defined(multiplicative_inverse(a))
% 3.07/1.22 === Backtracking. Learning clause 40:3:3:[7.3,32.1,10.2]:TopTopTop: product(x0,x1,u),product(x0,a,x2) -> product(x2,x1,b)
% 3.07/1.22 === Backtracking. Learning clause 41:3:0:[25.3,32.1]:: less_or_equal(additive_identity,a),less_or_equal(additive_identity,u) -> less_or_equal(additive_identity,b)
% 3.07/1.22 === Backtracking. Learning clause 42:3:3:[6.2,32.1]:TopTopTop: product(x0,a,x1),product(x1,u,x2) -> product(x0,b,x2)
% 3.07/1.22 === Backtracking. Learning clause 43:5:4:[24.2,19.3]:TopTopTopTop: less_or_equal(x0,x1),sum(x1,x2,x3),defined(x0),defined(x2) -> less_or_equal(add(x0,x2),x3)
% 3.07/1.22 === Backtracking. Learning clause 44:5:4:[24.3,19.3]:TopTopTopTop: less_or_equal(x0,x1),sum(x0,x2,x3),defined(x1),defined(x2) -> less_or_equal(x3,add(x1,x2))
% 3.07/1.22 === Backtracking. Learning clause 45:6:6:[11.3,20.3,5.1]:TopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,x4),product(x1,x3,x5),defined(x0),defined(x3) -> sum(x5,multiply(x0,x3),x4)
% 3.07/1.22 === Backtracking. Learning clause 46:8:8:[11.2,20.3,24.3]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x0,x3,x4),product(x1,x3,x5),defined(x2),defined(x3),less_or_equal(x6,x4),sum(x6,x5,x7) -> less_or_equal(x7,multiply(x2,x3))
% 3.07/1.22 === Backtracking. Learning clause 47:6:6:[11.2,20.3]:TopTopTopTopTopTop: sum(x0,x1,x2),product(x0,x3,x4),product(x1,x3,x5),defined(x2),defined(x3) -> sum(x4,x5,multiply(x2,x3))
% 3.07/1.22 === Clause set with instances from active satisfied. Growing active. New size: 80
% 3.07/1.22 === Restarting.
% 3.07/1.22 === Backtracking. Learning clause 48:2:1:[10.1,8.2]:Top: defined(x0) -> product(x0,multiplicative_identity,x0)
% 3.07/1.22 === Backtracking. Learning clause 49:3:3:[6.2,33.1]:TopTopTop: product(x0,a,x1),product(x1,v,x2) -> product(x0,b,x2)
% 3.07/1.22 === Conflict found: 40:3:3:[7.3,32.1,10.2]:TopTopTop: product(x0,x1,u),product(x0,a,x2) -> product(x2,x1,b) {x0 -> multiplicative_inverse(a), x1 -> additive_identity, x2 -> multiplicative_identity}
% 3.07/1.22 === Backtracking. Learning clause 52:2:1:[27.0,50.1,31.0,51.3,40.2,9.2]:Top: product(multiplicative_inverse(a),x0,u) -> product(multiplicative_identity,x0,b)
% 3.07/1.22 === Backtracking. Learning clause 53:9:8:[12.2,20.3,2.4,21.3]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x1,x3,x4),defined(x0),defined(x3),sum(x5,x4,x6),sum(additive_identity,x6,x7),less_or_equal(x5,multiply(x0,x3)),less_or_equal(multiply(x0,x3),x5) -> product(x2,x3,x7)
% 3.07/1.22 === Backtracking. Learning clause 54:6:6:[12.2,20.3,5.2]:TopTopTopTopTopTop: sum(x0,x1,x2),product(x1,x3,x4),defined(x0),defined(x3),sum(x4,multiply(x0,x3),x5) -> product(x2,x3,x5)
% 3.07/1.22 === Clause set with instances from active satisfied. Growing active. New size: 109
% 3.07/1.22 === Restarting.
% 3.07/1.22 === Conflict found: 42:3:3:[6.2,32.1]:TopTopTop: product(x0,a,x1),product(x1,u,x2) -> product(x0,b,x2) {x0 -> additive_identity, x1 -> multiplicative_identity, x2 -> u}
% 3.07/1.22 === Backtracking. Learning clause 56:4:1:[29.0,55.1,42.2,8.2,25.3]:Top: product(x0,a,multiplicative_identity),less_or_equal(additive_identity,x0),less_or_equal(additive_identity,b) -> less_or_equal(additive_identity,u)
% 3.07/1.22 === Backtracking. Learning clause 57:5:5:[6.2,32.1,11.2]:TopTopTopTopTop: product(x0,a,a),sum(x1,x2,x0),product(x1,b,x3),product(x2,b,x4) -> sum(x3,x4,b)
% 3.07/1.22 === Backtracking. Learning clause 58:2:1:[6.2,32.1]:Top: product(x0,a,a) -> product(x0,b,b)
% 3.07/1.22 === Backtracking. Learning clause 59:2:1:[5.1,4.2]:Top: defined(x0) -> sum(x0,additive_inverse(x0),additive_identity)
% 3.07/1.22 === Backtracking. Learning clause 60:5:4:[6.3,9.2]:TopTopTopTop: product(x0,x1,multiplicative_inverse(x2)),product(x1,x2,x3),defined(x2) -> product(x0,x3,multiplicative_identity),sum(additive_identity,x2,additive_identity)
% 3.07/1.22 === Conflict found: 49:3:3:[6.2,33.1]:TopTopTop: product(x0,a,x1),product(x1,v,x2) -> product(x0,b,x2) {x0 -> multiplicative_inverse(a), x1 -> additive_identity, x2 -> u}
% 3.07/1.22 === Backtracking. Learning clause 61:5:6:[49.3,7.3]:TopTopTopTopTopTop: product(x0,a,x1),product(x1,v,x2),product(x0,x3,x4),product(x3,x5,b) -> product(x4,x5,x2)
% 3.07/1.22 === Conflict found: 61:5:6:[49.3,7.3]:TopTopTopTopTopTop: product(x0,a,x1),product(x1,v,x2),product(x0,x3,x4),product(x3,x5,b) -> product(x4,x5,x2) {x0 -> multiplicative_inverse(a), x1 -> multiplicative_identity, x2 -> v, x3 -> a, x4 -> multiplicative_identity, x5 -> u}
% 3.07/1.22
% 3.07/1.22 SZS status Unsatisfiable
% 3.07/1.22
% 3.07/1.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.22
% 3.07/1.22 SPASS-SCL-FOL Statistics:
% 3.07/1.22 Number of learned clauses: 22
% 3.07/1.22 Number of propagations: 545
% 3.07/1.22 Number of decisions: 278
% 3.07/1.22 Number of resolutions: 39
% 3.07/1.22 Number of condensations: 0
% 3.07/1.22 Number of sub resolutions: 5
% 3.07/1.22 Number of input literals (deduplicated): 28
% 3.07/1.22 Number of grows: 2
% 3.07/1.22 Number of considered ground atoms: 109
% 3.07/1.22
% 3.07/1.22 Needed: 0:00:00.68
% 3.07/1.22
%------------------------------------------------------------------------------