TSTP Solution File: SET610+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET610+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:19:55 EDT 2023
% Result : Theorem 263.97s 34.81s
% Output : CNFRefutation 263.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 96 ( 50 unt; 0 def)
% Number of atoms : 176 ( 29 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 128 ( 48 ~; 63 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 267 ( 47 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',difference_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',subset_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',equal_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',commutativity_of_union) ).
fof(prove_th83,conjecture,
! [X1,X2] : difference(union(X1,X2),X2) = difference(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p',prove_th83) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
fof(c_0_7,plain,
! [X6,X7,X8] :
( ( member(X8,X6)
| ~ member(X8,difference(X6,X7)) )
& ( ~ member(X8,X7)
| ~ member(X8,difference(X6,X7)) )
& ( ~ member(X8,X6)
| member(X8,X7)
| member(X8,difference(X6,X7)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X24,X25,X26,X27,X28] :
( ( ~ subset(X24,X25)
| ~ member(X26,X24)
| member(X26,X25) )
& ( member(esk5_2(X27,X28),X27)
| subset(X27,X28) )
& ( ~ member(esk5_2(X27,X28),X28)
| subset(X27,X28) ) ),
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)],[subset_defn])])])])])]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( member(esk5_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X30,X31] :
( ( subset(X30,X31)
| X30 != X31 )
& ( subset(X31,X30)
| X30 != X31 )
& ( ~ subset(X30,X31)
| ~ subset(X31,X30)
| X30 = X31 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( subset(difference(X1,X2),X3)
| member(esk5_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk5_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,plain,
( difference(X1,X2) = X1
| ~ subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
subset(difference(X1,X1),X2),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_22,plain,
! [X9,X10,X11] :
( ( ~ member(X11,union(X9,X10))
| member(X11,X9)
| member(X11,X10) )
& ( ~ member(X11,X9)
| member(X11,union(X9,X10)) )
& ( ~ member(X11,X10)
| member(X11,union(X9,X10)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).
cnf(c_0_23,plain,
difference(difference(X1,X1),X2) = difference(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( member(X1,X2)
| ~ member(X1,difference(X3,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,plain,
( subset(X1,difference(X2,X3))
| member(esk5_2(X1,difference(X2,X3)),X3)
| ~ member(esk5_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
~ member(X1,difference(X2,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_24]) ).
cnf(c_0_30,plain,
( subset(X1,difference(X1,X2))
| member(esk5_2(X1,difference(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_31,plain,
( subset(difference(X1,union(X2,X3)),X4)
| ~ member(esk5_2(difference(X1,union(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_32,plain,
( subset(difference(difference(X1,X2),X3),X4)
| member(esk5_2(difference(difference(X1,X2),X3),X4),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_33,plain,
( subset(difference(difference(X1,X2),X3),X4)
| ~ member(esk5_2(difference(difference(X1,X2),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_34,plain,
( subset(difference(X1,difference(X2,X3)),X4)
| member(esk5_2(difference(X1,difference(X2,X3)),X4),X3)
| ~ member(esk5_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_35,plain,
( subset(X1,union(X2,X3))
| ~ member(esk5_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_36,plain,
( subset(X1,union(X2,X3))
| ~ member(esk5_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_37,plain,
( subset(difference(union(X1,X2),X3),X4)
| member(esk5_2(difference(union(X1,X2),X3),X4),X1)
| member(esk5_2(difference(union(X1,X2),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_38,plain,
subset(X1,difference(X1,difference(X2,X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
subset(difference(difference(X1,X2),union(X3,X1)),X4),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
subset(difference(difference(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_41,plain,
( subset(union(X1,X2),X3)
| member(esk5_2(union(X1,X2),X3),X1)
| member(esk5_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_42,plain,
( subset(difference(difference(X1,union(X2,X3)),X4),X5)
| ~ member(esk5_2(difference(difference(X1,union(X2,X3)),X4),X5),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_43,plain,
( subset(difference(difference(X1,X2),difference(X1,X3)),X4)
| member(esk5_2(difference(difference(X1,X2),difference(X1,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_44,plain,
( subset(X1,union(X2,union(X3,X4)))
| ~ member(esk5_2(X1,union(X2,union(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_45,plain,
( subset(difference(union(X1,X2),X3),union(X2,X4))
| member(esk5_2(difference(union(X1,X2),X3),union(X2,X4)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,plain,
difference(X1,difference(X2,X2)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_38]),c_0_16])]) ).
cnf(c_0_47,plain,
difference(difference(difference(X1,X2),union(X3,X1)),X4) = difference(difference(X1,X2),union(X3,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ member(X1,difference(difference(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_49,plain,
( subset(union(X1,X2),X2)
| member(esk5_2(union(X1,X2),X2),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_41]) ).
fof(c_0_50,plain,
! [X12,X13] : union(X12,X13) = union(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_51,plain,
( X1 = difference(X2,X2)
| ~ subset(X1,difference(X2,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_52,plain,
subset(difference(difference(X1,union(X2,X3)),difference(X1,X3)),X4),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,plain,
subset(difference(union(X1,X2),X3),union(X2,union(X4,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,plain,
difference(X1,difference(difference(X2,X3),union(X4,X2))) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
( subset(X1,union(X2,difference(X3,X4)))
| member(esk5_2(X1,union(X2,difference(X3,X4))),X4)
| ~ member(esk5_2(X1,union(X2,difference(X3,X4))),X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_56,plain,
( subset(union(difference(difference(X1,X2),X3),X4),X4)
| member(esk5_2(union(difference(difference(X1,X2),X3),X4),X4),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
difference(difference(X1,union(X2,X3)),difference(X1,X3)) = difference(X4,X4),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
subset(union(difference(X1,X1),X2),X2),
inference(spm,[status(thm)],[c_0_29,c_0_49]) ).
cnf(c_0_60,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_61,plain,
subset(union(X1,X2),union(X2,union(X3,X1))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
( subset(union(X1,union(X2,difference(X1,X3))),union(X2,difference(X1,X3)))
| member(esk5_2(union(X1,union(X2,difference(X1,X3))),union(X2,difference(X1,X3))),X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_49]) ).
cnf(c_0_63,plain,
subset(union(X1,difference(difference(X1,X2),X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_56]),c_0_57]) ).
cnf(c_0_64,plain,
difference(X1,difference(difference(X2,union(X3,X4)),difference(X2,X4))) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_58]) ).
cnf(c_0_65,plain,
subset(difference(X1,X2),union(X3,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_66,plain,
union(difference(X1,X1),X2) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_59]),c_0_60])]) ).
cnf(c_0_67,plain,
subset(union(X1,X2),union(X2,union(X1,X3))),
inference(spm,[status(thm)],[c_0_61,c_0_57]) ).
cnf(c_0_68,plain,
subset(union(X1,union(X2,difference(X1,X2))),union(X2,difference(X1,X2))),
inference(spm,[status(thm)],[c_0_36,c_0_62]) ).
cnf(c_0_69,plain,
subset(union(X1,X2),union(union(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_61,c_0_57]) ).
cnf(c_0_70,plain,
subset(union(X1,difference(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_60,c_0_57]) ).
cnf(c_0_72,plain,
( member(X1,union(X2,X3))
| ~ member(X1,difference(X3,X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_65]) ).
cnf(c_0_73,plain,
union(X1,difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_66]) ).
cnf(c_0_74,plain,
subset(union(X1,X2),union(X1,union(X2,X3))),
inference(spm,[status(thm)],[c_0_67,c_0_57]) ).
cnf(c_0_75,plain,
union(X1,union(X2,difference(X1,X2))) = union(X2,difference(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_68]),c_0_60])]) ).
cnf(c_0_76,plain,
subset(union(X1,X2),union(union(X3,X2),X1)),
inference(spm,[status(thm)],[c_0_69,c_0_57]) ).
cnf(c_0_77,plain,
union(X1,difference(X1,X2)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_70]),c_0_71])]) ).
cnf(c_0_78,plain,
( subset(difference(X1,X2),X3)
| member(esk5_2(difference(X1,X2),X3),union(X4,X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_10]) ).
cnf(c_0_79,plain,
subset(difference(union(X1,X2),X1),union(X2,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_80,plain,
union(X1,difference(difference(X2,X3),union(X4,X2))) = X1,
inference(spm,[status(thm)],[c_0_73,c_0_47]) ).
cnf(c_0_81,plain,
subset(union(X1,X2),union(X2,difference(X1,X2))),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
subset(union(X1,difference(X2,X3)),union(X2,X1)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_83,plain,
( subset(difference(X1,X2),difference(union(X3,X1),X4))
| member(esk5_2(difference(X1,X2),difference(union(X3,X1),X4)),X4) ),
inference(spm,[status(thm)],[c_0_25,c_0_78]) ).
fof(c_0_84,negated_conjecture,
~ ! [X1,X2] : difference(union(X1,X2),X2) = difference(X1,X2),
inference(assume_negation,[status(cth)],[prove_th83]) ).
cnf(c_0_85,plain,
subset(difference(union(X1,X2),X1),X2),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
union(X1,difference(X2,X1)) = union(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_81]),c_0_82])]) ).
cnf(c_0_87,plain,
subset(difference(X1,X2),difference(union(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_83]) ).
fof(c_0_88,negated_conjecture,
difference(union(esk1_0,esk2_0),esk2_0) != difference(esk1_0,esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_84])])]) ).
cnf(c_0_89,plain,
subset(difference(union(X1,X2),X2),difference(X1,X2)),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
subset(difference(X1,X2),difference(union(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_87,c_0_57]) ).
cnf(c_0_91,negated_conjecture,
difference(union(esk1_0,esk2_0),esk2_0) != difference(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_92,plain,
difference(union(X1,X2),X2) = difference(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_89]),c_0_90])]) ).
cnf(c_0_93,negated_conjecture,
difference(union(esk2_0,esk1_0),esk2_0) != difference(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_91,c_0_57]) ).
cnf(c_0_94,plain,
difference(union(X1,X2),X1) = difference(X2,X1),
inference(spm,[status(thm)],[c_0_92,c_0_57]) ).
cnf(c_0_95,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET610+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n026.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 2400
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Oct 2 17:32:14 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.YEfBT330iQ/E---3.1_10806.p
% 263.97/34.81 # Version: 3.1pre001
% 263.97/34.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 263.97/34.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 263.97/34.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 263.97/34.81 # Starting new_bool_3 with 300s (1) cores
% 263.97/34.81 # Starting new_bool_1 with 300s (1) cores
% 263.97/34.81 # Starting sh5l with 300s (1) cores
% 263.97/34.81 # sh5l with pid 10887 completed with status 0
% 263.97/34.81 # Result found by sh5l
% 263.97/34.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 263.97/34.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 263.97/34.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 263.97/34.81 # Starting new_bool_3 with 300s (1) cores
% 263.97/34.81 # Starting new_bool_1 with 300s (1) cores
% 263.97/34.81 # Starting sh5l with 300s (1) cores
% 263.97/34.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 263.97/34.81 # Search class: FGHSS-FFSF22-SFFFFFNN
% 263.97/34.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 263.97/34.81 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 263.97/34.81 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 10895 completed with status 0
% 263.97/34.81 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 263.97/34.81 # Preprocessing class: FSMSSMSSSSSNFFN.
% 263.97/34.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 263.97/34.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 263.97/34.81 # Starting new_bool_3 with 300s (1) cores
% 263.97/34.81 # Starting new_bool_1 with 300s (1) cores
% 263.97/34.81 # Starting sh5l with 300s (1) cores
% 263.97/34.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 263.97/34.81 # Search class: FGHSS-FFSF22-SFFFFFNN
% 263.97/34.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 263.97/34.81 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 263.97/34.81 # Preprocessing time : 0.001 s
% 263.97/34.81 # Presaturation interreduction done
% 263.97/34.81
% 263.97/34.81 # Proof found!
% 263.97/34.81 # SZS status Theorem
% 263.97/34.81 # SZS output start CNFRefutation
% See solution above
% 263.97/34.81 # Parsed axioms : 9
% 263.97/34.81 # Removed by relevancy pruning/SinE : 0
% 263.97/34.81 # Initial clauses : 21
% 263.97/34.81 # Removed in clause preprocessing : 2
% 263.97/34.81 # Initial clauses in saturation : 19
% 263.97/34.81 # Processed clauses : 118350
% 263.97/34.81 # ...of these trivial : 16776
% 263.97/34.81 # ...subsumed : 97325
% 263.97/34.81 # ...remaining for further processing : 4249
% 263.97/34.81 # Other redundant clauses eliminated : 2
% 263.97/34.81 # Clauses deleted for lack of memory : 0
% 263.97/34.81 # Backward-subsumed : 18
% 263.97/34.81 # Backward-rewritten : 225
% 263.97/34.81 # Generated clauses : 3521994
% 263.97/34.81 # ...of the previous two non-redundant : 1811079
% 263.97/34.81 # ...aggressively subsumed : 0
% 263.97/34.81 # Contextual simplify-reflections : 21
% 263.97/34.81 # Paramodulations : 3519820
% 263.97/34.81 # Factorizations : 2172
% 263.97/34.81 # NegExts : 0
% 263.97/34.81 # Equation resolutions : 2
% 263.97/34.81 # Total rewrite steps : 3561757
% 263.97/34.81 # Propositional unsat checks : 0
% 263.97/34.81 # Propositional check models : 0
% 263.97/34.81 # Propositional check unsatisfiable : 0
% 263.97/34.81 # Propositional clauses : 0
% 263.97/34.81 # Propositional clauses after purity: 0
% 263.97/34.81 # Propositional unsat core size : 0
% 263.97/34.81 # Propositional preprocessing time : 0.000
% 263.97/34.81 # Propositional encoding time : 0.000
% 263.97/34.81 # Propositional solver time : 0.000
% 263.97/34.81 # Success case prop preproc time : 0.000
% 263.97/34.81 # Success case prop encoding time : 0.000
% 263.97/34.81 # Success case prop solver time : 0.000
% 263.97/34.81 # Current number of processed clauses : 3987
% 263.97/34.81 # Positive orientable unit clauses : 2491
% 263.97/34.81 # Positive unorientable unit clauses: 73
% 263.97/34.81 # Negative unit clauses : 30
% 263.97/34.81 # Non-unit-clauses : 1393
% 263.97/34.81 # Current number of unprocessed clauses: 1689022
% 263.97/34.81 # ...number of literals in the above : 4454434
% 263.97/34.81 # Current number of archived formulas : 0
% 263.97/34.81 # Current number of archived clauses : 260
% 263.97/34.81 # Clause-clause subsumption calls (NU) : 1137834
% 263.97/34.81 # Rec. Clause-clause subsumption calls : 328355
% 263.97/34.81 # Non-unit clause-clause subsumptions : 36495
% 263.97/34.81 # Unit Clause-clause subsumption calls : 470721
% 263.97/34.81 # Rewrite failures with RHS unbound : 13053
% 263.97/34.81 # BW rewrite match attempts : 256657
% 263.97/34.81 # BW rewrite match successes : 660
% 263.97/34.81 # Condensation attempts : 0
% 263.97/34.81 # Condensation successes : 0
% 263.97/34.81 # Termbank termtop insertions : 42899212
% 263.97/34.81
% 263.97/34.81 # -------------------------------------------------
% 263.97/34.81 # User time : 32.382 s
% 263.97/34.81 # System time : 1.080 s
% 263.97/34.81 # Total time : 33.462 s
% 263.97/34.81 # Maximum resident set size: 1708 pages
% 263.97/34.81
% 263.97/34.81 # -------------------------------------------------
% 263.97/34.81 # User time : 32.382 s
% 263.97/34.81 # System time : 1.083 s
% 263.97/34.81 # Total time : 33.465 s
% 263.97/34.81 # Maximum resident set size: 1680 pages
% 263.97/34.81 % E---3.1 exiting
% 263.97/34.81 % E---3.1 exiting
%------------------------------------------------------------------------------