%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:29 AM UTC 2026
% Result : Theorem 11.56s 3.31s
% Output : CNFRefutation 11.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 8 unt; 0 def)
% Number of atoms : 21 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 5 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 15 ( 1 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ord_v0_v600,axiom,
less(v0,v600) ).
fof(leq_def,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ) ).
fof(in_lopen,axiom,
! [X0,X1,X2] :
( 'in$ulopen'(X0,X1,X2)
<=> ( leq(X0,X2)
& less(X1,X0) ) ) ).
fof(odrl500,conjecture,
? [X0] : 'in$ulopen'(X0,v0,v600) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] : 'in$ulopen'(X0,v0,v600),
inference(negate_conjecture,[status(cth)],[odrl500]) ).
cnf(c4,plain,
less(v0,v600),
inference(clausification,[status(esa)],[ord_v0_v600]) ).
cnf(c14,plain,
( X0 != X1
| leq(X0,X1) ),
inference(clausification,[status(esa)],[leq_def]) ).
cnf(c25,plain,
( ~ leq(X0,X2)
| ~ less(X1,X0)
| 'in$ulopen'(X0,X1,X2) ),
inference(clausification,[status(esa)],[in_lopen]) ).
cnf(c54,plain,
~ 'in$ulopen'(X0,v0,v600),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
leq(X0,X0),
inference(equality_resolution,[status(thm)],[c14]) ).
cnf(d1,plain,
( ~ leq(X0,v600)
| ~ less(v0,X0) ),
inference(resolution,[status(thm)],[c25,c54]) ).
cnf(d2,plain,
~ less(v0,v600),
inference(resolution,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[c4,d2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 % Computer : n018.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sat Sep 26 00:14:50 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.56/3.31 % SZS status Theorem for theBenchmark.p
% 11.56/3.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------