TSTP Solution File: GRP775+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP775+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:51:15 EDT 2024
% Result : Theorem 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 78 ( 26 unt; 0 def)
% Number of atoms : 170 ( 90 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 167 ( 75 ~; 74 |; 13 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos01,axiom,
! [X1,X2,X3] : product(product(X3,X2),X1) = product(X3,product(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos01) ).
fof(sos02,axiom,
! [X3] : product(X3,X3) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos02) ).
fof(sos04,axiom,
! [X6,X7] :
( r(X6,X7)
<=> ( product(X6,X7) = X7
& product(X7,X6) = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos04) ).
fof(sos05,axiom,
! [X8,X9] :
( d(X8,X9)
<=> ? [X10] :
( r(X8,X10)
& l(X10,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos05) ).
fof(sos03,axiom,
! [X4,X5] :
( l(X4,X5)
<=> ( product(X4,X5) = X4
& product(X5,X4) = X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos03) ).
fof(goals,conjecture,
! [X11,X12] :
( d(X11,X12)
<=> ( product(X11,product(X12,X11)) = X11
& product(X12,product(X11,X12)) = X12 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X15,X16,X17] : product(product(X17,X16),X15) = product(X17,product(X16,X15)),
inference(variable_rename,[status(thm)],[sos01]) ).
fof(c_0_7,plain,
! [X18] : product(X18,X18) = X18,
inference(variable_rename,[status(thm)],[sos02]) ).
cnf(c_0_8,plain,
product(product(X1,X2),X3) = product(X1,product(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
product(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X27,X28] :
( ( product(X27,X28) = X28
| ~ r(X27,X28) )
& ( product(X28,X27) = X27
| ~ r(X27,X28) )
& ( product(X27,X28) != X28
| product(X28,X27) != X27
| r(X27,X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos04])])])]) ).
fof(c_0_11,plain,
! [X19,X20,X22,X23,X24] :
( ( r(X19,esk3_2(X19,X20))
| ~ d(X19,X20) )
& ( l(esk3_2(X19,X20),X20)
| ~ d(X19,X20) )
& ( ~ r(X22,X24)
| ~ l(X24,X23)
| d(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos05])])])])])])]) ).
cnf(c_0_12,plain,
product(X1,product(X1,X2)) = product(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( product(X1,X2) = X2
| ~ r(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( r(X1,esk3_2(X1,X2))
| ~ d(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X25,X26] :
( ( product(X25,X26) = X25
| ~ l(X25,X26) )
& ( product(X26,X25) = X26
| ~ l(X25,X26) )
& ( product(X25,X26) != X25
| product(X26,X25) != X26
| l(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos03])])])]) ).
cnf(c_0_16,plain,
product(X1,product(X2,product(X1,product(X2,X3)))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_8]),c_0_8]) ).
cnf(c_0_17,plain,
( product(X1,esk3_2(X1,X2)) = esk3_2(X1,X2)
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( product(X1,X2) = X1
| ~ l(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( l(esk3_2(X1,X2),X2)
| ~ d(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,negated_conjecture,
~ ! [X11,X12] :
( d(X11,X12)
<=> ( product(X11,product(X12,X11)) = X11
& product(X12,product(X11,X12)) = X12 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_21,plain,
( product(X1,product(X2,product(X1,esk3_2(X2,X3)))) = product(X1,esk3_2(X2,X3))
| ~ d(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( product(X1,esk3_2(X2,X1)) = X1
| ~ d(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,negated_conjecture,
( ( ~ d(esk1_0,esk2_0)
| product(esk1_0,product(esk2_0,esk1_0)) != esk1_0
| product(esk2_0,product(esk1_0,esk2_0)) != esk2_0 )
& ( product(esk1_0,product(esk2_0,esk1_0)) = esk1_0
| d(esk1_0,esk2_0) )
& ( product(esk2_0,product(esk1_0,esk2_0)) = esk2_0
| d(esk1_0,esk2_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
cnf(c_0_24,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( product(esk2_0,product(esk1_0,esk2_0)) = esk2_0
| d(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
( d(X1,X3)
| ~ r(X1,X2)
| ~ l(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( r(X1,X2)
| product(X1,X2) != X2
| product(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
product(esk2_0,product(esk1_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( d(X1,X2)
| product(X3,X1) != X1
| product(X1,X3) != X3
| ~ l(X3,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
product(esk2_0,product(esk1_0,product(esk2_0,X1))) = product(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_28]),c_0_8]) ).
cnf(c_0_31,plain,
( d(product(X1,X2),X3)
| product(X1,product(X2,X1)) != X1
| ~ l(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_8]) ).
cnf(c_0_32,plain,
product(X1,product(X2,product(X1,X2))) = product(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( product(esk2_0,product(esk1_0,esk3_2(esk2_0,X1))) = esk3_2(esk2_0,X1)
| ~ d(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_34,plain,
( d(product(X1,product(X2,X1)),X3)
| ~ l(product(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_12]),c_0_8]),c_0_9])]) ).
cnf(c_0_35,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,X3))))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_32]),c_0_8]),c_0_8]) ).
cnf(c_0_36,plain,
( product(X1,product(esk3_2(X2,X1),X3)) = product(X1,X3)
| ~ d(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
( esk3_2(esk2_0,esk1_0) = product(esk2_0,esk1_0)
| ~ d(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_38,plain,
( d(product(X1,product(X2,product(X3,product(X1,X2)))),X4)
| ~ l(product(X1,product(X2,X3)),X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_8]),c_0_8]),c_0_9]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( product(esk1_0,product(esk2_0,product(esk1_0,X1))) = product(esk1_0,X1)
| ~ d(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_8]) ).
cnf(c_0_40,plain,
( product(X1,X2) = X2
| ~ r(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,negated_conjecture,
( d(esk1_0,X1)
| ~ d(esk2_0,esk1_0)
| ~ l(product(esk1_0,esk2_0),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_9]),c_0_9]),c_0_12]) ).
cnf(c_0_42,plain,
( l(X1,X2)
| product(X1,X2) != X1
| product(X2,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( d(esk2_0,X1)
| ~ l(product(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_44,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,product(X3,X4)))))) = product(X1,product(X2,product(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_8]),c_0_8]) ).
cnf(c_0_45,plain,
( product(esk3_2(X1,X2),X1) = X1
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_14]) ).
cnf(c_0_46,negated_conjecture,
( ~ d(esk1_0,esk2_0)
| product(esk1_0,product(esk2_0,esk1_0)) != esk1_0
| product(esk2_0,product(esk1_0,esk2_0)) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_47,negated_conjecture,
( d(esk1_0,X1)
| product(esk1_0,product(esk2_0,X1)) != product(esk1_0,esk2_0)
| product(X1,product(esk1_0,esk2_0)) != X1
| ~ d(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_8]) ).
cnf(c_0_48,negated_conjecture,
( d(esk2_0,X1)
| product(esk2_0,product(esk1_0,X1)) != product(esk2_0,esk1_0)
| product(X1,product(esk2_0,esk1_0)) != X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_8]) ).
cnf(c_0_49,negated_conjecture,
product(X1,product(esk2_0,product(esk1_0,product(X1,product(esk2_0,X2))))) = product(X1,product(esk2_0,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_50,plain,
product(X1,product(X2,product(X3,product(X2,product(X1,product(X2,X3)))))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_9]),c_0_8]) ).
cnf(c_0_51,negated_conjecture,
product(X1,product(esk2_0,product(esk1_0,product(X1,esk2_0)))) = product(X1,esk2_0),
inference(spm,[status(thm)],[c_0_44,c_0_28]) ).
cnf(c_0_52,plain,
( product(esk3_2(X1,X2),product(X1,X3)) = product(X1,X3)
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( product(esk1_0,product(esk2_0,esk1_0)) != esk1_0
| ~ d(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_28])]) ).
cnf(c_0_54,negated_conjecture,
( d(esk1_0,X1)
| product(esk1_0,product(esk2_0,X1)) != product(esk1_0,esk2_0)
| product(esk1_0,product(esk2_0,esk1_0)) != esk1_0
| product(X1,product(esk1_0,esk2_0)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_9])]) ).
cnf(c_0_55,negated_conjecture,
product(X1,product(esk2_0,product(X1,product(esk1_0,product(X1,esk2_0))))) = product(X1,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_56,plain,
( product(X1,X2) = X1
| ~ l(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_57,plain,
( product(X1,product(esk3_2(X2,X3),product(X1,product(X2,X4)))) = product(X1,product(X2,X4))
| ~ d(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( product(esk1_0,product(esk2_0,esk1_0)) = esk1_0
| d(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_59,negated_conjecture,
product(esk1_0,product(esk2_0,esk1_0)) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_9]),c_0_28])]) ).
cnf(c_0_60,negated_conjecture,
product(esk2_0,product(X1,product(esk1_0,product(X1,esk2_0)))) = product(esk2_0,product(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_16,c_0_55]) ).
cnf(c_0_61,plain,
( product(esk3_2(X1,X2),X2) = esk3_2(X1,X2)
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_19]) ).
cnf(c_0_62,negated_conjecture,
( product(esk2_0,product(esk3_2(esk1_0,X1),esk2_0)) = esk2_0
| ~ d(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_28]) ).
cnf(c_0_63,negated_conjecture,
d(esk1_0,esk2_0),
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
( product(X1,product(esk3_2(X1,X2),X3)) = product(esk3_2(X1,X2),X3)
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_65,negated_conjecture,
( product(esk2_0,product(esk3_2(esk2_0,X1),product(esk1_0,esk2_0))) = esk2_0
| ~ d(esk2_0,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_45]),c_0_9]) ).
cnf(c_0_66,plain,
( product(esk3_2(X1,X2),product(X2,esk3_2(X1,X2))) = esk3_2(X1,X2)
| ~ d(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
product(esk2_0,esk3_2(esk1_0,esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_61]),c_0_63])]) ).
cnf(c_0_68,negated_conjecture,
( product(esk3_2(esk2_0,X1),product(esk1_0,esk2_0)) = esk2_0
| ~ d(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
( d(X1,X2)
| ~ l(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_9]),c_0_9])]) ).
cnf(c_0_70,negated_conjecture,
product(esk3_2(esk1_0,esk2_0),esk2_0) = esk3_2(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_63])]) ).
cnf(c_0_71,negated_conjecture,
( product(X1,product(esk1_0,esk2_0)) = product(X1,esk2_0)
| ~ d(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_68]) ).
cnf(c_0_72,plain,
( d(X1,X2)
| product(X2,X1) != X2
| product(X1,X2) != X1 ),
inference(spm,[status(thm)],[c_0_69,c_0_42]) ).
cnf(c_0_73,negated_conjecture,
product(esk3_2(esk1_0,esk2_0),product(esk2_0,X1)) = product(esk3_2(esk1_0,esk2_0),X1),
inference(spm,[status(thm)],[c_0_8,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( product(X1,product(esk1_0,esk2_0)) = product(X1,esk2_0)
| product(esk2_0,X1) != esk2_0
| product(X1,esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
product(esk3_2(esk1_0,esk2_0),product(esk1_0,esk2_0)) = esk3_2(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_9]),c_0_70]),c_0_9])]) ).
cnf(c_0_76,negated_conjecture,
esk3_2(esk1_0,esk2_0) = product(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_75]),c_0_63])]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_76]),c_0_8]),c_0_63])]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GRP775+1 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 06:13:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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/benchmark/theBenchmark.p
% 0.14/0.49 # Version: 3.1.0
% 0.14/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # new_bool_1 with pid 17686 completed with status 0
% 0.14/0.49 # Result found by new_bool_1
% 0.14/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.14/0.49 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 17690 completed with status 0
% 0.14/0.49 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.14/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.14/0.49 # Preprocessing time : 0.001 s
% 0.14/0.49 # Presaturation interreduction done
% 0.14/0.49
% 0.14/0.49 # Proof found!
% 0.14/0.49 # SZS status Theorem
% 0.14/0.49 # SZS output start CNFRefutation
% See solution above
% 0.14/0.49 # Parsed axioms : 6
% 0.14/0.49 # Removed by relevancy pruning/SinE : 0
% 0.14/0.49 # Initial clauses : 14
% 0.14/0.49 # Removed in clause preprocessing : 0
% 0.14/0.49 # Initial clauses in saturation : 14
% 0.14/0.49 # Processed clauses : 1072
% 0.14/0.49 # ...of these trivial : 48
% 0.14/0.49 # ...subsumed : 774
% 0.14/0.49 # ...remaining for further processing : 250
% 0.14/0.49 # Other redundant clauses eliminated : 0
% 0.14/0.49 # Clauses deleted for lack of memory : 0
% 0.14/0.49 # Backward-subsumed : 44
% 0.14/0.49 # Backward-rewritten : 25
% 0.14/0.49 # Generated clauses : 10110
% 0.14/0.49 # ...of the previous two non-redundant : 7786
% 0.14/0.49 # ...aggressively subsumed : 0
% 0.14/0.49 # Contextual simplify-reflections : 3
% 0.14/0.49 # Paramodulations : 10109
% 0.14/0.49 # Factorizations : 0
% 0.14/0.49 # NegExts : 0
% 0.14/0.49 # Equation resolutions : 0
% 0.14/0.49 # Disequality decompositions : 0
% 0.14/0.49 # Total rewrite steps : 19934
% 0.14/0.49 # ...of those cached : 16035
% 0.14/0.49 # Propositional unsat checks : 0
% 0.14/0.49 # Propositional check models : 0
% 0.14/0.49 # Propositional check unsatisfiable : 0
% 0.14/0.49 # Propositional clauses : 0
% 0.14/0.49 # Propositional clauses after purity: 0
% 0.14/0.49 # Propositional unsat core size : 0
% 0.14/0.49 # Propositional preprocessing time : 0.000
% 0.14/0.49 # Propositional encoding time : 0.000
% 0.14/0.49 # Propositional solver time : 0.000
% 0.14/0.49 # Success case prop preproc time : 0.000
% 0.14/0.49 # Success case prop encoding time : 0.000
% 0.14/0.49 # Success case prop solver time : 0.000
% 0.14/0.49 # Current number of processed clauses : 166
% 0.14/0.49 # Positive orientable unit clauses : 32
% 0.14/0.49 # Positive unorientable unit clauses: 0
% 0.14/0.49 # Negative unit clauses : 2
% 0.14/0.49 # Non-unit-clauses : 132
% 0.14/0.49 # Current number of unprocessed clauses: 6597
% 0.14/0.49 # ...number of literals in the above : 19182
% 0.14/0.49 # Current number of archived formulas : 0
% 0.14/0.49 # Current number of archived clauses : 84
% 0.14/0.49 # Clause-clause subsumption calls (NU) : 5622
% 0.14/0.49 # Rec. Clause-clause subsumption calls : 5026
% 0.14/0.49 # Non-unit clause-clause subsumptions : 796
% 0.14/0.49 # Unit Clause-clause subsumption calls : 80
% 0.14/0.49 # Rewrite failures with RHS unbound : 0
% 0.14/0.49 # BW rewrite match attempts : 158
% 0.14/0.49 # BW rewrite match successes : 11
% 0.14/0.49 # Condensation attempts : 0
% 0.14/0.49 # Condensation successes : 0
% 0.14/0.49 # Termbank termtop insertions : 178503
% 0.14/0.49 # Search garbage collected termcells : 196
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.099 s
% 0.14/0.49 # System time : 0.005 s
% 0.14/0.49 # Total time : 0.104 s
% 0.14/0.49 # Maximum resident set size: 1732 pages
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.100 s
% 0.14/0.49 # System time : 0.007 s
% 0.14/0.49 # Total time : 0.106 s
% 0.14/0.49 # Maximum resident set size: 1696 pages
% 0.14/0.49 % E---3.1 exiting
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------