%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT014+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 : n006.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 : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 20 unt; 0 def)
% Number of atoms : 181 ( 22 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 217 ( 91 ~; 72 |; 46 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 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 : 92 ( 1 sgn 38 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp6_1,axiom,
! [X,Y] :
~ ( X = Y
& greater(X,Y) ),
file('theBenchmark.p',mp6_1) ).
fof(mp15,axiom,
! [X,T] :
( organization(X,T)
=> time(T) ),
file('theBenchmark.p',mp15) ).
fof(mp16,axiom,
! [T1,T2] :
( ( time(T2)
& time(T1) )
=> ( greater(T2,T1)
| T1 = T2
| greater(T1,T2) ) ),
file('theBenchmark.p',mp16) ).
fof(mp17,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> reorganization_free(X,T2,T1) ),
file('theBenchmark.p',mp17) ).
fof(mp19,axiom,
! [X,S1,S2,T1,T2] :
( ( T1 = T2
& size(X,S2,T2)
& size(X,S1,T1)
& organization(X,T2)
& organization(X,T1) )
=> S1 = S2 ),
file('theBenchmark.p',mp19) ).
fof(t11_FOL,axiom,
! [X,S1,S2,T1,T2] :
( ( greater(T2,T1)
& size(X,S2,T2)
& size(X,S1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(S1,S2) ),
file('theBenchmark.p',t11_FOL) ).
fof(t12_FOL,axiom,
! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('theBenchmark.p',t12_FOL) ).
fof(t14_FOL,conjecture,
! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('theBenchmark.p',t14_FOL) ).
fof(t14_FOL_neg,negated_conjecture,
~ ! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
inference(assume_negation,[status(cth)],[t14_FOL]) ).
cnf(c_10,plain,
( B != A
| ~ greater(A,B) ),
inference(clausify,[status(thm)],[mp6_1]) ).
cnf(c_12,plain,
( time(B)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp15]) ).
cnf(c_13,plain,
( greater(B,A)
| B = A
| greater(A,B)
| ~ time(B)
| ~ time(A) ),
inference(clausify,[status(thm)],[mp16]) ).
cnf(c_14,plain,
( reorganization_free(A,C,B)
| ~ reorganization_free(A,B,C) ),
inference(clausify,[status(thm)],[mp17]) ).
cnf(c_15,plain,
( E = D
| C != B
| ~ size(A,E,C)
| ~ size(A,D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp19]) ).
cnf(c_16,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]) ).
cnf(c_17,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]) ).
fof(nnf_9,plain,
? [X,C1,C2,S1,S2,T1,T2] :
( greater(C1,C2)
& greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t14_FOL_neg]) ).
fof(sk_t14_FOL_neg,plain,
( greater(sK3,sK4)
& greater(sK6,sK5)
& size(sK0,sK6,sK2)
& size(sK0,sK5,sK1)
& complexity(sK0,sK4,sK2)
& complexity(sK0,sK3,sK1)
& reorganization_free(sK0,sK1,sK2)
& organization(sK0,sK2)
& organization(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X,sK0),skolemize(C1,sK3),skolemize(C2,sK4),skolemize(S1,sK5),skolemize(S2,sK6),skolemize(T1,sK1),skolemize(T2,sK2)],[nnf_9]) ).
cnf(c_18,negated_conjecture,
organization(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_19,negated_conjecture,
organization(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_20,negated_conjecture,
reorganization_free(sK0,sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_21,negated_conjecture,
complexity(sK0,sK3,sK1),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_22,negated_conjecture,
complexity(sK0,sK4,sK2),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_23,negated_conjecture,
size(sK0,sK5,sK1),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_24,negated_conjecture,
size(sK0,sK6,sK2),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_25,negated_conjecture,
greater(sK6,sK5),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_26,negated_conjecture,
greater(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t14_FOL_neg]) ).
cnf(c_31,plain,
time(sK1),
inference(resolve,[status(thm)],[c_18,c_12]) ).
cnf(c_32,plain,
time(sK2),
inference(resolve,[status(thm)],[c_19,c_12]) ).
cnf(c_34,plain,
reorganization_free(sK0,sK2,sK1),
inference(resolve,[status(thm)],[c_20,c_14]) ).
cnf(c_62,negated_conjecture,
sK5 != sK6,
inference(resolve,[status(thm)],[c_25,c_10]) ).
cnf(c_47,negated_conjecture,
sK6 != sK5,
inference(copy,[status(thm)],[c_62]) ).
cnf(c_63,negated_conjecture,
( ~ greater(B,C)
| ~ greater(A,sK1)
| ~ complexity(sK0,C,A)
| ~ complexity(sK0,B,sK1)
| ~ reorganization_free(sK0,sK1,A)
| ~ organization(sK0,A) ),
inference(resolve,[status(thm)],[c_17,c_18]) ).
cnf(c_64,negated_conjecture,
( ~ greater(A,B)
| ~ greater(sK2,sK1)
| ~ complexity(sK0,B,sK2)
| ~ complexity(sK0,A,sK1)
| ~ reorganization_free(sK0,sK1,sK2) ),
inference(resolve,[status(thm)],[c_63,c_19]) ).
cnf(c_65,negated_conjecture,
( ~ greater(A,B)
| ~ greater(sK2,sK1)
| ~ complexity(sK0,B,sK2)
| ~ complexity(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_64,c_20]) ).
cnf(c_66,negated_conjecture,
( ~ greater(sK3,A)
| ~ greater(sK2,sK1)
| ~ complexity(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_65,c_21]) ).
cnf(c_67,negated_conjecture,
( ~ greater(sK3,sK4)
| ~ greater(sK2,sK1) ),
inference(resolve,[status(thm)],[c_66,c_22]) ).
cnf(c_50,negated_conjecture,
~ greater(sK2,sK1),
inference(resolve,[status(thm)],[c_67,c_26]) ).
cnf(c_68,negated_conjecture,
( C = B
| A != sK1
| ~ size(sK0,C,A)
| ~ size(sK0,B,sK1)
| ~ organization(sK0,A) ),
inference(resolve,[status(thm)],[c_15,c_18]) ).
cnf(c_69,negated_conjecture,
( B = A
| sK2 != sK1
| ~ size(sK0,B,sK2)
| ~ size(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_68,c_19]) ).
cnf(c_70,negated_conjecture,
( A = sK5
| sK2 != sK1
| ~ size(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_69,c_23]) ).
cnf(c_71,negated_conjecture,
( sK6 = sK5
| sK2 != sK1 ),
inference(resolve,[status(thm)],[c_70,c_24]) ).
cnf(c_56,negated_conjecture,
sK2 != sK1,
inference(resolve,[status(thm)],[c_71,c_47]) ).
cnf(c_72,negated_conjecture,
( ~ greater(B,C)
| ~ greater(A,sK2)
| ~ size(sK0,C,A)
| ~ size(sK0,B,sK2)
| ~ reorganization_free(sK0,sK2,A)
| ~ organization(sK0,A) ),
inference(resolve,[status(thm)],[c_16,c_19]) ).
cnf(c_73,negated_conjecture,
( ~ greater(A,B)
| ~ greater(sK1,sK2)
| ~ size(sK0,B,sK1)
| ~ size(sK0,A,sK2)
| ~ reorganization_free(sK0,sK2,sK1) ),
inference(resolve,[status(thm)],[c_72,c_18]) ).
cnf(c_74,negated_conjecture,
( ~ greater(A,B)
| ~ greater(sK1,sK2)
| ~ size(sK0,B,sK1)
| ~ size(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_73,c_34]) ).
cnf(c_75,negated_conjecture,
( ~ greater(sK6,A)
| ~ greater(sK1,sK2)
| ~ size(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_74,c_24]) ).
cnf(c_76,negated_conjecture,
( ~ greater(sK6,sK5)
| ~ greater(sK1,sK2) ),
inference(resolve,[status(thm)],[c_75,c_23]) ).
cnf(c_60,negated_conjecture,
~ greater(sK1,sK2),
inference(resolve,[status(thm)],[c_76,c_25]) ).
cnf(c_77,plain,
( greater(sK1,A)
| sK1 = A
| greater(A,sK1)
| ~ time(A) ),
inference(resolve,[status(thm)],[c_13,c_31]) ).
cnf(c_78,plain,
( greater(sK1,sK2)
| sK1 = sK2
| ~ time(sK2) ),
inference(resolve,[status(thm)],[c_77,c_50]) ).
cnf(c_79,plain,
sK1 != sK2,
inference(copy,[status(thm)],[c_56]) ).
cnf(c_80,plain,
( greater(sK1,sK2)
| ~ time(sK2) ),
inference(resolve,[status(thm)],[c_78,c_79]) ).
cnf(c_81,plain,
~ time(sK2),
inference(resolve,[status(thm)],[c_80,c_60]) ).
cnf(c_61,plain,
$false,
inference(resolve,[status(thm)],[c_32,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n006.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 : Sat Sep 26 00:03:11 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 4071843 was started by sandbox2 on n006,
% 0.09/0.36 % Sat Sep 26 00:03:11 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 32.
% 0.09/0.38 % Level of proof is 4.
% 0.09/0.38 % Maximum clause weight is 24.000.
% 0.09/0.38 % Given clauses 34.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------