%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT084+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 : n014.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 0.33s 0.59s
% Output : Proof 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 94 ( 25 ~; 19 |; 48 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 49 ( 1 sgn 27 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
! [X] : ~ less(X,X),
file('MGT002+0.ax',irreflexive) ).
fof(less_leq_trans,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& less(X,Y) )
=> less(X,Z) ),
file('MGT002+0.ax',less_leq_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(odrl432,conjecture,
~ ? [X,Y,Z] :
( leq(v200,Z)
& in_lopen(Z,v0,v200)
& less(v400,Y)
& in_lopen(Y,v0,v400)
& leq(v600,X)
& in_lopen(X,v0,v600) ),
file('theBenchmark.p',odrl432) ).
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_8_1,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ leq(Y,Z)
| ~ less(X,Y) ),
inference(fof_nnf,[status(thm)],[less_leq_trans]) ).
fof(f_8_2,plain,
! [U_21,U_20,U_19] :
( less(U_21,U_19)
| ~ leq(U_20,U_19)
| ~ less(U_21,U_20) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
( less(U_21,U_19)
| ~ leq(U_20,U_19)
| ~ less(U_21,U_20) ),
inference(clausify,[status(thm)],[f_8_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_39_1,negated_conjecture,
? [X,Y,Z] :
( leq(v200,Z)
& in_lopen(Z,v0,v200)
& less(v400,Y)
& in_lopen(Y,v0,v400)
& leq(v600,X)
& in_lopen(X,v0,v600) ),
inference(negate,[status(cth)],[odrl432]) ).
fof(f_39_2,negated_conjecture,
? [U_114,U_113,U_112] :
( leq(v200,U_112)
& in_lopen(U_112,v0,v200)
& less(v400,U_113)
& in_lopen(U_113,v0,v400)
& leq(v600,U_114)
& in_lopen(U_114,v0,v600) ),
inference(variable_rename,[status(thm)],[f_39_1]) ).
fof(f_39_3,negated_conjecture,
( ? [U_114] :
( leq(v600,U_114)
& in_lopen(U_114,v0,v600) )
& ? [U_113] :
( less(v400,U_113)
& in_lopen(U_113,v0,v400) )
& ? [U_112] :
( leq(v200,U_112)
& in_lopen(U_112,v0,v200) ) ),
inference(miniscope,[status(thm)],[f_39_2]) ).
fof(f_39_4,negated_conjecture,
( ? [U_114] :
( leq(v600,U_114)
& in_lopen(U_114,v0,v600) )
& ? [U_113] :
( less(v400,U_113)
& in_lopen(U_113,v0,v400) )
& leq(v200,sK4)
& in_lopen(sK4,v0,v200) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_112,sK4)],[f_39_3]) ).
fof(f_39_5,negated_conjecture,
( ? [U_114] :
( leq(v600,U_114)
& in_lopen(U_114,v0,v600) )
& less(v400,sK5)
& in_lopen(sK5,v0,v400)
& leq(v200,sK4)
& in_lopen(sK4,v0,v200) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_113,sK5)],[f_39_4]) ).
fof(f_39_6,negated_conjecture,
( leq(v600,sK6)
& in_lopen(sK6,v0,v600)
& less(v400,sK5)
& in_lopen(sK5,v0,v400)
& leq(v200,sK4)
& in_lopen(sK4,v0,v200) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_114,sK6)],[f_39_5]) ).
fof(f_39_7,negated_conjecture,
( leq(v600,sK6)
& in_lopen(sK6,v0,v600)
& less(v400,sK5)
& in_lopen(sK5,v0,v400)
& leq(v200,sK4)
& in_lopen(sK4,v0,v200) ),
inference(definitional_conversion,[status(esa)],[f_39_6]) ).
cnf(f_39_10,negated_conjecture,
in_lopen(sK5,v0,v400),
inference(clausify,[status(thm)],[f_39_7]) ).
cnf(f_39_11,negated_conjecture,
less(v400,sK5),
inference(clausify,[status(thm)],[f_39_7]) ).
cnf(t1,plain,
~ less(v400,v400),
inference(start,[status(thm),parent(0:0)],[f_1_3]) ).
cnf(t2,plain,
( ~ leq(sK5,v400)
| ~ less(v400,sK5)
| less(v400,v400) ),
inference(extension,[status(thm),parent(t1:1)],[f_8_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
less(v400,sK5),
inference(extension,[status(thm),parent(t2:2)],[f_39_11]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ in_lopen(sK5,v0,v400)
| leq(sK5,v400) ),
inference(extension,[status(thm),parent(t2:3)],[f_11_5]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
in_lopen(sK5,v0,v400),
inference(extension,[status(thm),parent(t6:2)],[f_39_10]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT084+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.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 16:19:52 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.33/0.59 % SZS status Theorem for theBenchmark
% 0.33/0.59 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------