%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD025-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 : n010.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 192.72s 48.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD025-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.16/0.34 % Computer : n010.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:07 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]
% 192.72/48.71 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71 Execution resolution_2 ended with status: unsatisfiable
% 192.72/48.71 Used heuristic: resolution_2
% 192.72/48.71
% 192.72/48.71 Input Clauses:
% 192.72/48.71
% 192.72/48.71 Predicates: sum defined product less_or_equal
% 192.72/48.71 Fol Constants: additive_identity multiplicative_identity a b c d
% 192.72/48.71 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 192.72/48.71 Problem Properties:
% 192.72/48.71 This is a full first-order problem without equality.
% 192.72/48.71
% 192.72/48.71 After reduction: Problem Properties:
% 192.72/48.71 This is a full first-order problem without equality.
% 192.72/48.71
% 192.72/48.71
% 192.72/48.71 Reduced Input Clauses:
% 192.72/48.71
% 192.72/48.71 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 192.72/48.71
% 192.72/48.71 === Starting SPASS-SCL-FOL A Little Less Naive, considering 44 atoms initially, heuristics mode: resolution_2 ===
% 192.72/48.71
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 44
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 34:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 35:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 49
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 36:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 192.72/48.71 === Backtracking. Learning clause 37:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 38:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 49
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 39: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) ->
% 192.72/48.71 === Backtracking. Learning clause 40:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 58
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 41:2:0:[18.1,27.1]:: -> defined(multiplicative_inverse(a)),sum(additive_identity,a,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 42:2:0:[9.1,27.1]:: -> product(multiplicative_inverse(a),a,multiplicative_identity),sum(additive_identity,a,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 43:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0)
% 192.72/48.71 === Conflict found: 36:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> a}
% 192.72/48.71 === Backtracking. Learning clause 44:2:0:[36.1,27.1]:: -> less_or_equal(a,multiplicative_identity),less_or_equal(multiplicative_identity,a)
% 192.72/48.71 === Backtracking. Learning clause 45:1:0:[8.1,27.1]:: -> product(multiplicative_identity,a,a)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 122
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 131
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 46:2:0:[18.1,28.1]:: -> defined(multiplicative_inverse(b)),sum(additive_identity,b,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 47:2:0:[9.1,28.1]:: -> product(multiplicative_inverse(b),b,multiplicative_identity),sum(additive_identity,b,additive_identity)
% 192.72/48.71 === Conflict found: 36:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> b}
% 192.72/48.71 === Backtracking. Learning clause 48:2:0:[36.1,28.1]:: -> less_or_equal(b,multiplicative_identity),less_or_equal(multiplicative_identity,b)
% 192.72/48.71 === Backtracking. Learning clause 49:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0)
% 192.72/48.71 === Conflict found: 43:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> b}
% 192.72/48.71 === Backtracking. Learning clause 50:2:0:[43.1,28.1]:: -> less_or_equal(b,a),less_or_equal(a,b)
% 192.72/48.71 === Backtracking. Learning clause 51:1:0:[15.1,28.1]:: -> defined(additive_inverse(b))
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 142
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 52:2:0:[18.1,29.1]:: -> defined(multiplicative_inverse(c)),sum(additive_identity,c,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 53:2:0:[9.1,29.1]:: -> product(multiplicative_inverse(c),c,multiplicative_identity),sum(additive_identity,c,additive_identity)
% 192.72/48.71 === Conflict found: 36:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> c}
% 192.72/48.71 === Backtracking. Learning clause 54:2:0:[36.1,29.1]:: -> less_or_equal(c,multiplicative_identity),less_or_equal(multiplicative_identity,c)
% 192.72/48.71 === Conflict found: 43:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> c}
% 192.72/48.71 === Backtracking. Learning clause 55:2:0:[43.1,29.1]:: -> less_or_equal(c,a),less_or_equal(a,c)
% 192.72/48.71 === Backtracking. Learning clause 56:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,c),less_or_equal(c,x0)
% 192.72/48.71 === Conflict found: 49:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> c}
% 192.72/48.71 === Backtracking. Learning clause 57:2:0:[49.1,29.1]:: -> less_or_equal(c,b),less_or_equal(b,c)
% 192.72/48.71 === Backtracking. Learning clause 58:2:1:[20.1,29.1]:Top: defined(x0) -> product(c,x0,multiply(c,x0))
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 161
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 59:2:0:[18.1,30.1]:: -> defined(multiplicative_inverse(d)),sum(additive_identity,d,additive_identity)
% 192.72/48.71 === Backtracking. Learning clause 60:2:0:[9.1,30.1]:: -> product(multiplicative_inverse(d),d,multiplicative_identity),sum(additive_identity,d,additive_identity)
% 192.72/48.71 === Conflict found: 36:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0) {x0 -> d}
% 192.72/48.71 === Backtracking. Learning clause 61:2:0:[36.1,30.1]:: -> less_or_equal(d,multiplicative_identity),less_or_equal(multiplicative_identity,d)
% 192.72/48.71 === Conflict found: 43:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> d}
% 192.72/48.71 === Backtracking. Learning clause 62:2:0:[43.1,30.1]:: -> less_or_equal(d,a),less_or_equal(a,d)
% 192.72/48.71 === Conflict found: 49:3:1:[23.2,28.1]:Top: defined(x0) -> less_or_equal(x0,b),less_or_equal(b,x0) {x0 -> d}
% 192.72/48.71 === Backtracking. Learning clause 63:2:0:[49.1,30.1]:: -> less_or_equal(d,b),less_or_equal(b,d)
% 192.72/48.71 === Backtracking. Learning clause 64:3:1:[23.2,30.1]:Top: defined(x0) -> less_or_equal(x0,d),less_or_equal(d,x0)
% 192.72/48.71 === Conflict found: 56:3:1:[23.2,29.1]:Top: defined(x0) -> less_or_equal(x0,c),less_or_equal(c,x0) {x0 -> d}
% 192.72/48.71 === Backtracking. Learning clause 65:2:0:[56.1,30.1]:: -> less_or_equal(d,c),less_or_equal(c,d)
% 192.72/48.71 === Conflict found: 58:2:1:[20.1,29.1]:Top: defined(x0) -> product(c,x0,multiply(c,x0)) {x0 -> d}
% 192.72/48.71 === Backtracking. Learning clause 66:1:0:[58.1,30.1]:: -> product(c,d,multiply(c,d))
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 167
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 67:3:0:[25.3,31.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(additive_identity,a) -> less_or_equal(additive_identity,b)
% 192.72/48.71 === Backtracking. Learning clause 68:3:3:[6.1,31.1]:TopTopTop: product(a,x0,x1),product(b,x0,x2) -> product(multiplicative_identity,x1,x2)
% 192.72/48.71 === Backtracking. Learning clause 69:1:0:[10.1,31.1]:: -> product(a,multiplicative_identity,b)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 231
% 192.72/48.71 === Backtracking. Learning clause 70:7:9:[11.5,24.3,10.2]:TopTopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,x4),product(x1,x3,x5),less_or_equal(x6,x7),sum(x6,x5,x8),product(x3,x0,x7) -> less_or_equal(x8,x4)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 237
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 71:3:0:[25.3,32.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(additive_identity,c) -> less_or_equal(additive_identity,d)
% 192.72/48.71 === Backtracking. Learning clause 72:3:3:[7.1,32.1,10.1,10.2,10.2]:TopTopTop: product(x0,multiplicative_identity,x1),product(x2,c,x0) -> product(x2,d,x1)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 241
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 73:4:4:[12.5,33.1]:TopTopTopTop: sum(x0,x1,d),product(x0,b,x2),product(x1,b,x3),sum(x2,x3,multiply(a,c)) ->
% 192.72/48.71 === Backtracking. Learning clause 74:5:6:[7.4,33.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,multiply(a,c)),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) ->
% 192.72/48.71 === Backtracking. Learning clause 75:3:3:[6.4,33.1]:TopTopTop: product(d,x0,x1),product(x0,x2,b),product(x1,x2,multiply(a,c)) ->
% 192.72/48.71 === Backtracking. Learning clause 76:1:0:[8.1,14.1]:: -> product(multiplicative_identity,additive_identity,additive_identity)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 241
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Conflict found: 39: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}
% 192.72/48.71 === Backtracking. Learning clause 77:2:1:[39.1,35.1]:Top: product(additive_identity,x0,multiplicative_identity),product(additive_identity,x0,additive_identity) ->
% 192.72/48.71 === Backtracking. Learning clause 78:2:0:[5.1,11.5,24.3,3.2,21.2,25.4,26.1,17.1,76.1]:: product(additive_identity,additive_identity,multiplicative_identity),less_or_equal(additive_identity,additive_identity) ->
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 245
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Backtracking. Learning clause 79:3:2:[24.2,38.1]:TopTop: less_or_equal(additive_inverse(multiplicative_identity),x0),sum(x0,multiplicative_identity,x1) -> less_or_equal(additive_identity,x1)
% 192.72/48.71 === Backtracking. Learning clause 80:3:3:[1.1,38.1]:TopTopTop: sum(multiplicative_identity,x0,x1),sum(additive_identity,x0,x2) -> sum(additive_inverse(multiplicative_identity),x1,x2)
% 192.72/48.71 === Backtracking. Learning clause 81:1:0:[1.3,3.2,5.2,17.1,26.1,35.1]:: sum(multiplicative_identity,additive_identity,additive_identity) ->
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 309
% 192.72/48.71 === Backtracking. Learning clause 82:6:5:[9.3,11.1]:TopTopTopTopTop: defined(x0),product(additive_identity,x1,x2),product(additive_identity,x1,x3),product(x0,x1,x4) -> product(multiplicative_inverse(x0),x0,multiplicative_identity),sum(x3,x4,x2)
% 192.72/48.71 === Clause set with instances from active satisfied. Growing active. New size: 312
% 192.72/48.71 === Restarting.
% 192.72/48.71 === Conflict found: 74:5:6:[7.4,33.1,6.4]:TopTopTopTopTopTop: product(x0,x1,d),product(x0,x2,multiply(a,c)),product(x1,x3,x4),product(x3,x5,b),product(x4,x5,x2) -> {x0 -> additive_identity, x1 -> multiplicative_identity, x2 -> additive_identity, x3 -> a, x4 -> a, x5 -> additive_identity}
% 192.72/48.71 === Backtracking. Learning clause 83:4:3:[74.3,45.1,10.2]:TopTopTop: product(x0,multiplicative_identity,d),product(x0,x1,multiply(a,c)),product(a,x2,b),product(x2,a,x1) ->
% 192.72/48.71 === Backtracking. Learning clause 84:3:1:[1.3,11.5,5.2,45.1,35.1,3.2,17.1]:Top: product(additive_identity,a,additive_identity),sum(a,additive_identity,x0) -> sum(additive_identity,x0,a)
% 192.72/48.71 === Backtracking. Learning clause 85:7:10:[7.4,11.3]:TopTopTopTopTopTopTopTopTopTop: product(x0,x1,x2),product(x1,x3,x4),product(x0,x4,x5),sum(x2,x6,x7),product(x7,x3,x8),product(x6,x3,x9) -> sum(x5,x9,x8)
% 192.72/48.71 === Backtracking. Learning clause 86:6:9:[7.3,6.4]:TopTopTopTopTopTopTopTopTop: product(x0,x1,x2),product(x1,x3,x4),product(x0,x5,x6),product(x5,x7,x4),product(x6,x7,x8) -> product(x2,x3,x8)
% 192.72/48.71 === Conflict found: 86:6:9:[7.3,6.4]:TopTopTopTopTopTopTopTopTop: product(x0,x1,x2),product(x1,x3,x4),product(x0,x5,x6),product(x5,x7,x4),product(x6,x7,x8) -> product(x2,x3,x8) {x0 -> a, x1 -> multiplicative_identity, x2 -> b, x3 -> d, x4 -> d, x5 -> multiplicative_identity, x6 -> a, x7 -> c, x8 -> multiply(a,c)}
% 192.72/48.71
% 192.72/48.71 SZS status Unsatisfiable
% 192.72/48.71
% 192.72/48.71 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 192.72/48.71
% 192.72/48.71 SPASS-SCL-FOL Statistics:
% 192.72/48.71 Number of learned clauses: 53
% 192.72/48.71 Number of propagations: 2808
% 192.72/48.71 Number of decisions: 401
% 192.72/48.71 Number of resolutions: 86
% 192.72/48.71 Number of condensations: 1
% 192.72/48.71 Number of sub resolutions: 0
% 192.72/48.71 Number of input literals (deduplicated): 27
% 192.72/48.71 Number of grows: 16
% 192.72/48.71 Number of considered ground atoms: 312
% 192.72/48.71
% 192.72/48.71 Needed: 0:0:48.09
% 192.72/48.71
%------------------------------------------------------------------------------