TSTP Solution File: SET951+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:40 EDT 2022
% Result : Theorem 0.48s 46.64s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 63 ( 26 unt; 0 def)
% Number of atoms : 171 ( 76 equ)
% Maximal formula atoms : 28 ( 2 avg)
% Number of connectives : 187 ( 79 ~; 79 |; 24 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 158 ( 21 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d2_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_k2_tarski) ).
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(t104_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5] :
~ ( in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
& ! [X6,X7] :
~ ( X1 = ordered_pair(X6,X7)
& in(X6,set_intersection2(X2,X4))
& in(X7,set_intersection2(X3,X5)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t104_zfmisc_1) ).
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t33_zfmisc_1) ).
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(c_0_7,plain,
! [X7,X8,X9,X10,X10,X13,X14,X7,X8,X9,X16,X17] :
( ( in(esk1_4(X7,X8,X9,X10),X7)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( in(esk2_4(X7,X8,X9,X10),X8)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( X10 = ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(X13,X7)
| ~ in(X14,X8)
| X10 != ordered_pair(X13,X14)
| in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(esk3_3(X7,X8,X9),X9)
| ~ in(X16,X7)
| ~ in(X17,X8)
| esk3_3(X7,X8,X9) != ordered_pair(X16,X17)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk4_3(X7,X8,X9),X7)
| in(esk3_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk5_3(X7,X8,X9),X8)
| in(esk3_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( esk3_3(X7,X8,X9) = ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))
| in(esk3_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) ) ),
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)],[d2_zfmisc_1])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_9,plain,
( X4 = ordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4))
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_12,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(esk6_3(X5,X6,X7),X7)
| ~ in(esk6_3(X5,X6,X7),X5)
| ~ in(esk6_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk6_3(X5,X6,X7),X5)
| in(esk6_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk6_3(X5,X6,X7),X6)
| in(esk6_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])])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
~ ( in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
& ! [X6,X7] :
~ ( X1 = ordered_pair(X6,X7)
& in(X6,set_intersection2(X2,X4))
& in(X7,set_intersection2(X3,X5)) ) ),
inference(assume_negation,[status(cth)],[t104_zfmisc_1]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| ordered_pair(X5,X6) != ordered_pair(X7,X8) )
& ( X6 = X8
| ordered_pair(X5,X6) != ordered_pair(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
cnf(c_0_15,plain,
( X4 = unordered_pair(unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)),singleton(esk1_4(X2,X3,X1,X4)))
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
! [X13,X14] :
( in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))
& ( esk9_0 != ordered_pair(X13,X14)
| ~ in(X13,set_intersection2(esk10_0,esk12_0))
| ~ in(X14,set_intersection2(esk11_0,esk13_0)) ) ),
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)],[c_0_13])])])])])]) ).
cnf(c_0_19,plain,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( unordered_pair(singleton(esk1_4(X1,X2,X3,X4)),unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4))) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( X1 = X3
| unordered_pair(unordered_pair(X1,X2),singleton(X1)) != unordered_pair(unordered_pair(X3,X4),singleton(X3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_10]),c_0_10]) ).
cnf(c_0_25,plain,
( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
in(esk9_0,cartesian_product2(esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( X2 = X4
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( X1 = X2
| unordered_pair(singleton(X1),unordered_pair(X1,X3)) != unordered_pair(singleton(X2),unordered_pair(X2,X4)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_16]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
unordered_pair(singleton(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0)),unordered_pair(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0))) = esk9_0,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
in(esk9_0,cartesian_product2(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_32,plain,
( X2 = X4
| unordered_pair(unordered_pair(X1,X2),singleton(X1)) != unordered_pair(unordered_pair(X3,X4),singleton(X3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_10]),c_0_10]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0)
| unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
unordered_pair(singleton(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0)),unordered_pair(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0))) = esk9_0,
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_35,plain,
( in(esk1_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_36,plain,
( in(esk2_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,plain,
( X1 = X2
| unordered_pair(singleton(X3),unordered_pair(X3,X1)) != unordered_pair(singleton(X4),unordered_pair(X4,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_16]),c_0_16]) ).
cnf(c_0_38,negated_conjecture,
esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) = esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(X1,set_intersection2(esk11_0,esk13_0))
| ~ in(X2,set_intersection2(esk10_0,esk12_0))
| esk9_0 != ordered_pair(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_40,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( X1 = esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0)
| unordered_pair(singleton(X2),unordered_pair(X2,X1)) != esk9_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
unordered_pair(singleton(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0)),unordered_pair(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0))) = esk9_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_38]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( esk9_0 != unordered_pair(unordered_pair(X2,X1),singleton(X2))
| ~ in(X2,set_intersection2(esk10_0,esk12_0))
| ~ in(X1,set_intersection2(esk11_0,esk13_0)) ),
inference(rw,[status(thm)],[c_0_39,c_0_10]) ).
cnf(c_0_46,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk10_0),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_48,negated_conjecture,
in(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk12_0),
inference(spm,[status(thm)],[c_0_41,c_0_26]) ).
fof(c_0_49,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_50,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk11_0),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_51,negated_conjecture,
in(esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk13_0),
inference(spm,[status(thm)],[c_0_42,c_0_26]) ).
cnf(c_0_52,negated_conjecture,
esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) = esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0
| ~ in(X1,set_intersection2(esk10_0,esk12_0))
| ~ in(X2,set_intersection2(esk11_0,esk13_0)) ),
inference(rw,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_54,negated_conjecture,
( in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(X1,esk10_0))
| ~ in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk12_0),
inference(rw,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_56,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(X1,esk11_0))
| ~ in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk13_0),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( ~ in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk10_0,esk12_0))
| ~ in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk11_0,esk13_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_60,negated_conjecture,
in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk10_0,esk12_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk11_0,esk13_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_56]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n015.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 Jul 10 00:00:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.42 eprover: CPU time limit exceeded, terminating
% 0.35/23.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.43 eprover: CPU time limit exceeded, terminating
% 0.48/46.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.46 eprover: CPU time limit exceeded, terminating
% 0.48/46.64 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.48/46.64
% 0.48/46.64 # Failure: Resource limit exceeded (time)
% 0.48/46.64 # OLD status Res
% 0.48/46.64 # Preprocessing time : 0.015 s
% 0.48/46.64 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.48/46.64
% 0.48/46.64 # Failure: Resource limit exceeded (time)
% 0.48/46.64 # OLD status Res
% 0.48/46.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.48/46.64 # Preprocessing time : 0.008 s
% 0.48/46.64 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.48/46.64 # Preprocessing time : 0.008 s
% 0.48/46.64
% 0.48/46.64 # Proof found!
% 0.48/46.64 # SZS status Theorem
% 0.48/46.64 # SZS output start CNFRefutation
% See solution above
% 0.48/46.64 # Proof object total steps : 63
% 0.48/46.64 # Proof object clause steps : 48
% 0.48/46.64 # Proof object formula steps : 15
% 0.48/46.64 # Proof object conjectures : 28
% 0.48/46.64 # Proof object clause conjectures : 25
% 0.48/46.64 # Proof object formula conjectures : 3
% 0.48/46.64 # Proof object initial clauses used : 13
% 0.48/46.64 # Proof object initial formulas used : 7
% 0.48/46.64 # Proof object generating inferences : 23
% 0.48/46.64 # Proof object simplifying inferences : 22
% 0.48/46.64 # Training examples: 0 positive, 0 negative
% 0.48/46.64 # Parsed axioms : 12
% 0.48/46.64 # Removed by relevancy pruning/SinE : 0
% 0.48/46.64 # Initial clauses : 26
% 0.48/46.64 # Removed in clause preprocessing : 1
% 0.48/46.64 # Initial clauses in saturation : 25
% 0.48/46.64 # Processed clauses : 425
% 0.48/46.64 # ...of these trivial : 4
% 0.48/46.64 # ...subsumed : 126
% 0.48/46.64 # ...remaining for further processing : 294
% 0.48/46.64 # Other redundant clauses eliminated : 3
% 0.48/46.64 # Clauses deleted for lack of memory : 0
% 0.48/46.64 # Backward-subsumed : 0
% 0.48/46.64 # Backward-rewritten : 137
% 0.48/46.64 # Generated clauses : 1712
% 0.48/46.64 # ...of the previous two non-trivial : 1466
% 0.48/46.64 # Contextual simplify-reflections : 1
% 0.48/46.64 # Paramodulations : 1669
% 0.48/46.64 # Factorizations : 20
% 0.48/46.64 # Equation resolutions : 23
% 0.48/46.64 # Current number of processed clauses : 157
% 0.48/46.64 # Positive orientable unit clauses : 16
% 0.48/46.64 # Positive unorientable unit clauses: 2
% 0.48/46.64 # Negative unit clauses : 13
% 0.48/46.64 # Non-unit-clauses : 126
% 0.48/46.64 # Current number of unprocessed clauses: 574
% 0.48/46.64 # ...number of literals in the above : 1788
% 0.48/46.64 # Current number of archived formulas : 0
% 0.48/46.64 # Current number of archived clauses : 138
% 0.48/46.64 # Clause-clause subsumption calls (NU) : 2627
% 0.48/46.64 # Rec. Clause-clause subsumption calls : 1669
% 0.48/46.64 # Non-unit clause-clause subsumptions : 97
% 0.48/46.64 # Unit Clause-clause subsumption calls : 112
% 0.48/46.64 # Rewrite failures with RHS unbound : 0
% 0.48/46.64 # BW rewrite match attempts : 3813
% 0.48/46.64 # BW rewrite match successes : 33
% 0.48/46.64 # Condensation attempts : 0
% 0.48/46.64 # Condensation successes : 0
% 0.48/46.64 # Termbank termtop insertions : 49174
% 0.48/46.64
% 0.48/46.64 # -------------------------------------------------
% 0.48/46.64 # User time : 0.030 s
% 0.48/46.64 # System time : 0.004 s
% 0.48/46.64 # Total time : 0.034 s
% 0.48/46.64 # Maximum resident set size: 4744 pages
% 0.48/69.44 eprover: CPU time limit exceeded, terminating
% 0.48/69.45 eprover: CPU time limit exceeded, terminating
% 0.48/69.46 eprover: CPU time limit exceeded, terminating
% 0.48/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.46 eprover: No such file or directory
% 0.48/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.47 eprover: No such file or directory
% 0.48/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.47 eprover: No such file or directory
% 0.48/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.47 eprover: No such file or directory
% 0.48/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.47 eprover: No such file or directory
% 0.48/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.47 eprover: No such file or directory
% 0.48/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.48 eprover: No such file or directory
% 0.48/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.48 eprover: No such file or directory
% 0.48/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.48 eprover: No such file or directory
% 0.48/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.48 eprover: No such file or directory
% 0.48/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.48 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.49 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.50 eprover: eprover: No such file or directory
% 0.48/69.50 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.50 eprover: No such file or directory
% 0.48/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/69.51 eprover: No such file or directory
% 0.48/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.51 eprover: No such file or directory
% 0.48/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/69.51 eprover: No such file or directory
%------------------------------------------------------------------------------