%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT010-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 : n011.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:05 AM UTC 2026
% Result : Unsatisfiable 0.39s 0.65s
% Output : Proof 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 21 RR)
% Number of literals : 75 ( 0 equ; 55 neg)
% Maximal clause size : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 50 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a2_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)
| ~ reproducibility(X0,X8,X1)
| ~ reproducibility(X2,X9,X3)
| ~ greater(X9,X8)
| greater(X7,X6) ),
file('theBenchmark.p',a2_FOL_3) ).
% FILE RECORD
cnf(t9_FOL_5,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ reproducibility(X0,X5,X1)
| ~ reproducibility(X2,X6,X3)
| ~ size(X0,X7,X1)
| ~ size(X2,X8,X3)
| ~ greater(X8,X7)
| greater(X6,X5) ),
file('theBenchmark.p',t9_FOL_5) ).
% FILE RECORD
cnf(mp3_1,axiom,
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp3_1) ).
% CNF SPASS RESOLUTION.
cnf(c_22,plain,
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ reproducibility(X0,X5,X1)
| ~ size(X0,X6,X1)
| ~ size(X2,X7,X3)
| ~ greater(X7,X6)
| ~ organization(X2,X3)
| greater(sk1(X3,X2),X5) ),
inference(resolution,[status(thm)],[t9_FOL_5,mp3_1]) ).
% FILE RECORD
cnf(t10_FOL_19,negated_conjecture,
( ~ greater(sk6,sk5)
| ~ greater(sk8,sk7) ),
file('theBenchmark.p',t10_FOL_19) ).
% FILE RECORD
cnf(a2_FOL_2,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reliability(X0,X4,X1)
| ~ reliability(X2,X5,X3)
| ~ accountability(X0,X6,X1)
| ~ accountability(X2,X7,X3)
| ~ reproducibility(X0,X8,X1)
| ~ reproducibility(X2,X9,X3)
| ~ greater(X9,X8)
| greater(X5,X4) ),
file('theBenchmark.p',a2_FOL_2) ).
% CNF SPASS RESOLUTION.
cnf(c_23,plain,
( ~ reliability(X0,X4,X1)
| ~ reliability(X2,X5,X3)
| ~ accountability(X0,X6,X1)
| ~ accountability(X2,X7,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ class(X0,X8,X1)
| ~ class(X2,X8,X3)
| ~ size(X0,X9,X1)
| ~ size(X2,X10,X3)
| ~ greater(X10,X9)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| greater(X5,X4) ),
inference(resolution,[status(thm)],[a2_FOL_2,c_22,mp3_1,mp3_1]) ).
% FILE RECORD
cnf(t10_FOL_13,negated_conjecture,
reliability(sk3,sk6,sk12),
file('theBenchmark.p',t10_FOL_13) ).
% FILE RECORD
cnf(t10_FOL_12,negated_conjecture,
reliability(sk2,sk5,sk11),
file('theBenchmark.p',t10_FOL_12) ).
% FILE RECORD
cnf(t10_FOL_15,negated_conjecture,
accountability(sk3,sk8,sk12),
file('theBenchmark.p',t10_FOL_15) ).
% FILE RECORD
cnf(t10_FOL_14,negated_conjecture,
accountability(sk2,sk7,sk11),
file('theBenchmark.p',t10_FOL_14) ).
% FILE RECORD
cnf(t10_FOL_9,negated_conjecture,
reorganization_free(sk3,sk12,sk12),
file('theBenchmark.p',t10_FOL_9) ).
% FILE RECORD
cnf(t10_FOL_8,negated_conjecture,
reorganization_free(sk2,sk11,sk11),
file('theBenchmark.p',t10_FOL_8) ).
% FILE RECORD
cnf(t10_FOL_11,negated_conjecture,
class(sk3,sk4,sk12),
file('theBenchmark.p',t10_FOL_11) ).
% FILE RECORD
cnf(t10_FOL_10,negated_conjecture,
class(sk2,sk4,sk11),
file('theBenchmark.p',t10_FOL_10) ).
% FILE RECORD
cnf(t10_FOL_17,negated_conjecture,
size(sk3,sk10,sk12),
file('theBenchmark.p',t10_FOL_17) ).
% FILE RECORD
cnf(t10_FOL_16,negated_conjecture,
size(sk2,sk9,sk11),
file('theBenchmark.p',t10_FOL_16) ).
% FILE RECORD
cnf(t10_FOL_7,negated_conjecture,
organization(sk3,sk12),
file('theBenchmark.p',t10_FOL_7) ).
% FILE RECORD
cnf(t10_FOL_6,negated_conjecture,
organization(sk2,sk11),
file('theBenchmark.p',t10_FOL_6) ).
% FILE RECORD
cnf(t10_FOL_18,negated_conjecture,
greater(sk10,sk9),
file('theBenchmark.p',t10_FOL_18) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
$false,
inference(resolution,[status(thm)],[a2_FOL_3,c_22,t10_FOL_19,mp3_1,mp3_1,c_23,t10_FOL_13,t10_FOL_12,t10_FOL_15,t10_FOL_14,t10_FOL_9,t10_FOL_8,t10_FOL_11,t10_FOL_10,t10_FOL_17,t10_FOL_16,t10_FOL_7,t10_FOL_6,t10_FOL_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT010-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 : n011.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.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 11:48:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % Input Clauses:
% 0.10/0.37 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.10/0.37 % 2:10: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x9,x8) -> greater(x5,x4)
% 0.10/0.37 % 3:10: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x9,x8) -> greater(x7,x6)
% 0.10/0.37 % 4: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.10/0.37 % 5:12:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),class(x0,x4,x1),class(x2,x4,x3),reproducibility(x0,x5,x1),reproducibility(x2,x6,x3),size(x0,x7,x1),size(x2,x8,x3),greater(x8,x7) -> greater(x6,x5)
% 0.10/0.37 % 6:1:0:INP:: -> organization(sk2,sk11)
% 0.10/0.37 % 7:1:0:INP:: -> organization(sk3,sk12)
% 0.10/0.37 % 8:1:0:INP:: -> reorganization_free(sk2,sk11,sk11)
% 0.10/0.37 % 9:1:0:INP:: -> reorganization_free(sk3,sk12,sk12)
% 0.10/0.37 % 10:1:0:INP:: -> class(sk2,sk4,sk11)
% 0.10/0.37 % 11:1:0:INP:: -> class(sk3,sk4,sk12)
% 0.10/0.37 % 12:1:0:INP:: -> reliability(sk2,sk5,sk11)
% 0.10/0.37 % 13:1:0:INP:: -> reliability(sk3,sk6,sk12)
% 0.10/0.37 % 14:1:0:INP:: -> accountability(sk2,sk7,sk11)
% 0.10/0.37 % 15:1:0:INP:: -> accountability(sk3,sk8,sk12)
% 0.10/0.37 % 16:1:0:INP:: -> size(sk2,sk9,sk11)
% 0.10/0.37 % 17:1:0:INP:: -> size(sk3,sk10,sk12)
% 0.10/0.37 % 18:1:0:INP:: -> greater(sk10,sk9)
% 0.10/0.37 % 19:2:0:INP:: greater(sk6,sk5),greater(sk8,sk7) ->
% 0.10/0.37
% 0.10/0.37 % Predicates: organization reproducibility reliability accountability greater reorganization_free class size
% 0.10/0.37 % Fol Constants: sk2 sk11 sk3 sk12 sk4 sk5 sk6 sk7 sk8 sk9 sk10
% 0.10/0.37 % Fol Functions: sk1
% 0.10/0.37 % Problem Properties:
% 0.10/0.37 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % Reduced Input Axiom Clauses:
% 0.10/0.37 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.10/0.37
% 0.10/0.37 % Reduced Input Conjecture Clauses:
% 0.10/0.37 % 2:10: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x9,x8) -> greater(x5,x4)
% 0.10/0.37 % 3:10: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x9,x8) -> greater(x7,x6)
% 0.10/0.37 % 4: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),reproducibility(x0,x8,x1),reproducibility(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.10/0.37 % 5:12:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),class(x0,x4,x1),class(x2,x4,x3),reproducibility(x0,x5,x1),reproducibility(x2,x6,x3),size(x0,x7,x1),size(x2,x8,x3),greater(x8,x7) -> greater(x6,x5)
% 0.10/0.37 % 6:1:0:INP:: -> organization(sk2,sk11)
% 0.10/0.37 % 7:1:0:INP:: -> organization(sk3,sk12)
% 0.10/0.37 % 8:1:0:INP:: -> reorganization_free(sk2,sk11,sk11)
% 0.10/0.37 % 9:1:0:INP:: -> reorganization_free(sk3,sk12,sk12)
% 0.10/0.37 % 10:1:0:INP:: -> class(sk2,sk4,sk11)
% 0.10/0.37 % 11:1:0:INP:: -> class(sk3,sk4,sk12)
% 0.10/0.37 % 12:1:0:INP:: -> reliability(sk2,sk5,sk11)
% 0.10/0.37 % 13:1:0:INP:: -> reliability(sk3,sk6,sk12)
% 0.10/0.37 % 14:1:0:INP:: -> accountability(sk2,sk7,sk11)
% 0.10/0.37 % 15:1:0:INP:: -> accountability(sk3,sk8,sk12)
% 0.10/0.37 % 16:1:0:INP:: -> size(sk2,sk9,sk11)
% 0.10/0.37 % 17:1:0:INP:: -> size(sk3,sk10,sk12)
% 0.10/0.37 % 18:1:0:INP:: -> greater(sk10,sk9)
% 0.10/0.37 % 19:2:0:INP:: greater(sk6,sk5),greater(sk8,sk7) ->
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 59 atoms initially. Used heuristic: lmodel_grow ===
% 0.39/0.65
% 0.39/0.65
% 0.39/0.65
% 0.39/0.65 % SZS status Unsatisfiable
% 0.39/0.65 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.65
% 0.39/0.65 % SPASS-SCL-FOL Statistics:
% 0.39/0.65 % Number of learned clauses: 4
% 0.39/0.65 % Number of propagations: 81
% 0.39/0.65 % Number of decisions: 61
% 0.39/0.65 % Number of resolutions: 26
% 0.39/0.65 % Number of condensations: 2
% 0.39/0.65 % Number of sub resolutions: 0
% 0.39/0.65
% 0.39/0.65 % Solver is done. Empty clause found
% 0.39/0.65
% 0.39/0.65 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.39/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 0.39/0.65 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.39/0.65
% 0.39/0.65
% 0.39/0.65 % Needed: 0:00:00.28
% 0.39/0.65
% 0.39/0.65 % ###
% 0.39/0.65 % ### Pagesize: 8192
% 0.39/0.65 % ### Marksize: 0
% 0.39/0.65 % ### Memory demanded: 3874 KBytes
% 0.39/0.65 % ### Memory freed: 3874 KBytes
% 0.39/0.65 % ### Memory remaining: 0 Bytes
% 0.39/0.65 % ### Pages allocated: 562 Pages
% 0.39/0.65 % ###
%------------------------------------------------------------------------------