%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT008-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:20:04 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 15
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 50 ( 0 equ; 34 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(t1_FOL_3,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X7,X3)
| ~ greater(X5,X4)
| greater(X7,X6) ),
file('theBenchmark.p',t1_FOL_3) ).
% FILE RECORD
cnf(a5_FOL_2,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ size(X2,X6,X3)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
file('theBenchmark.p',a5_FOL_2) ).
% FILE RECORD
cnf(mp5_1,axiom,
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp5_1) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,X4,X3)
| ~ survival_chance(X0,X5,X1)
| ~ survival_chance(X2,X6,X3)
| ~ organization(X7,X8)
| ~ class(X0,X9,X1)
| ~ class(X7,X9,X8)
| ~ size(X0,X10,X1)
| ~ size(X7,X11,X8)
| ~ inertia(X7,X4,X8)
| ~ greater(X11,X10)
| ~ organization(X0,X1)
| greater(X6,X5) ),
inference(resolution,[status(thm)],[t1_FOL_3,a5_FOL_2,mp5_1]) ).
% FILE RECORD
cnf(t8_FOL_6,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('theBenchmark.p',t8_FOL_6) ).
% FILE RECORD
cnf(t8_FOL_7,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('theBenchmark.p',t8_FOL_7) ).
% FILE RECORD
cnf(t8_FOL_10,negated_conjecture,
survival_chance(sk2,sk5,sk9),
file('theBenchmark.p',t8_FOL_10) ).
% FILE RECORD
cnf(t8_FOL_11,negated_conjecture,
survival_chance(sk3,sk6,sk10),
file('theBenchmark.p',t8_FOL_11) ).
% FILE RECORD
cnf(t8_FOL_8,negated_conjecture,
class(sk2,sk4,sk9),
file('theBenchmark.p',t8_FOL_8) ).
% FILE RECORD
cnf(t8_FOL_9,negated_conjecture,
class(sk3,sk4,sk10),
file('theBenchmark.p',t8_FOL_9) ).
% FILE RECORD
cnf(t8_FOL_12,negated_conjecture,
size(sk2,sk7,sk9),
file('theBenchmark.p',t8_FOL_12) ).
% FILE RECORD
cnf(t8_FOL_13,negated_conjecture,
size(sk3,sk8,sk10),
file('theBenchmark.p',t8_FOL_13) ).
% FILE RECORD
cnf(t8_FOL_15,negated_conjecture,
~ greater(sk6,sk5),
file('theBenchmark.p',t8_FOL_15) ).
% FILE RECORD
cnf(t8_FOL_4,negated_conjecture,
organization(sk2,sk9),
file('theBenchmark.p',t8_FOL_4) ).
% FILE RECORD
cnf(t8_FOL_5,negated_conjecture,
organization(sk3,sk10),
file('theBenchmark.p',t8_FOL_5) ).
% FILE RECORD
cnf(t8_FOL_14,negated_conjecture,
greater(sk8,sk7),
file('theBenchmark.p',t8_FOL_14) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
$false,
inference(resolution,[status(thm)],[c_17,mp5_1,t8_FOL_6,t8_FOL_7,t8_FOL_10,t8_FOL_11,t8_FOL_8,t8_FOL_9,t8_FOL_12,t8_FOL_13,t8_FOL_15,t8_FOL_4,t8_FOL_5,t8_FOL_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT008-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n019.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 7 11:46:22 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % Input Clauses:
% 0.12/0.40 % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.12/0.40 % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.12/0.40 % 3:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),inertia(x0,x4,x1),inertia(x2,x5,x3),survival_chance(x0,x6,x1),survival_chance(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.12/0.40 % 4:1:0:INP:: -> organization(sk2,sk9)
% 0.12/0.40 % 5:1:0:INP:: -> organization(sk3,sk10)
% 0.12/0.40 % 6:1:0:INP:: -> reorganization_free(sk2,sk9,sk9)
% 0.12/0.40 % 7:1:0:INP:: -> reorganization_free(sk3,sk10,sk10)
% 0.12/0.40 % 8:1:0:INP:: -> class(sk2,sk4,sk9)
% 0.12/0.40 % 9:1:0:INP:: -> class(sk3,sk4,sk10)
% 0.12/0.40 % 10:1:0:INP:: -> survival_chance(sk2,sk5,sk9)
% 0.12/0.40 % 11:1:0:INP:: -> survival_chance(sk3,sk6,sk10)
% 0.12/0.40 % 12:1:0:INP:: -> size(sk2,sk7,sk9)
% 0.12/0.40 % 13:1:0:INP:: -> size(sk3,sk8,sk10)
% 0.12/0.40 % 14:1:0:INP:: -> greater(sk8,sk7)
% 0.12/0.40 % 15:1:0:INP:: greater(sk6,sk5) ->
% 0.12/0.40
% 0.12/0.40 % Predicates: organization inertia class size greater reorganization_free survival_chance
% 0.12/0.40 % Fol Constants: sk2 sk9 sk3 sk10 sk4 sk5 sk6 sk7 sk8
% 0.12/0.40 % Fol Functions: sk1
% 0.12/0.40 % Problem Properties:
% 0.12/0.40 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 % Reduced Input Axiom Clauses:
% 0.12/0.40 % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.12/0.40
% 0.12/0.40 % Reduced Input Conjecture Clauses:
% 0.12/0.40 % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.12/0.40 % 3:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),inertia(x0,x4,x1),inertia(x2,x5,x3),survival_chance(x0,x6,x1),survival_chance(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.12/0.40 % 4:1:0:INP:: -> organization(sk2,sk9)
% 0.12/0.40 % 5:1:0:INP:: -> organization(sk3,sk10)
% 0.12/0.40 % 6:1:0:INP:: -> reorganization_free(sk2,sk9,sk9)
% 0.12/0.40 % 7:1:0:INP:: -> reorganization_free(sk3,sk10,sk10)
% 0.12/0.40 % 8:1:0:INP:: -> class(sk2,sk4,sk9)
% 0.12/0.40 % 9:1:0:INP:: -> class(sk3,sk4,sk10)
% 0.12/0.40 % 10:1:0:INP:: -> survival_chance(sk2,sk5,sk9)
% 0.12/0.40 % 11:1:0:INP:: -> survival_chance(sk3,sk6,sk10)
% 0.12/0.40 % 12:1:0:INP:: -> size(sk2,sk7,sk9)
% 0.12/0.40 % 13:1:0:INP:: -> size(sk3,sk8,sk10)
% 0.12/0.40 % 14:1:0:INP:: -> greater(sk8,sk7)
% 0.12/0.40 % 15:1:0:INP:: greater(sk6,sk5) ->
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 35 atoms initially. Used heuristic: lmodel_grow ===
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 % SZS status Unsatisfiable
% 0.12/0.40 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % SPASS-SCL-FOL Statistics:
% 0.12/0.40 % Number of learned clauses: 2
% 0.12/0.40 % Number of propagations: 38
% 0.12/0.40 % Number of decisions: 31
% 0.12/0.40 % Number of resolutions: 16
% 0.12/0.40 % Number of condensations: 0
% 0.12/0.40 % Number of sub resolutions: 0
% 0.12/0.40
% 0.12/0.40 % Solver is done. Empty clause found
% 0.12/0.40
% 0.12/0.40 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.40 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 % Needed: 0:00:00.05
% 0.12/0.40
% 0.12/0.40 % ###
% 0.12/0.40 % ### Pagesize: 8192
% 0.12/0.40 % ### Marksize: 0
% 0.12/0.40 % ### Memory demanded: 1189 KBytes
% 0.12/0.40 % ### Memory freed: 1189 KBytes
% 0.12/0.40 % ### Memory remaining: 0 Bytes
% 0.12/0.40 % ### Pages allocated: 217 Pages
% 0.12/0.40 % ###
%------------------------------------------------------------------------------