%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL555+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Sun Jul 17 10:11:51 EDT 2022
% Result : Theorem 1.05s 121.22s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 23
% Syntax : Number of formulae : 143 ( 96 unt; 0 def)
% Number of atoms : 236 ( 74 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 159 ( 66 ~; 62 |; 16 &)
% ( 9 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 17 con; 0-2 aty)
% Number of variables : 262 ( 29 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(substitution_strict_equiv,axiom,
( substitution_strict_equiv
<=> ! [X1,X2] :
( is_a_theorem(strict_equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',substitution_strict_equiv) ).
fof(op_strict_equiv,axiom,
( op_strict_equiv
=> ! [X1,X2] : strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_equiv) ).
fof(s1_0_substitution_strict_equiv,axiom,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_substitution_strict_equiv) ).
fof(s1_0_op_strict_equiv,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_op_strict_equiv) ).
fof(adjunction,axiom,
( adjunction
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(X2) )
=> is_a_theorem(and(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
fof(s1_0_adjunction,axiom,
adjunction,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_adjunction) ).
fof(axiom_m1,axiom,
( axiom_m1
<=> ! [X1,X2] : is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m1) ).
fof(axiom_m3,axiom,
( axiom_m3
<=> ! [X1,X2,X3] : is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m3) ).
fof(s1_0_axiom_m1,axiom,
axiom_m1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m1) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m4) ).
fof(axiom_m2,axiom,
( axiom_m2
<=> ! [X1,X2] : is_a_theorem(strict_implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m2) ).
fof(s1_0_axiom_m3,axiom,
axiom_m3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m3) ).
fof(s1_0_axiom_m4,axiom,
axiom_m4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m4) ).
fof(s1_0_axiom_m2,axiom,
axiom_m2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m2) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',hilbert_op_implies_and) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_op_strict_implies) ).
fof(hilbert_and_1,conjecture,
and_1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',hilbert_and_1) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(modus_ponens_strict_implies,axiom,
( modus_ponens_strict_implies
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).
fof(s1_0_modus_ponens_strict_implies,axiom,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_modus_ponens_strict_implies) ).
fof(c_0_23,plain,
! [X3,X4] :
( ( ~ substitution_strict_equiv
| ~ is_a_theorem(strict_equiv(X3,X4))
| X3 = X4 )
& ( is_a_theorem(strict_equiv(esk61_0,esk62_0))
| substitution_strict_equiv )
& ( esk61_0 != esk62_0
| substitution_strict_equiv ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_strict_equiv])])])])])])]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ~ op_strict_equiv
| strict_equiv(X3,X4) = and(strict_implies(X3,X4),strict_implies(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_equiv])])])])]) ).
cnf(c_0_25,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2))
| ~ substitution_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
substitution_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv]) ).
cnf(c_0_27,plain,
( strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1))
| ~ op_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
op_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ( ~ adjunction
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X4)
| is_a_theorem(and(X3,X4)) )
& ( is_a_theorem(esk59_0)
| adjunction )
& ( is_a_theorem(esk60_0)
| adjunction )
& ( ~ is_a_theorem(and(esk59_0,esk60_0))
| adjunction ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[adjunction])])])])])])]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_31,plain,
strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_32,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
adjunction,
inference(split_conjunct,[status(thm)],[s1_0_adjunction]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ( ~ axiom_m1
| is_a_theorem(strict_implies(and(X3,X4),and(X4,X3))) )
& ( ~ is_a_theorem(strict_implies(and(esk77_0,esk78_0),and(esk78_0,esk77_0)))
| axiom_m1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m1])])])])])]) ).
fof(c_0_35,plain,
! [X4,X5,X6] :
( ( ~ axiom_m3
| is_a_theorem(strict_implies(and(and(X4,X5),X6),and(X4,and(X5,X6)))) )
& ( ~ is_a_theorem(strict_implies(and(and(esk81_0,esk82_0),esk83_0),and(esk81_0,and(esk82_0,esk83_0))))
| axiom_m3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m3])])])])])]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ is_a_theorem(and(strict_implies(X1,X2),strict_implies(X2,X1))) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_38,plain,
( is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))
| ~ axiom_m1 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
axiom_m1,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m1]) ).
fof(c_0_40,plain,
! [X2] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X2,and(X2,X2))) )
& ( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])])])]) ).
fof(c_0_41,plain,
! [X3,X4] :
( ( ~ axiom_m2
| is_a_theorem(strict_implies(and(X3,X4),X3)) )
& ( ~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0))
| axiom_m2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m2])])])])])]) ).
cnf(c_0_42,plain,
( is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))
| ~ axiom_m3 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
axiom_m3,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m3]) ).
cnf(c_0_44,plain,
( X1 = X2
| ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_46,plain,
( is_a_theorem(strict_implies(X1,and(X1,X1)))
| ~ axiom_m4 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
axiom_m4,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m4]) ).
cnf(c_0_48,plain,
( is_a_theorem(strict_implies(and(X1,X2),X1))
| ~ axiom_m2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
axiom_m2,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m2]) ).
fof(c_0_50,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(X3,not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])])]) ).
cnf(c_0_51,plain,
is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_52,plain,
and(X1,X2) = and(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45])]) ).
cnf(c_0_53,plain,
is_a_theorem(strict_implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_54,plain,
is_a_theorem(strict_implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_55,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_57,plain,
is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(X2,and(X3,X1)))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
and(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_54])]) ).
cnf(c_0_59,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_60,plain,
is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(X2,and(X1,X3)))),
inference(spm,[status(thm)],[c_0_57,c_0_52]) ).
cnf(c_0_61,plain,
is_a_theorem(strict_implies(and(X1,X2),and(X1,and(X1,X2)))),
inference(spm,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_62,plain,
is_a_theorem(strict_implies(and(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
fof(c_0_63,plain,
! [X3,X4] :
( ~ op_strict_implies
| strict_implies(X3,X4) = necessarily(implies(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])])])]) ).
cnf(c_0_64,plain,
not(and(not(X1),X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_59,c_0_52]) ).
cnf(c_0_65,plain,
and(X1,and(X2,X3)) = and(X2,and(X1,X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_60]),c_0_60])]) ).
cnf(c_0_66,plain,
and(X1,and(X1,X2)) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_61]),c_0_62])]) ).
cnf(c_0_67,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_69,plain,
not(and(X1,and(not(X2),X3))) = implies(and(X1,X3),X2),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
and(X1,and(X2,X1)) = and(X2,X1),
inference(spm,[status(thm)],[c_0_66,c_0_52]) ).
cnf(c_0_71,plain,
and(X1,and(X2,X3)) = and(and(X1,X3),X2),
inference(spm,[status(thm)],[c_0_52,c_0_65]) ).
cnf(c_0_72,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_73,plain,
implies(and(not(X1),X2),X3) = implies(and(not(X3),X2),X1),
inference(spm,[status(thm)],[c_0_64,c_0_69]) ).
cnf(c_0_74,plain,
and(X1,and(X2,X3)) = and(X2,and(X3,X1)),
inference(spm,[status(thm)],[c_0_65,c_0_52]) ).
cnf(c_0_75,plain,
and(X1,and(X2,and(X3,X1))) = and(X2,and(X3,X1)),
inference(spm,[status(thm)],[c_0_65,c_0_70]) ).
cnf(c_0_76,plain,
and(and(X1,X2),X3) = and(X1,and(X2,X3)),
inference(spm,[status(thm)],[c_0_71,c_0_52]) ).
cnf(c_0_77,plain,
strict_implies(and(not(X1),X2),X3) = strict_implies(and(not(X3),X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_72]) ).
cnf(c_0_78,plain,
and(X1,and(X2,and(X3,X4))) = and(X4,and(X2,and(X3,and(X4,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_76]) ).
cnf(c_0_79,plain,
( and(X1,X2) = X1
| ~ is_a_theorem(strict_implies(X1,and(X1,X2))) ),
inference(spm,[status(thm)],[c_0_44,c_0_54]) ).
cnf(c_0_80,plain,
is_a_theorem(strict_implies(and(X1,not(X1)),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_77]),c_0_52]) ).
cnf(c_0_81,plain,
and(X1,and(X2,and(X3,X4))) = and(X4,and(X2,and(X3,and(X1,X4)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_70]),c_0_76]),c_0_75]) ).
cnf(c_0_82,plain,
and(X1,and(not(X1),X2)) = and(X1,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_76]) ).
cnf(c_0_83,plain,
and(X1,and(X2,not(X2))) = and(X3,and(X2,not(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_82]) ).
cnf(c_0_84,plain,
and(X1,and(X2,and(X3,not(X3)))) = and(X1,not(X1)),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_85,plain,
implies(and(not(X1),X2),X1) = implies(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_66]),c_0_64]) ).
cnf(c_0_86,plain,
and(X1,not(X1)) = and(X2,and(X3,not(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_84]),c_0_76]),c_0_76]),c_0_82]) ).
cnf(c_0_87,plain,
implies(and(X1,and(not(X2),X3)),X2) = implies(and(X3,X1),X2),
inference(spm,[status(thm)],[c_0_85,c_0_74]) ).
cnf(c_0_88,plain,
implies(and(X1,not(X2)),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_70]),c_0_59]) ).
cnf(c_0_89,plain,
not(and(X1,and(X2,not(X2)))) = implies(X3,X3),
inference(spm,[status(thm)],[c_0_59,c_0_86]) ).
cnf(c_0_90,plain,
implies(and(X1,X2),X1) = implies(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_82]),c_0_59]) ).
cnf(c_0_91,plain,
implies(and(X1,X2),X2) = implies(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_82]),c_0_88]) ).
cnf(c_0_92,plain,
implies(and(X1,and(X2,implies(X2,X3))),X3) = implies(X4,X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_64]),c_0_76]),c_0_69]) ).
cnf(c_0_93,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_59,c_0_64]) ).
cnf(c_0_94,plain,
implies(and(not(X1),X2),X3) = implies(and(X2,not(X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_73]),c_0_66]) ).
cnf(c_0_95,plain,
implies(and(X1,and(X2,not(X2))),X3) = implies(X3,X3),
inference(spm,[status(thm)],[c_0_90,c_0_83]) ).
cnf(c_0_96,plain,
implies(and(X1,not(X1)),X2) = implies(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_91]),c_0_52]) ).
cnf(c_0_97,plain,
implies(X1,X1) = implies(and(X2,implies(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_85,c_0_92]) ).
cnf(c_0_98,plain,
implies(not(X1),and(X2,not(X3))) = implies(implies(X2,X3),X1),
inference(spm,[status(thm)],[c_0_93,c_0_59]) ).
cnf(c_0_99,plain,
implies(X1,X1) = implies(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_76]),c_0_82]),c_0_96]) ).
cnf(c_0_100,plain,
implies(X1,X1) = implies(and(not(X2),implies(not(X3),X2)),X3),
inference(spm,[status(thm)],[c_0_73,c_0_97]) ).
cnf(c_0_101,plain,
implies(not(X1),and(X2,not(X2))) = implies(implies(X3,X3),X1),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
fof(c_0_102,negated_conjecture,
~ and_1,
inference(assume_negation,[status(cth)],[hilbert_and_1]) ).
cnf(c_0_103,plain,
implies(X1,X1) = implies(and(implies(X2,X2),implies(implies(X3,X3),X4)),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_59]) ).
fof(c_0_104,plain,
! [X3,X4] :
( ( ~ and_1
| is_a_theorem(implies(and(X3,X4),X3)) )
& ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])])])]) ).
fof(c_0_105,negated_conjecture,
~ and_1,
inference(fof_simplification,[status(thm)],[c_0_102]) ).
cnf(c_0_106,plain,
implies(X1,X1) = implies(and(implies(X2,X2),implies(X3,X3)),implies(X4,X4)),
inference(spm,[status(thm)],[c_0_103,c_0_99]) ).
cnf(c_0_107,plain,
( and_1
| ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_108,negated_conjecture,
~ and_1,
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_109,plain,
and(X1,not(X1)) = and(X2,and(X3,not(X2))),
inference(spm,[status(thm)],[c_0_65,c_0_86]) ).
cnf(c_0_110,plain,
strict_implies(not(X1),X2) = strict_implies(not(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_93]),c_0_72]) ).
cnf(c_0_111,plain,
implies(X1,X1) = implies(implies(X2,X2),implies(X3,X3)),
inference(spm,[status(thm)],[c_0_106,c_0_58]) ).
cnf(c_0_112,plain,
~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)),
inference(sr,[status(thm)],[c_0_107,c_0_108]) ).
fof(c_0_113,plain,
! [X5] :
( ( ~ kn1
| is_a_theorem(implies(X5,and(X5,X5))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])])])]) ).
cnf(c_0_114,plain,
and(X1,not(X1)) = and(X2,and(X3,and(not(X2),X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_109]),c_0_76]),c_0_82]),c_0_76]) ).
cnf(c_0_115,plain,
( and(X1,X2) = X2
| ~ is_a_theorem(strict_implies(X2,and(X1,X2))) ),
inference(spm,[status(thm)],[c_0_44,c_0_62]) ).
cnf(c_0_116,plain,
strict_implies(not(X1),and(X2,not(X3))) = strict_implies(implies(X2,X3),X1),
inference(spm,[status(thm)],[c_0_110,c_0_59]) ).
cnf(c_0_117,plain,
strict_implies(X1,X1) = strict_implies(implies(X2,X2),implies(X3,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_111]),c_0_72]) ).
cnf(c_0_118,plain,
implies(and(X1,and(X2,not(X2))),X3) = implies(X4,X4),
inference(spm,[status(thm)],[c_0_95,c_0_99]) ).
cnf(c_0_119,plain,
not(not(X1)) = implies(not(X1),X1),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_120,plain,
~ is_a_theorem(implies(and(esk15_0,esk14_0),esk14_0)),
inference(rw,[status(thm)],[c_0_112,c_0_52]) ).
cnf(c_0_121,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
fof(c_0_122,plain,
! [X3,X4] :
( ( ~ modus_ponens_strict_implies
| ~ is_a_theorem(X3)
| ~ is_a_theorem(strict_implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk57_0)
| modus_ponens_strict_implies )
& ( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies )
& ( ~ is_a_theorem(esk58_0)
| modus_ponens_strict_implies ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens_strict_implies])])])])])])]) ).
cnf(c_0_123,plain,
not(and(X1,and(X2,and(not(X1),X3)))) = implies(X4,X4),
inference(spm,[status(thm)],[c_0_59,c_0_114]) ).
cnf(c_0_124,plain,
( and(X1,not(X2)) = not(X2)
| ~ is_a_theorem(strict_implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_125,plain,
strict_implies(X1,X1) = strict_implies(implies(and(X2,and(X3,not(X3))),X4),implies(X5,X5)),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_126,plain,
not(implies(X1,X2)) = implies(implies(X1,X2),and(not(X2),X1)),
inference(spm,[status(thm)],[c_0_119,c_0_64]) ).
cnf(c_0_127,plain,
is_a_theorem(strict_implies(X1,X1)),
inference(rw,[status(thm)],[c_0_53,c_0_58]) ).
cnf(c_0_128,plain,
( kn1
| ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_129,plain,
~ is_a_theorem(implies(esk14_0,esk14_0)),
inference(rw,[status(thm)],[c_0_120,c_0_91]) ).
cnf(c_0_130,plain,
( is_a_theorem(implies(X1,X1))
| ~ kn1 ),
inference(rw,[status(thm)],[c_0_121,c_0_58]) ).
cnf(c_0_131,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_132,plain,
modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies]) ).
cnf(c_0_133,plain,
necessarily(not(and(X1,and(X2,and(not(X1),X3))))) = strict_implies(X4,X4),
inference(spm,[status(thm)],[c_0_72,c_0_123]) ).
cnf(c_0_134,plain,
and(X1,and(X2,not(X2))) = implies(implies(X3,X3),and(X3,not(X3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),c_0_52]),c_0_76]),c_0_76]),c_0_82]),c_0_126]),c_0_52]),c_0_127])]) ).
cnf(c_0_135,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_59,c_0_59]) ).
cnf(c_0_136,plain,
( kn1
| ~ is_a_theorem(implies(esk33_0,esk33_0)) ),
inference(rw,[status(thm)],[c_0_128,c_0_58]) ).
cnf(c_0_137,plain,
~ kn1,
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_138,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_132])]) ).
cnf(c_0_139,plain,
strict_implies(X1,implies(X2,X2)) = strict_implies(X3,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135]),c_0_59]),c_0_58]),c_0_72]) ).
cnf(c_0_140,plain,
~ is_a_theorem(implies(X1,X1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_99]),c_0_137]) ).
cnf(c_0_141,plain,
~ is_a_theorem(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_127])]),c_0_140]) ).
cnf(c_0_142,plain,
$false,
inference(sr,[status(thm)],[c_0_45,c_0_141]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL555+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 06:38:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.43 eprover: CPU time limit exceeded, terminating
% 0.38/23.48 eprover: CPU time limit exceeded, terminating
% 0.53/46.44 eprover: CPU time limit exceeded, terminating
% 0.53/46.44 eprover: CPU time limit exceeded, terminating
% 0.53/46.46 eprover: CPU time limit exceeded, terminating
% 0.53/46.50 eprover: CPU time limit exceeded, terminating
% 0.70/69.46 eprover: CPU time limit exceeded, terminating
% 0.70/69.48 eprover: CPU time limit exceeded, terminating
% 0.70/69.53 eprover: CPU time limit exceeded, terminating
% 0.70/69.56 eprover: CPU time limit exceeded, terminating
% 0.86/92.50 eprover: CPU time limit exceeded, terminating
% 0.86/92.52 eprover: CPU time limit exceeded, terminating
% 0.86/92.57 eprover: CPU time limit exceeded, terminating
% 1.00/115.55 eprover: CPU time limit exceeded, terminating
% 1.00/115.59 eprover: CPU time limit exceeded, terminating
% 1.05/121.22 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 1.05/121.22
% 1.05/121.22 # Failure: Resource limit exceeded (time)
% 1.05/121.22 # OLD status Res
% 1.05/121.22 # Preprocessing time : 0.022 s
% 1.05/121.22 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.05/121.22 # Preprocessing time : 0.017 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.014 s
% 1.05/121.22 # System time : 0.003 s
% 1.05/121.22 # Total time : 0.017 s
% 1.05/121.22 # Maximum resident set size: 2904 pages
% 1.05/121.22 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 1.05/121.22
% 1.05/121.22 # Failure: Resource limit exceeded (time)
% 1.05/121.22 # OLD status Res
% 1.05/121.22 # Preprocessing time : 0.021 s
% 1.05/121.22 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 1.05/121.22
% 1.05/121.22 # Failure: Resource limit exceeded (time)
% 1.05/121.22 # OLD status Res
% 1.05/121.22 # Preprocessing time : 0.021 s
% 1.05/121.22 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 1.05/121.22 # Preprocessing time : 0.017 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.014 s
% 1.05/121.22 # System time : 0.003 s
% 1.05/121.22 # Total time : 0.017 s
% 1.05/121.22 # Maximum resident set size: 3116 pages
% 1.05/121.22 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 1.05/121.22
% 1.05/121.22 # Failure: Resource limit exceeded (time)
% 1.05/121.22 # OLD status Res
% 1.05/121.22 # Preprocessing time : 0.022 s
% 1.05/121.22 # Running protocol protocol_eprover_6017f334107ca4679a9978dd19d7c76a8bd36e48 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,,1.4,,02,20000,1.0)
% 1.05/121.22 # Preprocessing time : 0.009 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.008 s
% 1.05/121.22 # System time : 0.001 s
% 1.05/121.22 # Total time : 0.009 s
% 1.05/121.22 # Maximum resident set size: 3172 pages
% 1.05/121.22 # Running protocol protocol_eprover_29f46a864b4eba32a7d0333eeab34cc2a3bfeeb2 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,04,500,1.0)
% 1.05/121.22 # Preprocessing time : 0.008 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.005 s
% 1.05/121.22 # System time : 0.002 s
% 1.05/121.22 # Total time : 0.008 s
% 1.05/121.22 # Maximum resident set size: 2848 pages
% 1.05/121.22 # Running protocol protocol_eprover_6c6e328223588bd61ac14315e52cd57432d78a40 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,04,20000,1.0)
% 1.05/121.22 # Preprocessing time : 0.008 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.006 s
% 1.05/121.22 # System time : 0.002 s
% 1.05/121.22 # Total time : 0.008 s
% 1.05/121.22 # Maximum resident set size: 3168 pages
% 1.05/121.22 # Running protocol protocol_eprover_d060f57557112503de4e70311f17201fbe20b6a3 for 23 seconds:
% 1.05/121.22
% 1.05/121.22 # Failure: Resource limit exceeded (time)
% 1.05/121.22 # OLD status Res
% 1.05/121.22 # Preprocessing time : 0.011 s
% 1.05/121.22 # Running protocol protocol_eprover_7e73d521eed2eff17dc17155adefb3ab5d9c1092 for 23 seconds:
% 1.05/121.22 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,80,1.0)
% 1.05/121.22 # Preprocessing time : 0.007 s
% 1.05/121.22
% 1.05/121.22 # Failure: Out of unprocessed clauses!
% 1.05/121.22 # OLD status GaveUp
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 75
% 1.05/121.22 # Initial clauses : 3
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 3
% 1.05/121.22 # Processed clauses : 3
% 1.05/121.22 # ...of these trivial : 0
% 1.05/121.22 # ...subsumed : 1
% 1.05/121.22 # ...remaining for further processing : 2
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 0
% 1.05/121.22 # Backward-subsumed : 0
% 1.05/121.22 # Backward-rewritten : 0
% 1.05/121.22 # Generated clauses : 0
% 1.05/121.22 # ...of the previous two non-trivial : 0
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 0
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2
% 1.05/121.22 # Positive orientable unit clauses : 0
% 1.05/121.22 # Positive unorientable unit clauses: 0
% 1.05/121.22 # Negative unit clauses : 2
% 1.05/121.22 # Non-unit-clauses : 0
% 1.05/121.22 # Current number of unprocessed clauses: 0
% 1.05/121.22 # ...number of literals in the above : 0
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 0
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 0
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 0
% 1.05/121.22 # Non-unit clause-clause subsumptions : 0
% 1.05/121.22 # Unit Clause-clause subsumption calls : 0
% 1.05/121.22 # Rewrite failures with RHS unbound : 0
% 1.05/121.22 # BW rewrite match attempts : 0
% 1.05/121.22 # BW rewrite match successes : 0
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 786
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 0.005 s
% 1.05/121.22 # System time : 0.002 s
% 1.05/121.22 # Total time : 0.007 s
% 1.05/121.22 # Maximum resident set size: 3112 pages
% 1.05/121.22 # Running protocol protocol_eprover_d352e266807dcdd44825904f97f73b76738a5cd0 for 23 seconds:
% 1.05/121.22 # Preprocessing time : 0.010 s
% 1.05/121.22
% 1.05/121.22 # Proof found!
% 1.05/121.22 # SZS status Theorem
% 1.05/121.22 # SZS output start CNFRefutation
% See solution above
% 1.05/121.22 # Proof object total steps : 143
% 1.05/121.22 # Proof object clause steps : 106
% 1.05/121.22 # Proof object formula steps : 37
% 1.05/121.22 # Proof object conjectures : 4
% 1.05/121.22 # Proof object clause conjectures : 1
% 1.05/121.22 # Proof object formula conjectures : 3
% 1.05/121.22 # Proof object initial clauses used : 24
% 1.05/121.22 # Proof object initial formulas used : 23
% 1.05/121.22 # Proof object generating inferences : 64
% 1.05/121.22 # Proof object simplifying inferences : 81
% 1.05/121.22 # Training examples: 0 positive, 0 negative
% 1.05/121.22 # Parsed axioms : 77
% 1.05/121.22 # Removed by relevancy pruning/SinE : 0
% 1.05/121.22 # Initial clauses : 135
% 1.05/121.22 # Removed in clause preprocessing : 0
% 1.05/121.22 # Initial clauses in saturation : 135
% 1.05/121.22 # Processed clauses : 156358
% 1.05/121.22 # ...of these trivial : 2353
% 1.05/121.22 # ...subsumed : 150637
% 1.05/121.22 # ...remaining for further processing : 3368
% 1.05/121.22 # Other redundant clauses eliminated : 0
% 1.05/121.22 # Clauses deleted for lack of memory : 241383
% 1.05/121.22 # Backward-subsumed : 277
% 1.05/121.22 # Backward-rewritten : 459
% 1.05/121.22 # Generated clauses : 707806
% 1.05/121.22 # ...of the previous two non-trivial : 672294
% 1.05/121.22 # Contextual simplify-reflections : 0
% 1.05/121.22 # Paramodulations : 704914
% 1.05/121.22 # Factorizations : 0
% 1.05/121.22 # Equation resolutions : 0
% 1.05/121.22 # Current number of processed clauses : 2546
% 1.05/121.22 # Positive orientable unit clauses : 304
% 1.05/121.22 # Positive unorientable unit clauses: 473
% 1.05/121.22 # Negative unit clauses : 316
% 1.05/121.22 # Non-unit-clauses : 1453
% 1.05/121.22 # Current number of unprocessed clauses: 150260
% 1.05/121.22 # ...number of literals in the above : 226911
% 1.05/121.22 # Current number of archived formulas : 0
% 1.05/121.22 # Current number of archived clauses : 822
% 1.05/121.22 # Clause-clause subsumption calls (NU) : 701116
% 1.05/121.22 # Rec. Clause-clause subsumption calls : 595150
% 1.05/121.22 # Non-unit clause-clause subsumptions : 8695
% 1.05/121.22 # Unit Clause-clause subsumption calls : 137568
% 1.05/121.22 # Rewrite failures with RHS unbound : 44455
% 1.05/121.22 # BW rewrite match attempts : 103923
% 1.05/121.22 # BW rewrite match successes : 6177
% 1.05/121.22 # Condensation attempts : 0
% 1.05/121.22 # Condensation successes : 0
% 1.05/121.22 # Termbank termtop insertions : 6964751
% 1.05/121.22
% 1.05/121.22 # -------------------------------------------------
% 1.05/121.22 # User time : 4.883 s
% 1.05/121.22 # System time : 0.107 s
% 1.05/121.22 # Total time : 4.990 s
% 1.05/121.22 # Maximum resident set size: 145552 pages
%------------------------------------------------------------------------------