%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT003+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /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 : Sun Sep 27 08:02:03 AM UTC 2026
% Result : Theorem 0.10s 0.48s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 189 ( 76 ~; 71 |; 36 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 92 ( 2 sgn 32 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp4,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> ( reorganization_free(X,T2,T2)
& reorganization_free(X,T1,T1) ) ),
file('theBenchmark.p',mp4) ).
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
fof(t1_FOL,axiom,
! [X,Y,T1,T2,I1,I2,P1,P2] :
( ( greater(I2,I1)
& survival_chance(Y,P2,T2)
& survival_chance(X,P1,T1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
file('theBenchmark.p',t1_FOL) ).
fof(t2_FOL,axiom,
! [X,I1,I2,T1,T2] :
( ( greater(T2,T1)
& inertia(X,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',t2_FOL) ).
fof(t3_FOL,conjecture,
! [X,P1,P2,T1,T2] :
( ( greater(T2,T1)
& survival_chance(X,P2,T2)
& survival_chance(X,P1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
file('theBenchmark.p',t3_FOL) ).
fof(t3_FOL_neg,negated_conjecture,
~ ! [X,P1,P2,T1,T2] :
( ( greater(T2,T1)
& survival_chance(X,P2,T2)
& survival_chance(X,P1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
inference(assume_negation,[status(cth)],[t3_FOL]) ).
cnf(c_6,plain,
( reorganization_free(A,B,B)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp4]) ).
cnf(c_7,plain,
( reorganization_free(A,C,C)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp4]) ).
fof(nnf_2,plain,
! [X,T] :
( ? [I] : inertia(X,I,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp5]) ).
fof(sk_mp5,plain,
! [X,T] :
( inertia(X,sK0(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(I,sK0(X,T))],[nnf_2]) ).
cnf(c_8,plain,
( inertia(A,sK0(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp5]) ).
cnf(c_9,plain,
( greater(V7,V6)
| ~ greater(F,E)
| ~ survival_chance(C,V7,D)
| ~ survival_chance(A,V6,B)
| ~ inertia(C,F,D)
| ~ inertia(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t1_FOL]) ).
cnf(c_10,plain,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(A,E,C)
| ~ inertia(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t2_FOL]) ).
fof(nnf_5,plain,
? [X,P1,P2,T1,T2] :
( ~ greater(P2,P1)
& greater(T2,T1)
& survival_chance(X,P2,T2)
& survival_chance(X,P1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t3_FOL_neg]) ).
fof(sk_t3_FOL_neg,plain,
( ~ greater(sK5,sK4)
& greater(sK3,sK2)
& survival_chance(sK1,sK5,sK3)
& survival_chance(sK1,sK4,sK2)
& reorganization_free(sK1,sK2,sK3)
& organization(sK1,sK3)
& organization(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X,sK1),skolemize(P1,sK4),skolemize(P2,sK5),skolemize(T1,sK2),skolemize(T2,sK3)],[nnf_5]) ).
cnf(c_11,negated_conjecture,
organization(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_12,negated_conjecture,
organization(sK1,sK3),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_13,negated_conjecture,
reorganization_free(sK1,sK2,sK3),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_14,negated_conjecture,
survival_chance(sK1,sK4,sK2),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_15,negated_conjecture,
survival_chance(sK1,sK5,sK3),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_16,negated_conjecture,
greater(sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_17,negated_conjecture,
~ greater(sK5,sK4),
inference(split_conjunct,[status(thm)],[sk_t3_FOL_neg]) ).
cnf(c_18,negated_conjecture,
inertia(sK1,sK0(sK1,sK2),sK2),
inference(resolve,[status(thm)],[c_8,c_11]) ).
cnf(c_19,negated_conjecture,
inertia(sK1,sK0(sK1,sK3),sK3),
inference(resolve,[status(thm)],[c_8,c_12]) ).
cnf(c_20,negated_conjecture,
reorganization_free(sK1,sK3,sK3),
inference(resolve,[status(thm)],[c_7,c_13]) ).
cnf(c_21,negated_conjecture,
reorganization_free(sK1,sK2,sK2),
inference(resolve,[status(thm)],[c_6,c_13]) ).
cnf(c_45,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK2)
| ~ inertia(sK1,C,A)
| ~ inertia(sK1,B,sK2)
| ~ reorganization_free(sK1,sK2,A)
| ~ organization(sK1,A) ),
inference(resolve,[status(thm)],[c_10,c_11]) ).
cnf(c_46,negated_conjecture,
( greater(B,A)
| ~ greater(sK3,sK2)
| ~ inertia(sK1,B,sK3)
| ~ inertia(sK1,A,sK2)
| ~ reorganization_free(sK1,sK2,sK3) ),
inference(resolve,[status(thm)],[c_45,c_12]) ).
cnf(c_47,negated_conjecture,
( greater(B,A)
| ~ greater(sK3,sK2)
| ~ inertia(sK1,B,sK3)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_46,c_13]) ).
cnf(c_48,negated_conjecture,
( greater(A,sK0(sK1,sK2))
| ~ greater(sK3,sK2)
| ~ inertia(sK1,A,sK3) ),
inference(resolve,[status(thm)],[c_47,c_18]) ).
cnf(c_49,negated_conjecture,
( greater(sK0(sK1,sK3),sK0(sK1,sK2))
| ~ greater(sK3,sK2) ),
inference(resolve,[status(thm)],[c_48,c_19]) ).
cnf(c_42,negated_conjecture,
greater(sK0(sK1,sK3),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_49,c_16]) ).
cnf(c_50,negated_conjecture,
( greater(F,E)
| ~ greater(D,C)
| ~ survival_chance(A,F,B)
| ~ survival_chance(sK1,E,sK2)
| ~ inertia(A,D,B)
| ~ inertia(sK1,C,sK2)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(sK1,sK2,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_9,c_11]) ).
cnf(c_51,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ survival_chance(sK1,D,sK3)
| ~ survival_chance(sK1,C,sK2)
| ~ inertia(sK1,B,sK3)
| ~ inertia(sK1,A,sK2)
| ~ reorganization_free(sK1,sK3,sK3)
| ~ reorganization_free(sK1,sK2,sK2) ),
inference(resolve,[status(thm)],[c_50,c_12]) ).
cnf(c_52,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ survival_chance(sK1,D,sK3)
| ~ survival_chance(sK1,C,sK2)
| ~ inertia(sK1,B,sK3)
| ~ inertia(sK1,A,sK2)
| ~ reorganization_free(sK1,sK3,sK3) ),
inference(resolve,[status(thm)],[c_51,c_21]) ).
cnf(c_53,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ survival_chance(sK1,D,sK3)
| ~ survival_chance(sK1,C,sK2)
| ~ inertia(sK1,B,sK3)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_52,c_20]) ).
cnf(c_54,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK0(sK1,sK2))
| ~ survival_chance(sK1,C,sK3)
| ~ survival_chance(sK1,B,sK2)
| ~ inertia(sK1,A,sK3) ),
inference(resolve,[status(thm)],[c_53,c_18]) ).
cnf(c_55,negated_conjecture,
( greater(B,A)
| ~ greater(sK0(sK1,sK3),sK0(sK1,sK2))
| ~ survival_chance(sK1,B,sK3)
| ~ survival_chance(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_54,c_19]) ).
cnf(c_56,negated_conjecture,
( greater(A,sK4)
| ~ greater(sK0(sK1,sK3),sK0(sK1,sK2))
| ~ survival_chance(sK1,A,sK3) ),
inference(resolve,[status(thm)],[c_55,c_14]) ).
cnf(c_57,negated_conjecture,
( greater(sK5,sK4)
| ~ greater(sK0(sK1,sK3),sK0(sK1,sK2)) ),
inference(resolve,[status(thm)],[c_56,c_15]) ).
cnf(c_43,negated_conjecture,
~ greater(sK0(sK1,sK3),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_57,c_17]) ).
cnf(c_44,plain,
$false,
inference(resolve,[status(thm)],[c_43,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT003+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.45 % Computer : n011.cluster.edu
% 0.10/0.45 % Model : x86_64 x86_64
% 0.10/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.45 % Memory : 8046.5625MB
% 0.10/0.45 % OS : Linux 6.8.0-71-generic
% 0.10/0.45 % CPULimit : 300
% 0.10/0.45 % WCLimit : 300
% 0.10/0.45 % DateTime : Sat Sep 26 00:02:43 UTC 2026
% 0.10/0.46 % CPUTime :
% 0.10/0.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.46 % Process 3216321 was started by sandbox2 on n011,
% 0.10/0.46 % Sat Sep 26 00:02:43 2026
% 0.10/0.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.46
% 0.10/0.46 % From the command line: assign(max_seconds, 300).
% 0.10/0.48
% 0.10/0.48 % SZS status Theorem for theBenchmark
% 0.10/0.48
% 0.10/0.48 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.10/0.48 % Length of proof is 24.
% 0.10/0.48 % Level of proof is 4.
% 0.10/0.48 % Maximum clause weight is 36.000.
% 0.10/0.48 % Given clauses 20.
% 0.10/0.48
% 0.10/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------