%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT004-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 : n007.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.79s 1.07s
% Output : Proof 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 19 ( 10 unt; 6 nHn; 19 RR)
% Number of literals : 103 ( 0 equ; 73 neg)
% Maximal clause size : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 75 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a6_FOL_5,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X1)
| ~ accountability(X0,X8,X2)
| ~ greater(X2,X1)
| greater(X3,X1)
| greater(X2,X4)
| greater(X7,X8) ),
file('theBenchmark.p',a6_FOL_5) ).
% FILE RECORD
cnf(a6_FOL_4,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X1)
| ~ accountability(X0,X8,X2)
| ~ greater(X2,X1)
| greater(X3,X1)
| greater(X2,X4)
| greater(X5,X6) ),
file('theBenchmark.p',a6_FOL_4) ).
% FILE RECORD
cnf(a1_FOL_3,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reliability(X0,X4,X1)
| ~ reliability(X2,X5,X3)
| ~ accountability(X0,X6,X1)
| ~ accountability(X2,X7,X3)
| ~ survival_chance(X0,X8,X1)
| ~ survival_chance(X2,X9,X3)
| ~ greater(X5,X4)
| ~ greater(X7,X6)
| greater(X9,X8) ),
file('theBenchmark.p',a1_FOL_3) ).
% FILE RECORD
cnf(mp1_1,axiom,
( ~ organization(X0,X1)
| reliability(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp1_1) ).
% CNF SPASS RESOLUTION.
cnf(c_15,plain,
( ~ organization(X0,X1)
| ~ reorganization(X0,X2,X3)
| ~ reliability(X0,X4,X1)
| ~ accountability(X0,X5,X1)
| ~ greater(X1,X6)
| ~ organization(X7,X8)
| ~ reliability(X7,X4,X8)
| ~ accountability(X7,X9,X8)
| ~ accountability(X0,X10,X6)
| ~ survival_chance(X7,X11,X8)
| ~ survival_chance(X0,X12,X6)
| ~ greater(X10,X9)
| ~ organization(X0,X6)
| greater(X2,X6)
| greater(X1,X3)
| greater(X12,X11) ),
inference(resolution,[status(thm)],[a6_FOL_4,a1_FOL_3,mp1_1]) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ reorganization(X0,X1,X2)
| ~ greater(X3,X4)
| ~ accountability(X0,X5,X3)
| ~ accountability(X0,X6,X4)
| ~ survival_chance(X0,X7,X3)
| ~ survival_chance(X0,X8,X4)
| ~ greater(X6,X5)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X1,X4)
| greater(X3,X2)
| greater(X8,X7) ),
inference(resolution,[status(thm)],[c_15,mp1_1]) ).
% FILE RECORD
cnf(mp2_2,axiom,
( ~ organization(X0,X1)
| accountability(X0,sk2(X1,X0),X1) ),
file('theBenchmark.p',mp2_2) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ organization(X0,X1)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X1)
| ~ greater(X2,X1)
| ~ reorganization(X0,X8,X9)
| ~ greater(X2,X10)
| ~ accountability(X0,X7,X10)
| ~ survival_chance(X0,X11,X2)
| ~ survival_chance(X0,X12,X10)
| ~ organization(X0,X10)
| ~ organization(X0,X2)
| greater(X3,X1)
| greater(X2,X4)
| greater(X8,X10)
| greater(X2,X9)
| greater(X12,X11) ),
inference(resolution,[status(thm)],[a6_FOL_5,c_17,mp2_2]) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
( ~ reorganization(X0,X1,X2)
| ~ greater(X3,X4)
| ~ accountability(X0,X5,X4)
| ~ survival_chance(X0,X6,X3)
| ~ survival_chance(X0,X7,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X1,X4)
| greater(X3,X2)
| greater(X7,X6) ),
inference(resolution,[status(thm)],[c_18,mp1_1,mp1_1]) ).
% FILE RECORD
cnf(t4_FOL_10,negated_conjecture,
survival_chance(sk3,sk5,sk7),
file('theBenchmark.p',t4_FOL_10) ).
% FILE RECORD
cnf(t4_FOL_9,negated_conjecture,
survival_chance(sk3,sk4,sk6),
file('theBenchmark.p',t4_FOL_9) ).
% FILE RECORD
cnf(t4_FOL_8,negated_conjecture,
reorganization(sk3,sk8,sk9),
file('theBenchmark.p',t4_FOL_8) ).
% FILE RECORD
cnf(t4_FOL_11,negated_conjecture,
~ greater(sk8,sk6),
file('theBenchmark.p',t4_FOL_11) ).
% FILE RECORD
cnf(t4_FOL_13,negated_conjecture,
~ greater(sk7,sk9),
file('theBenchmark.p',t4_FOL_13) ).
% FILE RECORD
cnf(t4_FOL_14,negated_conjecture,
~ greater(sk4,sk5),
file('theBenchmark.p',t4_FOL_14) ).
% FILE RECORD
cnf(t4_FOL_7,negated_conjecture,
organization(sk3,sk7),
file('theBenchmark.p',t4_FOL_7) ).
% FILE RECORD
cnf(t4_FOL_6,negated_conjecture,
organization(sk3,sk6),
file('theBenchmark.p',t4_FOL_6) ).
% FILE RECORD
cnf(t4_FOL_12,negated_conjecture,
greater(sk7,sk6),
file('theBenchmark.p',t4_FOL_12) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
$false,
inference(resolution,[status(thm)],[c_19,mp2_2,t4_FOL_10,t4_FOL_9,t4_FOL_8,t4_FOL_11,t4_FOL_13,t4_FOL_14,t4_FOL_7,t4_FOL_6,t4_FOL_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT004-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.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 11:33:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.79/1.07
% 0.79/1.07 % Input Clauses:
% 0.79/1.07 % 1:2:2:INP:TopTop: organization(x0,x1) -> reliability(x0,sk1(x1,x0),x1)
% 0.79/1.07 % 2:2:2:INP:TopTop: organization(x0,x1) -> accountability(x0,sk2(x1,x0),x1)
% 0.79/1.07 % 3:11:10:INP:TopTopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reliability(x0,x4,x1),reliability(x2,x5,x3),accountability(x0,x6,x1),accountability(x2,x7,x3),survival_chance(x0,x8,x1),survival_chance(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.79/1.07 % 4:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),greater(x5,x6)
% 0.79/1.07 % 5:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),greater(x7,x8)
% 0.79/1.07 % 6:1:0:INP:: -> organization(sk3,sk6)
% 0.79/1.07 % 7:1:0:INP:: -> organization(sk3,sk7)
% 0.79/1.07 % 8:1:0:INP:: -> reorganization(sk3,sk8,sk9)
% 0.79/1.07 % 9:1:0:INP:: -> survival_chance(sk3,sk4,sk6)
% 0.79/1.07 % 10:1:0:INP:: -> survival_chance(sk3,sk5,sk7)
% 0.79/1.07 % 11:1:0:INP:: greater(sk8,sk6) ->
% 0.79/1.07 % 12:1:0:INP:: -> greater(sk7,sk6)
% 0.79/1.07 % 13:1:0:INP:: greater(sk7,sk9) ->
% 0.79/1.07 % 14:1:0:INP:: greater(sk4,sk5) ->
% 0.79/1.07
% 0.79/1.07 % Predicates: organization reliability accountability survival_chance greater reorganization
% 0.79/1.07 % Fol Constants: sk3 sk6 sk7 sk8 sk9 sk4 sk5
% 0.79/1.07 % Fol Functions: sk1 sk2
% 0.79/1.07 % Problem Properties:
% 0.79/1.07 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.79/1.07
% 0.79/1.07
% 0.79/1.07 % Reduced Input Axiom Clauses:
% 0.79/1.07 % 1:2:2:INP:TopTop: organization(x0,x1) -> reliability(x0,sk1(x1,x0),x1)
% 0.79/1.07 % 2:2:2:INP:TopTop: organization(x0,x1) -> accountability(x0,sk2(x1,x0),x1)
% 0.79/1.07
% 0.79/1.07 % Reduced Input Conjecture Clauses:
% 0.79/1.07 % 3:11:10:INP:TopTopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reliability(x0,x4,x1),reliability(x2,x5,x3),accountability(x0,x6,x1),accountability(x2,x7,x3),survival_chance(x0,x8,x1),survival_chance(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.79/1.07 % 4:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),greater(x5,x6)
% 0.79/1.07 % 5:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),greater(x7,x8)
% 0.79/1.07 % 6:1:0:INP:: -> organization(sk3,sk6)
% 0.79/1.07 % 7:1:0:INP:: -> organization(sk3,sk7)
% 0.79/1.07 % 8:1:0:INP:: -> reorganization(sk3,sk8,sk9)
% 0.79/1.07 % 9:1:0:INP:: -> survival_chance(sk3,sk4,sk6)
% 0.79/1.07 % 10:1:0:INP:: -> survival_chance(sk3,sk5,sk7)
% 0.79/1.07 % 11:1:0:INP:: greater(sk8,sk6) ->
% 0.79/1.07 % 12:1:0:INP:: -> greater(sk7,sk6)
% 0.79/1.07 % 13:1:0:INP:: greater(sk7,sk9) ->
% 0.79/1.07 % 14:1:0:INP:: greater(sk4,sk5) ->
% 0.79/1.07
% 0.79/1.07
% 0.79/1.07 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 45 atoms initially. Used heuristic: lmodel_grow ===
% 0.79/1.07
% 0.79/1.07
% 0.79/1.07
% 0.79/1.07 % SZS status Unsatisfiable
% 0.79/1.07 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.79/1.07
% 0.79/1.07 % SPASS-SCL-FOL Statistics:
% 0.79/1.07 % Number of learned clauses: 5
% 0.79/1.07 % Number of propagations: 116
% 0.79/1.07 % Number of decisions: 72
% 0.79/1.07 % Number of resolutions: 18
% 0.79/1.07 % Number of condensations: 3
% 0.79/1.07 % Number of sub resolutions: 0
% 0.79/1.07
% 0.79/1.07 % Solver is done. Empty clause found
% 0.79/1.07
% 0.79/1.07 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.79/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 0.79/1.08 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.79/1.08
% 0.79/1.08
% 0.79/1.08 % Needed: 0:00:00.71
% 0.79/1.08
% 0.79/1.08 % ###
% 0.79/1.08 % ### Pagesize: 8192
% 0.79/1.08 % ### Marksize: 0
% 0.79/1.08 % ### Memory demanded: 6311 KBytes
% 0.79/1.08 % ### Memory freed: 6311 KBytes
% 0.79/1.08 % ### Memory remaining: 0 Bytes
% 0.79/1.08 % ### Pages allocated: 860 Pages
% 0.79/1.08 % ###
%------------------------------------------------------------------------------