%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : FLD070-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 : n019.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:30 PM UTC 2026
% Result : Unsatisfiable 2.89s 1.21s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD070-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n019.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:51:45 EDT 2026
% 0.16/0.35 % CPUTime :
% 0.16/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.89/1.21 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21 Execution resolution_3 ended with status: unsatisfiable
% 2.89/1.21 Used heuristic: resolution_3
% 2.89/1.21
% 2.89/1.21 Input Clauses:
% 2.89/1.21
% 2.89/1.21 Predicates: sum defined product less_or_equal
% 2.89/1.21 Fol Constants: additive_identity multiplicative_identity a b
% 2.89/1.21 Fol Functions: additive_inverse multiplicative_inverse add multiply
% 2.89/1.21 Problem Properties:
% 2.89/1.21 This is a full first-order problem without equality.
% 2.89/1.21
% 2.89/1.21 After reduction: Problem Properties:
% 2.89/1.21 This is a full first-order problem without equality.
% 2.89/1.21
% 2.89/1.21
% 2.89/1.21 Reduced Input Clauses:
% 2.89/1.21
% 2.89/1.21 Most General Atoms: product(x2,x3,x6) defined(x1) sum(x1,x2,x4) less_or_equal(x3,x4)
% 2.89/1.21
% 2.89/1.21 === Starting SPASS-SCL-FOL A Little Less Naive, considering 38 atoms initially, heuristics mode: resolution_3 ===
% 2.89/1.21
% 2.89/1.21 === Backtracking. Learning clause 32:2:0:[21.3,26.1]:: less_or_equal(additive_identity,multiplicative_identity),less_or_equal(multiplicative_identity,additive_identity) ->
% 2.89/1.21 === Backtracking. Learning clause 33: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)
% 2.89/1.21 === Backtracking. Learning clause 34: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))
% 2.89/1.21 === Backtracking. Learning clause 35: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)
% 2.89/1.21 === Backtracking. Learning clause 36: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))
% 2.89/1.21 === Backtracking. Learning clause 37: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))
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 43
% 2.89/1.21 === Restarting.
% 2.89/1.21 === Conflict found: 34: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)) {x0 -> additive_identity, x1 -> a, x2 -> b, x3 -> additive_identity}
% 2.89/1.21 === Backtracking. Learning clause 40:2:1:[27.0,38.2,28.0,39.3,34.5,31.1]:Top: less_or_equal(x0,a),sum(x0,b,additive_identity) ->
% 2.89/1.21 === Backtracking. Learning clause 41:8:8:[24.2,37.6]:TopTopTopTopTopTopTopTop: less_or_equal(x0,x1),sum(x1,x2,x3),sum(x4,x5,x6),product(x4,x7,x0),product(x5,x7,x2),defined(x6),defined(x7) -> less_or_equal(multiply(x6,x7),x3)
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 48
% 2.89/1.21 === Restarting.
% 2.89/1.21 === Conflict found: 40:2:1:[27.0,38.2,28.0,39.3,34.5,31.1]:Top: less_or_equal(x0,a),sum(x0,b,additive_identity) -> {x0 -> additive_identity}
% 2.89/1.21 === Backtracking. Learning clause 43:1:0:[28.0,42.0,40.2,18.3,29.1]:: -> defined(multiplicative_inverse(b))
% 2.89/1.21 === Backtracking. Learning clause 47:1:0:[29.0,44.0,30.0,45.1,14.0,46.3,1.4,40.2,21.3,3.2]:: less_or_equal(b,additive_identity) ->
% 2.89/1.21 === Conflict found: 40:2:1:[27.0,38.2,28.0,39.3,34.5,31.1]:Top: less_or_equal(x0,a),sum(x0,b,additive_identity) -> {x0 -> additive_inverse(b)}
% 2.89/1.21 === Backtracking. Learning clause 49:1:0:[28.0,48.1,40.2,4.2]:: less_or_equal(additive_inverse(b),a) ->
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 51
% 2.89/1.21 === Restarting.
% 2.89/1.21 === Backtracking. Learning clause 51:2:0:[27.0,50.0,23.4,49.1]:: defined(additive_inverse(b)) -> less_or_equal(a,additive_inverse(b))
% 2.89/1.21 === Backtracking. Learning clause 52:2:1:[22.3,49.1]:Top: less_or_equal(additive_inverse(b),x0),less_or_equal(x0,a) ->
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 57
% 2.89/1.21 === Restarting.
% 2.89/1.21 === Backtracking. Learning clause 53:3:1:[22.2,51.2]:Top: less_or_equal(x0,a),defined(additive_inverse(b)) -> less_or_equal(x0,additive_inverse(b))
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 58
% 2.89/1.21 === Restarting.
% 2.89/1.21 === Clause set with instances from active satisfied. Growing active. New size: 122
% 2.89/1.21
% 2.89/1.21 SZS status Unsatisfiable
% 2.89/1.21
% 2.89/1.21 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.21
% 2.89/1.21 SPASS-SCL-FOL Statistics:
% 2.89/1.21 Number of learned clauses: 14
% 2.89/1.21 Number of propagations: 481
% 2.89/1.21 Number of decisions: 149
% 2.89/1.21 Number of resolutions: 26
% 2.89/1.21 Number of condensations: 0
% 2.89/1.21 Number of sub resolutions: 8
% 2.89/1.21 Number of input literals (deduplicated): 25
% 2.89/1.21 Number of grows: 6
% 2.89/1.21 Number of considered ground atoms: 122
% 2.89/1.21
% 2.89/1.21 Needed: 0:00:00.64
% 2.89/1.21
%------------------------------------------------------------------------------