%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT006-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n027.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.48s 0.70s
% Output : Proof 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 61 ( 0 equ; 47 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a4_FOL_5,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('theBenchmark.p',a4_FOL_5) ).
% 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(mp3_1,axiom,
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp3_1) ).
% 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_16,plain,
( ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X2)
| ~ greater(X2,X1)
| ~ organization(X4,X5)
| ~ reliability(X0,X6,X1)
| ~ reliability(X4,X7,X5)
| ~ accountability(X0,X8,X1)
| ~ accountability(X4,X9,X5)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X0,X1)
| greater(X7,X6) ),
inference(resolution,[status(thm)],[a4_FOL_5,a2_FOL_2,mp3_1]) ).
% FILE RECORD
cnf(t6_FOL_14,negated_conjecture,
( ~ greater(sk4,sk3)
| ~ greater(sk6,sk5) ),
file('theBenchmark.p',t6_FOL_14) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ reorganization_free(X0,X2,X1)
| ~ greater(X1,X2)
| ~ reliability(X0,sk3,X2)
| ~ reliability(X0,sk4,X1)
| ~ accountability(X0,X3,X2)
| ~ accountability(X0,X4,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ greater(sk6,sk5) ),
inference(resolution,[status(thm)],[c_16,mp3_1,t6_FOL_14]) ).
% FILE RECORD
cnf(t6_FOL_8,negated_conjecture,
reorganization_free(sk2,sk7,sk8),
file('theBenchmark.p',t6_FOL_8) ).
% FILE RECORD
cnf(t6_FOL_9,negated_conjecture,
reliability(sk2,sk3,sk7),
file('theBenchmark.p',t6_FOL_9) ).
% FILE RECORD
cnf(t6_FOL_10,negated_conjecture,
reliability(sk2,sk4,sk8),
file('theBenchmark.p',t6_FOL_10) ).
% FILE RECORD
cnf(t6_FOL_11,negated_conjecture,
accountability(sk2,sk5,sk7),
file('theBenchmark.p',t6_FOL_11) ).
% FILE RECORD
cnf(t6_FOL_12,negated_conjecture,
accountability(sk2,sk6,sk8),
file('theBenchmark.p',t6_FOL_12) ).
% FILE RECORD
cnf(t6_FOL_6,negated_conjecture,
organization(sk2,sk7),
file('theBenchmark.p',t6_FOL_6) ).
% FILE RECORD
cnf(t6_FOL_7,negated_conjecture,
organization(sk2,sk8),
file('theBenchmark.p',t6_FOL_7) ).
% FILE RECORD
cnf(t6_FOL_13,negated_conjecture,
greater(sk8,sk7),
file('theBenchmark.p',t6_FOL_13) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
$false,
inference(resolution,[status(thm)],[a4_FOL_5,a2_FOL_3,mp3_1,c_17,mp3_1,t6_FOL_8,t6_FOL_9,t6_FOL_10,t6_FOL_11,t6_FOL_12,t6_FOL_6,t6_FOL_7,t6_FOL_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT006-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n027.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:46:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.70
% 0.48/0.70 % Input Clauses:
% 0.48/0.70 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.48/0.70 % 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.48/0.70 % 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.48/0.70 % 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.48/0.70 % 5:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),reproducibility(x0,x3,x1),reproducibility(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.48/0.70 % 6:1:0:INP:: -> organization(sk2,sk7)
% 0.48/0.70 % 7:1:0:INP:: -> organization(sk2,sk8)
% 0.48/0.70 % 8:1:0:INP:: -> reorganization_free(sk2,sk7,sk8)
% 0.48/0.70 % 9:1:0:INP:: -> reliability(sk2,sk3,sk7)
% 0.48/0.70 % 10:1:0:INP:: -> reliability(sk2,sk4,sk8)
% 0.48/0.70 % 11:1:0:INP:: -> accountability(sk2,sk5,sk7)
% 0.48/0.70 % 12:1:0:INP:: -> accountability(sk2,sk6,sk8)
% 0.48/0.70 % 13:1:0:INP:: -> greater(sk8,sk7)
% 0.48/0.70 % 14:2:0:INP:: greater(sk4,sk3),greater(sk6,sk5) ->
% 0.48/0.70
% 0.48/0.70 % Predicates: organization reproducibility reliability accountability greater reorganization_free
% 0.48/0.70 % Fol Constants: sk2 sk7 sk8 sk3 sk4 sk5 sk6
% 0.48/0.70 % Fol Functions: sk1
% 0.48/0.70 % Problem Properties:
% 0.48/0.70 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70 % Reduced Input Axiom Clauses:
% 0.48/0.70 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.48/0.70
% 0.48/0.70 % Reduced Input Conjecture Clauses:
% 0.48/0.70 % 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.48/0.70 % 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.48/0.70 % 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.48/0.70 % 5:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),reproducibility(x0,x3,x1),reproducibility(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.48/0.70 % 6:1:0:INP:: -> organization(sk2,sk7)
% 0.48/0.70 % 7:1:0:INP:: -> organization(sk2,sk8)
% 0.48/0.70 % 8:1:0:INP:: -> reorganization_free(sk2,sk7,sk8)
% 0.48/0.70 % 9:1:0:INP:: -> reliability(sk2,sk3,sk7)
% 0.48/0.70 % 10:1:0:INP:: -> reliability(sk2,sk4,sk8)
% 0.48/0.70 % 11:1:0:INP:: -> accountability(sk2,sk5,sk7)
% 0.48/0.70 % 12:1:0:INP:: -> accountability(sk2,sk6,sk8)
% 0.48/0.70 % 13:1:0:INP:: -> greater(sk8,sk7)
% 0.48/0.70 % 14:2:0:INP:: greater(sk4,sk3),greater(sk6,sk5) ->
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 49 atoms initially. Used heuristic: lmodel_grow ===
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70 % SZS status Unsatisfiable
% 0.48/0.70 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.70
% 0.48/0.70 % SPASS-SCL-FOL Statistics:
% 0.48/0.70 % Number of learned clauses: 4
% 0.48/0.70 % Number of propagations: 112
% 0.48/0.70 % Number of decisions: 47
% 0.48/0.70 % Number of resolutions: 18
% 0.48/0.70 % Number of condensations: 0
% 0.48/0.70 % Number of sub resolutions: 0
% 0.48/0.70
% 0.48/0.70 % Solver is done. Empty clause found
% 0.48/0.70
% 0.48/0.70 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.48/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.70 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.48/0.70
% 0.48/0.70
% 0.48/0.70 % Needed: 0:00:00.34
% 0.48/0.70
% 0.48/0.70 % ###
% 0.48/0.70 % ### Pagesize: 8192
% 0.48/0.70 % ### Marksize: 0
% 0.48/0.70 % ### Memory demanded: 4191 KBytes
% 0.48/0.70 % ### Memory freed: 4191 KBytes
% 0.48/0.70 % ### Memory remaining: 0 Bytes
% 0.48/0.70 % ### Pages allocated: 595 Pages
% 0.48/0.70 % ###
%------------------------------------------------------------------------------