TSTP Solution File: SET951+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET951+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:23 EDT 2023
% Result : Theorem 114.72s 14.92s
% Output : CNFRefutation 114.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 64 ( 12 unt; 0 def)
% Number of atoms : 202 ( 68 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 249 ( 111 ~; 109 |; 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 : 220 ( 23 sgn; 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.p',d5_tarski) ).
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/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.p',d2_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.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/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.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/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.p',t104_zfmisc_1) ).
fof(c_0_6,plain,
! [X54,X55,X56,X57] :
( ( X54 = X56
| ordered_pair(X54,X55) != ordered_pair(X56,X57) )
& ( X55 = X57
| ordered_pair(X54,X55) != ordered_pair(X56,X57) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
fof(c_0_7,plain,
! [X40,X41] : ordered_pair(X40,X41) = unordered_pair(unordered_pair(X40,X41),singleton(X40)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_8,plain,
! [X14,X15,X16,X17,X20,X21,X22,X23,X24,X25,X27,X28] :
( ( in(esk1_4(X14,X15,X16,X17),X14)
| ~ in(X17,X16)
| X16 != cartesian_product2(X14,X15) )
& ( in(esk2_4(X14,X15,X16,X17),X15)
| ~ in(X17,X16)
| X16 != cartesian_product2(X14,X15) )
& ( X17 = ordered_pair(esk1_4(X14,X15,X16,X17),esk2_4(X14,X15,X16,X17))
| ~ in(X17,X16)
| X16 != cartesian_product2(X14,X15) )
& ( ~ in(X21,X14)
| ~ in(X22,X15)
| X20 != ordered_pair(X21,X22)
| in(X20,X16)
| X16 != cartesian_product2(X14,X15) )
& ( ~ in(esk3_3(X23,X24,X25),X25)
| ~ in(X27,X23)
| ~ in(X28,X24)
| esk3_3(X23,X24,X25) != ordered_pair(X27,X28)
| X25 = cartesian_product2(X23,X24) )
& ( in(esk4_3(X23,X24,X25),X23)
| in(esk3_3(X23,X24,X25),X25)
| X25 = cartesian_product2(X23,X24) )
& ( in(esk5_3(X23,X24,X25),X24)
| in(esk3_3(X23,X24,X25),X25)
| X25 = cartesian_product2(X23,X24) )
& ( esk3_3(X23,X24,X25) = ordered_pair(esk4_3(X23,X24,X25),esk5_3(X23,X24,X25))
| in(esk3_3(X23,X24,X25),X25)
| X25 = cartesian_product2(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_zfmisc_1])])])])])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ordered_pair(X3,X1) != ordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X10,X11] : unordered_pair(X10,X11) = unordered_pair(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_12,plain,
( X1 = ordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X1 = X2
| unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(unordered_pair(X4,X2),singleton(X4)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( X1 = unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1)))
| X4 != cartesian_product2(X2,X3)
| ~ in(X1,X4) ),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
( in(esk2_4(X1,X2,X3,X4),X2)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( X1 = X2
| unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(singleton(X4),unordered_pair(X4,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,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)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
cnf(c_0_19,plain,
( in(X5,X6)
| ~ in(X1,X2)
| ~ in(X3,X4)
| X5 != ordered_pair(X1,X3)
| X6 != cartesian_product2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( esk2_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(unordered_pair(X3,X4),singleton(X3))) = X4
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]) ).
fof(c_0_22,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( in(X34,X31)
| ~ in(X34,X33)
| X33 != set_intersection2(X31,X32) )
& ( in(X34,X32)
| ~ in(X34,X33)
| X33 != set_intersection2(X31,X32) )
& ( ~ in(X35,X31)
| ~ in(X35,X32)
| in(X35,X33)
| X33 != set_intersection2(X31,X32) )
& ( ~ in(esk6_3(X36,X37,X38),X38)
| ~ in(esk6_3(X36,X37,X38),X36)
| ~ in(esk6_3(X36,X37,X38),X37)
| X38 = set_intersection2(X36,X37) )
& ( in(esk6_3(X36,X37,X38),X36)
| in(esk6_3(X36,X37,X38),X38)
| X38 = set_intersection2(X36,X37) )
& ( in(esk6_3(X36,X37,X38),X37)
| in(esk6_3(X36,X37,X38),X38)
| X38 = set_intersection2(X36,X37) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).
fof(c_0_23,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]) ).
cnf(c_0_24,plain,
( X1 = X2
| ordered_pair(X1,X3) != ordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( in(X5,X6)
| X6 != cartesian_product2(X2,X4)
| X5 != unordered_pair(unordered_pair(X1,X3),singleton(X1))
| ~ in(X3,X4)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,negated_conjecture,
! [X52,X53] :
( in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))
& ( esk9_0 != ordered_pair(X52,X53)
| ~ in(X52,set_intersection2(esk10_0,esk12_0))
| ~ in(X53,set_intersection2(esk11_0,esk13_0)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_29,plain,
( X1 = X2
| unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X2,X4),singleton(X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_10]),c_0_10]) ).
cnf(c_0_30,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_31,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_32,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_33,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_28]) ).
cnf(c_0_34,plain,
( in(esk1_4(X1,X2,X3,X4),X1)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,plain,
( X1 = X2
| unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(singleton(X2),unordered_pair(X2,X4)) ),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_36,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_37,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X4)
| ~ in(X3,cartesian_product2(X5,X4))
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_38,negated_conjecture,
in(esk9_0,cartesian_product2(esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( esk9_0 != ordered_pair(X1,X2)
| ~ in(X1,set_intersection2(esk10_0,esk12_0))
| ~ in(X2,set_intersection2(esk11_0,esk13_0)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( esk1_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(unordered_pair(X3,X4),singleton(X3))) = X3
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_18])]) ).
cnf(c_0_42,plain,
( in(X1,cartesian_product2(X2,X3))
| ~ in(esk2_4(X4,X5,cartesian_product2(X4,X5),X1),X3)
| ~ in(esk1_4(X4,X5,cartesian_product2(X4,X5),X1),X2)
| ~ in(X1,cartesian_product2(X4,X5)) ),
inference(spm,[status(thm)],[c_0_36,c_0_18]) ).
cnf(c_0_43,negated_conjecture,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk13_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_45,negated_conjecture,
( esk9_0 != unordered_pair(unordered_pair(X1,X2),singleton(X1))
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0)) ),
inference(rw,[status(thm)],[c_0_39,c_0_10]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( in(esk9_0,cartesian_product2(X1,esk13_0))
| ~ in(esk1_4(X2,X3,cartesian_product2(X2,X3),esk9_0),X1)
| ~ in(esk9_0,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_14]) ).
cnf(c_0_50,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_51,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_46,c_0_14]) ).
cnf(c_0_52,negated_conjecture,
( in(esk9_0,cartesian_product2(X1,esk13_0))
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_53,negated_conjecture,
in(esk9_0,cartesian_product2(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_54,negated_conjecture,
( ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk11_0,esk13_0))
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk10_0,esk12_0))
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_18])]) ).
cnf(c_0_55,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X4)
| ~ in(X3,cartesian_product2(X4,X5))
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_18]) ).
cnf(c_0_57,negated_conjecture,
in(esk9_0,cartesian_product2(esk10_0,esk13_0)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk10_0,esk12_0))
| ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk13_0)
| ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk11_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk10_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk12_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_38]) ).
cnf(c_0_61,negated_conjecture,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk11_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
~ in(esk9_0,cartesian_product2(X1,X2)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_59]),c_0_60]),c_0_61]),c_0_43]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET951+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.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 : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 16:26:50 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Nv8zuCe5Ad/E---3.1_18388.p
% 114.72/14.92 # Version: 3.1pre001
% 114.72/14.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 114.72/14.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.72/14.92 # Starting new_bool_3 with 300s (1) cores
% 114.72/14.92 # Starting new_bool_1 with 300s (1) cores
% 114.72/14.92 # Starting sh5l with 300s (1) cores
% 114.72/14.92 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18466 completed with status 0
% 114.72/14.92 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 114.72/14.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 114.72/14.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.72/14.92 # No SInE strategy applied
% 114.72/14.92 # Search class: FGHSS-FFMF32-MFFFFFNN
% 114.72/14.92 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 114.72/14.92 # Starting new_bool_3 with 136s (1) cores
% 114.72/14.92 # Starting new_bool_1 with 136s (1) cores
% 114.72/14.92 # Starting sh5l with 136s (1) cores
% 114.72/14.92 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18473 completed with status 0
% 114.72/14.92 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 114.72/14.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 114.72/14.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.72/14.92 # No SInE strategy applied
% 114.72/14.92 # Search class: FGHSS-FFMF32-MFFFFFNN
% 114.72/14.92 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 114.72/14.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 114.72/14.92 # Preprocessing time : 0.001 s
% 114.72/14.92 # Presaturation interreduction done
% 114.72/14.92
% 114.72/14.92 # Proof found!
% 114.72/14.92 # SZS status Theorem
% 114.72/14.92 # SZS output start CNFRefutation
% See solution above
% 114.72/14.92 # Parsed axioms : 12
% 114.72/14.92 # Removed by relevancy pruning/SinE : 0
% 114.72/14.92 # Initial clauses : 26
% 114.72/14.92 # Removed in clause preprocessing : 1
% 114.72/14.92 # Initial clauses in saturation : 25
% 114.72/14.92 # Processed clauses : 53664
% 114.72/14.92 # ...of these trivial : 129
% 114.72/14.92 # ...subsumed : 47714
% 114.72/14.92 # ...remaining for further processing : 5821
% 114.72/14.92 # Other redundant clauses eliminated : 47
% 114.72/14.92 # Clauses deleted for lack of memory : 0
% 114.72/14.92 # Backward-subsumed : 501
% 114.72/14.92 # Backward-rewritten : 2
% 114.72/14.92 # Generated clauses : 618537
% 114.72/14.92 # ...of the previous two non-redundant : 615077
% 114.72/14.92 # ...aggressively subsumed : 0
% 114.72/14.92 # Contextual simplify-reflections : 13
% 114.72/14.92 # Paramodulations : 618334
% 114.72/14.92 # Factorizations : 132
% 114.72/14.92 # NegExts : 0
% 114.72/14.92 # Equation resolutions : 68
% 114.72/14.92 # Total rewrite steps : 26944
% 114.72/14.92 # Propositional unsat checks : 1
% 114.72/14.92 # Propositional check models : 0
% 114.72/14.92 # Propositional check unsatisfiable : 0
% 114.72/14.92 # Propositional clauses : 0
% 114.72/14.92 # Propositional clauses after purity: 0
% 114.72/14.92 # Propositional unsat core size : 0
% 114.72/14.92 # Propositional preprocessing time : 0.000
% 114.72/14.92 # Propositional encoding time : 1.524
% 114.72/14.92 # Propositional solver time : 0.184
% 114.72/14.92 # Success case prop preproc time : 0.000
% 114.72/14.92 # Success case prop encoding time : 0.000
% 114.72/14.92 # Success case prop solver time : 0.000
% 114.72/14.92 # Current number of processed clauses : 5282
% 114.72/14.92 # Positive orientable unit clauses : 32
% 114.72/14.92 # Positive unorientable unit clauses: 2
% 114.72/14.92 # Negative unit clauses : 16
% 114.72/14.92 # Non-unit-clauses : 5232
% 114.72/14.92 # Current number of unprocessed clauses: 560304
% 114.72/14.92 # ...number of literals in the above : 1552336
% 114.72/14.92 # Current number of archived formulas : 0
% 114.72/14.92 # Current number of archived clauses : 533
% 114.72/14.92 # Clause-clause subsumption calls (NU) : 8805942
% 114.72/14.92 # Rec. Clause-clause subsumption calls : 5619518
% 114.72/14.92 # Non-unit clause-clause subsumptions : 38024
% 114.72/14.92 # Unit Clause-clause subsumption calls : 66661
% 114.72/14.92 # Rewrite failures with RHS unbound : 0
% 114.72/14.92 # BW rewrite match attempts : 147
% 114.72/14.92 # BW rewrite match successes : 10
% 114.72/14.92 # Condensation attempts : 0
% 114.72/14.92 # Condensation successes : 0
% 114.72/14.92 # Termbank termtop insertions : 24283721
% 114.72/14.92
% 114.72/14.92 # -------------------------------------------------
% 114.72/14.92 # User time : 13.856 s
% 114.72/14.92 # System time : 0.444 s
% 114.72/14.92 # Total time : 14.300 s
% 114.72/14.92 # Maximum resident set size: 1772 pages
% 114.72/14.92
% 114.72/14.92 # -------------------------------------------------
% 114.72/14.92 # User time : 70.428 s
% 114.72/14.92 # System time : 0.834 s
% 114.72/14.92 # Total time : 71.262 s
% 114.72/14.92 # Maximum resident set size: 1684 pages
% 114.72/14.92 % E---3.1 exiting
% 114.72/14.92 % E---3.1 exiting
%------------------------------------------------------------------------------