%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:01:00 AM UTC 2026
% Result : Theorem 11.34s 2.05s
% Output : CNFRefutation 11.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 20 unt; 0 def)
% Number of atoms : 159 ( 16 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 191 ( 84 ~; 69 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 77 ( 1 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp6_1,axiom,
! [X0,X1] :
~ ( X0 = X1
& greater(X0,X1) ) ).
fof(mp15,axiom,
! [X0,X1] :
( organization(X0,X1)
=> time(X1) ) ).
fof(mp16,axiom,
! [X0,X1] :
( ( time(X1)
& time(X0) )
=> ( greater(X1,X0)
| X0 = X1
| greater(X0,X1) ) ) ).
fof(mp17,axiom,
! [X0,X1,X2] :
( 'reorganization$ufree'(X0,X1,X2)
=> 'reorganization$ufree'(X0,X2,X1) ) ).
fof(mp19,axiom,
! [X0,X1,X2,X3,X4] :
( ( X3 = X4
& size(X0,X2,X4)
& size(X0,X1,X3)
& organization(X0,X4)
& organization(X0,X3) )
=> X1 = X2 ) ).
fof(t11_FOL,hypothesis,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& size(X0,X2,X4)
& size(X0,X1,X3)
& 'reorganization$ufree'(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X1,X2) ) ).
fof(t12_FOL,hypothesis,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& complexity(X0,X2,X4)
& complexity(X0,X1,X3)
& 'reorganization$ufree'(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X1,X2) ) ).
fof(t14_FOL,conjecture,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& 'reorganization$ufree'(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ~ greater(X1,X2) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& 'reorganization$ufree'(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ~ greater(X1,X2) ),
inference(negate_conjecture,[status(cth)],[t14_FOL]) ).
cnf(c0,plain,
( X0 != X1
| ~ greater(X0,X1) ),
inference(clausification,[status(esa)],[mp6_1]) ).
cnf(c2,plain,
( time(X1)
| ~ organization(X0,X1) ),
inference(clausification,[status(esa)],[mp15]) ).
cnf(c3,plain,
( ~ time(X1)
| greater(X1,X0)
| X1 = X0
| greater(X0,X1)
| ~ time(X0) ),
inference(clausification,[status(esa)],[mp16]) ).
cnf(c4,plain,
( 'reorganization$ufree'(X0,X2,X1)
| ~ 'reorganization$ufree'(X0,X1,X2) ),
inference(clausification,[status(esa)],[mp17]) ).
cnf(c5,plain,
( ~ organization(X2,X0)
| X4 = X3
| ~ size(X2,X4,X0)
| ~ size(X2,X3,X1)
| ~ organization(X2,X1)
| X0 != X1 ),
inference(clausification,[status(esa)],[mp19]) ).
cnf(c6,plain,
( ~ size(X2,X3,X1)
| ~ size(X2,X4,X0)
| ~ greater(X3,X4)
| ~ organization(X2,X0)
| ~ 'reorganization$ufree'(X2,X1,X0)
| ~ organization(X2,X1)
| ~ greater(X0,X1) ),
inference(clausification,[status(esa)],[t11_FOL]) ).
cnf(c7,plain,
( ~ complexity(X0,X4,X1)
| ~ greater(X4,X3)
| ~ complexity(X0,X3,X2)
| ~ 'reorganization$ufree'(X0,X1,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(clausification,[status(esa)],[t12_FOL]) ).
cnf(c8,plain,
organization(sK26,sK31),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c9,plain,
organization(sK26,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c10,plain,
'reorganization$ufree'(sK26,sK31,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c11,plain,
complexity(sK26,sK27,sK31),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c12,plain,
complexity(sK26,sK28,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c13,plain,
size(sK26,sK29,sK31),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c14,plain,
size(sK26,sK30,sK32),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c15,plain,
greater(sK30,sK29),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c16,plain,
greater(sK27,sK28),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ size(X2,X0,X3)
| ~ size(X2,X1,X3)
| ~ organization(X2,X3)
| ~ organization(X2,X3)
| X0 = X1 ),
inference(equality_resolution,[status(thm)],[c5]) ).
cnf(d1,plain,
( ~ size(sK26,X0,sK31)
| ~ organization(sK26,sK31)
| sK29 = X0 ),
inference(resolution,[status(thm)],[d0,c13]) ).
cnf(d2,plain,
( ~ size(sK26,X0,sK31)
| sK29 = X0 ),
inference(resolution,[status(thm)],[c8,d1]) ).
cnf(d3,plain,
( ~ complexity(sK26,X1,X0)
| ~ 'reorganization$ufree'(sK26,sK31,X0)
| ~ organization(sK26,sK31)
| ~ organization(sK26,X0)
| ~ greater(sK27,X1)
| ~ greater(X0,sK31) ),
inference(resolution,[status(thm)],[c11,c7]) ).
cnf(d4,plain,
( ~ complexity(sK26,X1,X0)
| ~ 'reorganization$ufree'(sK26,sK31,X0)
| ~ organization(sK26,X0)
| ~ greater(sK27,X1)
| ~ greater(X0,sK31) ),
inference(resolution,[status(thm)],[c8,d3]) ).
cnf(d5,plain,
( ~ 'reorganization$ufree'(sK26,sK31,sK32)
| ~ organization(sK26,sK32)
| ~ greater(sK27,sK28)
| ~ greater(sK32,sK31) ),
inference(resolution,[status(thm)],[d4,c12]) ).
cnf(d6,plain,
( ~ 'reorganization$ufree'(sK26,sK31,sK32)
| ~ greater(sK27,sK28)
| ~ greater(sK32,sK31) ),
inference(resolution,[status(thm)],[c9,d5]) ).
cnf(d7,plain,
( ~ 'reorganization$ufree'(sK26,sK31,sK32)
| ~ greater(sK32,sK31) ),
inference(resolution,[status(thm)],[c16,d6]) ).
cnf(d8,plain,
~ greater(sK32,sK31),
inference(resolution,[status(thm)],[c10,d7]) ).
cnf(d9,plain,
( ~ time(sK32)
| ~ time(sK31)
| greater(sK31,sK32)
| sK32 = sK31 ),
inference(resolution,[status(thm)],[d8,c3]) ).
cnf(d10,plain,
time(sK31),
inference(resolution,[status(thm)],[c2,c8]) ).
cnf(d11,plain,
( ~ time(sK32)
| greater(sK31,sK32)
| sK32 = sK31 ),
inference(resolution,[status(thm)],[d10,d9]) ).
cnf(d12,plain,
time(sK32),
inference(resolution,[status(thm)],[c2,c9]) ).
cnf(d13,plain,
( greater(sK31,sK32)
| sK32 = sK31 ),
inference(resolution,[status(thm)],[d12,d11]) ).
cnf(d14,plain,
( ~ size(sK26,X1,X0)
| ~ 'reorganization$ufree'(sK26,sK32,X0)
| ~ organization(sK26,sK32)
| ~ organization(sK26,X0)
| ~ greater(sK30,X1)
| ~ greater(X0,sK32) ),
inference(resolution,[status(thm)],[c14,c6]) ).
cnf(d15,plain,
( ~ size(sK26,X1,X0)
| ~ 'reorganization$ufree'(sK26,sK32,X0)
| ~ organization(sK26,X0)
| ~ greater(sK30,X1)
| ~ greater(X0,sK32) ),
inference(resolution,[status(thm)],[c9,d14]) ).
cnf(d16,plain,
( ~ 'reorganization$ufree'(sK26,sK32,sK31)
| ~ organization(sK26,sK31)
| ~ greater(sK30,sK29)
| ~ greater(sK31,sK32) ),
inference(resolution,[status(thm)],[d15,c13]) ).
cnf(d17,plain,
( ~ 'reorganization$ufree'(sK26,sK32,sK31)
| ~ greater(sK30,sK29)
| ~ greater(sK31,sK32) ),
inference(resolution,[status(thm)],[c8,d16]) ).
cnf(d18,plain,
( ~ 'reorganization$ufree'(sK26,sK32,sK31)
| ~ greater(sK31,sK32) ),
inference(resolution,[status(thm)],[c15,d17]) ).
cnf(d19,plain,
'reorganization$ufree'(sK26,sK32,sK31),
inference(resolution,[status(thm)],[c10,c4]) ).
cnf(d20,plain,
~ greater(sK31,sK32),
inference(resolution,[status(thm)],[d19,d18]) ).
cnf(d21,plain,
sK32 = sK31,
inference(resolution,[status(thm)],[d20,d13]) ).
cnf(d22,plain,
size(sK26,sK30,sK31),
inference(demodulation,[status(thm)],[c14,d21]) ).
cnf(d23,plain,
sK29 = sK30,
inference(resolution,[status(thm)],[d22,d2]) ).
cnf(d24,plain,
greater(sK29,sK29),
inference(demodulation,[status(thm)],[c15,d23]) ).
cnf(d25,plain,
~ greater(X0,X0),
inference(equality_resolution,[status(thm)],[c0]) ).
cnf(d26,plain,
$false,
inference(resolution,[status(thm)],[d25,d24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.56 % Computer : n017.cluster.edu
% 0.09/0.56 % Model : x86_64 x86_64
% 0.09/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56 % Memory : 8046.5625MB
% 0.09/0.56 % OS : Linux 6.8.0-71-generic
% 0.09/0.56 % CPULimit : 300
% 0.09/0.56 % WCLimit : 300
% 0.09/0.56 % DateTime : Fri Sep 25 23:58:47 UTC 2026
% 0.09/0.56 % CPUTime :
% 0.09/0.56 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.34/2.05 % SZS status Theorem for theBenchmark.p
% 11.34/2.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------