%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT002-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 : Sun Sep 27 08:02:02 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.67s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 21 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 177 ( 90 ~; 87 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 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 : 74 ( 2 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp3_1,axiom,
! [VAR_0,VAR_1] :
( reproducibility(VAR_0,sk1(VAR_1,VAR_0),VAR_1)
| ~ organization(VAR_0,VAR_1) ),
file('theBenchmark.p',mp3_1) ).
cnf(c_1,plain,
( reproducibility(A,sk1(B,A),B)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp3_1]) ).
fof(mp4_2,axiom,
! [VAR_0,VAR_1,VAR_2] :
( reorganization_free(VAR_0,VAR_1,VAR_1)
| ~ reorganization_free(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',mp4_2) ).
cnf(c_2,plain,
( reorganization_free(A,B,B)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp4_2]) ).
fof(mp4_3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( reorganization_free(VAR_0,VAR_2,VAR_2)
| ~ reorganization_free(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',mp4_3) ).
cnf(c_3,plain,
( reorganization_free(A,C,C)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp4_3]) ).
fof(a3_FOL_4,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6,VAR_7] :
( greater(VAR_7,VAR_6)
| ~ greater(VAR_5,VAR_4)
| ~ inertia(VAR_2,VAR_7,VAR_3)
| ~ inertia(VAR_0,VAR_6,VAR_1)
| ~ reproducibility(VAR_2,VAR_5,VAR_3)
| ~ reproducibility(VAR_0,VAR_4,VAR_1)
| ~ reorganization_free(VAR_2,VAR_3,VAR_3)
| ~ reorganization_free(VAR_0,VAR_1,VAR_1)
| ~ organization(VAR_2,VAR_3)
| ~ organization(VAR_0,VAR_1) ),
file('theBenchmark.p',a3_FOL_4) ).
cnf(c_4,plain,
( greater(V7,V6)
| ~ greater(F,E)
| ~ inertia(C,V7,D)
| ~ inertia(A,V6,B)
| ~ reproducibility(C,F,D)
| ~ reproducibility(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a3_FOL_4]) ).
fof(a4_FOL_6,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( greater(VAR_4,VAR_3)
| ~ greater(VAR_2,VAR_1)
| ~ reproducibility(VAR_0,VAR_4,VAR_2)
| ~ reproducibility(VAR_0,VAR_3,VAR_1)
| ~ reorganization_free(VAR_0,VAR_1,VAR_2)
| ~ organization(VAR_0,VAR_2)
| ~ organization(VAR_0,VAR_1) ),
file('theBenchmark.p',a4_FOL_6) ).
cnf(c_6,plain,
( greater(E,D)
| ~ greater(C,B)
| ~ reproducibility(A,E,C)
| ~ reproducibility(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a4_FOL_6]) ).
fof(t2_FOL_7,axiom,
organization(sk2,sk5),
file('theBenchmark.p',t2_FOL_7) ).
cnf(c_7,plain,
organization(sk2,sk5),
inference(clausify,[status(thm)],[t2_FOL_7]) ).
fof(t2_FOL_8,axiom,
organization(sk2,sk6),
file('theBenchmark.p',t2_FOL_8) ).
cnf(c_8,plain,
organization(sk2,sk6),
inference(clausify,[status(thm)],[t2_FOL_8]) ).
fof(t2_FOL_9,axiom,
reorganization_free(sk2,sk5,sk6),
file('theBenchmark.p',t2_FOL_9) ).
cnf(c_9,plain,
reorganization_free(sk2,sk5,sk6),
inference(clausify,[status(thm)],[t2_FOL_9]) ).
fof(t2_FOL_10,axiom,
inertia(sk2,sk3,sk5),
file('theBenchmark.p',t2_FOL_10) ).
cnf(c_10,plain,
inertia(sk2,sk3,sk5),
inference(clausify,[status(thm)],[t2_FOL_10]) ).
fof(t2_FOL_11,axiom,
inertia(sk2,sk4,sk6),
file('theBenchmark.p',t2_FOL_11) ).
cnf(c_11,plain,
inertia(sk2,sk4,sk6),
inference(clausify,[status(thm)],[t2_FOL_11]) ).
fof(t2_FOL_12,axiom,
greater(sk6,sk5),
file('theBenchmark.p',t2_FOL_12) ).
cnf(c_12,plain,
greater(sk6,sk5),
inference(clausify,[status(thm)],[t2_FOL_12]) ).
fof(t2_FOL_13,axiom,
~ greater(sk4,sk3),
file('theBenchmark.p',t2_FOL_13) ).
cnf(c_13,plain,
~ greater(sk4,sk3),
inference(clausify,[status(thm)],[t2_FOL_13]) ).
cnf(c_14,plain,
reproducibility(sk2,sk1(sk5,sk2),sk5),
inference(resolve,[status(thm)],[c_1,c_7]) ).
cnf(c_15,plain,
reproducibility(sk2,sk1(sk6,sk2),sk6),
inference(resolve,[status(thm)],[c_1,c_8]) ).
cnf(c_16,plain,
reorganization_free(sk2,sk6,sk6),
inference(resolve,[status(thm)],[c_3,c_9]) ).
cnf(c_17,plain,
reorganization_free(sk2,sk5,sk5),
inference(resolve,[status(thm)],[c_2,c_9]) ).
cnf(c_47,plain,
( greater(C,B)
| ~ greater(A,sk5)
| ~ reproducibility(sk2,C,A)
| ~ reproducibility(sk2,B,sk5)
| ~ reorganization_free(sk2,sk5,A)
| ~ organization(sk2,A) ),
inference(resolve,[status(thm)],[c_6,c_7]) ).
cnf(c_48,plain,
( greater(B,A)
| ~ greater(sk6,sk5)
| ~ reproducibility(sk2,B,sk6)
| ~ reproducibility(sk2,A,sk5)
| ~ reorganization_free(sk2,sk5,sk6) ),
inference(resolve,[status(thm)],[c_47,c_8]) ).
cnf(c_49,plain,
( greater(B,A)
| ~ greater(sk6,sk5)
| ~ reproducibility(sk2,B,sk6)
| ~ reproducibility(sk2,A,sk5) ),
inference(resolve,[status(thm)],[c_48,c_9]) ).
cnf(c_50,plain,
( greater(A,sk1(sk5,sk2))
| ~ greater(sk6,sk5)
| ~ reproducibility(sk2,A,sk6) ),
inference(resolve,[status(thm)],[c_49,c_14]) ).
cnf(c_51,plain,
( greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ greater(sk6,sk5) ),
inference(resolve,[status(thm)],[c_50,c_15]) ).
cnf(c_21,plain,
greater(sk1(sk6,sk2),sk1(sk5,sk2)),
inference(resolve,[status(thm)],[c_51,c_12]) ).
cnf(c_52,plain,
( greater(F,E)
| ~ greater(D,C)
| ~ inertia(A,F,B)
| ~ inertia(sk2,E,sk5)
| ~ reproducibility(A,D,B)
| ~ reproducibility(sk2,C,sk5)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_4,c_7]) ).
cnf(c_53,plain,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sk2,D,sk6)
| ~ inertia(sk2,C,sk5)
| ~ reproducibility(sk2,B,sk6)
| ~ reproducibility(sk2,A,sk5)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5) ),
inference(resolve,[status(thm)],[c_52,c_8]) ).
cnf(c_54,plain,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sk2,D,sk6)
| ~ inertia(sk2,C,sk5)
| ~ reproducibility(sk2,B,sk6)
| ~ reproducibility(sk2,A,sk5)
| ~ reorganization_free(sk2,sk6,sk6) ),
inference(resolve,[status(thm)],[c_53,c_17]) ).
cnf(c_55,plain,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sk2,D,sk6)
| ~ inertia(sk2,C,sk5)
| ~ reproducibility(sk2,B,sk6)
| ~ reproducibility(sk2,A,sk5) ),
inference(resolve,[status(thm)],[c_54,c_16]) ).
cnf(c_56,plain,
( greater(C,B)
| ~ greater(A,sk1(sk5,sk2))
| ~ inertia(sk2,C,sk6)
| ~ inertia(sk2,B,sk5)
| ~ reproducibility(sk2,A,sk6) ),
inference(resolve,[status(thm)],[c_55,c_14]) ).
cnf(c_57,plain,
( greater(B,A)
| ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ inertia(sk2,B,sk6)
| ~ inertia(sk2,A,sk5) ),
inference(resolve,[status(thm)],[c_56,c_15]) ).
cnf(c_58,plain,
( greater(A,sk3)
| ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ inertia(sk2,A,sk6) ),
inference(resolve,[status(thm)],[c_57,c_10]) ).
cnf(c_59,plain,
( greater(sk4,sk3)
| ~ greater(sk1(sk6,sk2),sk1(sk5,sk2)) ),
inference(resolve,[status(thm)],[c_58,c_11]) ).
cnf(c_45,plain,
~ greater(sk1(sk6,sk2),sk1(sk5,sk2)),
inference(resolve,[status(thm)],[c_59,c_13]) ).
cnf(c_46,plain,
$false,
inference(resolve,[status(thm)],[c_45,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT002-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.64 % Computer : n005.cluster.edu
% 0.17/0.64 % Model : x86_64 x86_64
% 0.17/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.64 % Memory : 8046.5625MB
% 0.17/0.64 % OS : Linux 6.8.0-71-generic
% 0.17/0.64 % CPULimit : 300
% 0.17/0.64 % WCLimit : 300
% 0.17/0.64 % DateTime : Sat Sep 26 00:02:04 UTC 2026
% 0.17/0.64 % CPUTime :
% 0.17/0.64 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.64 % Process 602515 was started by sandbox on n005,
% 0.17/0.64 % Sat Sep 26 00:02:04 2026
% 0.17/0.64 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.21/0.65
% 0.21/0.65 % From the command line: assign(max_seconds, 300).
% 0.21/0.67
% 0.21/0.67 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.67
% 0.21/0.67 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.21/0.67 % Length of proof is 19.
% 0.21/0.67 % Level of proof is 3.
% 0.21/0.67 % Maximum clause weight is 41.000.
% 0.21/0.67 % Given clauses 21.
% 0.21/0.67
% 0.21/0.67 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------