TSTP Solution File: SEU194+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU194+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 : Tue Jul 19 09:17:42 EDT 2022
% Result : Theorem 0.40s 24.58s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 67 ( 24 unt; 0 def)
% Number of atoms : 161 ( 62 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 158 ( 64 ~; 78 |; 10 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 184 ( 9 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t86_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_dom(relation_dom_restriction(X3,X2)))
<=> ( in(X1,X2)
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t86_relat_1) ).
fof(t90_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> relation_dom(relation_dom_restriction(X2,X1)) = set_intersection2(relation_dom(X2),X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t90_relat_1) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X7)
| ~ in(esk3_3(X5,X6,X7),X5)
| ~ in(esk3_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_5,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2)
| ~ in(esk3_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( set_intersection2(X1,X2) = X2
| in(esk3_3(X1,X2,X2),X2) ),
inference(ef,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( set_intersection2(X1,X2) = X2
| ~ in(esk3_3(X1,X2,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_12,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( set_intersection2(set_intersection2(X1,X2),X3) = X3
| ~ in(esk3_3(set_intersection2(X1,X2),X3,X3),X2)
| ~ in(esk3_3(set_intersection2(X1,X2),X3,X3),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( set_intersection2(X1,set_intersection2(X2,X3)) = set_intersection2(X2,X3)
| in(esk3_3(X1,set_intersection2(X2,X3),set_intersection2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_17,plain,
( set_intersection2(X1,set_intersection2(X2,X3)) = set_intersection2(X2,X3)
| in(esk3_3(X1,set_intersection2(X2,X3),set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_18,plain,
( set_intersection2(set_intersection2(X1,X2),set_intersection2(X3,X2)) = set_intersection2(X3,X2)
| ~ in(esk3_3(set_intersection2(X1,X2),set_intersection2(X3,X2),set_intersection2(X3,X2)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( set_intersection2(X1,set_intersection2(set_intersection2(X2,X3),X4)) = set_intersection2(set_intersection2(X2,X3),X4)
| in(esk3_3(X1,set_intersection2(set_intersection2(X2,X3),X4),set_intersection2(set_intersection2(X2,X3),X4)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_20,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_21,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(set_intersection2(X1,X3),X2)) = set_intersection2(set_intersection2(X1,X3),X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( set_intersection2(set_intersection2(X1,X2),set_intersection2(X2,X3)) = set_intersection2(X2,X3)
| ~ in(esk3_3(set_intersection2(X1,X2),set_intersection2(X2,X3),set_intersection2(X2,X3)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X2,set_intersection2(X1,X3))) = set_intersection2(set_intersection2(X1,X3),X2),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X2,X1)) = set_intersection2(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( ( in(X4,X5)
| ~ in(X4,relation_dom(relation_dom_restriction(X6,X5)))
| ~ relation(X6) )
& ( in(X4,relation_dom(X6))
| ~ in(X4,relation_dom(relation_dom_restriction(X6,X5)))
| ~ relation(X6) )
& ( ~ in(X4,X5)
| ~ in(X4,relation_dom(X6))
| in(X4,relation_dom(relation_dom_restriction(X6,X5)))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t86_relat_1])])]) ).
cnf(c_0_27,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_28,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X1,set_intersection2(X2,X3))) = set_intersection2(set_intersection2(X2,X3),X1),
inference(pm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,plain,
set_intersection2(X1,set_intersection2(set_intersection2(X1,X2),X3)) = set_intersection2(set_intersection2(X1,X2),X3),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_30,plain,
( set_intersection2(X1,set_intersection2(set_intersection2(X2,X3),X4)) = set_intersection2(set_intersection2(X2,X3),X4)
| in(esk3_3(X1,set_intersection2(set_intersection2(X2,X3),X4),set_intersection2(set_intersection2(X2,X3),X4)),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_31,plain,
set_intersection2(set_intersection2(set_intersection2(X1,X2),X3),set_intersection2(X3,set_intersection2(X2,X1))) = set_intersection2(set_intersection2(X2,X1),X3),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( in(X2,relation_dom(relation_dom_restriction(X1,X3)))
| ~ relation(X1)
| ~ in(X2,relation_dom(X1))
| ~ in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( set_intersection2(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X1,set_intersection2(set_intersection2(X2,X3),X4))) = set_intersection2(set_intersection2(set_intersection2(X2,X3),X4),X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(set_intersection2(X3,X1),X2)) = set_intersection2(set_intersection2(X3,X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_36,plain,
set_intersection2(X1,set_intersection2(X2,X3)) = set_intersection2(set_intersection2(X3,X2),X1),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_22]),c_0_25]) ).
cnf(c_0_37,plain,
( X1 = set_intersection2(X2,relation_dom(relation_dom_restriction(X3,X4)))
| ~ relation(X3)
| ~ in(esk3_3(X2,relation_dom(relation_dom_restriction(X3,X4)),X1),relation_dom(X3))
| ~ in(esk3_3(X2,relation_dom(relation_dom_restriction(X3,X4)),X1),X2)
| ~ in(esk3_3(X2,relation_dom(relation_dom_restriction(X3,X4)),X1),X1)
| ~ in(esk3_3(X2,relation_dom(relation_dom_restriction(X3,X4)),X1),X4) ),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_38,plain,
( set_intersection2(set_intersection2(X1,X2),X3) = set_intersection2(X1,X2)
| in(esk3_3(set_intersection2(X1,X2),X3,set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_39,plain,
set_intersection2(set_intersection2(X1,set_intersection2(X2,X3)),set_intersection2(set_intersection2(X3,X1),X2)) = set_intersection2(set_intersection2(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22]),c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
set_intersection2(X1,set_intersection2(X2,X1)) = set_intersection2(X2,X1),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_41,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(set_intersection2(X3,X2),X1)) = set_intersection2(set_intersection2(X3,X2),X1),
inference(pm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_42,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(set_intersection2(X2,X3),X1)) = set_intersection2(set_intersection2(X2,X3),X1),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_43,plain,
( in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ in(X2,relation_dom(relation_dom_restriction(X1,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_44,plain,
( set_intersection2(set_intersection2(relation_dom(X1),X2),relation_dom(relation_dom_restriction(X1,X3))) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1)
| ~ in(esk3_3(set_intersection2(relation_dom(X1),X2),relation_dom(relation_dom_restriction(X1,X3)),set_intersection2(relation_dom(X1),X2)),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33]) ).
cnf(c_0_45,plain,
( set_intersection2(set_intersection2(X1,X2),X3) = set_intersection2(X1,X2)
| in(esk3_3(set_intersection2(X1,X2),X3,set_intersection2(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_46,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X1,X3)) = set_intersection2(set_intersection2(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_40]),c_0_41]),c_0_22]),c_0_21]) ).
cnf(c_0_47,plain,
set_intersection2(set_intersection2(X1,X2),set_intersection2(X2,X3)) = set_intersection2(set_intersection2(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_42]),c_0_22]),c_0_29]) ).
cnf(c_0_48,plain,
( set_intersection2(X1,set_intersection2(relation_dom(relation_dom_restriction(X2,X3)),X4)) = set_intersection2(relation_dom(relation_dom_restriction(X2,X3)),X4)
| in(esk3_3(X1,set_intersection2(relation_dom(relation_dom_restriction(X2,X3)),X4),set_intersection2(relation_dom(relation_dom_restriction(X2,X3)),X4)),relation_dom(X2))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_17]) ).
cnf(c_0_49,plain,
( set_intersection2(set_intersection2(relation_dom(X1),X2),relation_dom(relation_dom_restriction(X1,X2))) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
set_intersection2(set_intersection2(X1,X2),X3) = set_intersection2(set_intersection2(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_47]) ).
fof(c_0_51,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> relation_dom(relation_dom_restriction(X2,X1)) = set_intersection2(relation_dom(X2),X1) ),
inference(assume_negation,[status(cth)],[t90_relat_1]) ).
cnf(c_0_52,plain,
( in(X2,X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(relation_dom_restriction(X1,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_53,plain,
( set_intersection2(relation_dom(X1),set_intersection2(relation_dom(relation_dom_restriction(X1,X2)),X3)) = set_intersection2(relation_dom(relation_dom_restriction(X1,X2)),X3)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_48]) ).
cnf(c_0_54,plain,
( set_intersection2(set_intersection2(X1,relation_dom(X2)),relation_dom(relation_dom_restriction(X2,X1))) = set_intersection2(relation_dom(X2),X1)
| ~ relation(X2) ),
inference(pm,[status(thm)],[c_0_49,c_0_22]) ).
cnf(c_0_55,plain,
set_intersection2(set_intersection2(X1,X2),X3) = set_intersection2(X2,set_intersection2(X1,X3)),
inference(pm,[status(thm)],[c_0_22,c_0_50]) ).
fof(c_0_56,negated_conjecture,
( relation(esk2_0)
& relation_dom(relation_dom_restriction(esk2_0,esk1_0)) != set_intersection2(relation_dom(esk2_0),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_57,plain,
( set_intersection2(X1,relation_dom(relation_dom_restriction(X2,X3))) = relation_dom(relation_dom_restriction(X2,X3))
| in(esk3_3(X1,relation_dom(relation_dom_restriction(X2,X3)),relation_dom(relation_dom_restriction(X2,X3))),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_7]) ).
cnf(c_0_58,plain,
( set_intersection2(relation_dom(X1),set_intersection2(X2,relation_dom(relation_dom_restriction(X1,X3)))) = set_intersection2(X2,relation_dom(relation_dom_restriction(X1,X3)))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_59,plain,
( set_intersection2(relation_dom(X1),set_intersection2(X2,relation_dom(relation_dom_restriction(X1,X2)))) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
relation_dom(relation_dom_restriction(esk2_0,esk1_0)) != set_intersection2(relation_dom(esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_61,plain,
( set_intersection2(X1,relation_dom(relation_dom_restriction(X2,X1))) = relation_dom(relation_dom_restriction(X2,X1))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_57]) ).
cnf(c_0_62,plain,
( set_intersection2(X1,relation_dom(relation_dom_restriction(X2,X1))) = set_intersection2(relation_dom(X2),X1)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
relation_dom(relation_dom_restriction(esk2_0,esk1_0)) != set_intersection2(esk1_0,relation_dom(esk2_0)),
inference(rw,[status(thm)],[c_0_60,c_0_22]) ).
cnf(c_0_64,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_22]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU194+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n010.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 : Mon Jun 20 10:24:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.39/23.40 eprover: CPU time limit exceeded, terminating
% 0.39/23.41 eprover: CPU time limit exceeded, terminating
% 0.39/23.41 eprover: CPU time limit exceeded, terminating
% 0.39/23.41 eprover: CPU time limit exceeded, terminating
% 0.40/24.58 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.40/24.58
% 0.40/24.58 # Failure: Resource limit exceeded (time)
% 0.40/24.58 # OLD status Res
% 0.40/24.58 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.40/24.58 # Preprocessing time : 0.015 s
% 0.40/24.58 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.40/24.58 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.40/24.58 # Preprocessing time : 0.008 s
% 0.40/24.58
% 0.40/24.58 # Proof found!
% 0.40/24.58 # SZS status Theorem
% 0.40/24.58 # SZS output start CNFRefutation
% See solution above
% 0.40/24.58 # Proof object total steps : 67
% 0.40/24.58 # Proof object clause steps : 58
% 0.40/24.58 # Proof object formula steps : 9
% 0.40/24.58 # Proof object conjectures : 7
% 0.40/24.58 # Proof object clause conjectures : 4
% 0.40/24.58 # Proof object formula conjectures : 3
% 0.40/24.58 # Proof object initial clauses used : 12
% 0.40/24.58 # Proof object initial formulas used : 4
% 0.40/24.58 # Proof object generating inferences : 44
% 0.40/24.58 # Proof object simplifying inferences : 19
% 0.40/24.58 # Training examples: 0 positive, 0 negative
% 0.40/24.58 # Parsed axioms : 29
% 0.40/24.58 # Removed by relevancy pruning/SinE : 17
% 0.40/24.58 # Initial clauses : 23
% 0.40/24.58 # Removed in clause preprocessing : 0
% 0.40/24.58 # Initial clauses in saturation : 23
% 0.40/24.58 # Processed clauses : 2223
% 0.40/24.58 # ...of these trivial : 331
% 0.40/24.58 # ...subsumed : 1508
% 0.40/24.58 # ...remaining for further processing : 384
% 0.40/24.58 # Other redundant clauses eliminated : 4
% 0.40/24.58 # Clauses deleted for lack of memory : 0
% 0.40/24.58 # Backward-subsumed : 2
% 0.40/24.58 # Backward-rewritten : 135
% 0.40/24.58 # Generated clauses : 66067
% 0.40/24.58 # ...of the previous two non-trivial : 54846
% 0.40/24.58 # Contextual simplify-reflections : 49
% 0.40/24.58 # Paramodulations : 65955
% 0.40/24.58 # Factorizations : 102
% 0.40/24.58 # Equation resolutions : 10
% 0.40/24.58 # Current number of processed clauses : 247
% 0.40/24.58 # Positive orientable unit clauses : 12
% 0.40/24.58 # Positive unorientable unit clauses: 3
% 0.40/24.58 # Negative unit clauses : 2
% 0.40/24.58 # Non-unit-clauses : 230
% 0.40/24.58 # Current number of unprocessed clauses: 10147
% 0.40/24.58 # ...number of literals in the above : 33629
% 0.40/24.58 # Current number of archived formulas : 0
% 0.40/24.58 # Current number of archived clauses : 137
% 0.40/24.58 # Clause-clause subsumption calls (NU) : 37877
% 0.40/24.58 # Rec. Clause-clause subsumption calls : 27564
% 0.40/24.58 # Non-unit clause-clause subsumptions : 1312
% 0.40/24.58 # Unit Clause-clause subsumption calls : 869
% 0.40/24.58 # Rewrite failures with RHS unbound : 0
% 0.40/24.58 # BW rewrite match attempts : 1026
% 0.40/24.58 # BW rewrite match successes : 480
% 0.40/24.58 # Condensation attempts : 0
% 0.40/24.58 # Condensation successes : 0
% 0.40/24.58 # Termbank termtop insertions : 984727
% 0.40/24.58
% 0.40/24.58 # -------------------------------------------------
% 0.40/24.58 # User time : 0.593 s
% 0.40/24.58 # System time : 0.018 s
% 0.40/24.58 # Total time : 0.611 s
% 0.40/24.58 # Maximum resident set size: 41340 pages
%------------------------------------------------------------------------------