%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT003-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 : n017.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:03 AM UTC 2026
% Result : Unsatisfiable 0.03s 0.37s
% Output : Proof 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 16 RR)
% Number of literals : 57 ( 0 equ; 42 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(t1_FOL_4,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_4) ).
% FILE RECORD
cnf(mp4_1,axiom,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
file('theBenchmark.p',mp4_1) ).
% FILE RECORD
cnf(mp5_3,axiom,
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp5_3) ).
% FILE RECORD
cnf(t2_FOL_5,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('theBenchmark.p',t2_FOL_5) ).
% CNF SPASS RESOLUTION.
cnf(c_13,plain,
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| ~ greater(X2,X1)
| ~ organization(X0,X2)
| greater(sk1(X2,X0),X3) ),
inference(resolution,[status(thm)],[t2_FOL_5,mp5_3]) ).
% CNF SPASS RESOLUTION.
cnf(c_14,plain,
( ~ organization(X0,X1)
| ~ inertia(X0,X4,X1)
| ~ survival_chance(X0,X5,X1)
| ~ survival_chance(X2,X6,X3)
| ~ reorganization_free(X0,X1,X7)
| ~ reorganization_free(X2,X3,X8)
| ~ organization(X2,X9)
| ~ reorganization_free(X2,X9,X3)
| ~ inertia(X2,X4,X9)
| ~ greater(X3,X9)
| ~ organization(X2,X3)
| greater(X6,X5) ),
inference(resolution,[status(thm)],[t1_FOL_4,mp4_1,mp4_1,mp5_3,c_13]) ).
% CNF SPASS RESOLUTION.
cnf(c_15,plain,
( ~ survival_chance(X0,X1,X2)
| ~ survival_chance(X0,X3,X4)
| ~ reorganization_free(X0,X4,X5)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ organization(X0,X4)
| ~ organization(X0,X2)
| greater(X3,X1) ),
inference(resolution,[status(thm)],[c_14,mp5_3]) ).
% FILE RECORD
cnf(mp4_2,axiom,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
file('theBenchmark.p',mp4_2) ).
% FILE RECORD
cnf(t3_FOL_9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('theBenchmark.p',t3_FOL_9) ).
% FILE RECORD
cnf(t3_FOL_8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('theBenchmark.p',t3_FOL_8) ).
% FILE RECORD
cnf(t3_FOL_10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('theBenchmark.p',t3_FOL_10) ).
% FILE RECORD
cnf(t3_FOL_12,negated_conjecture,
~ greater(sk4,sk3),
file('theBenchmark.p',t3_FOL_12) ).
% FILE RECORD
cnf(t3_FOL_7,negated_conjecture,
organization(sk2,sk6),
file('theBenchmark.p',t3_FOL_7) ).
% FILE RECORD
cnf(t3_FOL_6,negated_conjecture,
organization(sk2,sk5),
file('theBenchmark.p',t3_FOL_6) ).
% FILE RECORD
cnf(t3_FOL_11,negated_conjecture,
greater(sk6,sk5),
file('theBenchmark.p',t3_FOL_11) ).
% CNF SPASS RESOLUTION.
cnf(c_16,plain,
$false,
inference(resolution,[status(thm)],[c_15,mp4_2,t3_FOL_9,t3_FOL_8,t3_FOL_10,t3_FOL_12,t3_FOL_7,t3_FOL_6,t3_FOL_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT003-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.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Mon Sep 7 11:30:24 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.37
% 0.03/0.37 % Input Clauses:
% 0.03/0.37 % 1:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.03/0.37 % 2:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.03/0.37 % 3:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.03/0.37 % 4: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.03/0.37 % 5:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),inertia(x0,x3,x1),inertia(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.03/0.37 % 6:1:0:INP:: -> organization(sk2,sk5)
% 0.03/0.37 % 7:1:0:INP:: -> organization(sk2,sk6)
% 0.03/0.37 % 8:1:0:INP:: -> reorganization_free(sk2,sk5,sk6)
% 0.03/0.37 % 9:1:0:INP:: -> survival_chance(sk2,sk3,sk5)
% 0.03/0.37 % 10:1:0:INP:: -> survival_chance(sk2,sk4,sk6)
% 0.03/0.37 % 11:1:0:INP:: -> greater(sk6,sk5)
% 0.03/0.37 % 12:1:0:INP:: greater(sk4,sk3) ->
% 0.03/0.37
% 0.03/0.37 % Predicates: reorganization_free organization inertia survival_chance greater
% 0.03/0.37 % Fol Constants: sk2 sk5 sk6 sk3 sk4
% 0.03/0.37 % Fol Functions: sk1
% 0.03/0.37 % Problem Properties:
% 0.03/0.37 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.03/0.37
% 0.03/0.37
% 0.03/0.37 % Reduced Input Axiom Clauses:
% 0.03/0.37 % 1:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.03/0.37 % 2:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.03/0.37 % 3:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,sk1(x1,x0),x1)
% 0.03/0.37
% 0.03/0.37 % Reduced Input Conjecture Clauses:
% 0.03/0.37 % 4: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.03/0.37 % 5:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),inertia(x0,x3,x1),inertia(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.03/0.37 % 6:1:0:INP:: -> organization(sk2,sk5)
% 0.03/0.37 % 7:1:0:INP:: -> organization(sk2,sk6)
% 0.03/0.37 % 8:1:0:INP:: -> reorganization_free(sk2,sk5,sk6)
% 0.03/0.37 % 9:1:0:INP:: -> survival_chance(sk2,sk3,sk5)
% 0.03/0.37 % 10:1:0:INP:: -> survival_chance(sk2,sk4,sk6)
% 0.03/0.37 % 11:1:0:INP:: -> greater(sk6,sk5)
% 0.03/0.37 % 12:1:0:INP:: greater(sk4,sk3) ->
% 0.03/0.37
% 0.03/0.37
% 0.03/0.37 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 31 atoms initially. Used heuristic: lmodel_grow ===
% 0.03/0.37
% 0.03/0.37
% 0.03/0.37
% 0.03/0.37 % SZS status Unsatisfiable
% 0.03/0.37 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.37
% 0.03/0.37 % SPASS-SCL-FOL Statistics:
% 0.03/0.37 % Number of learned clauses: 3
% 0.03/0.37 % Number of propagations: 31
% 0.03/0.37 % Number of decisions: 19
% 0.03/0.37 % Number of resolutions: 14
% 0.03/0.37 % Number of condensations: 1
% 0.03/0.37 % Number of sub resolutions: 0
% 0.03/0.37
% 0.03/0.37 % Solver is done. Empty clause found
% 0.03/0.37
% 0.03/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.03/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.37
% 0.03/0.37
% 0.03/0.37 % Needed: 0:00:00.01
% 0.03/0.37
% 0.03/0.37 % ###
% 0.03/0.37 % ### Pagesize: 8192
% 0.03/0.37 % ### Marksize: 0
% 0.03/0.37 % ### Memory demanded: 544 KBytes
% 0.03/0.37 % ### Memory freed: 544 KBytes
% 0.03/0.37 % ### Memory remaining: 0 Bytes
% 0.03/0.37 % ### Pages allocated: 140 Pages
% 0.03/0.37 % ###
%------------------------------------------------------------------------------