%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT013-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 : n001.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:06 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 58 ( 27 unt; 0 def)
% Number of atoms : 152 ( 20 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 202 ( 108 ~; 94 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 71 ( 1 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp6_1_18,axiom,
! [VAR_0,VAR_1] :
( VAR_0 != VAR_1
| ~ greater(VAR_0,VAR_1) ),
file('theBenchmark.p',mp6_1_18) ).
cnf(c_1,plain,
( A != B
| ~ greater(A,B) ),
inference(clausify,[status(thm)],[mp6_1_18]) ).
fof(mp15_20,axiom,
! [VAR_0,VAR_1] :
( time(VAR_1)
| ~ organization(VAR_0,VAR_1) ),
file('theBenchmark.p',mp15_20) ).
cnf(c_3,plain,
( time(B)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp15_20]) ).
fof(mp16_21,axiom,
! [VAR_0,VAR_1] :
( greater(VAR_1,VAR_0)
| VAR_0 = VAR_1
| greater(VAR_0,VAR_1)
| ~ time(VAR_1)
| ~ time(VAR_0) ),
file('theBenchmark.p',mp16_21) ).
cnf(c_4,plain,
( greater(B,A)
| A = B
| greater(A,B)
| ~ time(B)
| ~ time(A) ),
inference(clausify,[status(thm)],[mp16_21]) ).
fof(mp17_22,axiom,
! [VAR_0,VAR_1,VAR_2] :
( reorganization_free(VAR_0,VAR_2,VAR_1)
| ~ reorganization_free(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',mp17_22) ).
cnf(c_5,plain,
( reorganization_free(A,C,B)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp17_22]) ).
fof(mp18_23,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( VAR_3 = VAR_4
| VAR_1 != VAR_2
| ~ complexity(VAR_0,VAR_4,VAR_2)
| ~ complexity(VAR_0,VAR_3,VAR_1)
| ~ organization(VAR_0,VAR_2)
| ~ organization(VAR_0,VAR_1) ),
file('theBenchmark.p',mp18_23) ).
cnf(c_6,plain,
( D = E
| B != C
| ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp18_23]) ).
fof(t11_FOL_24,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ greater(VAR_3,VAR_4)
| ~ greater(VAR_2,VAR_1)
| ~ size(VAR_0,VAR_4,VAR_2)
| ~ size(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',t11_FOL_24) ).
cnf(c_7,plain,
( ~ greater(D,E)
| ~ greater(C,B)
| ~ size(A,E,C)
| ~ size(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t11_FOL_24]) ).
fof(t12_FOL_25,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ greater(VAR_3,VAR_4)
| ~ greater(VAR_2,VAR_1)
| ~ complexity(VAR_0,VAR_4,VAR_2)
| ~ complexity(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',t12_FOL_25) ).
cnf(c_8,plain,
( ~ greater(D,E)
| ~ greater(C,B)
| ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t12_FOL_25]) ).
fof(t13_FOL_26,axiom,
organization(sk1,sk6),
file('theBenchmark.p',t13_FOL_26) ).
cnf(c_9,plain,
organization(sk1,sk6),
inference(clausify,[status(thm)],[t13_FOL_26]) ).
fof(t13_FOL_27,axiom,
organization(sk1,sk7),
file('theBenchmark.p',t13_FOL_27) ).
cnf(c_10,plain,
organization(sk1,sk7),
inference(clausify,[status(thm)],[t13_FOL_27]) ).
fof(t13_FOL_28,axiom,
reorganization_free(sk1,sk6,sk7),
file('theBenchmark.p',t13_FOL_28) ).
cnf(c_11,plain,
reorganization_free(sk1,sk6,sk7),
inference(clausify,[status(thm)],[t13_FOL_28]) ).
fof(t13_FOL_29,axiom,
complexity(sk1,sk2,sk6),
file('theBenchmark.p',t13_FOL_29) ).
cnf(c_12,plain,
complexity(sk1,sk2,sk6),
inference(clausify,[status(thm)],[t13_FOL_29]) ).
fof(t13_FOL_30,axiom,
complexity(sk1,sk3,sk7),
file('theBenchmark.p',t13_FOL_30) ).
cnf(c_13,plain,
complexity(sk1,sk3,sk7),
inference(clausify,[status(thm)],[t13_FOL_30]) ).
fof(t13_FOL_31,axiom,
size(sk1,sk4,sk6),
file('theBenchmark.p',t13_FOL_31) ).
cnf(c_14,plain,
size(sk1,sk4,sk6),
inference(clausify,[status(thm)],[t13_FOL_31]) ).
fof(t13_FOL_32,axiom,
size(sk1,sk5,sk7),
file('theBenchmark.p',t13_FOL_32) ).
cnf(c_15,plain,
size(sk1,sk5,sk7),
inference(clausify,[status(thm)],[t13_FOL_32]) ).
fof(t13_FOL_33,axiom,
greater(sk3,sk2),
file('theBenchmark.p',t13_FOL_33) ).
cnf(c_16,plain,
greater(sk3,sk2),
inference(clausify,[status(thm)],[t13_FOL_33]) ).
fof(t13_FOL_34,axiom,
greater(sk4,sk5),
file('theBenchmark.p',t13_FOL_34) ).
cnf(c_17,plain,
greater(sk4,sk5),
inference(clausify,[status(thm)],[t13_FOL_34]) ).
cnf(c_22,plain,
time(sk6),
inference(resolve,[status(thm)],[c_9,c_3]) ).
cnf(c_23,plain,
time(sk7),
inference(resolve,[status(thm)],[c_10,c_3]) ).
cnf(c_25,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolve,[status(thm)],[c_11,c_5]) ).
cnf(c_38,plain,
sk3 != sk2,
inference(resolve,[status(thm)],[c_16,c_1]) ).
cnf(c_53,plain,
( ~ greater(B,C)
| ~ greater(A,sk6)
| ~ size(sk1,C,A)
| ~ size(sk1,B,sk6)
| ~ reorganization_free(sk1,sk6,A)
| ~ organization(sk1,A) ),
inference(resolve,[status(thm)],[c_7,c_9]) ).
cnf(c_54,plain,
( ~ greater(A,B)
| ~ greater(sk7,sk6)
| ~ size(sk1,B,sk7)
| ~ size(sk1,A,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(resolve,[status(thm)],[c_53,c_10]) ).
cnf(c_55,plain,
( ~ greater(A,B)
| ~ greater(sk7,sk6)
| ~ size(sk1,B,sk7)
| ~ size(sk1,A,sk6) ),
inference(resolve,[status(thm)],[c_54,c_11]) ).
cnf(c_56,plain,
( ~ greater(sk4,A)
| ~ greater(sk7,sk6)
| ~ size(sk1,A,sk7) ),
inference(resolve,[status(thm)],[c_55,c_14]) ).
cnf(c_57,plain,
( ~ greater(sk4,sk5)
| ~ greater(sk7,sk6) ),
inference(resolve,[status(thm)],[c_56,c_15]) ).
cnf(c_41,plain,
~ greater(sk7,sk6),
inference(resolve,[status(thm)],[c_57,c_17]) ).
cnf(c_58,plain,
( B = C
| sk7 != A
| ~ complexity(sk1,C,A)
| ~ complexity(sk1,B,sk7)
| ~ organization(sk1,A) ),
inference(resolve,[status(thm)],[c_6,c_10]) ).
cnf(c_59,plain,
( A = B
| sk7 != sk6
| ~ complexity(sk1,B,sk6)
| ~ complexity(sk1,A,sk7) ),
inference(resolve,[status(thm)],[c_58,c_9]) ).
cnf(c_60,plain,
( sk3 = A
| sk7 != sk6
| ~ complexity(sk1,A,sk6) ),
inference(resolve,[status(thm)],[c_59,c_13]) ).
cnf(c_61,plain,
( sk3 = sk2
| sk7 != sk6 ),
inference(resolve,[status(thm)],[c_60,c_12]) ).
cnf(c_47,plain,
sk7 != sk6,
inference(resolve,[status(thm)],[c_61,c_38]) ).
cnf(c_62,plain,
( ~ greater(B,C)
| ~ greater(A,sk7)
| ~ complexity(sk1,C,A)
| ~ complexity(sk1,B,sk7)
| ~ reorganization_free(sk1,sk7,A)
| ~ organization(sk1,A) ),
inference(resolve,[status(thm)],[c_8,c_10]) ).
cnf(c_63,plain,
( ~ greater(A,B)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,B,sk6)
| ~ complexity(sk1,A,sk7)
| ~ reorganization_free(sk1,sk7,sk6) ),
inference(resolve,[status(thm)],[c_62,c_9]) ).
cnf(c_64,plain,
( ~ greater(A,B)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,B,sk6)
| ~ complexity(sk1,A,sk7) ),
inference(resolve,[status(thm)],[c_63,c_25]) ).
cnf(c_65,plain,
( ~ greater(sk3,A)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,A,sk6) ),
inference(resolve,[status(thm)],[c_64,c_13]) ).
cnf(c_66,plain,
( ~ greater(sk3,sk2)
| ~ greater(sk6,sk7) ),
inference(resolve,[status(thm)],[c_65,c_12]) ).
cnf(c_51,plain,
~ greater(sk6,sk7),
inference(resolve,[status(thm)],[c_66,c_16]) ).
cnf(c_67,plain,
( greater(sk6,A)
| A = sk6
| greater(A,sk6)
| ~ time(A) ),
inference(resolve,[status(thm)],[c_4,c_22]) ).
cnf(c_68,plain,
( greater(sk6,sk7)
| sk7 = sk6
| ~ time(sk7) ),
inference(resolve,[status(thm)],[c_67,c_41]) ).
cnf(c_69,plain,
( greater(sk6,sk7)
| ~ time(sk7) ),
inference(resolve,[status(thm)],[c_68,c_47]) ).
cnf(c_70,plain,
~ time(sk7),
inference(resolve,[status(thm)],[c_69,c_51]) ).
cnf(c_52,plain,
$false,
inference(resolve,[status(thm)],[c_23,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 00:09:11 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 388877 was started by sandbox on n001,
% 0.08/0.36 % Sat Sep 26 00:09:11 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 0.08/0.38
% 0.08/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.38
% 0.08/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.08/0.38 % Length of proof is 24.
% 0.08/0.38 % Level of proof is 3.
% 0.08/0.38 % Maximum clause weight is 24.000.
% 0.08/0.38 % Given clauses 34.
% 0.08/0.38
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------