%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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 : Thu Sep 24 08:50:50 AM UTC 2026
% Result : Theorem 4.05s 9.36s
% Output : Proof 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 19 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 27 ~; 21 |; 29 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 43 ( 1 sgn 27 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
! [X] : ~ less(X,X),
file('MGT002+0.ax',irreflexive) ).
fof(leq_less_trans,axiom,
! [X,Y,Z] :
( ( less(Y,Z)
& leq(X,Y) )
=> less(X,Z) ),
file('MGT002+0.ax',leq_less_trans) ).
fof(in_lopen,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( leq(X,B)
& less(A,X) ) ),
file('MGT002+2.ax',in_lopen) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('theBenchmark.p',ord_v400_v800) ).
fof(odrl402,conjecture,
~ ? [X,Y] :
( leq(v200,Y)
& in_lopen(Y,v0,v600)
& leq(v800,X)
& in_lopen(X,v0,v400) ),
file('theBenchmark.p',odrl402) ).
fof(f_1_1,plain,
! [X] : ~ less(X,X),
inference(fof_nnf,[status(thm)],[irreflexive]) ).
fof(f_1_2,plain,
! [U_0] : ~ less(U_0,U_0),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
~ less(U_0,U_0),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_7_1,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ less(Y,Z)
| ~ leq(X,Y) ),
inference(fof_nnf,[status(thm)],[leq_less_trans]) ).
fof(f_7_2,plain,
! [U_18,U_17,U_16] :
( less(U_18,U_16)
| ~ less(U_17,U_16)
| ~ leq(U_18,U_17) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
cnf(f_7_3,plain,
( less(U_18,U_16)
| ~ less(U_17,U_16)
| ~ leq(U_18,U_17) ),
inference(clausify,[status(thm)],[f_7_2]) ).
fof(f_11_1,plain,
! [X,A,B] :
( ( in_lopen(X,A,B)
| ~ leq(X,B)
| ~ less(A,X) )
& ( ( leq(X,B)
& less(A,X) )
| ~ in_lopen(X,A,B) ) ),
inference(fof_nnf,[status(thm)],[in_lopen]) ).
fof(f_11_2,plain,
! [U_36,U_35,U_34] :
( ( in_lopen(U_36,U_35,U_34)
| ~ leq(U_36,U_34)
| ~ less(U_35,U_36) )
& ( ( leq(U_36,U_34)
& less(U_35,U_36) )
| ~ in_lopen(U_36,U_35,U_34) ) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
fof(f_11_3,plain,
( ! [U_42,U_40,U_38] :
( in_lopen(U_42,U_40,U_38)
| ~ leq(U_42,U_38)
| ~ less(U_40,U_42) )
& ! [U_41,U_39,U_37] :
( ( leq(U_41,U_37)
& less(U_39,U_41) )
| ~ in_lopen(U_41,U_39,U_37) ) ),
inference(miniscope,[status(thm)],[f_11_2]) ).
cnf(f_11_5,plain,
( leq(U_41,U_37)
| ~ in_lopen(U_41,U_39,U_37) ),
inference(clausify,[status(thm)],[f_11_3]) ).
fof(f_41_1,plain,
less(v400,v800),
inference(fof_nnf,[status(thm)],[ord_v400_v800]) ).
cnf(f_41_2,plain,
less(v400,v800),
inference(clausify,[status(thm)],[f_41_1]) ).
fof(f_44_1,negated_conjecture,
? [X,Y] :
( leq(v200,Y)
& in_lopen(Y,v0,v600)
& leq(v800,X)
& in_lopen(X,v0,v400) ),
inference(negate,[status(cth)],[odrl402]) ).
fof(f_44_2,negated_conjecture,
? [U_113,U_112] :
( leq(v200,U_112)
& in_lopen(U_112,v0,v600)
& leq(v800,U_113)
& in_lopen(U_113,v0,v400) ),
inference(variable_rename,[status(thm)],[f_44_1]) ).
fof(f_44_3,negated_conjecture,
( ? [U_113] :
( leq(v800,U_113)
& in_lopen(U_113,v0,v400) )
& ? [U_112] :
( leq(v200,U_112)
& in_lopen(U_112,v0,v600) ) ),
inference(miniscope,[status(thm)],[f_44_2]) ).
fof(f_44_4,negated_conjecture,
( ? [U_113] :
( leq(v800,U_113)
& in_lopen(U_113,v0,v400) )
& leq(v200,sK4)
& in_lopen(sK4,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_112,sK4)],[f_44_3]) ).
fof(f_44_5,negated_conjecture,
( leq(v800,sK5)
& in_lopen(sK5,v0,v400)
& leq(v200,sK4)
& in_lopen(sK4,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_113,sK5)],[f_44_4]) ).
fof(f_44_6,negated_conjecture,
( leq(v800,sK5)
& in_lopen(sK5,v0,v400)
& leq(v200,sK4)
& in_lopen(sK4,v0,v600) ),
inference(definitional_conversion,[status(esa)],[f_44_5]) ).
cnf(f_44_9,negated_conjecture,
in_lopen(sK5,v0,v400),
inference(clausify,[status(thm)],[f_44_6]) ).
cnf(f_44_10,negated_conjecture,
leq(v800,sK5),
inference(clausify,[status(thm)],[f_44_6]) ).
cnf(t1,plain,
~ less(v800,v800),
inference(start,[status(thm),parent(0:0)],[f_1_3]) ).
cnf(t2,plain,
( ~ less(sK5,v800)
| ~ leq(v800,sK5)
| less(v800,v800) ),
inference(extension,[status(thm),parent(t1:1)],[f_7_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
leq(v800,sK5),
inference(extension,[status(thm),parent(t2:2)],[f_44_10]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ less(v400,v800)
| ~ leq(sK5,v400)
| less(sK5,v800) ),
inference(extension,[status(thm),parent(t2:3)],[f_7_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ in_lopen(sK5,v0,v400)
| leq(sK5,v400) ),
inference(extension,[status(thm),parent(t6:2)],[f_11_5]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
in_lopen(sK5,v0,v400),
inference(extension,[status(thm),parent(t8:2)],[f_44_9]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
less(v400,v800),
inference(extension,[status(thm),parent(t6:3)],[f_41_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n001.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 19 16:25:31 UTC 2026
% 0.10/5.38 % CPUTime :
% 4.05/9.36 % SZS status Theorem for theBenchmark
% 4.05/9.36 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------