%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD031-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 : n022.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 6.16s 2.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : FLD031-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.09/0.15 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 % Computer : n022.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu May 7 11:49:21 EDT 2026
% 0.19/0.38 % CPUTime :
% 0.19/0.38 SPASS-SCL-FOL version:
% 0.26/0.46 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 6.16/2.03 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03 Execution resolution_2 ended with status: unsatisfiable
% 6.16/2.03 Used heuristic: resolution_2
% 6.16/2.03
% 6.16/2.03 Input Clauses:
% 6.16/2.03
% 6.16/2.03 Predicates: sum defined product less_or_equal
% 6.16/2.03 Fol Constants: additive_identity multiplicative_identity a
% 6.16/2.03 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 6.16/2.03 Problem Properties:
% 6.16/2.03 This is a full first-order problem without equality.
% 6.16/2.03
% 6.16/2.03 After reduction: Problem Properties:
% 6.16/2.03 This is a full first-order problem without equality.
% 6.16/2.03
% 6.16/2.03
% 6.16/2.03 Reduced Input Clauses:
% 6.16/2.03
% 6.16/2.03 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 6.16/2.03
% 6.16/2.03 === Starting SPASS-SCL-FOL A Little Less Naive, considering 58 atoms initially, heuristics mode: resolution_2 ===
% 6.16/2.03
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 58
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 31:2:0:[18.1,14.1]:: -> defined(multiplicative_inverse(additive_identity)),sum(additive_identity,additive_identity,additive_identity)
% 6.16/2.03 === Backtracking. Learning clause 32:1:0:[3.1,14.1]:: -> sum(additive_identity,additive_identity,additive_identity)
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 62
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 33:3:1:[23.2,17.1]:Top: defined(x0) -> less_or_equal(x0,multiplicative_identity),less_or_equal(multiplicative_identity,x0)
% 6.16/2.03 === Backtracking. Learning clause 34:2:0:[9.1,17.1]:: -> product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),sum(additive_identity,multiplicative_identity,additive_identity)
% 6.16/2.03 === Backtracking. Learning clause 35:1:0:[4.1,17.1]:: -> sum(additive_inverse(multiplicative_identity),multiplicative_identity,additive_identity)
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 62
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 36: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) ->
% 6.16/2.03 === Backtracking. Learning clause 37:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 69
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 38:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0)
% 6.16/2.03 === Conflict found: 38:3:1:[23.2,27.1]:Top: defined(x0) -> less_or_equal(x0,a),less_or_equal(a,x0) {x0 -> multiplicative_identity}
% 6.16/2.03 === Backtracking. Learning clause 39:2:0:[38.1,17.1]:: -> less_or_equal(multiplicative_identity,a),less_or_equal(a,multiplicative_identity)
% 6.16/2.03 === Backtracking. Learning clause 40:1:0:[8.1,27.1]:: -> product(multiplicative_identity,a,a)
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 133
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 136
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 41:1:0:[10.1,28.1]:: -> product(a,multiplicative_identity,multiplicative_identity)
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 137
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 42:7:8:[11.5,29.1,12.5]:TopTopTopTopTopTopTopTop: sum(x0,x1,x2),product(x2,x3,additive_identity),product(x0,x3,additive_identity),sum(x4,x5,x1),product(x4,x3,x6),product(x5,x3,x7),sum(x6,x7,a) ->
% 6.16/2.03 === Backtracking. Learning clause 43:3:3:[1.4,29.1]:TopTopTop: sum(additive_identity,x0,x1),sum(x0,x2,a),sum(x1,x2,additive_identity) ->
% 6.16/2.03 === Backtracking. Learning clause 44:1:0:[5.2,29.1]:: sum(a,additive_identity,additive_identity) ->
% 6.16/2.03 === Clause set with instances from active satisfied. Growing active. New size: 140
% 6.16/2.03 === Restarting.
% 6.16/2.03 === Backtracking. Learning clause 45:5:6:[7.4,30.1,6.4]:TopTopTopTopTopTop: product(x0,x1,multiplicative_identity),product(x0,x2,multiplicative_identity),product(x1,x3,x4),product(x3,x5,multiplicative_inverse(a)),product(x4,x5,x2) ->
% 6.16/2.03 === Backtracking. Learning clause 46:1:0:[10.2,30.1]:: product(multiplicative_inverse(a),multiplicative_identity,multiplicative_identity) ->
% 6.16/2.03
% 6.16/2.03 SZS status Unsatisfiable
% 6.16/2.03
% 6.16/2.03 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/2.03
% 6.16/2.03 SPASS-SCL-FOL Statistics:
% 6.16/2.03 Number of learned clauses: 16
% 6.16/2.03 Number of propagations: 634
% 6.16/2.03 Number of decisions: 139
% 6.16/2.03 Number of resolutions: 25
% 6.16/2.03 Number of condensations: 0
% 6.16/2.03 Number of sub resolutions: 0
% 6.16/2.03 Number of input literals (deduplicated): 24
% 6.16/2.03 Number of grows: 8
% 6.16/2.03 Number of considered ground atoms: 140
% 6.16/2.03
% 6.16/2.03 Needed: 0:00:01.43
% 6.16/2.03
%------------------------------------------------------------------------------