TSTP Solution File: SEU131+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU131+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:00 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 87 ( 25 unt; 0 def)
% Number of atoms : 218 ( 66 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 221 ( 90 ~; 97 |; 19 &)
% ( 9 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 181 ( 35 sgn 79 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).
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(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_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(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t17_xboole_1) ).
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(t26_xboole_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t26_xboole_1) ).
fof(l32_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l32_xboole_1) ).
fof(t2_xboole_1,lemma,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_xboole_1) ).
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(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_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(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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(c_0_16,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_17,plain,
empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_18,plain,
! [X3,X4,X3] :
( ( X3 != empty_set
| ~ in(X4,X3) )
& ( in(esk4_1(X3),X3)
| X3 = empty_set ) ),
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)],[d1_xboole_0])])])])])])]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk3_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_22,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_23,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_24,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
empty_set = esk9_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_29,lemma,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_30,plain,
( X1 != esk9_0
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,lemma,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_32,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
fof(c_0_33,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])])])]) ).
cnf(c_0_34,lemma,
( X1 = esk9_0
| ~ subset(X1,esk9_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_25]),c_0_25]) ).
cnf(c_0_35,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[l32_xboole_1]) ).
cnf(c_0_37,lemma,
( set_union2(X1,X2) != esk9_0
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,lemma,
set_intersection2(esk9_0,X1) = esk9_0,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,lemma,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
fof(c_0_42,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(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk5_3(X5,X6,X7),X6)
| in(esk5_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_43,negated_conjecture,
( ( set_difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) )
& ( set_difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
cnf(c_0_44,lemma,
( X1 != esk9_0
| ~ subset(X2,X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,lemma,
( subset(set_intersection2(X1,X2),esk9_0)
| ~ subset(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( subset(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,lemma,
( ~ subset(X1,esk9_0)
| ~ in(X2,set_intersection2(X1,X3)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,lemma,
subset(esk9_0,X1),
inference(rw,[status(thm)],[c_0_46,c_0_25]) ).
fof(c_0_51,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])])]) ).
fof(c_0_52,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_intersection2(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_53,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_54,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk9_0
| subset(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_56,lemma,
~ in(X1,esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_40]),c_0_50])]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_61,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_26]) ).
cnf(c_0_62,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_63,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(esk7_3(X5,X6,X7),X7)
| ~ in(esk7_3(X5,X6,X7),X5)
| ~ in(esk7_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X5)
| in(esk7_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X6)
| in(esk7_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_64,lemma,
( set_intersection2(X1,X2) = set_intersection2(X3,X2)
| ~ subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X3,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_39]) ).
cnf(c_0_65,lemma,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,lemma,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_35,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_69,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_70,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_72,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_73,lemma,
( set_intersection2(X1,X2) = X2
| ~ subset(X3,X1)
| ~ subset(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_74,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
( X1 = set_intersection2(set_difference(X2,X3),X4)
| in(esk7_3(set_difference(X2,X3),X4,X1),X1)
| ~ in(esk7_3(set_difference(X2,X3),X4,X1),X3) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,lemma,
( set_intersection2(X1,X2) = esk9_0
| in(esk7_3(X1,X2,esk9_0),X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_71]) ).
cnf(c_0_77,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( ~ subset(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_79,negated_conjecture,
( set_intersection2(esk2_0,X1) = X1
| ~ subset(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,lemma,
set_intersection2(X1,set_difference(X2,X1)) = esk9_0,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_56]),c_0_59]) ).
cnf(c_0_81,plain,
( subset(set_difference(X1,X2),X3)
| in(esk3_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_68]) ).
cnf(c_0_82,negated_conjecture,
( set_difference(esk1_0,esk2_0) != esk9_0
| ~ subset(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_78,c_0_25]) ).
cnf(c_0_83,negated_conjecture,
( set_difference(X1,esk2_0) = esk9_0
| ~ subset(set_difference(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_60,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
set_difference(esk1_0,esk2_0) != esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_74])]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU131+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.33 % Computer : n003.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jun 19 01:05:43 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 87
% 0.23/1.41 # Proof object clause steps : 54
% 0.23/1.41 # Proof object formula steps : 33
% 0.23/1.41 # Proof object conjectures : 14
% 0.23/1.41 # Proof object clause conjectures : 11
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 22
% 0.23/1.41 # Proof object initial formulas used : 16
% 0.23/1.41 # Proof object generating inferences : 26
% 0.23/1.41 # Proof object simplifying inferences : 17
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 8
% 0.23/1.41 # Initial clauses : 58
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 58
% 0.23/1.41 # Processed clauses : 4142
% 0.23/1.41 # ...of these trivial : 73
% 0.23/1.41 # ...subsumed : 3374
% 0.23/1.41 # ...remaining for further processing : 695
% 0.23/1.41 # Other redundant clauses eliminated : 89
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 55
% 0.23/1.41 # Backward-rewritten : 17
% 0.23/1.41 # Generated clauses : 34463
% 0.23/1.41 # ...of the previous two non-trivial : 30969
% 0.23/1.41 # Contextual simplify-reflections : 1651
% 0.23/1.41 # Paramodulations : 34223
% 0.23/1.41 # Factorizations : 128
% 0.23/1.41 # Equation resolutions : 112
% 0.23/1.41 # Current number of processed clauses : 621
% 0.23/1.41 # Positive orientable unit clauses : 47
% 0.23/1.41 # Positive unorientable unit clauses: 2
% 0.23/1.41 # Negative unit clauses : 31
% 0.23/1.41 # Non-unit-clauses : 541
% 0.23/1.41 # Current number of unprocessed clauses: 25785
% 0.23/1.41 # ...number of literals in the above : 92633
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 72
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 234652
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 189892
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3747
% 0.23/1.41 # Unit Clause-clause subsumption calls : 5595
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 86
% 0.23/1.41 # BW rewrite match successes : 18
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 345181
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.457 s
% 0.23/1.41 # System time : 0.022 s
% 0.23/1.41 # Total time : 0.479 s
% 0.23/1.41 # Maximum resident set size: 23108 pages
%------------------------------------------------------------------------------