%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /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:01:26 AM UTC 2026
% Result : Theorem 40.75s 10.61s
% Output : CNFRefutation 40.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 21
% Syntax : Number of formulae : 82 ( 20 unt; 0 def)
% Number of atoms : 235 ( 19 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 248 ( 95 ~; 116 |; 24 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-8 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-4 aty)
% Number of variables : 136 ( 7 sgn 43 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(h_3_5,hypothesis,
less(n3,n5) ).
fof(h_5_10,hypothesis,
less(n5,n10) ).
fof(h_inf_lb,hypothesis,
! [X0] : leq(ninf,X0) ).
fof(h_sup_ub,hypothesis,
! [X0] : leq(X0,nsup) ).
fof(irreflexive,axiom,
! [X0] : ~ less(X0,X0) ).
fof(leq_def,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ) ).
fof(leq_antisym,axiom,
! [X0,X1] :
( ( leq(X1,X0)
& leq(X0,X1) )
=> X0 = X1 ) ).
fof(leq_less_trans,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& leq(X0,X1) )
=> less(X0,X2) ) ).
fof(leq_trans,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ) ).
fof(dense,axiom,
! [X0,X1] :
( less(X0,X1)
=> ? [X2] :
( less(X2,X1)
& less(X0,X2) ) ) ).
fof(in_closed,axiom,
! [X0,X1,X2] :
( 'in$uclosed'(X0,X1,X2)
<=> ( leq(X0,X2)
& leq(X1,X0) ) ) ).
fof(axis_conflict_def,axiom,
! [X0,X1,X2,X3] :
( 'axis$uconflict'(X0,X1,X2,X3)
<=> ~ ? [X4] :
( 'in$uclosed'(X4,X2,X3)
& 'in$uclosed'(X4,X0,X1) ) ) ).
fof(conflict_is_verdict,axiom,
'is$uverdict'(conflict) ).
fof(unknown_is_verdict,axiom,
'is$uverdict'(unknown) ).
fof(box_conflict,axiom,
! [X0,X1] :
( ( ( X1 = conflict
| X0 = conflict )
& 'is$uverdict'(X1)
& 'is$uverdict'(X0) )
=> 'box$uverdict'(X0,X1) = conflict ) ).
fof(completion_compat,axiom,
! [X0,X1,X2] :
( ( leq(X0,X2)
& leq(X1,X0) )
=> 'completion$ucompatible'(X0,X1,X2) ) ).
fof(sharpness_conflict,axiom,
! [X0,X1,X2,X3] :
( ( leq(X1,X3)
& less(X0,X1)
& leq(X0,X3)
& leq(X2,X0) )
=> 'completion$uconflict'(X0,X1,X2,X3) ) ).
fof(prec_cc,axiom,
! [X0,X1] :
( prec(X0,X1,c,c)
<=> less(X0,X1) ) ).
fof(prec_oo,axiom,
! [X0,X1] :
( prec(X0,X1,o,o)
<=> leq(X0,X1) ) ).
fof(disjoint_def,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
<=> ( prec(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ) ) ).
fof(hard_chain,conjecture,
( 'box$uverdict'(conflict,unknown) = conflict
& 'completion$ucompatible'(n5,ninf,nsup)
& 'completion$uconflict'(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X0] :
( less(X0,n10)
& less(n5,X0) )
& 'axis$uconflict'(n0,n3,n10,n20) ) ).
fof(negated_conjecture,negated_conjecture,
~ ( 'box$uverdict'(conflict,unknown) = conflict
& 'completion$ucompatible'(n5,ninf,nsup)
& 'completion$uconflict'(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X0] :
( less(X0,n10)
& less(n5,X0) )
& 'axis$uconflict'(n0,n3,n10,n20) ),
inference(negate_conjecture,[status(cth)],[hard_chain]) ).
cnf(c1,plain,
less(n3,n5),
inference(clausification,[status(esa)],[h_3_5]) ).
cnf(c2,plain,
less(n5,n10),
inference(clausification,[status(esa)],[h_5_10]) ).
cnf(c4,plain,
leq(ninf,X0),
inference(clausification,[status(esa)],[h_inf_lb]) ).
cnf(c5,plain,
leq(X0,nsup),
inference(clausification,[status(esa)],[h_sup_ub]) ).
cnf(c6,plain,
~ less(X0,X0),
inference(clausification,[status(esa)],[irreflexive]) ).
cnf(c10,plain,
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(clausification,[status(esa)],[leq_def]) ).
cnf(c12,plain,
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(clausification,[status(esa)],[leq_antisym]) ).
cnf(c14,plain,
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(clausification,[status(esa)],[leq_less_trans]) ).
cnf(c16,plain,
( leq(X2,X1)
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(clausification,[status(esa)],[leq_trans]) ).
cnf(c17,plain,
( less(X0,sK25(X0,X1))
| ~ less(X0,X1) ),
inference(clausification,[status(esa)],[dense]) ).
cnf(c18,plain,
( less(sK25(X0,X1),X1)
| ~ less(X0,X1) ),
inference(clausification,[status(esa)],[dense]) ).
cnf(c19,plain,
( leq(X1,X0)
| ~ 'in$uclosed'(X0,X1,X2) ),
inference(clausification,[status(esa)],[in_closed]) ).
cnf(c20,plain,
( leq(X0,X2)
| ~ 'in$uclosed'(X0,X1,X2) ),
inference(clausification,[status(esa)],[in_closed]) ).
cnf(c32,plain,
( 'in$uclosed'(sK43(X0,X1,X2,X3),X0,X1)
| 'axis$uconflict'(X0,X1,X2,X3) ),
inference(clausification,[status(esa)],[axis_conflict_def]) ).
cnf(c33,plain,
( 'in$uclosed'(sK43(X0,X1,X2,X3),X2,X3)
| 'axis$uconflict'(X0,X1,X2,X3) ),
inference(clausification,[status(esa)],[axis_conflict_def]) ).
cnf(c40,plain,
'is$uverdict'(conflict),
inference(clausification,[status(esa)],[conflict_is_verdict]) ).
cnf(c42,plain,
'is$uverdict'(unknown),
inference(clausification,[status(esa)],[unknown_is_verdict]) ).
cnf(c47,plain,
( 'box$uverdict'(X1,X0) = conflict
| ~ 'is$uverdict'(X1)
| X1 != conflict
| ~ 'is$uverdict'(X0) ),
inference(clausification,[status(esa)],[box_conflict]) ).
cnf(c53,plain,
( 'completion$ucompatible'(X0,X2,X1)
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(clausification,[status(esa)],[completion_compat]) ).
cnf(c56,plain,
( ~ less(X0,X2)
| ~ leq(X3,X0)
| 'completion$uconflict'(X0,X2,X3,X1)
| ~ leq(X2,X1)
| ~ leq(X0,X1) ),
inference(clausification,[status(esa)],[sharpness_conflict]) ).
cnf(c63,plain,
( less(X0,X1)
| ~ prec(X0,X1,c,c) ),
inference(clausification,[status(esa)],[prec_cc]) ).
cnf(c69,plain,
( leq(X0,X1)
| ~ prec(X0,X1,o,o) ),
inference(clausification,[status(esa)],[prec_oo]) ).
cnf(c71,plain,
( prec(X1,X4,X3,X6)
| prec(X5,X0,X7,X2)
| ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(clausification,[status(esa)],[disjoint_def]) ).
cnf(c84,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| 'box$uverdict'(conflict,unknown) != conflict
| ~ 'completion$uconflict'(n5,n10,ninf,nsup)
| ~ less(n5,X0)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ less(X0,n10) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
leq(n5,n10),
inference(resolution,[status(thm)],[c10,c2]) ).
cnf(d1,plain,
( ~ leq(n10,n5)
| n10 = n5 ),
inference(resolution,[status(thm)],[c12,d0]) ).
cnf(d2,plain,
leq(n3,n5),
inference(resolution,[status(thm)],[c10,c1]) ).
cnf(d3,plain,
( ~ leq(X0,n3)
| leq(X0,n5) ),
inference(resolution,[status(thm)],[c16,d2]) ).
cnf(d4,plain,
( ~ 'is$uverdict'(conflict)
| ~ 'is$uverdict'(X0)
| 'box$uverdict'(conflict,X0) = conflict ),
inference(equality_resolution,[status(thm)],[c47]) ).
cnf(d5,plain,
( ~ 'is$uverdict'(X0)
| 'box$uverdict'(conflict,X0) = conflict ),
inference(resolution,[status(thm)],[c40,d4]) ).
cnf(d6,plain,
'box$uverdict'(conflict,unknown) = conflict,
inference(resolution,[status(thm)],[d5,c42]) ).
cnf(d7,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$uconflict'(n5,n10,ninf,nsup)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[d6,c84]) ).
cnf(d8,plain,
( ~ leq(n5,nsup)
| ~ leq(n10,nsup)
| ~ leq(ninf,n5)
| ~ less(n5,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[d7,c56]) ).
cnf(d9,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ leq(ninf,n5)
| ~ leq(n10,nsup)
| ~ leq(n5,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c2,d8]) ).
cnf(d10,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ leq(n10,nsup)
| ~ leq(n5,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c4,d9]) ).
cnf(d11,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ 'axis$uconflict'(n0,n3,n10,n20)
| ~ leq(n10,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c5,d10]) ).
cnf(d12,plain,
( leq(X2,sK43(X0,X1,X2,X3))
| 'axis$uconflict'(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[c33,c19]) ).
cnf(d13,plain,
( leq(sK43(X0,X1,X2,X3),X1)
| 'axis$uconflict'(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[c32,c20]) ).
cnf(d14,plain,
( ~ leq(X4,sK43(X0,X1,X2,X3))
| leq(X4,X1)
| 'axis$uconflict'(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[d13,c16]) ).
cnf(d15,plain,
( 'axis$uconflict'(X2,X1,X0,X3)
| 'axis$uconflict'(X2,X1,X0,X3)
| leq(X0,X1) ),
inference(resolution,[status(thm)],[d14,d12]) ).
cnf(d16,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| ~ leq(n10,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d15,d11]) ).
cnf(d17,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ 'completion$ucompatible'(n5,ninf,nsup)
| leq(n10,n3)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c5,d16]) ).
cnf(d18,plain,
( ~ leq(n5,nsup)
| ~ leq(ninf,n5)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[d17,c53]) ).
cnf(d19,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3)
| ~ leq(n5,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c4,d18]) ).
cnf(d20,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3)
| ~ less(n5,X0)
| ~ less(X0,n10) ),
inference(resolution,[status(thm)],[c5,d19]) ).
cnf(d21,plain,
( ~ less(n5,X0)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3)
| ~ less(sK25(n5,X0),n10) ),
inference(resolution,[status(thm)],[d20,c17]) ).
cnf(d22,plain,
( ~ less(n5,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3)
| ~ less(n5,n10) ),
inference(resolution,[status(thm)],[d21,c18]) ).
cnf(d23,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[c2,d22]) ).
cnf(d24,plain,
( prec(nsup,ninf,c,c)
| prec(n10,n5,o,o)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d23,c71]) ).
cnf(d25,plain,
( less(nsup,ninf)
| prec(n10,n5,o,o)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d24,c63]) ).
cnf(d26,plain,
( ~ less(nsup,X1)
| less(X0,X1) ),
inference(resolution,[status(thm)],[c14,c5]) ).
cnf(d27,plain,
( ~ less(nsup,X1)
| less(X0,sK25(nsup,X1)) ),
inference(resolution,[status(thm)],[d26,c17]) ).
cnf(d28,plain,
~ less(nsup,X0),
inference(resolution,[status(thm)],[d27,c6]) ).
cnf(d29,plain,
( prec(n10,n5,o,o)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d28,d25]) ).
cnf(d30,plain,
( leq(n10,n5)
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d29,c69]) ).
cnf(d31,plain,
( n10 = n5
| leq(n10,n3) ),
inference(resolution,[status(thm)],[d30,d1]) ).
cnf(d32,plain,
( leq(n10,n5)
| n10 = n5 ),
inference(resolution,[status(thm)],[d31,d3]) ).
cnf(d33,plain,
( n10 = n5
| n10 = n5 ),
inference(resolution,[status(thm)],[d32,d1]) ).
cnf(d34,plain,
less(n5,n5),
inference(demodulation,[status(thm)],[c2,d33]) ).
cnf(d35,plain,
$false,
inference(resolution,[status(thm)],[c6,d34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n006.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 00:11:25 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 40.75/10.61 % SZS status Theorem for theBenchmark.p
% 40.75/10.61 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------