%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.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 : n017.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:49:24 AM UTC 2026
% Result : Theorem 27.67s 27.92s
% Output : Proof 27.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 112 ( 57 unt; 0 def)
% Number of atoms : 242 ( 37 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 227 ( 97 ~; 93 |; 30 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 120 ( 1 sgn 64 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('LCL006+0.ax',modus_ponens) ).
fof(or_1,axiom,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('LCL006+0.ax',or_1) ).
fof(r2,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('LCL006+0.ax',r2) ).
fof(r3,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('LCL006+0.ax',r3) ).
fof(r5,axiom,
( r5
<=> ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) ),
file('LCL006+0.ax',r5) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('LCL006+1.ax',op_implies_or) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('LCL006+4.ax',principia_op_implies_or) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r2,axiom,
r2,
file('LCL006+4.ax',principia_r2) ).
fof(principia_r3,axiom,
r3,
file('LCL006+4.ax',principia_r3) ).
fof(principia_r5,axiom,
r5,
file('LCL006+4.ax',principia_r5) ).
fof(hilbert_or_1,conjecture,
or_1,
file('theBenchmark.p',hilbert_or_1) ).
fof(f_1_1,plain,
( ( modus_ponens
| ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) ) )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(fof_nnf,[status(thm)],[modus_ponens]) ).
fof(f_1_2,plain,
( ( modus_ponens
| ? [U_3,U_2] :
( ~ is_a_theorem(U_2)
& is_a_theorem(implies(U_3,U_2))
& is_a_theorem(U_3) ) )
& ( ! [U_1,U_0] :
( is_a_theorem(U_0)
| ~ is_a_theorem(implies(U_1,U_0))
| ~ is_a_theorem(U_1) )
| ~ modus_ponens ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ( modus_ponens
| ? [U_2] :
( ~ is_a_theorem(U_2)
& is_a_theorem(implies(sK1,U_2))
& is_a_theorem(sK1) ) )
& ( ! [U_1,U_0] :
( is_a_theorem(U_0)
| ~ is_a_theorem(implies(U_1,U_0))
| ~ is_a_theorem(U_1) )
| ~ modus_ponens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1)],[f_1_2]) ).
fof(f_1_4,plain,
( ( modus_ponens
| ( ~ is_a_theorem(sK2)
& is_a_theorem(implies(sK1,sK2))
& is_a_theorem(sK1) ) )
& ( ! [U_1,U_0] :
( is_a_theorem(U_0)
| ~ is_a_theorem(implies(U_1,U_0))
| ~ is_a_theorem(U_1) )
| ~ modus_ponens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2)],[f_1_3]) ).
cnf(f_1_5,plain,
( is_a_theorem(U_0)
| ~ is_a_theorem(implies(U_1,U_0))
| ~ is_a_theorem(U_1)
| ~ modus_ponens ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_10_1,plain,
( ( or_1
| ? [X,Y] : ~ is_a_theorem(implies(X,or(X,Y))) )
& ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
| ~ or_1 ) ),
inference(fof_nnf,[status(thm)],[or_1]) ).
fof(f_10_2,plain,
( ( or_1
| ? [U_41,U_40] : ~ is_a_theorem(implies(U_41,or(U_41,U_40))) )
& ( ! [U_39,U_38] : is_a_theorem(implies(U_39,or(U_39,U_38)))
| ~ or_1 ) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
fof(f_10_3,plain,
( ( or_1
| ? [U_40] : ~ is_a_theorem(implies(sK20,or(sK20,U_40))) )
& ( ! [U_39,U_38] : is_a_theorem(implies(U_39,or(U_39,U_38)))
| ~ or_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(U_41,sK20)],[f_10_2]) ).
fof(f_10_4,plain,
( ( or_1
| ~ is_a_theorem(implies(sK20,or(sK20,sK21))) )
& ( ! [U_39,U_38] : is_a_theorem(implies(U_39,or(U_39,U_38)))
| ~ or_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(U_40,sK21)],[f_10_3]) ).
cnf(f_10_6,plain,
( or_1
| ~ is_a_theorem(implies(sK20,or(sK20,sK21))) ),
inference(clausify,[status(thm)],[f_10_4]) ).
fof(f_23_1,plain,
( ( r2
| ? [P,Q] : ~ is_a_theorem(implies(Q,or(P,Q))) )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(fof_nnf,[status(thm)],[r2]) ).
fof(f_23_2,plain,
( ( r2
| ? [U_93,U_92] : ~ is_a_theorem(implies(U_92,or(U_93,U_92))) )
& ( ! [U_91,U_90] : is_a_theorem(implies(U_90,or(U_91,U_90)))
| ~ r2 ) ),
inference(variable_rename,[status(thm)],[f_23_1]) ).
fof(f_23_3,plain,
( ( r2
| ? [U_92] : ~ is_a_theorem(implies(U_92,or(sK46,U_92))) )
& ( ! [U_91,U_90] : is_a_theorem(implies(U_90,or(U_91,U_90)))
| ~ r2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK46]),skolemize(U_93,sK46)],[f_23_2]) ).
fof(f_23_4,plain,
( ( r2
| ~ is_a_theorem(implies(sK47,or(sK46,sK47))) )
& ( ! [U_91,U_90] : is_a_theorem(implies(U_90,or(U_91,U_90)))
| ~ r2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47]),skolemize(U_92,sK47)],[f_23_3]) ).
cnf(f_23_5,plain,
( is_a_theorem(implies(U_90,or(U_91,U_90)))
| ~ r2 ),
inference(clausify,[status(thm)],[f_23_4]) ).
fof(f_24_1,plain,
( ( r3
| ? [P,Q] : ~ is_a_theorem(implies(or(P,Q),or(Q,P))) )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(fof_nnf,[status(thm)],[r3]) ).
fof(f_24_2,plain,
( ( r3
| ? [U_97,U_96] : ~ is_a_theorem(implies(or(U_97,U_96),or(U_96,U_97))) )
& ( ! [U_95,U_94] : is_a_theorem(implies(or(U_95,U_94),or(U_94,U_95)))
| ~ r3 ) ),
inference(variable_rename,[status(thm)],[f_24_1]) ).
fof(f_24_3,plain,
( ( r3
| ? [U_96] : ~ is_a_theorem(implies(or(sK48,U_96),or(U_96,sK48))) )
& ( ! [U_95,U_94] : is_a_theorem(implies(or(U_95,U_94),or(U_94,U_95)))
| ~ r3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK48]),skolemize(U_97,sK48)],[f_24_2]) ).
fof(f_24_4,plain,
( ( r3
| ~ is_a_theorem(implies(or(sK48,sK49),or(sK49,sK48))) )
& ( ! [U_95,U_94] : is_a_theorem(implies(or(U_95,U_94),or(U_94,U_95)))
| ~ r3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK49]),skolemize(U_96,sK49)],[f_24_3]) ).
cnf(f_24_5,plain,
( is_a_theorem(implies(or(U_95,U_94),or(U_94,U_95)))
| ~ r3 ),
inference(clausify,[status(thm)],[f_24_4]) ).
fof(f_26_1,plain,
( ( r5
| ? [P,Q,R] : ~ is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| ~ r5 ) ),
inference(fof_nnf,[status(thm)],[r5]) ).
fof(f_26_2,plain,
( ( r5
| ? [U_109,U_108,U_107] : ~ is_a_theorem(implies(implies(U_108,U_107),implies(or(U_109,U_108),or(U_109,U_107)))) )
& ( ! [U_106,U_105,U_104] : is_a_theorem(implies(implies(U_105,U_104),implies(or(U_106,U_105),or(U_106,U_104))))
| ~ r5 ) ),
inference(variable_rename,[status(thm)],[f_26_1]) ).
fof(f_26_3,plain,
( ( r5
| ? [U_108,U_107] : ~ is_a_theorem(implies(implies(U_108,U_107),implies(or(sK53,U_108),or(sK53,U_107)))) )
& ( ! [U_106,U_105,U_104] : is_a_theorem(implies(implies(U_105,U_104),implies(or(U_106,U_105),or(U_106,U_104))))
| ~ r5 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53]),skolemize(U_109,sK53)],[f_26_2]) ).
fof(f_26_4,plain,
( ( r5
| ? [U_107] : ~ is_a_theorem(implies(implies(sK54,U_107),implies(or(sK53,sK54),or(sK53,U_107)))) )
& ( ! [U_106,U_105,U_104] : is_a_theorem(implies(implies(U_105,U_104),implies(or(U_106,U_105),or(U_106,U_104))))
| ~ r5 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK54]),skolemize(U_108,sK54)],[f_26_3]) ).
fof(f_26_5,plain,
( ( r5
| ~ is_a_theorem(implies(implies(sK54,sK55),implies(or(sK53,sK54),or(sK53,sK55)))) )
& ( ! [U_106,U_105,U_104] : is_a_theorem(implies(implies(U_105,U_104),implies(or(U_106,U_105),or(U_106,U_104))))
| ~ r5 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK55]),skolemize(U_107,sK55)],[f_26_4]) ).
cnf(f_26_6,plain,
( is_a_theorem(implies(implies(U_105,U_104),implies(or(U_106,U_105),or(U_106,U_104))))
| ~ r5 ),
inference(clausify,[status(thm)],[f_26_5]) ).
fof(f_30_1,plain,
( ! [X,Y] : implies(X,Y) = or(not(X),Y)
| ~ op_implies_or ),
inference(fof_nnf,[status(thm)],[op_implies_or]) ).
fof(f_30_2,plain,
( ! [U_117,U_116] : implies(U_117,U_116) = or(not(U_117),U_116)
| ~ op_implies_or ),
inference(variable_rename,[status(thm)],[f_30_1]) ).
cnf(f_30_3,plain,
( implies(U_117,U_116) = or(not(U_117),U_116)
| ~ op_implies_or ),
inference(clausify,[status(thm)],[f_30_2]) ).
fof(f_32_1,plain,
op_implies_or,
inference(fof_nnf,[status(thm)],[principia_op_implies_or]) ).
cnf(f_32_2,plain,
op_implies_or,
inference(clausify,[status(thm)],[f_32_1]) ).
fof(f_35_1,plain,
modus_ponens,
inference(fof_nnf,[status(thm)],[principia_modus_ponens]) ).
cnf(f_35_2,plain,
modus_ponens,
inference(clausify,[status(thm)],[f_35_1]) ).
fof(f_37_1,plain,
r2,
inference(fof_nnf,[status(thm)],[principia_r2]) ).
cnf(f_37_2,plain,
r2,
inference(clausify,[status(thm)],[f_37_1]) ).
fof(f_38_1,plain,
r3,
inference(fof_nnf,[status(thm)],[principia_r3]) ).
cnf(f_38_2,plain,
r3,
inference(clausify,[status(thm)],[f_38_1]) ).
fof(f_40_1,plain,
r5,
inference(fof_nnf,[status(thm)],[principia_r5]) ).
cnf(f_40_2,plain,
r5,
inference(clausify,[status(thm)],[f_40_1]) ).
fof(f_45_1,negated_conjecture,
~ or_1,
inference(negate,[status(cth)],[hilbert_or_1]) ).
fof(f_45_2,negated_conjecture,
~ or_1,
inference(definitional_conversion,[status(esa)],[f_45_1]) ).
cnf(f_45_3,negated_conjecture,
~ or_1,
inference(clausify,[status(thm)],[f_45_2]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( implies(Eq_x_0,Eq_x_1) = implies(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( or(Eq_x_0,Eq_x_1) = or(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_9,axiom,
( is_a_theorem(Eq_y_0)
| ~ is_a_theorem(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ or_1,
inference(start,[status(thm),parent(0:0)],[f_45_3]) ).
cnf(t2,plain,
( ~ is_a_theorem(implies(sK20,or(sK20,sK21)))
| or_1 ),
inference(extension,[status(thm),parent(t1:1)],[f_10_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ is_a_theorem(or(not(sK20),or(sK20,sK21)))
| or(not(sK20),or(sK20,sK21)) != implies(sK20,or(sK20,sK21))
| is_a_theorem(implies(sK20,or(sK20,sK21))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_9]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( implies(sK20,or(sK20,sK21)) != implies(sK20,or(sK20,sK21))
| or(not(sK20),or(sK20,sK21)) != implies(sK20,or(sK20,sK21))
| or(not(sK20),or(sK20,sK21)) = implies(sK20,or(sK20,sK21)) ),
inference(extension,[status(thm),parent(t4:2)],[equality_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( implies(sK20,or(sK20,sK21)) != or(not(sK20),or(sK20,sK21))
| or(not(sK20),or(sK20,sK21)) = implies(sK20,or(sK20,sK21)) ),
inference(extension,[status(thm),parent(t6:2)],[equality_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ op_implies_or
| implies(sK20,or(sK20,sK21)) = or(not(sK20),or(sK20,sK21)) ),
inference(extension,[status(thm),parent(t8:2)],[f_30_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
op_implies_or,
inference(extension,[status(thm),parent(t10:2)],[f_32_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( or(sK20,sK21) != or(sK20,sK21)
| sK20 != sK20
| implies(sK20,or(sK20,sK21)) = implies(sK20,or(sK20,sK21)) ),
inference(extension,[status(thm),parent(t6:3)],[equality_4]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t6:3]) ).
cnf(t16,plain,
( sK20 != sK20
| sK20 = sK20 ),
inference(extension,[status(thm),parent(t14:2)],[equality_2]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
sK20 = sK20,
inference(extension,[status(thm),parent(t16:2)],[equality_1]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
( sK21 != sK21
| sK20 != sK20
| or(sK20,sK21) = or(sK20,sK21) ),
inference(extension,[status(thm),parent(t14:3)],[equality_8]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t14:3]) ).
cnf(t22,plain,
sK20 = sK20,
inference(extension,[status(thm),parent(t20:2)],[equality_1]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
sK21 = sK21,
inference(extension,[status(thm),parent(t20:3)],[equality_1]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).
cnf(t26,plain,
( ~ is_a_theorem(or(not(sK20),or(sK21,sK20)))
| ~ is_a_theorem(implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21))))
| ~ modus_ponens
| is_a_theorem(or(not(sK20),or(sK20,sK21))) ),
inference(extension,[status(thm),parent(t4:3)],[f_1_5]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t4:3]) ).
cnf(t28,plain,
modus_ponens,
inference(extension,[status(thm),parent(t26:2)],[f_35_2]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(l14,lemma,
modus_ponens,
inference(lemma,[status(cth),parent(t26:2),below(t4:3)],[t26:2]) ).
cnf(t30,plain,
( ~ is_a_theorem(implies(or(sK21,sK20),or(sK20,sK21)))
| ~ is_a_theorem(implies(implies(or(sK21,sK20),or(sK20,sK21)),implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21)))))
| ~ modus_ponens
| is_a_theorem(implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21)))) ),
inference(extension,[status(thm),parent(t26:3)],[f_1_5]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t26:3]) ).
cnf(t32,plain,
modus_ponens,
inference(lemma_extension,[status(thm),parent(t30:2)],[l14:1]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).
cnf(t34,plain,
( ~ r5
| is_a_theorem(implies(implies(or(sK21,sK20),or(sK20,sK21)),implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21))))) ),
inference(extension,[status(thm),parent(t30:3)],[f_26_6]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t30:3]) ).
cnf(t36,plain,
r5,
inference(extension,[status(thm),parent(t34:2)],[f_40_2]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t34:2]) ).
cnf(t38,plain,
( ~ r3
| is_a_theorem(implies(or(sK21,sK20),or(sK20,sK21))) ),
inference(extension,[status(thm),parent(t30:4)],[f_24_5]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t30:4]) ).
cnf(t40,plain,
r3,
inference(extension,[status(thm),parent(t38:2)],[f_38_2]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).
cnf(t42,plain,
( ~ is_a_theorem(implies(sK20,or(sK21,sK20)))
| implies(sK20,or(sK21,sK20)) != or(not(sK20),or(sK21,sK20))
| is_a_theorem(or(not(sK20),or(sK21,sK20))) ),
inference(extension,[status(thm),parent(t26:4)],[equality_9]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t26:4]) ).
cnf(t44,plain,
( ~ op_implies_or
| implies(sK20,or(sK21,sK20)) = or(not(sK20),or(sK21,sK20)) ),
inference(extension,[status(thm),parent(t42:2)],[f_30_3]) ).
cnf(t45,plain,
$false,
inference(connection,[status(thm),parent(t44:1)],[t44:1,t42:2]) ).
cnf(t46,plain,
op_implies_or,
inference(extension,[status(thm),parent(t44:2)],[f_32_2]) ).
cnf(t47,plain,
$false,
inference(connection,[status(thm),parent(t46:1)],[t46:1,t44:2]) ).
cnf(t48,plain,
( ~ r2
| is_a_theorem(implies(sK20,or(sK21,sK20))) ),
inference(extension,[status(thm),parent(t42:3)],[f_23_5]) ).
cnf(t49,plain,
$false,
inference(connection,[status(thm),parent(t48:1)],[t48:1,t42:3]) ).
cnf(t50,plain,
r2,
inference(extension,[status(thm),parent(t48:2)],[f_37_2]) ).
cnf(t51,plain,
$false,
inference(connection,[status(thm),parent(t50:1)],[t50:1,t48:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.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.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 19 15:02:56 UTC 2026
% 0.10/0.38 % CPUTime :
% 27.67/27.92 % SZS status Theorem for theBenchmark
% 27.67/27.92 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------