TSTP Solution File: SET582+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET582+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:26 EDT 2023
% Result : Theorem 116.32s 16.43s
% Output : CNFRefutation 116.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 78 ( 26 unt; 0 def)
% Number of atoms : 197 ( 31 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 191 ( 72 ~; 87 |; 18 &)
% ( 11 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 159 ( 14 sgn; 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',difference_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',subset_defn) ).
fof(prove_th25,conjecture,
! [X1,X2,X3] :
( ! [X4] :
( ~ member(X4,X1)
<=> ( member(X4,X2)
<=> member(X4,X3) ) )
=> X1 = symmetric_difference(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',prove_th25) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',equal_defn) ).
fof(symmetric_difference_defn,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',symmetric_difference_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',union_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',equal_member_defn) ).
fof(commutativity_of_symmetric_difference,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = symmetric_difference(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ZAeDi7D4h0/E---3.1_12407.p',commutativity_of_symmetric_difference) ).
fof(c_0_8,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_9,plain,
! [X19,X20,X21] :
( ( member(X21,X19)
| ~ member(X21,difference(X19,X20)) )
& ( ~ member(X21,X20)
| ~ member(X21,difference(X19,X20)) )
& ( ~ member(X21,X19)
| member(X21,X20)
| member(X21,difference(X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X29,X30,X31,X32,X33] :
( ( ~ subset(X29,X30)
| ~ member(X31,X29)
| member(X31,X30) )
& ( member(esk6_2(X32,X33),X32)
| subset(X32,X33) )
& ( ~ member(esk6_2(X32,X33),X33)
| subset(X32,X33) ) ),
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_11,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( member(esk6_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
( ! [X4] :
( ~ member(X4,X1)
<=> ( member(X4,X2)
<=> member(X4,X3) ) )
=> X1 = symmetric_difference(X2,X3) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_th25])]) ).
fof(c_0_15,plain,
! [X37,X38] :
( ( subset(X37,X38)
| X37 != X38 )
& ( subset(X38,X37)
| X37 != X38 )
& ( ~ subset(X37,X38)
| ~ subset(X38,X37)
| X37 = X38 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_16,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk6_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( subset(difference(X1,X2),X3)
| member(esk6_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,negated_conjecture,
! [X8] :
( ( ~ member(X8,esk2_0)
| member(X8,esk3_0)
| member(X8,esk1_0) )
& ( ~ member(X8,esk3_0)
| member(X8,esk2_0)
| member(X8,esk1_0) )
& ( ~ member(X8,esk2_0)
| ~ member(X8,esk3_0)
| ~ member(X8,esk1_0) )
& ( member(X8,esk2_0)
| member(X8,esk3_0)
| ~ member(X8,esk1_0) )
& esk1_0 != symmetric_difference(esk2_0,esk3_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
subset(difference(X1,X1),X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( member(X1,esk3_0)
| member(X1,esk1_0)
| ~ member(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X9,X10] : symmetric_difference(X9,X10) = union(difference(X9,X10),difference(X10,X9)),
inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).
cnf(c_0_25,plain,
( X1 = difference(X2,X2)
| ~ subset(X1,difference(X2,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( difference(X1,X2) = X1
| ~ subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_27,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( subset(X1,esk3_0)
| member(esk6_2(X1,esk3_0),esk1_0)
| ~ member(esk6_2(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_29,plain,
( subset(difference(difference(X1,X2),X3),X4)
| member(esk6_2(difference(difference(X1,X2),X3),X4),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
fof(c_0_30,plain,
! [X16,X17,X18] :
( ( ~ member(X18,union(X16,X17))
| member(X18,X16)
| member(X18,X17) )
& ( ~ member(X18,X16)
| member(X18,union(X16,X17)) )
& ( ~ member(X18,X17)
| member(X18,union(X16,X17)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).
cnf(c_0_31,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
difference(X1,X1) = difference(X2,X2),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_33,plain,
difference(difference(X1,X1),X2) = difference(X1,X1),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_34,plain,
( member(X1,X2)
| ~ member(X1,difference(X3,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
( subset(difference(difference(esk2_0,X1),X2),esk3_0)
| member(esk6_2(difference(difference(esk2_0,X1),X2),esk3_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
union(difference(X1,X1),difference(X2,X2)) = symmetric_difference(X2,X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
~ member(X1,difference(X2,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
subset(difference(difference(esk2_0,X1),esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( member(X1,esk2_0)
| member(X1,esk1_0)
| ~ member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_41,plain,
~ member(X1,symmetric_difference(X2,X2)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,difference(difference(esk2_0,X2),esk1_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( subset(difference(esk3_0,X1),X2)
| member(esk6_2(difference(esk3_0,X1),X2),esk2_0)
| member(esk6_2(difference(esk3_0,X1),X2),esk1_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_44,plain,
subset(symmetric_difference(X1,X1),X2),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_45,plain,
( subset(difference(difference(X1,X2),X3),X4)
| ~ member(esk6_2(difference(difference(X1,X2),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_46,negated_conjecture,
( subset(difference(difference(esk2_0,X1),esk1_0),X2)
| member(esk6_2(difference(difference(esk2_0,X1),esk1_0),X2),esk3_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_12]) ).
cnf(c_0_47,negated_conjecture,
( subset(difference(esk3_0,esk2_0),X1)
| member(esk6_2(difference(esk3_0,esk2_0),X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
fof(c_0_48,plain,
! [X22,X23,X24,X25,X26,X27] :
( ( ~ member(X24,X22)
| member(X24,X23)
| X22 != X23 )
& ( ~ member(X25,X23)
| member(X25,X22)
| X22 != X23 )
& ( ~ member(esk5_2(X26,X27),X26)
| ~ member(esk5_2(X26,X27),X27)
| X26 = X27 )
& ( member(esk5_2(X26,X27),X26)
| member(esk5_2(X26,X27),X27)
| X26 = X27 ) ),
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)],[equal_member_defn])])])])])]) ).
cnf(c_0_49,plain,
( X1 = symmetric_difference(X2,X2)
| ~ subset(X1,symmetric_difference(X2,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
subset(difference(difference(esk2_0,esk3_0),esk1_0),X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
subset(difference(esk3_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_52,plain,
( member(X1,difference(X2,X3))
| member(X1,difference(X3,X2))
| ~ member(X1,symmetric_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_53,plain,
( member(esk5_2(X1,X2),X1)
| member(esk5_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_54,plain,
! [X11,X12] : symmetric_difference(X11,X12) = symmetric_difference(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_of_symmetric_difference]) ).
cnf(c_0_55,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_56,negated_conjecture,
difference(difference(esk2_0,esk3_0),esk1_0) = symmetric_difference(X1,X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,difference(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_51]) ).
cnf(c_0_58,plain,
( symmetric_difference(X1,X2) = X3
| member(esk5_2(symmetric_difference(X1,X2),X3),difference(X2,X1))
| member(esk5_2(symmetric_difference(X1,X2),X3),difference(X1,X2))
| member(esk5_2(symmetric_difference(X1,X2),X3),X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
symmetric_difference(X1,X2) = symmetric_difference(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,difference(esk2_0,esk3_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_41]) ).
cnf(c_0_61,negated_conjecture,
( symmetric_difference(esk2_0,esk3_0) = X1
| member(esk5_2(symmetric_difference(esk2_0,esk3_0),X1),esk1_0)
| member(esk5_2(symmetric_difference(esk2_0,esk3_0),X1),X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_60]) ).
cnf(c_0_62,negated_conjecture,
esk1_0 != symmetric_difference(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_63,plain,
( X1 = X2
| ~ member(esk5_2(X1,X2),X1)
| ~ member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_64,negated_conjecture,
member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_61]),c_0_62]) ).
cnf(c_0_65,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_66,negated_conjecture,
~ member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),symmetric_difference(esk2_0,esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_62]) ).
cnf(c_0_67,plain,
( member(X1,symmetric_difference(X2,X3))
| ~ member(X1,difference(X3,X2)) ),
inference(spm,[status(thm)],[c_0_65,c_0_31]) ).
cnf(c_0_68,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_69,negated_conjecture,
~ member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),difference(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
( member(X1,symmetric_difference(X2,X3))
| ~ member(X1,difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_68,c_0_31]) ).
cnf(c_0_71,negated_conjecture,
( member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),esk2_0)
| ~ member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_69,c_0_55]) ).
cnf(c_0_72,negated_conjecture,
( member(X1,esk2_0)
| member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_73,negated_conjecture,
~ member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),difference(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_64])]) ).
cnf(c_0_75,negated_conjecture,
( ~ member(X1,esk2_0)
| ~ member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_76,negated_conjecture,
member(esk5_2(symmetric_difference(esk2_0,esk3_0),esk1_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_55]),c_0_74])]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_64]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET582+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 17:50:46 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.ZAeDi7D4h0/E---3.1_12407.p
% 116.32/16.43 # Version: 3.1pre001
% 116.32/16.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 116.32/16.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 116.32/16.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 116.32/16.43 # Starting new_bool_3 with 300s (1) cores
% 116.32/16.43 # Starting new_bool_1 with 300s (1) cores
% 116.32/16.43 # Starting sh5l with 300s (1) cores
% 116.32/16.43 # sh5l with pid 12488 completed with status 0
% 116.32/16.43 # Result found by sh5l
% 116.32/16.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 116.32/16.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 116.32/16.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 116.32/16.43 # Starting new_bool_3 with 300s (1) cores
% 116.32/16.43 # Starting new_bool_1 with 300s (1) cores
% 116.32/16.43 # Starting sh5l with 300s (1) cores
% 116.32/16.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 116.32/16.43 # Search class: FGHSM-FFMF22-SFFFFFNN
% 116.32/16.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 116.32/16.43 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 116.32/16.43 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 12496 completed with status 0
% 116.32/16.43 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 116.32/16.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 116.32/16.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 116.32/16.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 116.32/16.43 # Starting new_bool_3 with 300s (1) cores
% 116.32/16.43 # Starting new_bool_1 with 300s (1) cores
% 116.32/16.43 # Starting sh5l with 300s (1) cores
% 116.32/16.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 116.32/16.43 # Search class: FGHSM-FFMF22-SFFFFFNN
% 116.32/16.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 116.32/16.43 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 116.32/16.43 # Preprocessing time : 0.001 s
% 116.32/16.43 # Presaturation interreduction done
% 116.32/16.43
% 116.32/16.43 # Proof found!
% 116.32/16.43 # SZS status Theorem
% 116.32/16.43 # SZS output start CNFRefutation
% See solution above
% 116.32/16.43 # Parsed axioms : 11
% 116.32/16.43 # Removed by relevancy pruning/SinE : 0
% 116.32/16.43 # Initial clauses : 27
% 116.32/16.43 # Removed in clause preprocessing : 2
% 116.32/16.43 # Initial clauses in saturation : 25
% 116.32/16.43 # Processed clauses : 51524
% 116.32/16.43 # ...of these trivial : 5312
% 116.32/16.43 # ...subsumed : 42940
% 116.32/16.43 # ...remaining for further processing : 3272
% 116.32/16.43 # Other redundant clauses eliminated : 2
% 116.32/16.43 # Clauses deleted for lack of memory : 0
% 116.32/16.43 # Backward-subsumed : 27
% 116.32/16.43 # Backward-rewritten : 313
% 116.32/16.43 # Generated clauses : 1151743
% 116.32/16.43 # ...of the previous two non-redundant : 898421
% 116.32/16.43 # ...aggressively subsumed : 0
% 116.32/16.43 # Contextual simplify-reflections : 96
% 116.32/16.43 # Paramodulations : 1148857
% 116.32/16.43 # Factorizations : 2884
% 116.32/16.43 # NegExts : 0
% 116.32/16.43 # Equation resolutions : 2
% 116.32/16.43 # Total rewrite steps : 1232737
% 116.32/16.43 # Propositional unsat checks : 0
% 116.32/16.43 # Propositional check models : 0
% 116.32/16.43 # Propositional check unsatisfiable : 0
% 116.32/16.43 # Propositional clauses : 0
% 116.32/16.43 # Propositional clauses after purity: 0
% 116.32/16.43 # Propositional unsat core size : 0
% 116.32/16.43 # Propositional preprocessing time : 0.000
% 116.32/16.43 # Propositional encoding time : 0.000
% 116.32/16.43 # Propositional solver time : 0.000
% 116.32/16.43 # Success case prop preproc time : 0.000
% 116.32/16.43 # Success case prop encoding time : 0.000
% 116.32/16.43 # Success case prop solver time : 0.000
% 116.32/16.43 # Current number of processed clauses : 2907
% 116.32/16.43 # Positive orientable unit clauses : 913
% 116.32/16.43 # Positive unorientable unit clauses: 83
% 116.32/16.43 # Negative unit clauses : 87
% 116.32/16.43 # Non-unit-clauses : 1824
% 116.32/16.43 # Current number of unprocessed clauses: 842891
% 116.32/16.43 # ...number of literals in the above : 2621221
% 116.32/16.43 # Current number of archived formulas : 0
% 116.32/16.43 # Current number of archived clauses : 363
% 116.32/16.43 # Clause-clause subsumption calls (NU) : 505523
% 116.32/16.43 # Rec. Clause-clause subsumption calls : 134664
% 116.32/16.43 # Non-unit clause-clause subsumptions : 11194
% 116.32/16.43 # Unit Clause-clause subsumption calls : 119724
% 116.32/16.43 # Rewrite failures with RHS unbound : 5245
% 116.32/16.43 # BW rewrite match attempts : 46364
% 116.32/16.43 # BW rewrite match successes : 828
% 116.32/16.43 # Condensation attempts : 0
% 116.32/16.43 # Condensation successes : 0
% 116.32/16.43 # Termbank termtop insertions : 21640622
% 116.32/16.43
% 116.32/16.43 # -------------------------------------------------
% 116.32/16.43 # User time : 13.634 s
% 116.32/16.43 # System time : 0.557 s
% 116.32/16.43 # Total time : 14.191 s
% 116.32/16.43 # Maximum resident set size: 1720 pages
% 116.32/16.43
% 116.32/16.43 # -------------------------------------------------
% 116.32/16.43 # User time : 13.634 s
% 116.32/16.43 # System time : 0.560 s
% 116.32/16.43 # Total time : 14.194 s
% 116.32/16.43 # Maximum resident set size: 1680 pages
% 116.32/16.43 % E---3.1 exiting
% 116.32/16.43 % E---3.1 exiting
%------------------------------------------------------------------------------