%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 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 : 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 : Thu Sep 24 08:50:48 AM UTC 2026
% Result : Theorem 0.31s 0.56s
% Output : Proof 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 18 |; 5 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completion_compat,axiom,
! [V,InfD,SupD] :
( ( leq(V,SupD)
& leq(InfD,V) )
=> completion_compatible(V,InfD,SupD) ),
file('MGT002+4.ax',completion_compat) ).
fof(h_sup_ub,hypothesis,
! [X] : leq(X,nsup),
file('theBenchmark.p',h_sup_ub) ).
fof(unknown_sound_compatible,conjecture,
? [V] :
( completion_compatible(V,ninf,nsup)
& leq(V,nsup)
& leq(ninf,V) ),
file('theBenchmark.p',unknown_sound_compatible) ).
fof(f_29_1,plain,
! [V,InfD,SupD] :
( completion_compatible(V,InfD,SupD)
| ~ leq(V,SupD)
| ~ leq(InfD,V) ),
inference(fof_nnf,[status(thm)],[completion_compat]) ).
fof(f_29_2,plain,
! [U_117,U_116,U_115] :
( completion_compatible(U_117,U_116,U_115)
| ~ leq(U_117,U_115)
| ~ leq(U_116,U_117) ),
inference(variable_rename,[status(thm)],[f_29_1]) ).
cnf(f_29_3,plain,
( completion_compatible(U_117,U_116,U_115)
| ~ leq(U_117,U_115)
| ~ leq(U_116,U_117) ),
inference(clausify,[status(thm)],[f_29_2]) ).
fof(f_38_1,plain,
! [X] : leq(X,nsup),
inference(fof_nnf,[status(thm)],[h_sup_ub]) ).
fof(f_38_2,plain,
! [U_142] : leq(U_142,nsup),
inference(variable_rename,[status(thm)],[f_38_1]) ).
cnf(f_38_3,plain,
leq(U_142,nsup),
inference(clausify,[status(thm)],[f_38_2]) ).
fof(f_40_1,negated_conjecture,
~ ? [V] :
( completion_compatible(V,ninf,nsup)
& leq(V,nsup)
& leq(ninf,V) ),
inference(negate,[status(cth)],[unknown_sound_compatible]) ).
fof(f_40_2,negated_conjecture,
! [V] :
( ~ completion_compatible(V,ninf,nsup)
| ~ leq(V,nsup)
| ~ leq(ninf,V) ),
inference(fof_nnf,[status(thm)],[f_40_1]) ).
fof(f_40_3,negated_conjecture,
! [U_143] :
( ~ completion_compatible(U_143,ninf,nsup)
| ~ leq(U_143,nsup)
| ~ leq(ninf,U_143) ),
inference(variable_rename,[status(thm)],[f_40_2]) ).
fof(f_40_4,negated_conjecture,
! [U_143] :
( ~ completion_compatible(U_143,ninf,nsup)
| ~ leq(U_143,nsup)
| ~ leq(ninf,U_143) ),
inference(definitional_conversion,[status(esa)],[f_40_3]) ).
cnf(f_40_5,negated_conjecture,
( ~ completion_compatible(U_143,ninf,nsup)
| ~ leq(U_143,nsup)
| ~ leq(ninf,U_143) ),
inference(clausify,[status(thm)],[f_40_4]) ).
cnf(t1,plain,
( ~ leq(nsup,nsup)
| ~ completion_compatible(nsup,ninf,nsup)
| ~ leq(ninf,nsup) ),
inference(start,[status(thm),parent(0:0)],[f_40_5]) ).
cnf(t2,plain,
leq(ninf,nsup),
inference(extension,[status(thm),parent(t1:1)],[f_38_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(l1,lemma,
leq(ninf,nsup),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t4,plain,
( ~ leq(nsup,nsup)
| ~ leq(ninf,nsup)
| completion_compatible(nsup,ninf,nsup) ),
inference(extension,[status(thm),parent(t1:2)],[f_29_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
leq(ninf,nsup),
inference(lemma_extension,[status(thm),parent(t4:2)],[l1:1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
leq(nsup,nsup),
inference(extension,[status(thm),parent(t4:3)],[f_38_3]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
leq(nsup,nsup),
inference(extension,[status(thm),parent(t1:3)],[f_38_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t1:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 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/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 16:18:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.31/0.56 % SZS status Theorem for theBenchmark
% 0.31/0.56 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------