%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD025-4 : 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 : n018.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:22 PM UTC 2026
% Result : Unsatisfiable 54.74s 11.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD025-4 : 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.16/0.34 % Computer : n018.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:18 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.21/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 54.74/11.45 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.45 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.45 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.45 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.45 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.45 Execution resolution_2 ended with status: unsatisfiable
% 54.74/11.45 Used heuristic: resolution_2
% 54.74/11.45
% 54.74/11.45 Input Clauses:
% 54.74/11.46
% 54.74/11.46 Predicates: sum defined product less_or_equal
% 54.74/11.46 Fol Constants: additive_identity multiplicative_identity a b c d u
% 54.74/11.46 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 54.74/11.46 Problem Properties:
% 54.74/11.46 This is a full first-order problem without equality.
% 54.74/11.46
% 54.74/11.46 After reduction: Problem Properties:
% 54.74/11.46 This is a full first-order problem without equality.
% 54.74/11.46
% 54.74/11.46
% 54.74/11.46 Reduced Input Clauses:
% 54.74/11.46
% 54.74/11.46 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 54.74/11.46
% 54.74/11.46 === Starting SPASS-SCL-FOL A Little Less Naive, considering 46 atoms initially, heuristics mode: resolution_2 ===
% 54.74/11.46
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 46
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 36:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 37:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 51
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 54.74/11.46 === Backtracking. Learning clause 39:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 40:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 51
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 41: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) ->
% 54.74/11.46 === Backtracking. Learning clause 42:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 60
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 43:2:0:[18.1,27.1]:: -> defined(multiplicative_inverse(a)),sum(additive_identity,a,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 44:2:0:[9.1,27.1]:: -> product(multiplicative_inverse(a),a,multiplicative_identity),sum(additive_identity,a,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 45:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0)
% 54.74/11.46 === Conflict found: 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> a}
% 54.74/11.46 === Backtracking. Learning clause 46:2:0:[38.1,27.1]:: -> less_or_equal(a,multiplicative_identity),less_or_equal(multiplicative_identity,a)
% 54.74/11.46 === Backtracking. Learning clause 47:1:0:[8.1,27.1]:: -> product(multiplicative_identity,a,a)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 124
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 133
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 48:2:0:[18.1,28.1]:: -> defined(multiplicative_inverse(b)),sum(additive_identity,b,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 49:2:0:[9.1,28.1]:: -> product(multiplicative_inverse(b),b,multiplicative_identity),sum(additive_identity,b,additive_identity)
% 54.74/11.46 === Conflict found: 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> b}
% 54.74/11.46 === Backtracking. Learning clause 50:2:0:[38.1,28.1]:: -> less_or_equal(b,multiplicative_identity),less_or_equal(multiplicative_identity,b)
% 54.74/11.46 === Backtracking. Learning clause 51:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0)
% 54.74/11.46 === Conflict found: 45:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> b}
% 54.74/11.46 === Backtracking. Learning clause 52:2:0:[45.1,28.1]:: -> less_or_equal(b,a),less_or_equal(a,b)
% 54.74/11.46 === Backtracking. Learning clause 53:1:0:[15.1,28.1]:: -> defined(additive_inverse(b))
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 144
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 54:2:0:[18.1,29.1]:: -> defined(multiplicative_inverse(c)),sum(additive_identity,c,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 55:2:0:[9.1,29.1]:: -> product(multiplicative_inverse(c),c,multiplicative_identity),sum(additive_identity,c,additive_identity)
% 54.74/11.46 === Conflict found: 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> c}
% 54.74/11.46 === Backtracking. Learning clause 56:2:0:[38.1,29.1]:: -> less_or_equal(c,multiplicative_identity),less_or_equal(multiplicative_identity,c)
% 54.74/11.46 === Conflict found: 45:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> c}
% 54.74/11.46 === Backtracking. Learning clause 57:2:0:[45.1,29.1]:: -> less_or_equal(c,a),less_or_equal(a,c)
% 54.74/11.46 === Backtracking. Learning clause 58:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,c),less_or_equal(c,x0)
% 54.74/11.46 === Conflict found: 51:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> c}
% 54.74/11.46 === Backtracking. Learning clause 59:2:0:[51.1,29.1]:: -> less_or_equal(c,b),less_or_equal(b,c)
% 54.74/11.46 === Backtracking. Learning clause 60:2:1:[20.1,29.1]:Top: defined(x0) -> product(c,x0,multiply(c,x0))
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 163
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 61:2:0:[18.1,30.1]:: -> defined(multiplicative_inverse(d)),sum(additive_identity,d,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 62:2:0:[9.1,30.1]:: -> product(multiplicative_inverse(d),d,multiplicative_identity),sum(additive_identity,d,additive_identity)
% 54.74/11.46 === Conflict found: 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> d}
% 54.74/11.46 === Backtracking. Learning clause 63:2:0:[38.1,30.1]:: -> less_or_equal(d,multiplicative_identity),less_or_equal(multiplicative_identity,d)
% 54.74/11.46 === Conflict found: 45:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> d}
% 54.74/11.46 === Backtracking. Learning clause 64:2:0:[45.1,30.1]:: -> less_or_equal(d,a),less_or_equal(a,d)
% 54.74/11.46 === Conflict found: 51:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> d}
% 54.74/11.46 === Backtracking. Learning clause 65:2:0:[51.1,30.1]:: -> less_or_equal(d,b),less_or_equal(b,d)
% 54.74/11.46 === Backtracking. Learning clause 66:3:1:[23.2,30.1]:Top: defined(x0) -> less_or_equal(x0,d),less_or_equal(d,x0)
% 54.74/11.46 === Conflict found: 58:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,c),less_or_equal(c,x0) {x0 -> d}
% 54.74/11.46 === Backtracking. Learning clause 67:2:0:[58.1,30.1]:: -> less_or_equal(d,c),less_or_equal(c,d)
% 54.74/11.46 === Conflict found: 60:2:1:[20.1,29.1]:Top: defined(x0) -> product(c,x0,multiply(c,x0)) {x0 -> d}
% 54.74/11.46 === Backtracking. Learning clause 68:1:0:[60.1,30.1]:: -> product(c,d,multiply(c,d))
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 186
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 69:2:0:[18.1,31.1]:: -> defined(multiplicative_inverse(u)),sum(additive_identity,u,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 70:2:0:[9.1,31.1]:: -> product(multiplicative_inverse(u),u,multiplicative_identity),sum(additive_identity,u,additive_identity)
% 54.74/11.46 === Conflict found: 38:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> u}
% 54.74/11.46 === Backtracking. Learning clause 71:2:0:[38.1,31.1]:: -> less_or_equal(u,multiplicative_identity),less_or_equal(multiplicative_identity,u)
% 54.74/11.46 === Conflict found: 45:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> u}
% 54.74/11.46 === Backtracking. Learning clause 72:2:0:[45.1,31.1]:: -> less_or_equal(u,a),less_or_equal(a,u)
% 54.74/11.46 === Conflict found: 51:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> u}
% 54.74/11.46 === Backtracking. Learning clause 73:2:0:[51.1,31.1]:: -> less_or_equal(u,b),less_or_equal(b,u)
% 54.74/11.46 === Conflict found: 58:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,c),less_or_equal(c,x0) {x0 -> u}
% 54.74/11.46 === Backtracking. Learning clause 74:2:0:[58.1,31.1]:: -> less_or_equal(u,c),less_or_equal(c,u)
% 54.74/11.46 === Backtracking. Learning clause 75:3:1:[23.2,31.1]:Top: defined(x0) -> less_or_equal(x0,u),less_or_equal(u,x0)
% 54.74/11.46 === Conflict found: 66:3:1:[23.2,30.1]:Top: defined(x0) -> less_or_equal(x0,d),less_or_equal(d,x0) {x0 -> u}
% 54.74/11.46 === Backtracking. Learning clause 76:2:0:[66.1,31.1]:: -> less_or_equal(u,d),less_or_equal(d,u)
% 54.74/11.46 === Backtracking. Learning clause 77:2:1:[20.2,31.1]:Top: defined(x0) -> product(x0,u,multiply(x0,u))
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 250
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 256
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 78:3:0:[25.3,32.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(additive_identity,a) -> less_or_equal(additive_identity,b)
% 54.74/11.46 === Backtracking. Learning clause 79:3:3:[6.1,32.1]:TopTopTop: product(a,x0,x1),product(b,x0,x2) -> product(multiplicative_identity,x1,x2)
% 54.74/11.46 === Backtracking. Learning clause 80:1:0:[10.1,32.1]:: -> product(a,multiplicative_identity,b)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 263
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 81:3:0:[25.3,33.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(additive_identity,c) -> less_or_equal(additive_identity,d)
% 54.74/11.46 === Backtracking. Learning clause 82:3:3:[7.1,33.1,10.1,10.2,10.2]:TopTopTop: product(x0,multiplicative_identity,x1),product(x2,c,x0) -> product(x2,d,x1)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 271
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 83:3:0:[25.3,34.1]:: less_or_equal(additive_identity,a),less_or_equal(additive_identity,c) -> less_or_equal(additive_identity,u)
% 54.74/11.46 === Backtracking. Learning clause 84:4:4:[11.2,34.1]:TopTopTopTop: sum(x0,x1,a),product(x0,c,x2),product(x1,c,x3) -> sum(x2,x3,u)
% 54.74/11.46 === Backtracking. Learning clause 85:3:3:[6.2,34.1]:TopTopTop: product(x0,a,x1),product(x1,c,x2) -> product(x0,u,x2)
% 54.74/11.46 === Conflict found: 79:3:3:[6.1,32.1]:TopTopTop: product(a,x0,x1),product(b,x0,x2) -> product(multiplicative_identity,x1,x2) {x0 -> c, x1 -> u, x2 -> additive_identity}
% 54.74/11.46 === Backtracking. Learning clause 86:2:1:[79.1,34.1]:Top: product(b,c,x0) -> product(multiplicative_identity,u,x0)
% 54.74/11.46 === Clause set with instances from active satisfied. Growing active. New size: 273
% 54.74/11.46 === Restarting.
% 54.74/11.46 === Backtracking. Learning clause 87:4:4:[12.5,35.1]:TopTopTopTop: sum(x0,x1,d),product(x0,b,x2),product(x1,b,x3),sum(x2,x3,u) ->
% 54.74/11.46 === Backtracking. Learning clause 88:5:6:[7.4,35.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,u),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) ->
% 54.74/11.46 === Backtracking. Learning clause 89:3:3:[6.4,35.1]:TopTopTop: product(d,x0,x1),product(x0,x2,b),product(x1,x2,u) ->
% 54.74/11.46 === Backtracking. Learning clause 90:1:0:[8.1,14.1]:: -> product(multiplicative_identity,additive_identity,additive_identity)
% 54.74/11.46 === Backtracking. Learning clause 92:2:1:[14.0,91.1,24.1,23.3,37.1]:Top: sum(additive_identity,additive_identity,x0) -> less_or_equal(additive_identity,x0)
% 54.74/11.46 === Conflict found: 88:5:6:[7.4,35.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,u),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) -> {x0 -> c, x1 -> multiplicative_identity, x2 -> a, x3 -> a, x4 -> a, x5 -> multiplicative_identity}
% 54.74/11.46
% 54.74/11.46 SZS status Unsatisfiable
% 54.74/11.46
% 54.74/11.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 54.74/11.46
% 54.74/11.46 SPASS-SCL-FOL Statistics:
% 54.74/11.46 Number of learned clauses: 56
% 54.74/11.46 Number of propagations: 1960
% 54.74/11.46 Number of decisions: 373
% 54.74/11.46 Number of resolutions: 68
% 54.74/11.46 Number of condensations: 0
% 54.74/11.46 Number of sub resolutions: 1
% 54.74/11.46 Number of input literals (deduplicated): 29
% 54.74/11.46 Number of grows: 14
% 54.74/11.46 Number of considered ground atoms: 273
% 54.74/11.46
% 54.74/11.46 Needed: 0:0:10.89
% 54.74/11.46
%------------------------------------------------------------------------------