%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT002-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 : n026.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.14s 0.38s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 42 ( 0 equ; 29 neg)
% Maximal clause size : 11 ( 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 : 30 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(a3_FOL_4,hypothesis,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ inertia(X0,X6,X1)
| ~ inertia(X2,X7,X3)
| ~ greater(X5,X4)
| greater(X7,X6) ),
file('theBenchmark.p',a3_FOL_4) ).
% FILE RECORD
cnf(a4_FOL_6,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_6) ).
% FILE RECORD
cnf(mp3_1,axiom,
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
file('theBenchmark.p',mp3_1) ).
% FILE RECORD
cnf(mp4_2,axiom,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
file('theBenchmark.p',mp4_2) ).
% FILE RECORD
cnf(mp4_3,axiom,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
file('theBenchmark.p',mp4_3) ).
% CNF SPASS RESOLUTION.
cnf(c_15,plain,
( ~ organization(X0,X1)
| ~ reproducibility(X0,X2,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(X4,X5,X6)
| ~ organization(X4,X7)
| ~ reorganization_free(X4,X7,X6)
| ~ reproducibility(X4,X2,X7)
| ~ greater(X6,X7)
| ~ organization(X4,X6)
| ~ reorganization_free(X0,X1,X8)
| greater(X5,X3) ),
inference(resolution,[status(thm)],[a3_FOL_4,a4_FOL_6,mp3_1,mp4_2,mp4_3]) ).
% FILE RECORD
cnf(t2_FOL_9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('theBenchmark.p',t2_FOL_9) ).
% FILE RECORD
cnf(t2_FOL_11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('theBenchmark.p',t2_FOL_11) ).
% FILE RECORD
cnf(t2_FOL_10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('theBenchmark.p',t2_FOL_10) ).
% FILE RECORD
cnf(t2_FOL_13,negated_conjecture,
~ greater(sk4,sk3),
file('theBenchmark.p',t2_FOL_13) ).
% FILE RECORD
cnf(t2_FOL_8,negated_conjecture,
organization(sk2,sk6),
file('theBenchmark.p',t2_FOL_8) ).
% FILE RECORD
cnf(t2_FOL_7,negated_conjecture,
organization(sk2,sk5),
file('theBenchmark.p',t2_FOL_7) ).
% FILE RECORD
cnf(t2_FOL_12,negated_conjecture,
greater(sk6,sk5),
file('theBenchmark.p',t2_FOL_12) ).
% CNF SPASS RESOLUTION.
cnf(c_16,plain,
$false,
inference(resolution,[status(thm)],[c_15,mp3_1,t2_FOL_9,t2_FOL_11,t2_FOL_10,t2_FOL_13,t2_FOL_8,t2_FOL_7,t2_FOL_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT002-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.35 % Computer : n026.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % 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:36:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38
% 0.14/0.38 % Input Clauses:
% 0.14/0.38 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.14/0.38 % 2:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.14/0.38 % 3:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.14/0.38 % 4:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),reproducibility(x0,x4,x1),reproducibility(x2,x5,x3),inertia(x0,x6,x1),inertia(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.14/0.38 % 5:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),reproducibility(x0,x4,x1),reproducibility(x2,x5,x3),inertia(x0,x6,x1),inertia(x2,x7,x3),greater(x7,x6) -> greater(x5,x4)
% 0.14/0.38 % 6: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.14/0.38 % 7:1:0:INP:: -> organization(sk2,sk5)
% 0.14/0.38 % 8:1:0:INP:: -> organization(sk2,sk6)
% 0.14/0.38 % 9:1:0:INP:: -> reorganization_free(sk2,sk5,sk6)
% 0.14/0.38 % 10:1:0:INP:: -> inertia(sk2,sk3,sk5)
% 0.14/0.38 % 11:1:0:INP:: -> inertia(sk2,sk4,sk6)
% 0.14/0.38 % 12:1:0:INP:: -> greater(sk6,sk5)
% 0.14/0.38 % 13:1:0:INP:: greater(sk4,sk3) ->
% 0.14/0.38
% 0.14/0.38 % Predicates: organization reproducibility reorganization_free inertia greater
% 0.14/0.38 % Fol Constants: sk2 sk5 sk6 sk3 sk4
% 0.14/0.38 % Fol Functions: sk1
% 0.14/0.38 % Problem Properties:
% 0.14/0.38 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % Reduced Input Axiom Clauses:
% 0.14/0.38 % 1:2:2:INP:TopTop: organization(x0,x1) -> reproducibility(x0,sk1(x1,x0),x1)
% 0.14/0.38 % 2:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.14/0.38 % 3:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.14/0.38
% 0.14/0.38 % Reduced Input Conjecture Clauses:
% 0.14/0.38 % 4:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),reproducibility(x0,x4,x1),reproducibility(x2,x5,x3),inertia(x0,x6,x1),inertia(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.14/0.38 % 5:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),reproducibility(x0,x4,x1),reproducibility(x2,x5,x3),inertia(x0,x6,x1),inertia(x2,x7,x3),greater(x7,x6) -> greater(x5,x4)
% 0.14/0.38 % 6: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.14/0.38 % 7:1:0:INP:: -> organization(sk2,sk5)
% 0.14/0.38 % 8:1:0:INP:: -> organization(sk2,sk6)
% 0.14/0.38 % 9:1:0:INP:: -> reorganization_free(sk2,sk5,sk6)
% 0.14/0.38 % 10:1:0:INP:: -> inertia(sk2,sk3,sk5)
% 0.14/0.38 % 11:1:0:INP:: -> inertia(sk2,sk4,sk6)
% 0.14/0.38 % 12:1:0:INP:: -> greater(sk6,sk5)
% 0.14/0.38 % 13:1:0:INP:: greater(sk4,sk3) ->
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 39 atoms initially. Used heuristic: lmodel_grow ===
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % SZS status Unsatisfiable
% 0.14/0.38 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38
% 0.14/0.38 % SPASS-SCL-FOL Statistics:
% 0.14/0.38 % Number of learned clauses: 2
% 0.14/0.38 % Number of propagations: 35
% 0.14/0.38 % Number of decisions: 23
% 0.14/0.38 % Number of resolutions: 13
% 0.14/0.38 % Number of condensations: 1
% 0.14/0.38 % Number of sub resolutions: 0
% 0.14/0.38
% 0.14/0.38 % Solver is done. Empty clause found
% 0.14/0.38
% 0.14/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % Needed: 0:00:00.02
% 0.14/0.38
% 0.14/0.38 % ###
% 0.14/0.38 % ### Pagesize: 8192
% 0.14/0.38 % ### Marksize: 0
% 0.14/0.38 % ### Memory demanded: 791 KBytes
% 0.14/0.38 % ### Memory freed: 791 KBytes
% 0.14/0.38 % ### Memory remaining: 0 Bytes
% 0.14/0.38 % ### Pages allocated: 169 Pages
% 0.14/0.38 % ###
%------------------------------------------------------------------------------