TSTP Solution File: LCL458+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL458+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:49 EDT 2023
% Result : Theorem 56.06s 7.80s
% Output : CNFRefutation 56.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 88 ( 44 unt; 0 def)
% Number of atoms : 164 ( 32 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 128 ( 52 ~; 51 |; 11 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 16 con; 0-2 aty)
% Number of variables : 129 ( 0 sgn; 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',op_implies_or) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',principia_op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',op_or) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',principia_op_and) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_op_implies_and) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',and_3) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',modus_tollens) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_op_or) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',substitution_of_equivalents) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',op_equiv) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_and_3) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_modus_tollens) ).
fof(substitution_of_equivalents_0001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',substitution_of_equivalents_0001) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_op_equiv) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',r3) ).
fof(implies_3,axiom,
( implies_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',implies_3) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',r5) ).
fof(principia_r5,conjecture,
r5,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',principia_r5) ).
fof(hilbert_implies_3,axiom,
implies_3,
file('/export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p',hilbert_implies_3) ).
fof(c_0_23,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
fof(c_0_24,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
cnf(c_0_25,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_27,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_28,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_29,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_31,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_32,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_34,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_35,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])]) ).
fof(c_0_36,plain,
! [X15,X16] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16))) )
& ( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])]) ).
cnf(c_0_37,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_40,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
fof(c_0_41,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
fof(c_0_42,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_43,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_49,plain,
not(not(implies(not(X1),not(not(X2))))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_50,plain,
not(not(implies(X1,not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents_0001]) ).
cnf(c_0_53,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_54,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_55,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(X1,implies(X2,not(implies(X1,not(X2)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_38]),c_0_46])]) ).
fof(c_0_57,plain,
! [X101,X102] :
( ( ~ r3
| is_a_theorem(implies(or(X101,X102),or(X102,X101))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_59,plain,
implies(not(X1),X2) = or(X1,X2),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_61,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_62,plain,
( is_a_theorem(implies(X1,not(implies(X2,not(X1)))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,plain,
( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(not(X1),not(not(X2))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_50]),c_0_30]) ).
fof(c_0_67,plain,
! [X27,X28,X29] :
( ( ~ implies_3
| is_a_theorem(implies(implies(X27,X28),implies(implies(X28,X29),implies(X27,X29)))) )
& ( ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0))))
| implies_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_3])])])]) ).
cnf(c_0_68,plain,
( X1 = X2
| ~ is_a_theorem(not(implies(implies(X1,X2),not(implies(X2,X1))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_38]) ).
cnf(c_0_69,plain,
( is_a_theorem(not(implies(X1,not(X2))))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_62]) ).
cnf(c_0_70,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ is_a_theorem(implies(implies(not(esk48_0),esk49_0),or(esk49_0,esk48_0))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_59]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(implies(not(X1),X2),or(X2,X1))),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
fof(c_0_72,plain,
! [X111,X112,X113] :
( ( ~ r5
| is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])]) ).
fof(c_0_73,negated_conjecture,
~ r5,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r5])]) ).
cnf(c_0_74,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_75,plain,
implies_3,
inference(split_conjunct,[status(thm)],[hilbert_implies_3]) ).
cnf(c_0_76,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_78,plain,
( r5
| ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,negated_conjecture,
~ r5,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_81,plain,
or(X1,X2) = or(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_77])]) ).
cnf(c_0_82,plain,
~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))),
inference(sr,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_80,c_0_59]) ).
cnf(c_0_84,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_81]) ).
cnf(c_0_85,plain,
~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(implies(not(esk54_0),esk53_0),implies(not(esk55_0),esk53_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_81]),c_0_59]),c_0_81]),c_0_59]) ).
cnf(c_0_86,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X3),implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : LCL458+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 12:13:21 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.zqOBL0dhWk/E---3.1_10803.p
% 56.06/7.80 # Version: 3.1pre001
% 56.06/7.80 # Preprocessing class: FSMSSLSSSSSNFFN.
% 56.06/7.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.06/7.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 56.06/7.80 # Starting new_bool_3 with 300s (1) cores
% 56.06/7.80 # Starting new_bool_1 with 300s (1) cores
% 56.06/7.80 # Starting sh5l with 300s (1) cores
% 56.06/7.80 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 10881 completed with status 0
% 56.06/7.80 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 56.06/7.80 # Preprocessing class: FSMSSLSSSSSNFFN.
% 56.06/7.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.06/7.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 56.06/7.80 # No SInE strategy applied
% 56.06/7.80 # Search class: FGUSF-FFMM21-MFFFFFNN
% 56.06/7.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 56.06/7.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 56.06/7.80 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 56.06/7.80 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 56.06/7.80 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 56.06/7.80 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 56.06/7.80 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 10893 completed with status 0
% 56.06/7.80 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 56.06/7.80 # Preprocessing class: FSMSSLSSSSSNFFN.
% 56.06/7.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.06/7.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 56.06/7.80 # No SInE strategy applied
% 56.06/7.80 # Search class: FGUSF-FFMM21-MFFFFFNN
% 56.06/7.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 56.06/7.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 56.06/7.80 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 56.06/7.80 # Preprocessing time : 0.003 s
% 56.06/7.80 # Presaturation interreduction done
% 56.06/7.80
% 56.06/7.80 # Proof found!
% 56.06/7.80 # SZS status Theorem
% 56.06/7.80 # SZS output start CNFRefutation
% See solution above
% 56.06/7.80 # Parsed axioms : 53
% 56.06/7.80 # Removed by relevancy pruning/SinE : 0
% 56.06/7.80 # Initial clauses : 82
% 56.06/7.80 # Removed in clause preprocessing : 0
% 56.06/7.80 # Initial clauses in saturation : 82
% 56.06/7.80 # Processed clauses : 13266
% 56.06/7.80 # ...of these trivial : 992
% 56.06/7.80 # ...subsumed : 10779
% 56.06/7.80 # ...remaining for further processing : 1495
% 56.06/7.80 # Other redundant clauses eliminated : 0
% 56.06/7.80 # Clauses deleted for lack of memory : 0
% 56.06/7.80 # Backward-subsumed : 40
% 56.06/7.80 # Backward-rewritten : 112
% 56.06/7.80 # Generated clauses : 774108
% 56.06/7.80 # ...of the previous two non-redundant : 561236
% 56.06/7.80 # ...aggressively subsumed : 0
% 56.06/7.80 # Contextual simplify-reflections : 0
% 56.06/7.80 # Paramodulations : 774108
% 56.06/7.80 # Factorizations : 0
% 56.06/7.80 # NegExts : 0
% 56.06/7.80 # Equation resolutions : 0
% 56.06/7.80 # Total rewrite steps : 775075
% 56.06/7.80 # Propositional unsat checks : 0
% 56.06/7.80 # Propositional check models : 0
% 56.06/7.80 # Propositional check unsatisfiable : 0
% 56.06/7.80 # Propositional clauses : 0
% 56.06/7.80 # Propositional clauses after purity: 0
% 56.06/7.80 # Propositional unsat core size : 0
% 56.06/7.80 # Propositional preprocessing time : 0.000
% 56.06/7.80 # Propositional encoding time : 0.000
% 56.06/7.80 # Propositional solver time : 0.000
% 56.06/7.80 # Success case prop preproc time : 0.000
% 56.06/7.80 # Success case prop encoding time : 0.000
% 56.06/7.80 # Success case prop solver time : 0.000
% 56.06/7.80 # Current number of processed clauses : 1285
% 56.06/7.80 # Positive orientable unit clauses : 394
% 56.06/7.80 # Positive unorientable unit clauses: 149
% 56.06/7.80 # Negative unit clauses : 24
% 56.06/7.80 # Non-unit-clauses : 718
% 56.06/7.80 # Current number of unprocessed clauses: 546105
% 56.06/7.80 # ...number of literals in the above : 715645
% 56.06/7.80 # Current number of archived formulas : 0
% 56.06/7.80 # Current number of archived clauses : 210
% 56.06/7.80 # Clause-clause subsumption calls (NU) : 112940
% 56.06/7.80 # Rec. Clause-clause subsumption calls : 112756
% 56.06/7.80 # Non-unit clause-clause subsumptions : 6691
% 56.06/7.80 # Unit Clause-clause subsumption calls : 13744
% 56.06/7.80 # Rewrite failures with RHS unbound : 7554
% 56.06/7.80 # BW rewrite match attempts : 112395
% 56.06/7.80 # BW rewrite match successes : 1220
% 56.06/7.80 # Condensation attempts : 0
% 56.06/7.80 # Condensation successes : 0
% 56.06/7.80 # Termbank termtop insertions : 9426222
% 56.06/7.80
% 56.06/7.80 # -------------------------------------------------
% 56.06/7.80 # User time : 6.701 s
% 56.06/7.80 # System time : 0.316 s
% 56.06/7.80 # Total time : 7.018 s
% 56.06/7.80 # Maximum resident set size: 1996 pages
% 56.06/7.80
% 56.06/7.80 # -------------------------------------------------
% 56.06/7.80 # User time : 33.285 s
% 56.06/7.80 # System time : 1.478 s
% 56.06/7.80 # Total time : 34.763 s
% 56.06/7.80 # Maximum resident set size: 1720 pages
% 56.06/7.80 % E---3.1 exiting
% 56.06/7.81 % E---3.1 exiting
%------------------------------------------------------------------------------