TSTP Solution File: LCL518+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL518+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Aug 22 10:48:17 EDT 2023
% Result : Theorem 10.81s 3.55s
% Output : CNFRefutation 11.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 111
% Syntax : Number of formulae : 184 ( 56 unt; 92 typ; 0 def)
% Number of atoms : 136 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 81 ( 37 ~; 32 |; 1 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 34 ( 32 usr; 32 prp; 0-2 aty)
% Number of functors : 60 ( 60 usr; 55 con; 0-2 aty)
% Number of variables : 125 (; 125 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > or > implies > equiv > and > #nlpp > not > substitution_of_equivalents > r5 > r4 > r3 > r2 > r1 > or_3 > or_2 > or_1 > op_or > op_implies_or > op_implies_and > op_equiv > op_and > modus_tollens > modus_ponens > kn3 > kn2 > kn1 > implies_3 > implies_2 > implies_1 > equivalence_3 > equivalence_2 > equivalence_1 > cn3 > cn2 > cn1 > and_3 > and_2 > and_1 > #skF_33 > #skF_41 > #skF_52 > #skF_49 > #skF_20 > #skF_18 > #skF_17 > #skF_11 > #skF_31 > #skF_15 > #skF_25 > #skF_55 > #skF_38 > #skF_36 > #skF_54 > #skF_43 > #skF_19 > #skF_40 > #skF_48 > #skF_7 > #skF_37 > #skF_10 > #skF_16 > #skF_47 > #skF_26 > #skF_53 > #skF_14 > #skF_51 > #skF_5 > #skF_45 > #skF_46 > #skF_39 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_1 > #skF_21 > #skF_9 > #skF_32 > #skF_50 > #skF_8 > #skF_30 > #skF_42 > #skF_4 > #skF_22 > #skF_29 > #skF_28 > #skF_35 > #skF_24 > #skF_27 > #skF_23 > #skF_44 > #skF_12 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(implies_2,type,
implies_2: $o ).
tff(r1,type,
r1: $o ).
tff(equiv,type,
equiv: ( $i * $i ) > $i ).
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_41',type,
'#skF_41': $i ).
tff(r3,type,
r3: $o ).
tff('#skF_52',type,
'#skF_52': $i ).
tff(equivalence_2,type,
equivalence_2: $o ).
tff('#skF_49',type,
'#skF_49': $i ).
tff(and_2,type,
and_2: $o ).
tff('#skF_20',type,
'#skF_20': $i ).
tff(op_implies_or,type,
op_implies_or: $o ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff(r5,type,
r5: $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(kn3,type,
kn3: $o ).
tff('#skF_31',type,
'#skF_31': $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff(cn2,type,
cn2: $o ).
tff('#skF_55',type,
'#skF_55': $i ).
tff(r4,type,
r4: $o ).
tff('#skF_38',type,
'#skF_38': $i ).
tff('#skF_36',type,
'#skF_36': $i ).
tff('#skF_54',type,
'#skF_54': $i ).
tff('#skF_43',type,
'#skF_43': $i ).
tff(op_and,type,
op_and: $o ).
tff('#skF_19',type,
'#skF_19': $i ).
tff('#skF_40',type,
'#skF_40': $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff(and_3,type,
and_3: $o ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(op_implies_and,type,
op_implies_and: $o ).
tff(equivalence_1,type,
equivalence_1: $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(kn2,type,
kn2: $o ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(equivalence_3,type,
equivalence_3: $o ).
tff(and_1,type,
and_1: $o ).
tff('#skF_47',type,
'#skF_47': $i ).
tff(cn1,type,
cn1: $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff('#skF_53',type,
'#skF_53': $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff(or_1,type,
or_1: $o ).
tff(implies_3,type,
implies_3: $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_45',type,
'#skF_45': $i ).
tff('#skF_46',type,
'#skF_46': $i ).
tff('#skF_39',type,
'#skF_39': $i ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(modus_tollens,type,
modus_tollens: $o ).
tff(r2,type,
r2: $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(not,type,
not: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(modus_ponens,type,
modus_ponens: $o ).
tff(op_or,type,
op_or: $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(substitution_of_equivalents,type,
substitution_of_equivalents: $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_32',type,
'#skF_32': $i ).
tff(op_equiv,type,
op_equiv: $o ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_42',type,
'#skF_42': $i ).
tff(or_3,type,
or_3: $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(kn1,type,
kn1: $o ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_35',type,
'#skF_35': $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(implies_1,type,
implies_1: $o ).
tff('#skF_44',type,
'#skF_44': $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(cn3,type,
cn3: $o ).
tff(or_2,type,
or_2: $o ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_258,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
tff(f_210,axiom,
( op_implies_or
=> ! [X,Y] : ( implies(X,Y) = or(not(X),Y) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
tff(f_243,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
tff(f_244,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
tff(f_206,axiom,
( op_implies_and
=> ! [X,Y] : ( implies(X,Y) = not(and(X,not(Y))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
tff(f_198,axiom,
( op_or
=> ! [X,Y] : ( or(X,Y) = not(and(not(X),not(Y))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
tff(f_249,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
tff(f_125,axiom,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
tff(f_259,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
tff(f_202,axiom,
( op_and
=> ! [X,Y] : ( and(X,Y) = not(or(not(X),not(Y))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
tff(f_247,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
tff(f_60,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(X)
& is_a_theorem(implies(X,Y)) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
tff(f_250,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
tff(f_129,axiom,
( kn2
<=> ! [P,Q] : is_a_theorem(implies(and(P,Q),P)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
tff(f_251,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
tff(f_133,axiom,
( kn3
<=> ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P))))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
tff(f_146,axiom,
( cn3
<=> ! [P] : is_a_theorem(implies(implies(not(P),P),P)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn3) ).
tff(f_262,negated_conjecture,
~ r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
tff(f_151,axiom,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r1) ).
tff(c_138,plain,
op_implies_or,
inference(cnfTransformation,[status(thm)],[f_258]) ).
tff(c_118,plain,
! [X_62,Y_63] :
( ( or(not(X_62),Y_63) = implies(X_62,Y_63) )
| ~ op_implies_or ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_149,plain,
! [X_62,Y_63] : ( or(not(X_62),Y_63) = implies(X_62,Y_63) ),
inference(demodulation,[status(thm),theory(equality)],[c_138,c_118]) ).
tff(c_122,plain,
op_or,
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_124,plain,
op_implies_and,
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_116,plain,
! [X_60,Y_61] :
( ( not(and(X_60,not(Y_61))) = implies(X_60,Y_61) )
| ~ op_implies_and ),
inference(cnfTransformation,[status(thm)],[f_206]) ).
tff(c_151,plain,
! [X_60,Y_61] : ( not(and(X_60,not(Y_61))) = implies(X_60,Y_61) ),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_116]) ).
tff(c_112,plain,
! [X_56,Y_57] :
( ( not(and(not(X_56),not(Y_57))) = or(X_56,Y_57) )
| ~ op_or ),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_155,plain,
! [X_56,Y_57] : ( implies(not(X_56),Y_57) = or(X_56,Y_57) ),
inference(demodulation,[status(thm),theory(equality)],[c_122,c_151,c_112]) ).
tff(c_265,plain,
! [X_80,Y_81] : ( not(and(X_80,not(Y_81))) = implies(X_80,Y_81) ),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_116]) ).
tff(c_2968,plain,
! [X_262,X_263,Y_264] : ( implies(X_262,and(X_263,not(Y_264))) = not(and(X_262,implies(X_263,Y_264))) ),
inference(superposition,[status(thm),theory(equality)],[c_265,c_151]) ).
tff(c_130,plain,
kn1,
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_70,plain,
! [P_33] :
( is_a_theorem(implies(P_33,and(P_33,P_33)))
| ~ kn1 ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_170,plain,
! [P_33] : is_a_theorem(implies(P_33,and(P_33,P_33))),
inference(demodulation,[status(thm),theory(equality)],[c_130,c_70]) ).
tff(c_3060,plain,
! [Y_264] : is_a_theorem(not(and(not(Y_264),implies(not(Y_264),Y_264)))),
inference(superposition,[status(thm),theory(equality)],[c_2968,c_170]) ).
tff(c_3109,plain,
! [Y_265] : is_a_theorem(not(and(not(Y_265),or(Y_265,Y_265)))),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_3060]) ).
tff(c_140,plain,
op_and,
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_114,plain,
! [X_58,Y_59] :
( ( not(or(not(X_58),not(Y_59))) = and(X_58,Y_59) )
| ~ op_and ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_227,plain,
! [X_75,Y_76] : ( not(implies(X_75,not(Y_76))) = and(X_75,Y_76) ),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_149,c_114]) ).
tff(c_249,plain,
! [X_56,Y_76] : ( not(or(X_56,not(Y_76))) = and(not(X_56),Y_76) ),
inference(superposition,[status(thm),theory(equality)],[c_155,c_227]) ).
tff(c_153,plain,
! [X_58,Y_59] : ( not(implies(X_58,not(Y_59))) = and(X_58,Y_59) ),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_149,c_114]) ).
tff(c_589,plain,
! [X_104,Y_105] : ( not(or(X_104,not(Y_105))) = and(not(X_104),Y_105) ),
inference(superposition,[status(thm),theory(equality)],[c_155,c_227]) ).
tff(c_632,plain,
! [X_62,Y_105] : ( and(not(not(X_62)),Y_105) = not(implies(X_62,not(Y_105))) ),
inference(superposition,[status(thm),theory(equality)],[c_149,c_589]) ).
tff(c_638,plain,
! [X_106,Y_107] : ( and(not(not(X_106)),Y_107) = and(X_106,Y_107) ),
inference(demodulation,[status(thm),theory(equality)],[c_153,c_632]) ).
tff(c_128,plain,
modus_ponens,
inference(cnfTransformation,[status(thm)],[f_247]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(implies(X_1,Y_2))
| ~ is_a_theorem(X_1)
| ~ modus_ponens ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_252,plain,
! [Y_77,X_78] :
( is_a_theorem(Y_77)
| ~ is_a_theorem(implies(X_78,Y_77))
| ~ is_a_theorem(X_78) ),
inference(demodulation,[status(thm),theory(equality)],[c_128,c_2]) ).
tff(c_262,plain,
! [P_33] :
( is_a_theorem(and(P_33,P_33))
| ~ is_a_theorem(P_33) ),
inference(resolution,[status(thm)],[c_170,c_252]) ).
tff(c_942,plain,
! [X_136] :
( is_a_theorem(and(X_136,not(not(X_136))))
| ~ is_a_theorem(not(not(X_136))) ),
inference(superposition,[status(thm),theory(equality)],[c_638,c_262]) ).
tff(c_132,plain,
kn2,
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_74,plain,
! [P_34,Q_35] :
( is_a_theorem(implies(and(P_34,Q_35),P_34))
| ~ kn2 ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_166,plain,
! [P_34,Q_35] : is_a_theorem(implies(and(P_34,Q_35),P_34)),
inference(demodulation,[status(thm),theory(equality)],[c_132,c_74]) ).
tff(c_263,plain,
! [P_34,Q_35] :
( is_a_theorem(P_34)
| ~ is_a_theorem(and(P_34,Q_35)) ),
inference(resolution,[status(thm)],[c_166,c_252]) ).
tff(c_966,plain,
! [X_137] :
( is_a_theorem(X_137)
| ~ is_a_theorem(not(not(X_137))) ),
inference(resolution,[status(thm)],[c_942,c_263]) ).
tff(c_972,plain,
! [X_56,Y_76] :
( is_a_theorem(or(X_56,not(Y_76)))
| ~ is_a_theorem(not(and(not(X_56),Y_76))) ),
inference(superposition,[status(thm),theory(equality)],[c_249,c_966]) ).
tff(c_3141,plain,
! [Y_265] : is_a_theorem(or(Y_265,not(or(Y_265,Y_265)))),
inference(resolution,[status(thm)],[c_3109,c_972]) ).
tff(c_660,plain,
! [X_106] : is_a_theorem(implies(not(not(X_106)),and(X_106,not(not(X_106))))),
inference(superposition,[status(thm),theory(equality)],[c_638,c_170]) ).
tff(c_699,plain,
! [X_110] : is_a_theorem(implies(X_110,and(X_110,not(not(X_110))))),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_155,c_660]) ).
tff(c_719,plain,
! [X_56] : is_a_theorem(or(X_56,and(not(X_56),not(not(not(X_56)))))),
inference(superposition,[status(thm),theory(equality)],[c_155,c_699]) ).
tff(c_637,plain,
! [X_62,Y_105] : ( and(not(not(X_62)),Y_105) = and(X_62,Y_105) ),
inference(demodulation,[status(thm),theory(equality)],[c_153,c_632]) ).
tff(c_682,plain,
! [X_108,Y_109] : is_a_theorem(implies(and(X_108,Y_109),not(not(X_108)))),
inference(superposition,[status(thm),theory(equality)],[c_638,c_166]) ).
tff(c_688,plain,
! [X_62,Y_105] : is_a_theorem(implies(and(X_62,Y_105),not(not(not(not(X_62)))))),
inference(superposition,[status(thm),theory(equality)],[c_637,c_682]) ).
tff(c_280,plain,
! [X_80,Y_81,Y_57] : ( or(and(X_80,not(Y_81)),Y_57) = implies(implies(X_80,Y_81),Y_57) ),
inference(superposition,[status(thm),theory(equality)],[c_265,c_155]) ).
tff(c_134,plain,
kn3,
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_78,plain,
! [P_36,Q_37,R_38] :
( is_a_theorem(implies(implies(P_36,Q_37),implies(not(and(Q_37,R_38)),not(and(R_38,P_36)))))
| ~ kn3 ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_1608,plain,
! [P_189,Q_190,R_191] : is_a_theorem(implies(implies(P_189,Q_190),or(and(Q_190,R_191),not(and(R_191,P_189))))),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_155,c_78]) ).
tff(c_1633,plain,
! [X_56,Y_57,R_191] : is_a_theorem(implies(or(X_56,Y_57),or(and(Y_57,R_191),not(and(R_191,not(X_56)))))),
inference(superposition,[status(thm),theory(equality)],[c_155,c_1608]) ).
tff(c_2555,plain,
! [X_231,Y_232,R_233] : is_a_theorem(implies(or(X_231,Y_232),or(and(Y_232,R_233),implies(R_233,X_231)))),
inference(demodulation,[status(thm),theory(equality)],[c_151,c_1633]) ).
tff(c_2575,plain,
! [X_231,X_80,Y_81] : is_a_theorem(implies(or(X_231,X_80),implies(implies(X_80,Y_81),implies(not(Y_81),X_231)))),
inference(superposition,[status(thm),theory(equality)],[c_280,c_2555]) ).
tff(c_5811,plain,
! [X_343,X_344,Y_345] : is_a_theorem(implies(or(X_343,X_344),implies(implies(X_344,Y_345),or(Y_345,X_343)))),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_2575]) ).
tff(c_186,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(implies(X_1,Y_2))
| ~ is_a_theorem(X_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_128,c_2]) ).
tff(c_8345,plain,
! [X_407,Y_408,X_409] :
( is_a_theorem(implies(implies(X_407,Y_408),or(Y_408,X_409)))
| ~ is_a_theorem(or(X_409,X_407)) ),
inference(resolution,[status(thm)],[c_5811,c_186]) ).
tff(c_9358,plain,
! [Y_434,X_435,X_436] :
( is_a_theorem(or(Y_434,X_435))
| ~ is_a_theorem(implies(X_436,Y_434))
| ~ is_a_theorem(or(X_435,X_436)) ),
inference(resolution,[status(thm)],[c_8345,c_186]) ).
tff(c_9404,plain,
! [X_62,X_435,Y_105] :
( is_a_theorem(or(not(not(not(not(X_62)))),X_435))
| ~ is_a_theorem(or(X_435,and(X_62,Y_105))) ),
inference(resolution,[status(thm)],[c_688,c_9358]) ).
tff(c_9461,plain,
! [X_437,X_438,Y_439] :
( is_a_theorem(or(X_437,X_438))
| ~ is_a_theorem(or(X_438,and(X_437,Y_439))) ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_149,c_155,c_149,c_9404]) ).
tff(c_9511,plain,
! [X_56] : is_a_theorem(or(not(X_56),X_56)),
inference(resolution,[status(thm)],[c_719,c_9461]) ).
tff(c_9544,plain,
! [X_440] : is_a_theorem(implies(X_440,X_440)),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_9511]) ).
tff(c_8392,plain,
! [Y_408,X_409,X_407] :
( is_a_theorem(or(Y_408,X_409))
| ~ is_a_theorem(implies(X_407,Y_408))
| ~ is_a_theorem(or(X_409,X_407)) ),
inference(resolution,[status(thm)],[c_8345,c_186]) ).
tff(c_10619,plain,
! [X_463,X_464] :
( is_a_theorem(or(X_463,X_464))
| ~ is_a_theorem(or(X_464,X_463)) ),
inference(resolution,[status(thm)],[c_9544,c_8392]) ).
tff(c_10639,plain,
! [Y_265] : is_a_theorem(or(not(or(Y_265,Y_265)),Y_265)),
inference(resolution,[status(thm)],[c_3141,c_10619]) ).
tff(c_10667,plain,
! [Y_265] : is_a_theorem(implies(or(Y_265,Y_265),Y_265)),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_10639]) ).
tff(c_90,plain,
! [P_44] :
( is_a_theorem(implies(implies(not(P_44),P_44),P_44))
| ~ cn3 ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_157,plain,
! [P_44] :
( is_a_theorem(implies(or(P_44,P_44),P_44))
| ~ cn3 ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_90]) ).
tff(c_206,plain,
~ cn3,
inference(splitLeft,[status(thm)],[c_157]) ).
tff(c_88,plain,
( cn3
| ~ is_a_theorem(implies(implies(not('#skF_44'),'#skF_44'),'#skF_44')) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_158,plain,
( cn3
| ~ is_a_theorem(implies(or('#skF_44','#skF_44'),'#skF_44')) ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_88]) ).
tff(c_223,plain,
~ is_a_theorem(implies(or('#skF_44','#skF_44'),'#skF_44')),
inference(negUnitSimplification,[status(thm)],[c_206,c_158]) ).
tff(c_10682,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10667,c_223]) ).
tff(c_10683,plain,
! [P_44] : is_a_theorem(implies(or(P_44,P_44),P_44)),
inference(splitRight,[status(thm)],[c_157]) ).
tff(c_144,plain,
~ r1,
inference(cnfTransformation,[status(thm)],[f_262]) ).
tff(c_92,plain,
( r1
| ~ is_a_theorem(implies(or('#skF_45','#skF_45'),'#skF_45')) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_156,plain,
~ is_a_theorem(implies(or('#skF_45','#skF_45'),'#skF_45')),
inference(negUnitSimplification,[status(thm)],[c_144,c_92]) ).
tff(c_10687,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10683,c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL518+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.34 % Computer : n027.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 14:03:38 EDT 2023
% 0.16/0.34 % CPUTime :
% 10.81/3.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.81/3.56
% 10.81/3.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.21/3.60
% 11.21/3.60 Inference rules
% 11.21/3.60 ----------------------
% 11.21/3.60 #Ref : 0
% 11.21/3.60 #Sup : 2646
% 11.21/3.60 #Fact : 0
% 11.21/3.60 #Define : 0
% 11.21/3.60 #Split : 30
% 11.21/3.60 #Chain : 0
% 11.21/3.60 #Close : 0
% 11.21/3.60
% 11.21/3.60 Ordering : KBO
% 11.21/3.60
% 11.21/3.60 Simplification rules
% 11.21/3.60 ----------------------
% 11.21/3.60 #Subsume : 384
% 11.21/3.60 #Demod : 2578
% 11.21/3.60 #Tautology : 669
% 11.21/3.60 #SimpNegUnit : 14
% 11.21/3.60 #BackRed : 88
% 11.21/3.60
% 11.21/3.60 #Partial instantiations: 0
% 11.21/3.60 #Strategies tried : 1
% 11.21/3.60
% 11.21/3.60 Timing (in seconds)
% 11.21/3.60 ----------------------
% 11.21/3.61 Preprocessing : 0.62
% 11.21/3.61 Parsing : 0.31
% 11.21/3.61 CNF conversion : 0.05
% 11.21/3.61 Main loop : 1.97
% 11.21/3.61 Inferencing : 0.59
% 11.21/3.61 Reduction : 0.78
% 11.21/3.61 Demodulation : 0.58
% 11.21/3.61 BG Simplification : 0.07
% 11.21/3.61 Subsumption : 0.41
% 11.21/3.61 Abstraction : 0.07
% 11.21/3.61 MUC search : 0.00
% 11.21/3.61 Cooper : 0.00
% 11.21/3.61 Total : 2.66
% 11.21/3.61 Index Insertion : 0.00
% 11.21/3.61 Index Deletion : 0.00
% 11.21/3.61 Index Matching : 0.00
% 11.21/3.61 BG Taut test : 0.00
%------------------------------------------------------------------------------