%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL573+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:56 EDT 2022
% Result : Theorem 0.90s 126.07s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 24
% Syntax : Number of formulae : 147 ( 97 unt; 0 def)
% Number of atoms : 243 ( 80 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 160 ( 64 ~; 65 |; 16 &)
% ( 9 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 16 con; 0-2 aty)
% Number of variables : 256 ( 19 sgn 44 !; 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(s1_0_axiom_m3,axiom,
axiom_m3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax',s1_0_axiom_m3) ).
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(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(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_op_implies_and) ).
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_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(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(km5_axiom_5,conjecture,
axiom_5,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',km5_axiom_5) ).
fof(axiom_m10,axiom,
( axiom_m10
<=> ! [X1] : is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m10) ).
fof(axiom_5,axiom,
( axiom_5
<=> ! [X1] : is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(s1_0_m10_axiom_m10,axiom,
axiom_m10,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+6.ax',s1_0_m10_axiom_m10) ).
fof(c_0_24,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])])])])])])]) ).
fof(c_0_25,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_26,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2))
| ~ substitution_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
substitution_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv]) ).
cnf(c_0_28,plain,
( strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1))
| ~ op_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
op_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv]) ).
fof(c_0_30,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])])])])])])]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ is_a_theorem(strict_equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,plain,
strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
adjunction,
inference(split_conjunct,[status(thm)],[s1_0_adjunction]) ).
fof(c_0_35,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_36,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])])])])])]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ is_a_theorem(and(strict_implies(X1,X2),strict_implies(X2,X1))) ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,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_33,c_0_34])]) ).
cnf(c_0_39,plain,
( is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))
| ~ axiom_m1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
axiom_m1,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m1]) ).
cnf(c_0_41,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_36]) ).
cnf(c_0_42,plain,
axiom_m3,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m3]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
fof(c_0_45,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_46,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_41,c_0_42])]) ).
cnf(c_0_47,plain,
and(X1,X2) = and(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_44])]) ).
fof(c_0_48,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_49,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])])])])])]) ).
cnf(c_0_50,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_52,plain,
is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(X2,and(X3,X1)))),
inference(pm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( is_a_theorem(strict_implies(X1,and(X1,X1)))
| ~ axiom_m4 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
axiom_m4,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m4]) ).
cnf(c_0_55,plain,
( is_a_theorem(strict_implies(and(X1,X2),X1))
| ~ axiom_m2 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,plain,
axiom_m2,
inference(split_conjunct,[status(thm)],[s1_0_axiom_m2]) ).
cnf(c_0_57,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_58,plain,
is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(X2,and(X1,X3)))),
inference(pm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_59,plain,
is_a_theorem(strict_implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_60,plain,
is_a_theorem(strict_implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
fof(c_0_61,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_62,plain,
not(and(not(X1),X2)) = implies(X2,X1),
inference(pm,[status(thm)],[c_0_57,c_0_47]) ).
cnf(c_0_63,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_43,c_0_58]),c_0_58])]) ).
cnf(c_0_64,plain,
and(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_59]),c_0_60])]) ).
cnf(c_0_65,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_67,plain,
not(and(X1,and(not(X2),X3))) = implies(and(X1,X3),X2),
inference(pm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
is_a_theorem(strict_implies(and(X1,X2),and(X1,and(X1,X2)))),
inference(spm,[status(thm)],[c_0_46,c_0_64]) ).
cnf(c_0_69,plain,
is_a_theorem(strict_implies(and(X1,X2),X2)),
inference(pm,[status(thm)],[c_0_60,c_0_47]) ).
cnf(c_0_70,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_71,plain,
implies(and(not(X1),X2),X3) = implies(and(not(X3),X2),X1),
inference(spm,[status(thm)],[c_0_62,c_0_67]) ).
cnf(c_0_72,plain,
and(X1,and(X1,X2)) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_68]),c_0_69])]) ).
cnf(c_0_73,plain,
strict_implies(and(not(X1),X2),X3) = strict_implies(and(not(X3),X2),X1),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_70,c_0_71]),c_0_70]) ).
cnf(c_0_74,plain,
and(X1,and(X2,X3)) = and(and(X1,X3),X2),
inference(pm,[status(thm)],[c_0_47,c_0_63]) ).
cnf(c_0_75,plain,
implies(and(not(X1),X2),X1) = implies(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_72]),c_0_62]) ).
cnf(c_0_76,plain,
( and(X1,X2) = X1
| ~ is_a_theorem(strict_implies(X1,and(X1,X2))) ),
inference(spm,[status(thm)],[c_0_43,c_0_60]) ).
cnf(c_0_77,plain,
is_a_theorem(strict_implies(and(X1,not(X1)),X2)),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_69,c_0_73]),c_0_47]) ).
cnf(c_0_78,plain,
and(and(X1,X2),X3) = and(X1,and(X2,X3)),
inference(pm,[status(thm)],[c_0_74,c_0_47]) ).
cnf(c_0_79,plain,
and(X1,and(X2,X1)) = and(X1,X2),
inference(pm,[status(thm)],[c_0_72,c_0_47]) ).
cnf(c_0_80,plain,
implies(and(X1,and(not(X2),X3)),X2) = implies(and(X1,X3),X2),
inference(pm,[status(thm)],[c_0_75,c_0_63]) ).
cnf(c_0_81,plain,
and(X1,and(not(X1),X2)) = and(X1,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_82,plain,
implies(and(X1,not(X2)),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_79]),c_0_62]) ).
cnf(c_0_83,plain,
and(X1,and(X2,X3)) = and(X3,and(X1,X2)),
inference(pm,[status(thm)],[c_0_63,c_0_47]) ).
cnf(c_0_84,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_57,c_0_57]) ).
cnf(c_0_85,plain,
implies(and(X1,X2),X1) = implies(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_86,plain,
and(X1,and(X2,X3)) = and(X3,and(X2,X1)),
inference(pm,[status(thm)],[c_0_63,c_0_83]) ).
cnf(c_0_87,plain,
not(and(X1,and(X2,and(not(X3),X4)))) = implies(and(X1,and(X2,X4)),X3),
inference(pm,[status(thm)],[c_0_67,c_0_63]) ).
cnf(c_0_88,plain,
not(and(implies(X1,X2),X3)) = implies(X3,and(X1,not(X2))),
inference(pm,[status(thm)],[c_0_84,c_0_47]) ).
cnf(c_0_89,plain,
implies(and(X1,and(X2,X3)),X3) = implies(X3,X3),
inference(pm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
implies(and(X1,not(X1)),X2) = implies(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_81]),c_0_57]),c_0_81]) ).
cnf(c_0_91,plain,
implies(and(implies(X1,X2),X3),and(X1,not(X2))) = implies(X3,and(X1,not(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_72]),c_0_88]) ).
cnf(c_0_92,plain,
implies(X1,X1) = implies(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_81]),c_0_90]) ).
cnf(c_0_93,plain,
implies(and(implies(X1,X1),X2),and(X3,not(X3))) = implies(X2,and(X3,not(X3))),
inference(pm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
implies(X1,and(implies(X2,X2),and(X3,implies(X4,X4)))) = implies(X1,and(X3,implies(X4,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_93]),c_0_88]),c_0_57]),c_0_57]),c_0_78]) ).
cnf(c_0_95,plain,
strict_implies(and(not(X1),X2),X1) = strict_implies(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_75]),c_0_70]) ).
cnf(c_0_96,plain,
implies(X1,and(implies(X2,X2),implies(X3,X3))) = implies(X1,implies(X3,X3)),
inference(spm,[status(thm)],[c_0_94,c_0_64]) ).
cnf(c_0_97,plain,
strict_implies(and(X1,and(not(X2),X3)),X2) = strict_implies(and(X1,X3),X2),
inference(pm,[status(thm)],[c_0_95,c_0_63]) ).
cnf(c_0_98,plain,
strict_implies(and(X1,not(X2)),X2) = strict_implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_82]),c_0_70]) ).
cnf(c_0_99,plain,
and(X1,and(X2,and(not(X1),X3))) = and(X1,not(X1)),
inference(pm,[status(thm)],[c_0_81,c_0_63]) ).
cnf(c_0_100,plain,
( and(X1,X2) = X1
| ~ is_a_theorem(strict_implies(X1,and(X2,X1))) ),
inference(pm,[status(thm)],[c_0_76,c_0_47]) ).
cnf(c_0_101,plain,
strict_implies(X1,and(implies(X2,X2),implies(X3,X3))) = strict_implies(X1,implies(X3,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_96]),c_0_70]) ).
cnf(c_0_102,plain,
is_a_theorem(strict_implies(X1,X1)),
inference(rw,[status(thm)],[c_0_59,c_0_64]) ).
cnf(c_0_103,plain,
strict_implies(and(X1,X2),X1) = strict_implies(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_81]),c_0_98]) ).
cnf(c_0_104,plain,
and(not(X1),and(X2,and(X3,X1))) = and(X1,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_99]),c_0_78]) ).
cnf(c_0_105,plain,
and(X1,and(X2,not(X2))) = and(X2,not(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_81]),c_0_78]),c_0_81]) ).
cnf(c_0_106,plain,
and(implies(X1,X1),implies(X2,X2)) = implies(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]) ).
cnf(c_0_107,plain,
strict_implies(and(X1,X2),X2) = strict_implies(X2,X2),
inference(pm,[status(thm)],[c_0_103,c_0_47]) ).
cnf(c_0_108,plain,
and(X1,and(not(X2),and(X3,implies(and(X1,X3),X2)))) = and(X2,not(X2)),
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_104,c_0_99]),c_0_67]),c_0_105]),c_0_105]),c_0_67]),c_0_78]),c_0_78]) ).
cnf(c_0_109,plain,
and(implies(X1,X1),and(implies(X2,X2),X3)) = and(implies(X1,X1),X3),
inference(spm,[status(thm)],[c_0_78,c_0_106]) ).
cnf(c_0_110,plain,
and(X1,and(X2,not(and(X1,X2)))) = and(X2,not(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_104]),c_0_105]),c_0_78]) ).
cnf(c_0_111,plain,
strict_implies(and(X1,not(X1)),X2) = strict_implies(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_107]),c_0_47]) ).
cnf(c_0_112,plain,
( and(X1,X2) = X2
| ~ is_a_theorem(strict_implies(X2,and(X1,X2))) ),
inference(spm,[status(thm)],[c_0_43,c_0_69]) ).
cnf(c_0_113,plain,
and(implies(X1,X1),and(X2,implies(X2,and(X3,not(X3))))) = and(X3,not(X3)),
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_108,c_0_93]),c_0_57]),c_0_109]),c_0_57]),c_0_78]),c_0_81]) ).
cnf(c_0_114,plain,
strict_implies(and(X1,implies(X1,X2)),X2) = strict_implies(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_110]),c_0_111]),c_0_62]) ).
cnf(c_0_115,plain,
strict_implies(and(X1,implies(X2,X3)),and(not(X3),X2)) = strict_implies(X1,and(not(X3),X2)),
inference(spm,[status(thm)],[c_0_98,c_0_62]) ).
cnf(c_0_116,plain,
and(X1,implies(X1,and(X2,not(X2)))) = and(X2,not(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_102])]) ).
cnf(c_0_117,plain,
strict_implies(X1,and(implies(X2,X2),X1)) = strict_implies(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_57]),c_0_111]),c_0_57]) ).
cnf(c_0_118,plain,
and(implies(X1,X1),X2) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_117]),c_0_102]),c_0_107]),c_0_102])]) ).
cnf(c_0_119,plain,
not(X1) = implies(X1,and(X2,not(X2))),
inference(spm,[status(thm)],[c_0_88,c_0_118]) ).
fof(c_0_120,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])])])])])])]) ).
cnf(c_0_121,plain,
necessarily(not(X1)) = strict_implies(X1,and(X2,not(X2))),
inference(pm,[status(thm)],[c_0_70,c_0_119]) ).
cnf(c_0_122,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_120]) ).
cnf(c_0_123,plain,
modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies]) ).
fof(c_0_124,negated_conjecture,
~ axiom_5,
inference(assume_negation,[status(cth)],[km5_axiom_5]) ).
cnf(c_0_125,plain,
( and(X1,not(X1)) = X1
| ~ is_a_theorem(necessarily(not(X1))) ),
inference(pm,[status(thm)],[c_0_76,c_0_121]) ).
cnf(c_0_126,plain,
and(not(X1),and(X2,implies(X2,X1))) = and(X1,not(X1)),
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_104,c_0_81]),c_0_62]),c_0_105]),c_0_105]),c_0_62]),c_0_78]) ).
cnf(c_0_127,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_122,c_0_123])]) ).
fof(c_0_128,plain,
! [X2] :
( ( ~ axiom_m10
| is_a_theorem(strict_implies(possibly(X2),necessarily(possibly(X2)))) )
& ( ~ is_a_theorem(strict_implies(possibly(esk39_0),necessarily(possibly(esk39_0))))
| axiom_m10 ) ),
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_m10])])])])])]) ).
fof(c_0_129,plain,
! [X2] :
( ( ~ axiom_5
| is_a_theorem(implies(possibly(X2),necessarily(possibly(X2)))) )
& ( ~ is_a_theorem(implies(possibly(esk13_0),necessarily(possibly(esk13_0))))
| axiom_5 ) ),
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_5])])])])])]) ).
fof(c_0_130,negated_conjecture,
~ axiom_5,
inference(fof_simplification,[status(thm)],[c_0_124]) ).
cnf(c_0_131,plain,
( and(not(X1),X2) = and(X1,not(X1))
| ~ is_a_theorem(strict_implies(X2,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_62]),c_0_78]),c_0_126]),c_0_70]) ).
cnf(c_0_132,plain,
and(implies(X1,X1),X2) = and(X2,implies(X3,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_109]),c_0_106]) ).
cnf(c_0_133,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_127,c_0_60]) ).
cnf(c_0_134,plain,
( is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_m10 ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_135,plain,
axiom_m10,
inference(split_conjunct,[status(thm)],[s1_0_m10_axiom_m10]) ).
cnf(c_0_136,plain,
( axiom_5
| ~ is_a_theorem(implies(possibly(esk13_0),necessarily(possibly(esk13_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_137,negated_conjecture,
~ axiom_5,
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_138,plain,
implies(and(X1,implies(X1,X2)),X2) = implies(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_110]),c_0_57]),c_0_62]) ).
cnf(c_0_139,plain,
( implies(X1,X1) = implies(X2,X1)
| ~ is_a_theorem(strict_implies(X2,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_131]),c_0_57]) ).
cnf(c_0_140,plain,
and(X1,implies(X2,X2)) = X1,
inference(rw,[status(thm)],[c_0_132,c_0_118]) ).
cnf(c_0_141,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_133,c_0_118]) ).
cnf(c_0_142,plain,
is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135])]) ).
cnf(c_0_143,plain,
~ is_a_theorem(implies(possibly(esk13_0),necessarily(possibly(esk13_0)))),
inference(sr,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_144,plain,
( implies(X1,X2) = implies(X1,X1)
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_146,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_143,c_0_144]),c_0_145]),c_0_142])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL573+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.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 21:12:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.42 eprover: CPU time limit exceeded, terminating
% 0.35/23.43 eprover: CPU time limit exceeded, terminating
% 0.35/23.48 eprover: CPU time limit exceeded, terminating
% 0.47/46.44 eprover: CPU time limit exceeded, terminating
% 0.47/46.45 eprover: CPU time limit exceeded, terminating
% 0.47/46.45 eprover: CPU time limit exceeded, terminating
% 0.47/46.50 eprover: CPU time limit exceeded, terminating
% 0.59/69.46 eprover: CPU time limit exceeded, terminating
% 0.59/69.47 eprover: CPU time limit exceeded, terminating
% 0.59/69.53 eprover: CPU time limit exceeded, terminating
% 0.59/69.54 eprover: CPU time limit exceeded, terminating
% 0.70/92.48 eprover: CPU time limit exceeded, terminating
% 0.70/92.50 eprover: CPU time limit exceeded, terminating
% 0.70/92.55 eprover: CPU time limit exceeded, terminating
% 0.70/92.56 eprover: CPU time limit exceeded, terminating
% 0.85/115.52 eprover: CPU time limit exceeded, terminating
% 0.85/115.55 eprover: CPU time limit exceeded, terminating
% 0.90/126.07 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.90/126.07
% 0.90/126.07 # Failure: Resource limit exceeded (time)
% 0.90/126.07 # OLD status Res
% 0.90/126.07 # Preprocessing time : 0.019 s
% 0.90/126.07 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.90/126.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.90/126.07 # Preprocessing time : 0.015 s
% 0.90/126.07
% 0.90/126.07 # Failure: Out of unprocessed clauses!
% 0.90/126.07 # OLD status GaveUp
% 0.90/126.07 # Parsed axioms : 52
% 0.90/126.07 # Removed by relevancy pruning/SinE : 50
% 0.90/126.07 # Initial clauses : 3
% 0.90/126.07 # Removed in clause preprocessing : 0
% 0.90/126.07 # Initial clauses in saturation : 3
% 0.90/126.07 # Processed clauses : 3
% 0.90/126.07 # ...of these trivial : 0
% 0.90/126.07 # ...subsumed : 1
% 0.90/126.07 # ...remaining for further processing : 2
% 0.90/126.07 # Other redundant clauses eliminated : 0
% 0.90/126.07 # Clauses deleted for lack of memory : 0
% 0.90/126.07 # Backward-subsumed : 0
% 0.90/126.07 # Backward-rewritten : 0
% 0.90/126.07 # Generated clauses : 0
% 0.90/126.07 # ...of the previous two non-trivial : 0
% 0.90/126.07 # Contextual simplify-reflections : 0
% 0.90/126.07 # Paramodulations : 0
% 0.90/126.07 # Factorizations : 0
% 0.90/126.07 # Equation resolutions : 0
% 0.90/126.07 # Current number of processed clauses : 2
% 0.90/126.07 # Positive orientable unit clauses : 0
% 0.90/126.07 # Positive unorientable unit clauses: 0
% 0.90/126.07 # Negative unit clauses : 2
% 0.90/126.07 # Non-unit-clauses : 0
% 0.90/126.07 # Current number of unprocessed clauses: 0
% 0.90/126.07 # ...number of literals in the above : 0
% 0.90/126.07 # Current number of archived formulas : 0
% 0.90/126.07 # Current number of archived clauses : 0
% 0.90/126.07 # Clause-clause subsumption calls (NU) : 0
% 0.90/126.07 # Rec. Clause-clause subsumption calls : 0
% 0.90/126.07 # Non-unit clause-clause subsumptions : 0
% 0.90/126.07 # Unit Clause-clause subsumption calls : 0
% 0.90/126.07 # Rewrite failures with RHS unbound : 0
% 0.90/126.07 # BW rewrite match attempts : 0
% 0.90/126.07 # BW rewrite match successes : 0
% 0.90/126.07 # Condensation attempts : 0
% 0.90/126.07 # Condensation successes : 0
% 0.90/126.07 # Termbank termtop insertions : 506
% 0.90/126.07
% 0.90/126.07 # -------------------------------------------------
% 0.90/126.07 # User time : 0.013 s
% 0.90/126.07 # System time : 0.002 s
% 0.90/126.07 # Total time : 0.015 s
% 0.90/126.07 # Maximum resident set size: 2744 pages
% 0.90/126.07 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.90/126.07
% 0.90/126.07 # Failure: Resource limit exceeded (time)
% 0.90/126.07 # OLD status Res
% 0.90/126.07 # Preprocessing time : 0.010 s
% 0.90/126.07 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.90/126.07
% 0.90/126.07 # Failure: Resource limit exceeded (time)
% 0.90/126.07 # OLD status Res
% 0.90/126.07 # Preprocessing time : 0.010 s
% 0.90/126.07 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 0.90/126.07
% 0.90/126.07 # Failure: Resource limit exceeded (time)
% 0.90/126.07 # OLD status Res
% 0.90/126.07 # Preprocessing time : 0.010 s
% 0.90/126.07 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 0.90/126.07 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 0.90/126.07 # Preprocessing time : 0.008 s
% 0.90/126.07
% 0.90/126.07 # Failure: Out of unprocessed clauses!
% 0.90/126.07 # OLD status GaveUp
% 0.90/126.07 # Parsed axioms : 52
% 0.90/126.07 # Removed by relevancy pruning/SinE : 50
% 0.90/126.07 # Initial clauses : 3
% 0.90/126.07 # Removed in clause preprocessing : 0
% 0.90/126.07 # Initial clauses in saturation : 3
% 0.90/126.07 # Processed clauses : 3
% 0.90/126.07 # ...of these trivial : 0
% 0.90/126.07 # ...subsumed : 0
% 0.90/126.07 # ...remaining for further processing : 3
% 0.90/126.07 # Other redundant clauses eliminated : 0
% 0.90/126.07 # Clauses deleted for lack of memory : 0
% 0.90/126.07 # Backward-subsumed : 0
% 0.90/126.07 # Backward-rewritten : 0
% 0.90/126.07 # Generated clauses : 0
% 0.90/126.07 # ...of the previous two non-trivial : 0
% 0.90/126.07 # Contextual simplify-reflections : 0
% 0.90/126.07 # Paramodulations : 0
% 0.90/126.07 # Factorizations : 0
% 0.90/126.07 # Equation resolutions : 0
% 0.90/126.07 # Current number of processed clauses : 3
% 0.90/126.07 # Positive orientable unit clauses : 0
% 0.90/126.07 # Positive unorientable unit clauses: 0
% 0.90/126.07 # Negative unit clauses : 1
% 0.90/126.07 # Non-unit-clauses : 2
% 0.90/126.07 # Current number of unprocessed clauses: 0
% 0.90/126.07 # ...number of literals in the above : 0
% 0.90/126.07 # Current number of archived formulas : 0
% 0.90/126.07 # Current number of archived clauses : 0
% 0.90/126.07 # Clause-clause subsumption calls (NU) : 0
% 0.90/126.07 # Rec. Clause-clause subsumption calls : 0
% 0.90/126.07 # Non-unit clause-clause subsumptions : 0
% 0.90/126.07 # Unit Clause-clause subsumption calls : 2
% 0.90/126.07 # Rewrite failures with RHS unbound : 0
% 0.90/126.07 # BW rewrite match attempts : 0
% 0.90/126.07 # BW rewrite match successes : 0
% 0.90/126.07 # Condensation attempts : 0
% 0.90/126.07 # Condensation successes : 0
% 0.90/126.07 # Termbank termtop insertions : 519
% 0.90/126.07
% 0.90/126.07 # -------------------------------------------------
% 0.90/126.07 # User time : 0.005 s
% 0.90/126.07 # System time : 0.003 s
% 0.90/126.07 # Total time : 0.008 s
% 0.90/126.07 # Maximum resident set size: 2744 pages
% 0.90/126.07 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 0.90/126.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.90/126.07 # Preprocessing time : 0.008 s
% 0.90/126.07
% 0.90/126.07 # Failure: Out of unprocessed clauses!
% 0.90/126.07 # OLD status GaveUp
% 0.90/126.07 # Parsed axioms : 52
% 0.90/126.07 # Removed by relevancy pruning/SinE : 50
% 0.90/126.07 # Initial clauses : 3
% 0.90/126.07 # Removed in clause preprocessing : 0
% 0.90/126.07 # Initial clauses in saturation : 3
% 0.90/126.07 # Processed clauses : 3
% 0.90/126.07 # ...of these trivial : 0
% 0.90/126.07 # ...subsumed : 0
% 0.90/126.07 # ...remaining for further processing : 3
% 0.90/126.07 # Other redundant clauses eliminated : 0
% 0.90/126.07 # Clauses deleted for lack of memory : 0
% 0.90/126.07 # Backward-subsumed : 0
% 0.90/126.07 # Backward-rewritten : 0
% 0.90/126.07 # Generated clauses : 1
% 0.90/126.07 # ...of the previous two non-trivial : 0
% 0.90/126.07 # Contextual simplify-reflections : 0
% 0.90/126.07 # Paramodulations : 1
% 0.90/126.07 # Factorizations : 0
% 0.90/126.07 # Equation resolutions : 0
% 0.90/126.07 # Current number of processed clauses : 3
% 0.90/126.07 # Positive orientable unit clauses : 0
% 0.90/126.07 # Positive unorientable unit clauses: 0
% 0.90/126.07 # Negative unit clauses : 1
% 0.90/126.07 # Non-unit-clauses : 2
% 0.90/126.07 # Current number of unprocessed clauses: 0
% 0.90/126.07 # ...number of literals in the above : 0
% 0.90/126.07 # Current number of archived formulas : 0
% 0.90/126.07 # Current number of archived clauses : 0
% 0.90/126.07 # Clause-clause subsumption calls (NU) : 0
% 0.90/126.07 # Rec. Clause-clause subsumption calls : 0
% 0.90/126.07 # Non-unit clause-clause subsumptions : 0
% 0.90/126.07 # Unit Clause-clause subsumption calls : 2
% 0.90/126.07 # Rewrite failures with RHS unbound : 0
% 0.90/126.07 # BW rewrite match attempts : 0
% 0.90/126.07 # BW rewrite match successes : 0
% 0.90/126.07 # Condensation attempts : 0
% 0.90/126.07 # Condensation successes : 0
% 0.90/126.07 # Termbank termtop insertions : 523
% 0.90/126.07
% 0.90/126.07 # -------------------------------------------------
% 0.90/126.07 # User time : 0.005 s
% 0.90/126.07 # System time : 0.003 s
% 0.90/126.07 # Total time : 0.008 s
% 0.90/126.07 # Maximum resident set size: 2800 pages
% 0.90/126.07 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 0.90/126.07
% 0.90/126.07 # Failure: Resource limit exceeded (time)
% 0.90/126.07 # OLD status Res
% 0.90/126.07 # Preprocessing time : 0.010 s
% 0.90/126.07 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 0.90/126.07 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 0.90/126.07 # Preprocessing time : 0.015 s
% 0.90/126.07
% 0.90/126.07 # Failure: Out of unprocessed clauses!
% 0.90/126.07 # OLD status GaveUp
% 0.90/126.07 # Parsed axioms : 52
% 0.90/126.07 # Removed by relevancy pruning/SinE : 50
% 0.90/126.07 # Initial clauses : 3
% 0.90/126.07 # Removed in clause preprocessing : 0
% 0.90/126.07 # Initial clauses in saturation : 3
% 0.90/126.07 # Processed clauses : 3
% 0.90/126.07 # ...of these trivial : 0
% 0.90/126.07 # ...subsumed : 1
% 0.90/126.07 # ...remaining for further processing : 2
% 0.90/126.07 # Other redundant clauses eliminated : 0
% 0.90/126.07 # Clauses deleted for lack of memory : 0
% 0.90/126.07 # Backward-subsumed : 0
% 0.90/126.07 # Backward-rewritten : 0
% 0.90/126.07 # Generated clauses : 0
% 0.90/126.07 # ...of the previous two non-trivial : 0
% 0.90/126.07 # Contextual simplify-reflections : 0
% 0.90/126.07 # Paramodulations : 0
% 0.90/126.07 # Factorizations : 0
% 0.90/126.07 # Equation resolutions : 0
% 0.90/126.07 # Current number of processed clauses : 2
% 0.90/126.07 # Positive orientable unit clauses : 0
% 0.90/126.07 # Positive unorientable unit clauses: 0
% 0.90/126.07 # Negative unit clauses : 2
% 0.90/126.07 # Non-unit-clauses : 0
% 0.90/126.07 # Current number of unprocessed clauses: 0
% 0.90/126.07 # ...number of literals in the above : 0
% 0.90/126.07 # Current number of archived formulas : 0
% 0.90/126.07 # Current number of archived clauses : 0
% 0.90/126.07 # Clause-clause subsumption calls (NU) : 0
% 0.90/126.07 # Rec. Clause-clause subsumption calls : 0
% 0.90/126.07 # Non-unit clause-clause subsumptions : 0
% 0.90/126.07 # Unit Clause-clause subsumption calls : 0
% 0.90/126.07 # Rewrite failures with RHS unbound : 0
% 0.90/126.07 # BW rewrite match attempts : 0
% 0.90/126.07 # BW rewrite match successes : 0
% 0.90/126.07 # Condensation attempts : 0
% 0.90/126.07 # Condensation successes : 0
% 0.90/126.07 # Termbank termtop insertions : 506
% 0.90/126.07
% 0.90/126.07 # -------------------------------------------------
% 0.90/126.07 # User time : 0.012 s
% 0.90/126.07 # System time : 0.003 s
% 0.90/126.07 # Total time : 0.015 s
% 0.90/126.07 # Maximum resident set size: 2748 pages
% 0.90/126.07 # Running protocol protocol_eprover_4692c23f3ccd5aecc2adbd7957ddb4b4144a02c8 for 23 seconds:
% 0.90/126.07 # Preprocessing time : 0.018 s
% 0.90/126.07
% 0.90/126.07 # Proof found!
% 0.90/126.07 # SZS status Theorem
% 0.90/126.07 # SZS output start CNFRefutation
% See solution above
% 0.90/126.07 # Proof object total steps : 147
% 0.90/126.07 # Proof object clause steps : 109
% 0.90/126.07 # Proof object formula steps : 38
% 0.90/126.07 # Proof object conjectures : 4
% 0.90/126.07 # Proof object clause conjectures : 1
% 0.90/126.07 # Proof object formula conjectures : 3
% 0.90/126.07 # Proof object initial clauses used : 24
% 0.90/126.07 # Proof object initial formulas used : 24
% 0.90/126.07 # Proof object generating inferences : 70
% 0.90/126.07 # Proof object simplifying inferences : 99
% 0.90/126.07 # Training examples: 0 positive, 0 negative
% 0.90/126.07 # Parsed axioms : 52
% 0.90/126.07 # Removed by relevancy pruning/SinE : 0
% 0.90/126.07 # Initial clauses : 81
% 0.90/126.07 # Removed in clause preprocessing : 0
% 0.90/126.07 # Initial clauses in saturation : 81
% 0.90/126.07 # Processed clauses : 115978
% 0.90/126.07 # ...of these trivial : 5365
% 0.90/126.07 # ...subsumed : 107168
% 0.90/126.07 # ...remaining for further processing : 3445
% 0.90/126.07 # Other redundant clauses eliminated : 0
% 0.90/126.07 # Clauses deleted for lack of memory : 744727
% 0.90/126.07 # Backward-subsumed : 2436
% 0.90/126.07 # Backward-rewritten : 367
% 0.90/126.07 # Generated clauses : 1129157
% 0.90/126.07 # ...of the previous two non-trivial : 1059413
% 0.90/126.07 # Contextual simplify-reflections : 0
% 0.90/126.07 # Paramodulations : 1129157
% 0.90/126.07 # Factorizations : 0
% 0.90/126.07 # Equation resolutions : 0
% 0.90/126.07 # Current number of processed clauses : 642
% 0.90/126.07 # Positive orientable unit clauses : 482
% 0.90/126.07 # Positive unorientable unit clauses: 40
% 0.90/126.07 # Negative unit clauses : 2
% 0.90/126.07 # Non-unit-clauses : 118
% 0.90/126.07 # Current number of unprocessed clauses: 21917
% 0.90/126.07 # ...number of literals in the above : 27830
% 0.90/126.07 # Current number of archived formulas : 0
% 0.90/126.07 # Current number of archived clauses : 2803
% 0.90/126.07 # Clause-clause subsumption calls (NU) : 1064760
% 0.90/126.07 # Rec. Clause-clause subsumption calls : 630058
% 0.90/126.07 # Non-unit clause-clause subsumptions : 29451
% 0.90/126.07 # Unit Clause-clause subsumption calls : 2715
% 0.90/126.07 # Rewrite failures with RHS unbound : 15511
% 0.90/126.07 # BW rewrite match attempts : 29651
% 0.90/126.07 # BW rewrite match successes : 996
% 0.90/126.07 # Condensation attempts : 0
% 0.90/126.07 # Condensation successes : 0
% 0.90/126.07 # Termbank termtop insertions : 20249494
% 0.90/126.07
% 0.90/126.07 # -------------------------------------------------
% 0.90/126.07 # User time : 10.080 s
% 0.90/126.07 # System time : 0.118 s
% 0.90/126.07 # Total time : 10.198 s
% 0.90/126.07 # Maximum resident set size: 151192 pages
%------------------------------------------------------------------------------