%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL566+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:54 EDT 2022
% Result : Theorem 0.34s 24.53s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 28
% Syntax : Number of formulae : 131 ( 71 unt; 0 def)
% Number of atoms : 240 ( 38 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 183 ( 74 ~; 75 |; 17 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 19 con; 0-2 aty)
% Number of variables : 180 ( 2 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_adjunction,axiom,
adjunction,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_adjunction) ).
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(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(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(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(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(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(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(s1_0_axiom_m1,axiom,
axiom_m1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m1) ).
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(s1_0_axiom_m3,axiom,
axiom_m3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m3) ).
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(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(axiom_m5,axiom,
( axiom_m5
<=> ! [X1,X2,X3] : is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m5) ).
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_axiom_m5,axiom,
axiom_m5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m5) ).
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(op_possibly,axiom,
( op_possibly
=> ! [X1] : possibly(X1) = not(necessarily(not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_possibly) ).
fof(axiom_m6,axiom,
( axiom_m6
<=> ! [X1] : is_a_theorem(strict_implies(X1,possibly(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m6) ).
fof(s1_0_op_possibly,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_op_possibly) ).
fof(s1_0_m6s3m9b_axiom_m6,axiom,
axiom_m6,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+5.ax',s1_0_m6s3m9b_axiom_m6) ).
fof(km5_axiom_M,conjecture,
axiom_M,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',km5_axiom_M) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(c_0_28,plain,
! [X3,X4] :
( ( ~ adjunction
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X4)
| is_a_theorem(and(X3,X4)) )
& ( is_a_theorem(esk4_0)
| adjunction )
& ( is_a_theorem(esk5_0)
| adjunction )
& ( ~ is_a_theorem(and(esk4_0,esk5_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])])])])])])]) ).
fof(c_0_29,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_30,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
adjunction,
inference(split_conjunct,[status(thm)],[s1_0_adjunction]) ).
cnf(c_0_32,plain,
( strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1))
| ~ op_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
op_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv]) ).
fof(c_0_34,plain,
! [X2] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X2,and(X2,X2))) )
& ( ~ is_a_theorem(strict_implies(esk29_0,and(esk29_0,esk29_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_35,plain,
! [X3,X4] :
( ( ~ axiom_m2
| is_a_theorem(strict_implies(and(X3,X4),X3)) )
& ( ~ is_a_theorem(strict_implies(and(esk24_0,esk25_0),esk24_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])])])])])]) ).
fof(c_0_36,plain,
! [X3,X4] :
( ( ~ axiom_m1
| is_a_theorem(strict_implies(and(X3,X4),and(X4,X3))) )
& ( ~ is_a_theorem(strict_implies(and(esk22_0,esk23_0),and(esk23_0,esk22_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_37,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(esk2_0)
| modus_ponens_strict_implies )
& ( is_a_theorem(strict_implies(esk2_0,esk3_0))
| modus_ponens_strict_implies )
& ( ~ is_a_theorem(esk3_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])])])])])])]) ).
fof(c_0_38,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(esk26_0,esk27_0),esk28_0),and(esk26_0,and(esk27_0,esk28_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])])])])])]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ( ~ substitution_strict_equiv
| ~ is_a_theorem(strict_equiv(X3,X4))
| X3 = X4 )
& ( is_a_theorem(strict_equiv(esk6_0,esk7_0))
| substitution_strict_equiv )
& ( esk6_0 != esk7_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])])])])])])]) ).
cnf(c_0_40,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_30,c_0_31])]) ).
cnf(c_0_41,plain,
and(strict_implies(X1,X2),strict_implies(X2,X1)) = strict_equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_42,plain,
( is_a_theorem(strict_implies(X1,and(X1,X1)))
| ~ axiom_m4 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
axiom_m4,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m4]) ).
cnf(c_0_44,plain,
( is_a_theorem(strict_implies(and(X1,X2),X1))
| ~ axiom_m2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
axiom_m2,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m2]) ).
cnf(c_0_46,plain,
( is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))
| ~ axiom_m1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
axiom_m1,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m1]) ).
cnf(c_0_48,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_37]) ).
cnf(c_0_49,plain,
modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies]) ).
cnf(c_0_50,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_38]) ).
cnf(c_0_51,plain,
axiom_m3,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m3]) ).
cnf(c_0_52,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2))
| ~ substitution_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_53,plain,
substitution_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv]) ).
cnf(c_0_54,plain,
( is_a_theorem(strict_equiv(X1,X2))
| ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_55,plain,
is_a_theorem(strict_implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_56,plain,
is_a_theorem(strict_implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
fof(c_0_57,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_58,plain,
is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_59,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_48,c_0_49])]) ).
cnf(c_0_60,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_50,c_0_51])]) ).
cnf(c_0_61,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_62,plain,
is_a_theorem(strict_equiv(and(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_63,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_65,plain,
is_a_theorem(strict_equiv(and(X1,X2),and(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_58]),c_0_58])]) ).
cnf(c_0_66,plain,
( is_a_theorem(and(X1,and(X2,X3)))
| ~ is_a_theorem(and(and(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,plain,
and(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
fof(c_0_68,plain,
! [X4,X5,X6] :
( ( ~ axiom_m5
| is_a_theorem(strict_implies(and(strict_implies(X4,X5),strict_implies(X5,X6)),strict_implies(X4,X6))) )
& ( ~ is_a_theorem(strict_implies(and(strict_implies(esk30_0,esk31_0),strict_implies(esk31_0,esk32_0)),strict_implies(esk30_0,esk32_0)))
| axiom_m5 ) ),
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_m5])])])])])]) ).
fof(c_0_69,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_70,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_71,plain,
and(X1,X2) = and(X2,X1),
inference(spm,[status(thm)],[c_0_61,c_0_65]) ).
cnf(c_0_72,plain,
( is_a_theorem(and(X1,and(X1,X2)))
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,plain,
( is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))
| ~ axiom_m5 ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_74,plain,
axiom_m5,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m5]) ).
cnf(c_0_75,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_76,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_77,plain,
not(and(not(X1),X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
is_a_theorem(strict_implies(and(strict_implies(X1,X2),and(X3,strict_implies(X2,X1))),and(X3,strict_equiv(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_71]) ).
cnf(c_0_79,plain,
( is_a_theorem(and(X1,and(X2,X1)))
| ~ is_a_theorem(and(X2,X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_80,plain,
is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_81,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_82,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_70,c_0_77]) ).
cnf(c_0_83,plain,
( is_a_theorem(and(X1,strict_equiv(X2,X3)))
| ~ is_a_theorem(and(strict_implies(X3,X2),and(X1,strict_implies(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_59,c_0_78]) ).
cnf(c_0_84,plain,
( is_a_theorem(and(X1,and(X2,X1)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_40]) ).
cnf(c_0_85,plain,
strict_equiv(X1,X1) = strict_implies(X1,X1),
inference(spm,[status(thm)],[c_0_41,c_0_67]) ).
cnf(c_0_86,plain,
is_a_theorem(strict_implies(X1,X1)),
inference(rw,[status(thm)],[c_0_55,c_0_67]) ).
cnf(c_0_87,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(and(strict_implies(X1,X3),strict_implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_59,c_0_80]) ).
cnf(c_0_88,plain,
strict_implies(not(X1),X2) = strict_implies(not(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_81]) ).
cnf(c_0_89,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(and(X2,X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_90,plain,
( is_a_theorem(and(X1,strict_implies(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86])]) ).
cnf(c_0_91,plain,
( is_a_theorem(strict_implies(not(X1),X2))
| ~ is_a_theorem(and(strict_implies(not(X3),X1),strict_implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,plain,
( is_a_theorem(and(strict_implies(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,plain,
( is_a_theorem(strict_implies(not(not(X1)),X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
and(strict_implies(X1,not(X2)),strict_implies(not(X1),X2)) = strict_equiv(not(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_88]),c_0_71]) ).
cnf(c_0_95,plain,
strict_equiv(X1,X2) = strict_equiv(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_71]),c_0_41]) ).
cnf(c_0_96,plain,
( is_a_theorem(strict_implies(not(not(not(X1))),X2))
| ~ is_a_theorem(strict_implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_93,c_0_88]) ).
cnf(c_0_97,plain,
( is_a_theorem(strict_equiv(X1,not(not(X1))))
| ~ is_a_theorem(strict_implies(X1,not(not(X1)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_94]),c_0_95]) ).
cnf(c_0_98,plain,
is_a_theorem(strict_implies(not(X1),not(not(not(X1))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_86]),c_0_88]) ).
cnf(c_0_99,plain,
is_a_theorem(strict_equiv(not(X1),not(not(not(X1))))),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_100,plain,
not(not(not(X1))) = not(X1),
inference(spm,[status(thm)],[c_0_61,c_0_99]) ).
fof(c_0_101,plain,
! [X2] :
( ~ op_possibly
| possibly(X2) = not(necessarily(not(X2))) ),
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_possibly])])])])]) ).
cnf(c_0_102,plain,
implies(X1,not(not(X2))) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_100]),c_0_77]) ).
fof(c_0_103,plain,
! [X2] :
( ( ~ axiom_m6
| is_a_theorem(strict_implies(X2,possibly(X2))) )
& ( ~ is_a_theorem(strict_implies(esk33_0,possibly(esk33_0)))
| axiom_m6 ) ),
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_m6])])])])])]) ).
cnf(c_0_104,plain,
( possibly(X1) = not(necessarily(not(X1)))
| ~ op_possibly ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_105,plain,
op_possibly,
inference(split_conjunct,[status(thm)],[s1_0_op_possibly]) ).
cnf(c_0_106,plain,
strict_implies(X1,not(not(X2))) = strict_implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_102]),c_0_81]) ).
cnf(c_0_107,plain,
( is_a_theorem(strict_implies(X1,possibly(X1)))
| ~ axiom_m6 ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_108,plain,
possibly(X1) = not(necessarily(not(X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_109,plain,
axiom_m6,
inference(split_conjunct,[status(thm)],[s1_0_m6s3m9b_axiom_m6]) ).
cnf(c_0_110,plain,
is_a_theorem(strict_equiv(X1,not(not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_106]),c_0_86])]) ).
cnf(c_0_111,plain,
is_a_theorem(strict_implies(X1,not(necessarily(not(X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).
cnf(c_0_112,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_110]) ).
cnf(c_0_113,plain,
is_a_theorem(strict_implies(and(X1,not(X2)),not(strict_implies(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_70]),c_0_81]) ).
cnf(c_0_114,plain,
not(and(X1,X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_77,c_0_112]) ).
fof(c_0_115,negated_conjecture,
~ axiom_M,
inference(assume_negation,[status(cth)],[km5_axiom_M]) ).
cnf(c_0_116,plain,
is_a_theorem(strict_implies(and(not(X1),X2),not(strict_implies(X2,X1)))),
inference(spm,[status(thm)],[c_0_113,c_0_71]) ).
cnf(c_0_117,plain,
and(X1,X2) = not(implies(X2,not(X1))),
inference(spm,[status(thm)],[c_0_112,c_0_114]) ).
cnf(c_0_118,plain,
implies(not(X1),X1) = not(not(X1)),
inference(spm,[status(thm)],[c_0_70,c_0_67]) ).
fof(c_0_119,plain,
! [X2] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X2),X2)) )
& ( ~ is_a_theorem(implies(necessarily(esk10_0),esk10_0))
| axiom_M ) ),
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_M])])])])])]) ).
fof(c_0_120,negated_conjecture,
~ axiom_M,
inference(fof_simplification,[status(thm)],[c_0_115]) ).
cnf(c_0_121,plain,
is_a_theorem(strict_implies(strict_implies(X1,X2),implies(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117]),c_0_112]),c_0_88]),c_0_112]) ).
cnf(c_0_122,plain,
implies(not(X1),X1) = X1,
inference(rw,[status(thm)],[c_0_118,c_0_112]) ).
cnf(c_0_123,plain,
strict_implies(not(X1),X1) = necessarily(not(not(X1))),
inference(spm,[status(thm)],[c_0_81,c_0_118]) ).
cnf(c_0_124,plain,
( axiom_M
| ~ is_a_theorem(implies(necessarily(esk10_0),esk10_0)) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_125,negated_conjecture,
~ axiom_M,
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_59,c_0_121]) ).
cnf(c_0_127,plain,
is_a_theorem(strict_implies(necessarily(X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]),c_0_112]) ).
cnf(c_0_128,plain,
~ is_a_theorem(implies(necessarily(esk10_0),esk10_0)),
inference(sr,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_130,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_129])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL566+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 08:45:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.45 eprover: CPU time limit exceeded, terminating
% 0.34/24.53 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.34/24.53 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.34/24.53 # Preprocessing time : 0.014 s
% 0.34/24.53
% 0.34/24.53 # Failure: Out of unprocessed clauses!
% 0.34/24.53 # OLD status GaveUp
% 0.34/24.53 # Parsed axioms : 55
% 0.34/24.53 # Removed by relevancy pruning/SinE : 53
% 0.34/24.53 # Initial clauses : 3
% 0.34/24.53 # Removed in clause preprocessing : 0
% 0.34/24.53 # Initial clauses in saturation : 3
% 0.34/24.53 # Processed clauses : 3
% 0.34/24.53 # ...of these trivial : 0
% 0.34/24.53 # ...subsumed : 1
% 0.34/24.53 # ...remaining for further processing : 2
% 0.34/24.53 # Other redundant clauses eliminated : 0
% 0.34/24.53 # Clauses deleted for lack of memory : 0
% 0.34/24.53 # Backward-subsumed : 0
% 0.34/24.53 # Backward-rewritten : 0
% 0.34/24.53 # Generated clauses : 0
% 0.34/24.53 # ...of the previous two non-trivial : 0
% 0.34/24.53 # Contextual simplify-reflections : 0
% 0.34/24.53 # Paramodulations : 0
% 0.34/24.53 # Factorizations : 0
% 0.34/24.53 # Equation resolutions : 0
% 0.34/24.53 # Current number of processed clauses : 2
% 0.34/24.53 # Positive orientable unit clauses : 0
% 0.34/24.53 # Positive unorientable unit clauses: 0
% 0.34/24.53 # Negative unit clauses : 2
% 0.34/24.53 # Non-unit-clauses : 0
% 0.34/24.53 # Current number of unprocessed clauses: 0
% 0.34/24.53 # ...number of literals in the above : 0
% 0.34/24.53 # Current number of archived formulas : 0
% 0.34/24.53 # Current number of archived clauses : 0
% 0.34/24.53 # Clause-clause subsumption calls (NU) : 0
% 0.34/24.53 # Rec. Clause-clause subsumption calls : 0
% 0.34/24.53 # Non-unit clause-clause subsumptions : 0
% 0.34/24.53 # Unit Clause-clause subsumption calls : 0
% 0.34/24.53 # Rewrite failures with RHS unbound : 0
% 0.34/24.53 # BW rewrite match attempts : 0
% 0.34/24.53 # BW rewrite match successes : 0
% 0.34/24.53 # Condensation attempts : 0
% 0.34/24.53 # Condensation successes : 0
% 0.34/24.53 # Termbank termtop insertions : 496
% 0.34/24.53
% 0.34/24.53 # -------------------------------------------------
% 0.34/24.53 # User time : 0.012 s
% 0.34/24.53 # System time : 0.002 s
% 0.34/24.53 # Total time : 0.014 s
% 0.34/24.53 # Maximum resident set size: 2752 pages
% 0.34/24.53 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.34/24.53 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.34/24.53 # Preprocessing time : 0.014 s
% 0.34/24.53
% 0.34/24.53 # Failure: Out of unprocessed clauses!
% 0.34/24.53 # OLD status GaveUp
% 0.34/24.53 # Parsed axioms : 55
% 0.34/24.53 # Removed by relevancy pruning/SinE : 53
% 0.34/24.53 # Initial clauses : 3
% 0.34/24.53 # Removed in clause preprocessing : 0
% 0.34/24.53 # Initial clauses in saturation : 3
% 0.34/24.53 # Processed clauses : 3
% 0.34/24.53 # ...of these trivial : 0
% 0.34/24.53 # ...subsumed : 1
% 0.34/24.53 # ...remaining for further processing : 2
% 0.34/24.53 # Other redundant clauses eliminated : 0
% 0.34/24.53 # Clauses deleted for lack of memory : 0
% 0.34/24.53 # Backward-subsumed : 0
% 0.34/24.53 # Backward-rewritten : 0
% 0.34/24.53 # Generated clauses : 0
% 0.34/24.53 # ...of the previous two non-trivial : 0
% 0.34/24.53 # Contextual simplify-reflections : 0
% 0.34/24.53 # Paramodulations : 0
% 0.34/24.53 # Factorizations : 0
% 0.34/24.53 # Equation resolutions : 0
% 0.34/24.53 # Current number of processed clauses : 2
% 0.34/24.53 # Positive orientable unit clauses : 0
% 0.34/24.53 # Positive unorientable unit clauses: 0
% 0.34/24.53 # Negative unit clauses : 1
% 0.34/24.53 # Non-unit-clauses : 1
% 0.34/24.53 # Current number of unprocessed clauses: 0
% 0.34/24.53 # ...number of literals in the above : 0
% 0.34/24.53 # Current number of archived formulas : 0
% 0.34/24.53 # Current number of archived clauses : 0
% 0.34/24.53 # Clause-clause subsumption calls (NU) : 0
% 0.34/24.53 # Rec. Clause-clause subsumption calls : 0
% 0.34/24.53 # Non-unit clause-clause subsumptions : 0
% 0.34/24.53 # Unit Clause-clause subsumption calls : 0
% 0.34/24.53 # Rewrite failures with RHS unbound : 0
% 0.34/24.53 # BW rewrite match attempts : 0
% 0.34/24.53 # BW rewrite match successes : 0
% 0.34/24.53 # Condensation attempts : 0
% 0.34/24.53 # Condensation successes : 0
% 0.34/24.53 # Termbank termtop insertions : 496
% 0.34/24.53
% 0.34/24.53 # -------------------------------------------------
% 0.34/24.53 # User time : 0.013 s
% 0.34/24.53 # System time : 0.001 s
% 0.34/24.53 # Total time : 0.014 s
% 0.34/24.53 # Maximum resident set size: 2760 pages
% 0.34/24.53 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.34/24.53 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.34/24.53 # Preprocessing time : 0.014 s
% 0.34/24.53
% 0.34/24.53 # Failure: Out of unprocessed clauses!
% 0.34/24.53 # OLD status GaveUp
% 0.34/24.53 # Parsed axioms : 55
% 0.34/24.53 # Removed by relevancy pruning/SinE : 53
% 0.34/24.53 # Initial clauses : 3
% 0.34/24.53 # Removed in clause preprocessing : 0
% 0.34/24.53 # Initial clauses in saturation : 3
% 0.34/24.53 # Processed clauses : 3
% 0.34/24.53 # ...of these trivial : 0
% 0.34/24.53 # ...subsumed : 1
% 0.34/24.53 # ...remaining for further processing : 2
% 0.34/24.53 # Other redundant clauses eliminated : 0
% 0.34/24.53 # Clauses deleted for lack of memory : 0
% 0.34/24.53 # Backward-subsumed : 0
% 0.34/24.53 # Backward-rewritten : 0
% 0.34/24.53 # Generated clauses : 0
% 0.34/24.53 # ...of the previous two non-trivial : 0
% 0.34/24.53 # Contextual simplify-reflections : 0
% 0.34/24.53 # Paramodulations : 0
% 0.34/24.53 # Factorizations : 0
% 0.34/24.53 # Equation resolutions : 0
% 0.34/24.53 # Current number of processed clauses : 2
% 0.34/24.53 # Positive orientable unit clauses : 0
% 0.34/24.53 # Positive unorientable unit clauses: 0
% 0.34/24.53 # Negative unit clauses : 2
% 0.34/24.53 # Non-unit-clauses : 0
% 0.34/24.53 # Current number of unprocessed clauses: 0
% 0.34/24.53 # ...number of literals in the above : 0
% 0.34/24.53 # Current number of archived formulas : 0
% 0.34/24.53 # Current number of archived clauses : 0
% 0.34/24.53 # Clause-clause subsumption calls (NU) : 0
% 0.34/24.53 # Rec. Clause-clause subsumption calls : 0
% 0.34/24.53 # Non-unit clause-clause subsumptions : 0
% 0.34/24.53 # Unit Clause-clause subsumption calls : 0
% 0.34/24.53 # Rewrite failures with RHS unbound : 0
% 0.34/24.53 # BW rewrite match attempts : 0
% 0.34/24.53 # BW rewrite match successes : 0
% 0.34/24.53 # Condensation attempts : 0
% 0.34/24.53 # Condensation successes : 0
% 0.34/24.53 # Termbank termtop insertions : 496
% 0.34/24.53
% 0.34/24.53 # -------------------------------------------------
% 0.34/24.53 # User time : 0.011 s
% 0.34/24.53 # System time : 0.003 s
% 0.34/24.53 # Total time : 0.014 s
% 0.34/24.53 # Maximum resident set size: 2808 pages
% 0.34/24.53 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.34/24.53
% 0.34/24.53 # Failure: Resource limit exceeded (time)
% 0.34/24.53 # OLD status Res
% 0.34/24.53 # Preprocessing time : 0.018 s
% 0.34/24.53 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.34/24.53 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.34/24.53 # Preprocessing time : 0.007 s
% 0.34/24.53
% 0.34/24.53 # Failure: Out of unprocessed clauses!
% 0.34/24.53 # OLD status GaveUp
% 0.34/24.53 # Parsed axioms : 55
% 0.34/24.53 # Removed by relevancy pruning/SinE : 53
% 0.34/24.53 # Initial clauses : 3
% 0.34/24.53 # Removed in clause preprocessing : 0
% 0.34/24.53 # Initial clauses in saturation : 3
% 0.34/24.53 # Processed clauses : 3
% 0.34/24.53 # ...of these trivial : 0
% 0.34/24.53 # ...subsumed : 1
% 0.34/24.53 # ...remaining for further processing : 2
% 0.34/24.53 # Other redundant clauses eliminated : 0
% 0.34/24.53 # Clauses deleted for lack of memory : 0
% 0.34/24.53 # Backward-subsumed : 0
% 0.34/24.53 # Backward-rewritten : 0
% 0.34/24.53 # Generated clauses : 0
% 0.34/24.53 # ...of the previous two non-trivial : 0
% 0.34/24.53 # Contextual simplify-reflections : 0
% 0.34/24.53 # Paramodulations : 0
% 0.34/24.53 # Factorizations : 0
% 0.34/24.53 # Equation resolutions : 0
% 0.34/24.53 # Current number of processed clauses : 2
% 0.34/24.53 # Positive orientable unit clauses : 0
% 0.34/24.53 # Positive unorientable unit clauses: 0
% 0.34/24.53 # Negative unit clauses : 2
% 0.34/24.53 # Non-unit-clauses : 0
% 0.34/24.53 # Current number of unprocessed clauses: 0
% 0.34/24.53 # ...number of literals in the above : 0
% 0.34/24.53 # Current number of archived formulas : 0
% 0.34/24.53 # Current number of archived clauses : 0
% 0.34/24.53 # Clause-clause subsumption calls (NU) : 0
% 0.34/24.53 # Rec. Clause-clause subsumption calls : 0
% 0.34/24.53 # Non-unit clause-clause subsumptions : 0
% 0.34/24.53 # Unit Clause-clause subsumption calls : 0
% 0.34/24.53 # Rewrite failures with RHS unbound : 0
% 0.34/24.53 # BW rewrite match attempts : 0
% 0.34/24.53 # BW rewrite match successes : 0
% 0.34/24.53 # Condensation attempts : 0
% 0.34/24.53 # Condensation successes : 0
% 0.34/24.53 # Termbank termtop insertions : 496
% 0.34/24.53
% 0.34/24.53 # -------------------------------------------------
% 0.34/24.53 # User time : 0.006 s
% 0.34/24.53 # System time : 0.001 s
% 0.34/24.53 # Total time : 0.008 s
% 0.34/24.53 # Maximum resident set size: 2756 pages
% 0.34/24.53 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.34/24.53 # Preprocessing time : 0.010 s
% 0.34/24.53
% 0.34/24.53 # Proof found!
% 0.34/24.53 # SZS status Theorem
% 0.34/24.53 # SZS output start CNFRefutation
% See solution above
% 0.34/24.53 # Proof object total steps : 131
% 0.34/24.53 # Proof object clause steps : 87
% 0.34/24.53 # Proof object formula steps : 44
% 0.34/24.53 # Proof object conjectures : 4
% 0.34/24.53 # Proof object clause conjectures : 1
% 0.34/24.53 # Proof object formula conjectures : 3
% 0.34/24.53 # Proof object initial clauses used : 28
% 0.34/24.53 # Proof object initial formulas used : 28
% 0.34/24.53 # Proof object generating inferences : 40
% 0.34/24.53 # Proof object simplifying inferences : 57
% 0.34/24.53 # Training examples: 0 positive, 0 negative
% 0.34/24.53 # Parsed axioms : 55
% 0.34/24.53 # Removed by relevancy pruning/SinE : 0
% 0.34/24.53 # Initial clauses : 84
% 0.34/24.53 # Removed in clause preprocessing : 0
% 0.34/24.53 # Initial clauses in saturation : 84
% 0.34/24.53 # Processed clauses : 1296
% 0.34/24.53 # ...of these trivial : 130
% 0.34/24.53 # ...subsumed : 641
% 0.34/24.53 # ...remaining for further processing : 525
% 0.34/24.53 # Other redundant clauses eliminated : 0
% 0.34/24.53 # Clauses deleted for lack of memory : 0
% 0.34/24.53 # Backward-subsumed : 5
% 0.34/24.53 # Backward-rewritten : 369
% 0.34/24.53 # Generated clauses : 16888
% 0.34/24.53 # ...of the previous two non-trivial : 14993
% 0.34/24.53 # Contextual simplify-reflections : 0
% 0.34/24.53 # Paramodulations : 16888
% 0.34/24.53 # Factorizations : 0
% 0.34/24.53 # Equation resolutions : 0
% 0.34/24.53 # Current number of processed clauses : 151
% 0.34/24.53 # Positive orientable unit clauses : 52
% 0.34/24.53 # Positive unorientable unit clauses: 4
% 0.34/24.53 # Negative unit clauses : 2
% 0.34/24.53 # Non-unit-clauses : 93
% 0.34/24.53 # Current number of unprocessed clauses: 723
% 0.34/24.53 # ...number of literals in the above : 1340
% 0.34/24.53 # Current number of archived formulas : 0
% 0.34/24.53 # Current number of archived clauses : 374
% 0.34/24.53 # Clause-clause subsumption calls (NU) : 9427
% 0.34/24.53 # Rec. Clause-clause subsumption calls : 8953
% 0.34/24.53 # Non-unit clause-clause subsumptions : 620
% 0.34/24.53 # Unit Clause-clause subsumption calls : 764
% 0.34/24.53 # Rewrite failures with RHS unbound : 0
% 0.34/24.53 # BW rewrite match attempts : 2044
% 0.34/24.53 # BW rewrite match successes : 414
% 0.34/24.53 # Condensation attempts : 0
% 0.34/24.53 # Condensation successes : 0
% 0.34/24.53 # Termbank termtop insertions : 284748
% 0.34/24.53
% 0.34/24.53 # -------------------------------------------------
% 0.34/24.53 # User time : 0.150 s
% 0.34/24.53 # System time : 0.006 s
% 0.34/24.53 # Total time : 0.156 s
% 0.34/24.53 # Maximum resident set size: 17048 pages
%------------------------------------------------------------------------------