%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /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:00:59 AM UTC 2026
% Result : Theorem 10.50s 2.36s
% Output : CNFRefutation 10.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 14 unt; 0 def)
% Number of atoms : 178 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 240 ( 103 ~; 96 |; 35 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn 37 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ) ).
fof(a3_FOL,hypothesis,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( inertia(X1,X7,X3)
& inertia(X0,X6,X2)
& reproducibility(X1,X5,X3)
& reproducibility(X0,X4,X2)
& 'reorganization$ufree'(X1,X3,X3)
& 'reorganization$ufree'(X0,X2,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ) ).
fof(a5_FOL,hypothesis,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X4,X3)
& inertia(X1,X6,X8)
& inertia(X0,X5,X7)
& size(X1,X4,X8)
& size(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X6,X5) ) ).
fof(t9_FOL,conjecture,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& 'reorganization$ufree'(X1,X8,X8)
& 'reorganization$ufree'(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X4,X3) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& 'reorganization$ufree'(X1,X8,X8)
& 'reorganization$ufree'(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X4,X3) ),
inference(negate_conjecture,[status(cth)],[t9_FOL]) ).
cnf(c0,plain,
( inertia(X0,sK2(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(clausification,[status(esa)],[mp5]) ).
cnf(c2,plain,
( ~ 'reorganization$ufree'(X5,X7,X7)
| ~ organization(X5,X7)
| ~ organization(X2,X4)
| ~ reproducibility(X5,X0,X7)
| ~ reproducibility(X2,X1,X4)
| ~ greater(X6,X3)
| ~ inertia(X5,X6,X7)
| ~ 'reorganization$ufree'(X2,X4,X4)
| ~ inertia(X2,X3,X4)
| greater(X0,X1) ),
inference(clausification,[status(esa)],[a3_FOL]) ).
cnf(c3,plain,
( ~ inertia(X4,X8,X5)
| greater(X1,X8)
| ~ greater(X6,X7)
| ~ organization(X4,X5)
| ~ size(X4,X7,X5)
| ~ organization(X0,X2)
| ~ size(X0,X6,X2)
| ~ class(X4,X3,X5)
| ~ class(X0,X3,X2)
| ~ inertia(X0,X1,X2) ),
inference(clausification,[status(esa)],[a5_FOL]) ).
cnf(c4,plain,
organization(sK20,sK27),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c5,plain,
organization(sK21,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6,plain,
'reorganization$ufree'(sK20,sK27,sK27),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c7,plain,
'reorganization$ufree'(sK21,sK28,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c8,plain,
class(sK20,sK22,sK27),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c9,plain,
class(sK21,sK22,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c10,plain,
reproducibility(sK20,sK23,sK27),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c11,plain,
reproducibility(sK21,sK24,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c12,plain,
size(sK20,sK25,sK27),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c13,plain,
size(sK21,sK26,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c14,plain,
greater(sK26,sK25),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c15,plain,
~ greater(sK24,sK23),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( greater(X4,X5)
| ~ greater(X2,X3)
| ~ 'reorganization$ufree'(X0,X1,X1)
| ~ reproducibility(sK20,X5,sK27)
| ~ reproducibility(X0,X4,X1)
| ~ inertia(sK20,X3,sK27)
| ~ inertia(X0,X2,X1)
| ~ organization(sK20,sK27)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[c6,c2]) ).
cnf(d1,plain,
( ~ greater(X2,X3)
| greater(X4,X5)
| ~ 'reorganization$ufree'(X0,X1,X1)
| ~ reproducibility(sK20,X5,sK27)
| ~ reproducibility(X0,X4,X1)
| ~ inertia(sK20,X3,sK27)
| ~ inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[c4,d0]) ).
cnf(d2,plain,
( ~ greater(X0,X1)
| greater(X2,X3)
| ~ reproducibility(sK20,X3,sK27)
| ~ reproducibility(sK21,X2,sK28)
| ~ inertia(sK20,X1,sK27)
| ~ inertia(sK21,X0,sK28)
| ~ organization(sK21,sK28) ),
inference(resolution,[status(thm)],[d1,c7]) ).
cnf(d3,plain,
( ~ greater(X1,X0)
| greater(X3,X2)
| ~ reproducibility(sK21,X3,sK28)
| ~ reproducibility(sK20,X2,sK27)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c5,d2]) ).
cnf(d4,plain,
( ~ greater(X1,X0)
| greater(sK24,X2)
| ~ reproducibility(sK20,X2,sK27)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d3,c11]) ).
cnf(d5,plain,
( greater(sK24,sK23)
| ~ greater(X1,X0)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d4,c10]) ).
cnf(d6,plain,
( ~ greater(X1,X0)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c15,d5]) ).
cnf(d7,plain,
( ~ organization(sK21,sK28)
| ~ greater(sK2(sK21,sK28),X0)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
( ~ greater(sK2(sK21,sK28),X0)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c5,d7]) ).
cnf(d9,plain,
( ~ class(X0,sK22,X1)
| ~ size(sK20,X5,sK27)
| ~ size(X0,X4,X1)
| ~ greater(X4,X5)
| greater(X2,X3)
| ~ inertia(sK20,X3,sK27)
| ~ inertia(X0,X2,X1)
| ~ organization(sK20,sK27)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[c8,c3]) ).
cnf(d10,plain,
( ~ class(X0,sK22,X1)
| ~ size(sK20,X5,sK27)
| ~ size(X0,X4,X1)
| greater(X2,X3)
| ~ greater(X4,X5)
| ~ inertia(sK20,X3,sK27)
| ~ inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[c4,d9]) ).
cnf(d11,plain,
( ~ size(sK20,X3,sK27)
| ~ size(sK21,X2,sK28)
| greater(X0,X1)
| ~ greater(X2,X3)
| ~ inertia(sK20,X1,sK27)
| ~ inertia(sK21,X0,sK28)
| ~ organization(sK21,sK28) ),
inference(resolution,[status(thm)],[d10,c9]) ).
cnf(d12,plain,
( ~ size(sK21,X2,sK28)
| ~ size(sK20,X3,sK27)
| greater(X1,X0)
| ~ greater(X2,X3)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c5,d11]) ).
cnf(d13,plain,
( ~ size(sK20,X2,sK27)
| greater(X1,X0)
| ~ greater(sK26,X2)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d12,c13]) ).
cnf(d14,plain,
( ~ greater(sK26,sK25)
| greater(X1,X0)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d13,c12]) ).
cnf(d15,plain,
( greater(X1,X0)
| ~ inertia(sK21,X1,sK28)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c14,d14]) ).
cnf(d16,plain,
( ~ organization(sK21,sK28)
| greater(sK2(sK21,sK28),X0)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d15,c0]) ).
cnf(d17,plain,
( greater(sK2(sK21,sK28),X0)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[c5,d16]) ).
cnf(d18,plain,
( ~ inertia(sK20,X0,sK27)
| ~ inertia(sK20,X0,sK27) ),
inference(resolution,[status(thm)],[d17,d8]) ).
cnf(d19,plain,
~ organization(sK20,sK27),
inference(resolution,[status(thm)],[d18,c0]) ).
cnf(d20,plain,
$false,
inference(resolution,[status(thm)],[c4,d19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 00:03:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.50/2.36 % SZS status Theorem for theBenchmark.p
% 10.50/2.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------