TSTP Solution File: SET733+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET733+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:23:29 EDT 2023
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 219 ( 19 equ)
% Maximal formula atoms : 55 ( 4 avg)
% Number of connectives : 263 ( 92 ~; 115 |; 43 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-7 aty)
% Number of variables : 127 ( 0 sgn; 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII24,conjecture,
! [X6,X10,X1,X2] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X1)
& identity(compose_function(X10,X6,X1,X2,X1),X1) )
=> injective(X6,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p',thII24) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5) ) )
& ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X6,X3,X8) )
=> X7 = X8 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p',maps) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X13,X1)
& member(X14,X1)
& member(X5,X2) )
=> ( ( apply(X6,X13,X5)
& apply(X6,X14,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p',injective) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p',identity) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p',compose_function) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X1,X2] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X1)
& identity(compose_function(X10,X6,X1,X2,X1),X1) )
=> injective(X6,X1,X2) ),
inference(assume_negation,[status(cth)],[thII24]) ).
fof(c_0_6,plain,
! [X51,X52,X53,X54,X56,X57,X58,X59,X60,X61,X63] :
( ( member(esk10_4(X51,X52,X53,X54),X53)
| ~ member(X54,X52)
| ~ maps(X51,X52,X53) )
& ( apply(X51,X54,esk10_4(X51,X52,X53,X54))
| ~ member(X54,X52)
| ~ maps(X51,X52,X53) )
& ( ~ member(X56,X52)
| ~ member(X57,X53)
| ~ member(X58,X53)
| ~ apply(X51,X56,X57)
| ~ apply(X51,X56,X58)
| X57 = X58
| ~ maps(X51,X52,X53) )
& ( member(esk12_3(X59,X60,X61),X60)
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( member(esk13_3(X59,X60,X61),X61)
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( member(esk14_3(X59,X60,X61),X61)
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( apply(X59,esk12_3(X59,X60,X61),esk13_3(X59,X60,X61))
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( apply(X59,esk12_3(X59,X60,X61),esk14_3(X59,X60,X61))
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( esk13_3(X59,X60,X61) != esk14_3(X59,X60,X61)
| member(esk11_3(X59,X60,X61),X60)
| maps(X59,X60,X61) )
& ( member(esk12_3(X59,X60,X61),X60)
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) )
& ( member(esk13_3(X59,X60,X61),X61)
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) )
& ( member(esk14_3(X59,X60,X61),X61)
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) )
& ( apply(X59,esk12_3(X59,X60,X61),esk13_3(X59,X60,X61))
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) )
& ( apply(X59,esk12_3(X59,X60,X61),esk14_3(X59,X60,X61))
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) )
& ( esk13_3(X59,X60,X61) != esk14_3(X59,X60,X61)
| ~ member(X63,X61)
| ~ apply(X59,esk11_3(X59,X60,X61),X63)
| maps(X59,X60,X61) ) ),
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)],[maps])])])])])]) ).
fof(c_0_7,negated_conjecture,
( maps(esk1_0,esk3_0,esk4_0)
& maps(esk2_0,esk4_0,esk3_0)
& identity(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0),esk3_0)
& ~ injective(esk1_0,esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X21,X22,X23,X24,X25,X26,X27,X28,X29] :
( ( ~ injective(X21,X22,X23)
| ~ member(X24,X22)
| ~ member(X25,X22)
| ~ member(X26,X23)
| ~ apply(X21,X24,X26)
| ~ apply(X21,X25,X26)
| X24 = X25 )
& ( member(esk5_3(X27,X28,X29),X28)
| injective(X27,X28,X29) )
& ( member(esk6_3(X27,X28,X29),X28)
| injective(X27,X28,X29) )
& ( member(esk7_3(X27,X28,X29),X29)
| injective(X27,X28,X29) )
& ( apply(X27,esk5_3(X27,X28,X29),esk7_3(X27,X28,X29))
| injective(X27,X28,X29) )
& ( apply(X27,esk6_3(X27,X28,X29),esk7_3(X27,X28,X29))
| injective(X27,X28,X29) )
& ( esk5_3(X27,X28,X29) != esk6_3(X27,X28,X29)
| injective(X27,X28,X29) ) ),
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)],[injective])])])])])]) ).
fof(c_0_9,plain,
! [X36,X37,X38,X39,X40] :
( ( ~ identity(X36,X37)
| ~ member(X38,X37)
| apply(X36,X38,X38) )
& ( member(esk8_2(X39,X40),X40)
| identity(X39,X40) )
& ( ~ apply(X39,esk8_2(X39,X40),esk8_2(X39,X40))
| identity(X39,X40) ) ),
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)],[identity])])])])])]) ).
cnf(c_0_10,plain,
( X3 = X5
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ member(X5,X4)
| ~ apply(X6,X1,X3)
| ~ apply(X6,X1,X5)
| ~ maps(X6,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
maps(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ injective(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( apply(X1,esk6_3(X1,X2,X3),esk7_3(X1,X2,X3))
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( member(esk7_3(X1,X2,X3),X3)
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( member(esk6_3(X1,X2,X3),X2)
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X42,X43,X44,X45,X46,X47,X48,X50] :
( ( member(esk9_7(X42,X43,X44,X45,X46,X47,X48),X45)
| ~ apply(compose_function(X42,X43,X44,X45,X46),X47,X48)
| ~ member(X47,X44)
| ~ member(X48,X46) )
& ( apply(X43,X47,esk9_7(X42,X43,X44,X45,X46,X47,X48))
| ~ apply(compose_function(X42,X43,X44,X45,X46),X47,X48)
| ~ member(X47,X44)
| ~ member(X48,X46) )
& ( apply(X42,esk9_7(X42,X43,X44,X45,X46,X47,X48),X48)
| ~ apply(compose_function(X42,X43,X44,X45,X46),X47,X48)
| ~ member(X47,X44)
| ~ member(X48,X46) )
& ( ~ member(X50,X45)
| ~ apply(X43,X47,X50)
| ~ apply(X42,X50,X48)
| apply(compose_function(X42,X43,X44,X45,X46),X47,X48)
| ~ member(X47,X44)
| ~ member(X48,X46) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])]) ).
cnf(c_0_17,plain,
( apply(X1,X3,X3)
| ~ identity(X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
identity(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( X1 = X2
| ~ apply(esk1_0,X3,X2)
| ~ apply(esk1_0,X3,X1)
| ~ member(X2,esk4_0)
| ~ member(X1,esk4_0)
| ~ member(X3,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
apply(esk1_0,esk6_3(esk1_0,esk3_0,esk4_0),esk7_3(esk1_0,esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
member(esk7_3(esk1_0,esk3_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
member(esk6_3(esk1_0,esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_23,plain,
( apply(X1,X2,esk9_7(X3,X1,X4,X5,X6,X2,X7))
| ~ apply(compose_function(X3,X1,X4,X5,X6),X2,X7)
| ~ member(X2,X4)
| ~ member(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0),X1,X1)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( apply(X1,esk5_3(X1,X2,X3),esk7_3(X1,X2,X3))
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( member(esk5_3(X1,X2,X3),X2)
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( X1 = esk7_3(esk1_0,esk3_0,esk4_0)
| ~ apply(esk1_0,esk6_3(esk1_0,esk3_0,esk4_0),X1)
| ~ member(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
( apply(esk1_0,X1,esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,X1,X1))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( member(esk9_7(X1,X2,X3,X4,X5,X6,X7),X4)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
apply(esk1_0,esk5_3(esk1_0,esk3_0,esk4_0),esk7_3(esk1_0,esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
member(esk5_3(esk1_0,esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_32,plain,
( apply(X1,esk9_7(X1,X2,X3,X4,X5,X6,X7),X7)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk6_3(esk1_0,esk3_0,esk4_0),esk6_3(esk1_0,esk3_0,esk4_0)) = esk7_3(esk1_0,esk3_0,esk4_0)
| ~ member(esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk6_3(esk1_0,esk3_0,esk4_0),esk6_3(esk1_0,esk3_0,esk4_0)),esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_34,negated_conjecture,
( member(esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,X1,X1),esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( X1 = esk7_3(esk1_0,esk3_0,esk4_0)
| ~ apply(esk1_0,esk5_3(esk1_0,esk3_0,esk4_0),X1)
| ~ member(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_21]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
maps(esk2_0,esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,negated_conjecture,
( apply(esk2_0,esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,X1,X1),X1)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk6_3(esk1_0,esk3_0,esk4_0),esk6_3(esk1_0,esk3_0,esk4_0)) = esk7_3(esk1_0,esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22])]) ).
cnf(c_0_39,negated_conjecture,
( esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk5_3(esk1_0,esk3_0,esk4_0),esk5_3(esk1_0,esk3_0,esk4_0)) = esk7_3(esk1_0,esk3_0,esk4_0)
| ~ member(esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk5_3(esk1_0,esk3_0,esk4_0),esk5_3(esk1_0,esk3_0,esk4_0)),esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
( X1 = X2
| ~ apply(esk2_0,X3,X2)
| ~ apply(esk2_0,X3,X1)
| ~ member(X2,esk3_0)
| ~ member(X1,esk3_0)
| ~ member(X3,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
apply(esk2_0,esk7_3(esk1_0,esk3_0,esk4_0),esk6_3(esk1_0,esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
esk9_7(esk2_0,esk1_0,esk3_0,esk4_0,esk3_0,esk5_3(esk1_0,esk3_0,esk4_0),esk5_3(esk1_0,esk3_0,esk4_0)) = esk7_3(esk1_0,esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_31])]) ).
cnf(c_0_43,plain,
( injective(X1,X2,X3)
| esk5_3(X1,X2,X3) != esk6_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_44,negated_conjecture,
( X1 = esk6_3(esk1_0,esk3_0,esk4_0)
| ~ apply(esk2_0,esk7_3(esk1_0,esk3_0,esk4_0),X1)
| ~ member(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22]),c_0_21])]) ).
cnf(c_0_45,negated_conjecture,
apply(esk2_0,esk7_3(esk1_0,esk3_0,esk4_0),esk5_3(esk1_0,esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
esk6_3(esk1_0,esk3_0,esk4_0) != esk5_3(esk1_0,esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_12,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_31])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET733+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.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 : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 17:23:15 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.46 Running first-order model finding
% 0.17/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.pgiidhLJVh/E---3.1_26464.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # new_bool_3 with pid 26542 completed with status 0
% 0.17/0.49 # Result found by new_bool_3
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.17/0.49 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.17/0.49 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 26545 completed with status 0
% 0.17/0.49 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.17/0.49 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.17/0.49 # Preprocessing time : 0.004 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 29
% 0.17/0.49 # Removed by relevancy pruning/SinE : 22
% 0.17/0.49 # Initial clauses : 40
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 40
% 0.17/0.49 # Processed clauses : 139
% 0.17/0.49 # ...of these trivial : 0
% 0.17/0.49 # ...subsumed : 1
% 0.17/0.49 # ...remaining for further processing : 138
% 0.17/0.49 # Other redundant clauses eliminated : 0
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 0
% 0.17/0.49 # Backward-rewritten : 5
% 0.17/0.49 # Generated clauses : 199
% 0.17/0.49 # ...of the previous two non-redundant : 176
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 0
% 0.17/0.49 # Paramodulations : 199
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 0
% 0.17/0.49 # Total rewrite steps : 68
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 93
% 0.17/0.49 # Positive orientable unit clauses : 15
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 3
% 0.17/0.49 # Non-unit-clauses : 75
% 0.17/0.49 # Current number of unprocessed clauses: 114
% 0.17/0.49 # ...number of literals in the above : 690
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 45
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 2056
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 706
% 0.17/0.49 # Non-unit clause-clause subsumptions : 0
% 0.17/0.49 # Unit Clause-clause subsumption calls : 12
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 14
% 0.17/0.49 # BW rewrite match successes : 5
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 8239
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.013 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.018 s
% 0.17/0.49 # Maximum resident set size: 1904 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.014 s
% 0.17/0.49 # System time : 0.007 s
% 0.17/0.49 # Total time : 0.021 s
% 0.17/0.49 # Maximum resident set size: 1740 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------