%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET973+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 00:55:48 EDT 2022
% Result : Theorem 0.21s 6.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 80 ( 54 unt; 0 def)
% Number of atoms : 146 ( 69 equ)
% Maximal formula atoms : 20 ( 1 avg)
% Number of connectives : 112 ( 46 ~; 48 |; 13 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 224 ( 28 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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',d4_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',d3_tarski) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t17_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',commutativity_k3_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',d10_xboole_0) ).
fof(t54_xboole_1,axiom,
! [X1,X2,X3] : set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t54_xboole_1) ).
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',commutativity_k2_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t123_zfmisc_1) ).
fof(t126_zfmisc_1,conjecture,
! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t126_zfmisc_1) ).
fof(t125_zfmisc_1,axiom,
! [X1,X2,X3] :
( cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& cartesian_product2(X3,set_difference(X1,X2)) = set_difference(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t125_zfmisc_1) ).
fof(c_0_12,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])])])])])])])]) ).
cnf(c_0_13,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_14,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk6_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk6_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])])])])])])]) ).
cnf(c_0_15,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_17,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,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])])])])]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( subset(set_difference(X1,X2),X3)
| in(esk6_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,plain,
! [X4,X5,X6] : set_difference(X4,set_intersection2(X5,X6)) = set_union2(set_difference(X4,X5),set_difference(X4,X6)),
inference(variable_rename,[status(thm)],[t54_xboole_1]) ).
fof(c_0_27,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( subset(set_difference(X1,X2),X3)
| ~ in(esk6_2(set_difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_30,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_35,plain,
subset(set_difference(X1,X1),X2),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_36,plain,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_37,plain,
( set_difference(X1,X2) = X1
| ~ subset(X1,set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_38,plain,
set_difference(X1,set_intersection2(set_intersection2(X2,X3),X4)) = set_union2(set_union2(set_difference(X1,X2),set_difference(X1,X3)),set_difference(X1,X4)),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_39,plain,
set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X3),set_difference(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_40,plain,
set_intersection2(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
set_intersection2(X1,set_difference(X2,X2)) = set_difference(X2,X2),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_42,plain,
set_difference(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_43,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,plain,
set_difference(X1,set_intersection2(set_intersection2(X2,X3),X4)) = set_union2(set_difference(X1,set_intersection2(X3,X2)),set_difference(X1,X4)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
set_difference(X1,X1) = set_difference(X2,X2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( X1 != set_difference(X2,X2)
| ~ in(X3,X4)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
cnf(c_0_47,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
set_difference(X1,set_intersection2(X2,set_intersection2(X3,X4))) = set_union2(set_difference(X1,set_intersection2(X4,X3)),set_difference(X1,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_49,plain,
set_difference(X1,set_intersection2(X2,set_intersection2(X3,X4))) = set_union2(set_difference(X1,X2),set_union2(set_difference(X1,X3),set_difference(X1,X4))),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
fof(c_0_50,plain,
! [X3] : set_intersection2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k3_xboole_0])]) ).
fof(c_0_51,plain,
! [X3] : set_union2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k2_xboole_0])]) ).
cnf(c_0_52,plain,
( X1 != set_difference(X2,X2)
| ~ in(X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_45]),c_0_46]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),set_difference(X1,X3))
| in(esk6_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_19]) ).
fof(c_0_54,plain,
! [X5,X6,X7,X8] : cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8)) = set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
cnf(c_0_55,plain,
set_union2(set_difference(X1,X1),set_union2(set_difference(X1,X2),set_difference(X1,X3))) = set_union2(set_difference(X1,set_intersection2(X3,X2)),set_difference(X4,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_49]) ).
cnf(c_0_56,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,plain,
~ in(X1,set_difference(X2,X2)),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
( subset(X1,set_difference(X1,X2))
| in(esk6_2(X1,set_difference(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
fof(c_0_60,negated_conjecture,
~ ! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
inference(assume_negation,[status(cth)],[t126_zfmisc_1]) ).
cnf(c_0_61,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,plain,
set_union2(set_difference(X1,X1),set_difference(X1,X2)) = set_union2(set_difference(X1,X2),set_difference(X3,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_63,plain,
subset(X1,set_difference(X1,set_difference(X2,X2))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
fof(c_0_64,negated_conjecture,
set_difference(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) != set_union2(cartesian_product2(set_difference(esk1_0,esk3_0),esk2_0),cartesian_product2(esk1_0,set_difference(esk2_0,esk4_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])]) ).
fof(c_0_65,plain,
! [X4,X5,X6,X4,X5,X6] :
( cartesian_product2(set_difference(X4,X5),X6) = set_difference(cartesian_product2(X4,X6),cartesian_product2(X5,X6))
& cartesian_product2(X6,set_difference(X4,X5)) = set_difference(cartesian_product2(X6,X4),cartesian_product2(X6,X5)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[t125_zfmisc_1])])]) ).
cnf(c_0_66,plain,
set_difference(X1,cartesian_product2(set_intersection2(X2,X3),set_intersection2(X4,X5))) = set_union2(set_difference(X1,cartesian_product2(X2,X4)),set_difference(X1,cartesian_product2(X3,X5))),
inference(spm,[status(thm)],[c_0_32,c_0_61]) ).
cnf(c_0_67,plain,
set_union2(set_difference(X1,X1),set_difference(X2,X3)) = set_union2(set_difference(X2,X3),set_difference(X4,X4)),
inference(spm,[status(thm)],[c_0_62,c_0_45]) ).
cnf(c_0_68,plain,
set_difference(X1,set_difference(X2,X2)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_63]),c_0_31])]) ).
cnf(c_0_69,negated_conjecture,
set_difference(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) != set_union2(cartesian_product2(set_difference(esk1_0,esk3_0),esk2_0),cartesian_product2(esk1_0,set_difference(esk2_0,esk4_0))),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,plain,
cartesian_product2(X1,set_difference(X2,X3)) = set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_71,plain,
cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_72,plain,
set_difference(X1,cartesian_product2(set_intersection2(X2,X3),set_intersection2(X4,X5))) = set_union2(set_difference(X1,cartesian_product2(X3,X5)),set_difference(X1,cartesian_product2(X2,X4))),
inference(spm,[status(thm)],[c_0_39,c_0_61]) ).
cnf(c_0_73,plain,
set_difference(X1,cartesian_product2(set_intersection2(X2,X3),set_intersection2(X4,X5))) = set_union2(set_difference(X1,cartesian_product2(X2,X5)),set_difference(X1,cartesian_product2(X3,X4))),
inference(spm,[status(thm)],[c_0_66,c_0_23]) ).
cnf(c_0_74,plain,
set_union2(set_difference(X1,X1),X2) = set_union2(X2,set_difference(X3,X3)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_68]),c_0_40]),c_0_68]),c_0_33]) ).
cnf(c_0_76,negated_conjecture,
set_union2(set_difference(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk2_0)),set_difference(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk1_0,esk4_0))) != set_difference(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_77,plain,
set_union2(set_difference(X1,cartesian_product2(X2,X3)),set_difference(X1,cartesian_product2(X4,X5))) = set_union2(set_difference(X1,cartesian_product2(X4,X3)),set_difference(X1,cartesian_product2(X2,X5))),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
set_union2(set_difference(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET973+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.10 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sat Jul 9 23:56:37 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.21/6.39 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.21/6.39 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.21/6.39 # Preprocessing time : 0.014 s
% 0.21/6.39
% 0.21/6.39 # Proof found!
% 0.21/6.39 # SZS status Theorem
% 0.21/6.39 # SZS output start CNFRefutation
% See solution above
% 0.21/6.39 # Proof object total steps : 80
% 0.21/6.39 # Proof object clause steps : 55
% 0.21/6.39 # Proof object formula steps : 25
% 0.21/6.39 # Proof object conjectures : 6
% 0.21/6.39 # Proof object clause conjectures : 3
% 0.21/6.39 # Proof object formula conjectures : 3
% 0.21/6.39 # Proof object initial clauses used : 16
% 0.21/6.39 # Proof object initial formulas used : 12
% 0.21/6.39 # Proof object generating inferences : 37
% 0.21/6.39 # Proof object simplifying inferences : 13
% 0.21/6.39 # Training examples: 0 positive, 0 negative
% 0.21/6.39 # Parsed axioms : 26
% 0.21/6.39 # Removed by relevancy pruning/SinE : 9
% 0.21/6.39 # Initial clauses : 32
% 0.21/6.39 # Removed in clause preprocessing : 0
% 0.21/6.39 # Initial clauses in saturation : 32
% 0.21/6.39 # Processed clauses : 3360
% 0.21/6.39 # ...of these trivial : 339
% 0.21/6.39 # ...subsumed : 2449
% 0.21/6.39 # ...remaining for further processing : 572
% 0.21/6.39 # Other redundant clauses eliminated : 47
% 0.21/6.39 # Clauses deleted for lack of memory : 154369
% 0.21/6.39 # Backward-subsumed : 9
% 0.21/6.39 # Backward-rewritten : 52
% 0.21/6.39 # Generated clauses : 339543
% 0.21/6.39 # ...of the previous two non-trivial : 335130
% 0.21/6.39 # Contextual simplify-reflections : 43
% 0.21/6.39 # Paramodulations : 339319
% 0.21/6.39 # Factorizations : 124
% 0.21/6.39 # Equation resolutions : 100
% 0.21/6.39 # Current number of processed clauses : 509
% 0.21/6.39 # Positive orientable unit clauses : 59
% 0.21/6.39 # Positive unorientable unit clauses: 262
% 0.21/6.39 # Negative unit clauses : 3
% 0.21/6.39 # Non-unit-clauses : 185
% 0.21/6.39 # Current number of unprocessed clauses: 155589
% 0.21/6.39 # ...number of literals in the above : 222927
% 0.21/6.39 # Current number of archived formulas : 0
% 0.21/6.39 # Current number of archived clauses : 61
% 0.21/6.39 # Clause-clause subsumption calls (NU) : 24079
% 0.21/6.39 # Rec. Clause-clause subsumption calls : 17925
% 0.21/6.39 # Non-unit clause-clause subsumptions : 720
% 0.21/6.39 # Unit Clause-clause subsumption calls : 6911
% 0.21/6.39 # Rewrite failures with RHS unbound : 1251
% 0.21/6.39 # BW rewrite match attempts : 9719
% 0.21/6.39 # BW rewrite match successes : 1245
% 0.21/6.39 # Condensation attempts : 0
% 0.21/6.39 # Condensation successes : 0
% 0.21/6.39 # Termbank termtop insertions : 7311961
% 0.21/6.39
% 0.21/6.39 # -------------------------------------------------
% 0.21/6.39 # User time : 5.743 s
% 0.21/6.39 # System time : 0.142 s
% 0.21/6.39 # Total time : 5.885 s
% 0.21/6.39 # Maximum resident set size: 134596 pages
% 0.22/23.36 eprover: CPU time limit exceeded, terminating
% 0.22/23.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.38 eprover: No such file or directory
% 0.22/23.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.38 eprover: No such file or directory
% 0.22/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.39 eprover: No such file or directory
% 0.22/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.40 eprover: No such file or directory
% 0.22/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.40 eprover: No such file or directory
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------