TSTP Solution File: SEU141+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU141+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:05 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 91 ( 52 unt; 0 def)
% Number of atoms : 173 ( 65 equ)
% Maximal formula atoms : 20 ( 1 avg)
% Number of connectives : 144 ( 62 ~; 52 |; 20 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 158 ( 25 sgn 84 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t83_xboole_1,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t83_xboole_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_boole) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_xboole_1) ).
fof(t4_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_xboole_0) ).
fof(t1_boole,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_boole) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_boole) ).
fof(t40_xboole_1,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t40_xboole_1) ).
fof(t4_boole,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_boole) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_xboole_1) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t36_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(t39_xboole_1,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_xboole_1) ).
fof(t3_xboole_1,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_r1_xboole_0) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t83_xboole_1]) ).
fof(c_0_21,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_22,plain,
empty(esk11_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_23,lemma,
! [X4,X5,X4,X5,X7] :
( ( in(esk4_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk4_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X7,X4)
| ~ in(X7,X5)
| ~ disjoint(X4,X5) ) ),
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)],[inference(fof_simplification,[status(thm)],[t3_xboole_0])])])])])])])]) ).
fof(c_0_24,negated_conjecture,
( ( ~ disjoint(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) != esk1_0 )
& ( disjoint(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) = esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_25,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X6)
| in(X8,X7)
| X7 != set_difference(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_difference(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(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)],[inference(fof_simplification,[status(thm)],[d4_xboole_0])])])])])])])]) ).
fof(c_0_26,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_27,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_28,lemma,
! [X4,X5,X4,X5,X7] :
( ( disjoint(X4,X5)
| in(esk5_2(X4,X5),set_intersection2(X4,X5)) )
& ( ~ in(X7,set_intersection2(X4,X5))
| ~ disjoint(X4,X5) ) ),
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)],[inference(fof_simplification,[status(thm)],[t4_xboole_0])])])])])])]) ).
fof(c_0_29,plain,
! [X2] : set_union2(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[t1_boole]) ).
cnf(c_0_30,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk1_0
| disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_37,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_38,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_39,lemma,
! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
inference(variable_rename,[status(thm)],[t40_xboole_1]) ).
fof(c_0_40,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[t4_boole]) ).
fof(c_0_41,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_42,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,plain,
empty_set = esk11_0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_45,lemma,
( disjoint(X1,X2)
| in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_46,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_47,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_48,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_difference(X1,set_difference(X1,X2))) ),
inference(rw,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_50,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_52,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_53,plain,
set_union2(X1,esk11_0) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,lemma,
( disjoint(X1,esk1_0)
| ~ in(esk4_2(X1,esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,lemma,
( disjoint(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_56,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_58,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
cnf(c_0_59,lemma,
( ~ disjoint(set_union2(X1,X2),X2)
| ~ in(X3,set_difference(set_union2(X1,X2),set_difference(X1,X2))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
set_difference(esk11_0,X1) = esk11_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_43]),c_0_43]) ).
cnf(c_0_61,plain,
set_union2(esk11_0,X1) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
set_difference(X1,esk11_0) = X1,
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_63,lemma,
( disjoint(X1,set_difference(X2,set_difference(X2,X3)))
| ~ disjoint(X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_64,lemma,
disjoint(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
fof(c_0_65,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_66,lemma,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
cnf(c_0_67,lemma,
( set_difference(X1,X2) = esk11_0
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_56]),c_0_57]),c_0_43]) ).
cnf(c_0_68,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
fof(c_0_69,lemma,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_70,lemma,
( ~ disjoint(X1,X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_61]),c_0_62]) ).
cnf(c_0_71,lemma,
disjoint(X1,set_difference(esk2_0,set_difference(esk2_0,esk1_0))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
fof(c_0_72,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk8_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk8_2(X4,X5),X5)
| subset(X4,X5) ) ),
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_tarski])])])])])])]) ).
fof(c_0_73,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
cnf(c_0_74,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,lemma,
set_difference(set_difference(X1,X2),X1) = esk11_0,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,lemma,
~ in(X1,set_difference(esk2_0,set_difference(esk2_0,esk1_0))),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
( subset(X1,X2)
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_80,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_81,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_36]),c_0_36]) ).
cnf(c_0_82,lemma,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_53]) ).
cnf(c_0_83,lemma,
( X1 = esk11_0
| ~ subset(X1,esk11_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_43]),c_0_43]) ).
cnf(c_0_84,lemma,
subset(set_difference(esk2_0,set_difference(esk2_0,esk1_0)),X1),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( set_difference(esk1_0,esk2_0) != esk1_0
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_86,lemma,
disjoint(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_80,c_0_64]) ).
cnf(c_0_87,lemma,
set_union2(set_difference(X1,X2),set_difference(X2,set_difference(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_81]),c_0_52]),c_0_82]) ).
cnf(c_0_88,lemma,
set_difference(esk2_0,set_difference(esk2_0,esk1_0)) = esk11_0,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_89,negated_conjecture,
set_difference(esk1_0,esk2_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_90,lemma,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_53]),c_0_89]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU141+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 02:04:14 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.018 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 91
% 0.22/1.40 # Proof object clause steps : 50
% 0.22/1.40 # Proof object formula steps : 41
% 0.22/1.40 # Proof object conjectures : 7
% 0.22/1.40 # Proof object clause conjectures : 4
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 23
% 0.22/1.40 # Proof object initial formulas used : 20
% 0.22/1.40 # Proof object generating inferences : 18
% 0.22/1.40 # Proof object simplifying inferences : 24
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 57
% 0.22/1.40 # Removed by relevancy pruning/SinE : 8
% 0.22/1.40 # Initial clauses : 77
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 76
% 0.22/1.40 # Processed clauses : 339
% 0.22/1.40 # ...of these trivial : 26
% 0.22/1.40 # ...subsumed : 146
% 0.22/1.40 # ...remaining for further processing : 167
% 0.22/1.40 # Other redundant clauses eliminated : 78
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 9
% 0.22/1.40 # Backward-rewritten : 25
% 0.22/1.40 # Generated clauses : 2010
% 0.22/1.40 # ...of the previous two non-trivial : 1395
% 0.22/1.40 # Contextual simplify-reflections : 5
% 0.22/1.40 # Paramodulations : 1908
% 0.22/1.40 # Factorizations : 14
% 0.22/1.40 # Equation resolutions : 88
% 0.22/1.40 # Current number of processed clauses : 131
% 0.22/1.40 # Positive orientable unit clauses : 35
% 0.22/1.40 # Positive unorientable unit clauses: 2
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 89
% 0.22/1.40 # Current number of unprocessed clauses: 915
% 0.22/1.40 # ...number of literals in the above : 2262
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 35
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 1838
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1534
% 0.22/1.40 # Non-unit clause-clause subsumptions : 109
% 0.22/1.40 # Unit Clause-clause subsumption calls : 183
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 55
% 0.22/1.40 # BW rewrite match successes : 17
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 17957
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.048 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.051 s
% 0.22/1.40 # Maximum resident set size: 3900 pages
%------------------------------------------------------------------------------