TSTP Solution File: SET647+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET647+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:20:06 EDT 2023
% Result : Theorem 4.21s 1.00s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 10 unt; 0 def)
% Number of atoms : 242 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 307 ( 122 ~; 121 |; 20 &)
% ( 7 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-2 aty)
% Number of variables : 112 ( 2 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p1) ).
fof(p26,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p26) ).
fof(p3,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,X2)
=> ( subset(cross_product(X1,X3),cross_product(X2,X3))
& subset(cross_product(X3,X1),cross_product(X3,X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p3) ).
fof(p24,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p24) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,binary_relation_type)
=> subset(X1,cross_product(domain_of(X1),range_of(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p2) ).
fof(prove_relset_1_9,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,binary_relation_type)
=> ( subset(domain_of(X2),X1)
=> ilf_type(X2,relation_type(X1,range_of(X2))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',prove_relset_1_9) ).
fof(p22,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ~ empty(X2)
& ilf_type(X2,set_type) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p22) ).
fof(p12,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p12) ).
fof(p4,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) )
& ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p4) ).
fof(p15,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p15) ).
fof(p20,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1DeXCEKllu/E---3.1_18037.p',p20) ).
fof(c_0_11,plain,
! [X7,X8,X9] :
( ~ ilf_type(X7,set_type)
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X9,set_type)
| ~ subset(X7,X8)
| ~ subset(X8,X9)
| subset(X7,X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
fof(c_0_12,plain,
! [X16] : ilf_type(X16,set_type),
inference(variable_rename,[status(thm)],[p26]) ).
fof(c_0_13,plain,
! [X30,X31,X32] :
( ( subset(cross_product(X30,X32),cross_product(X31,X32))
| ~ subset(X30,X31)
| ~ ilf_type(X32,set_type)
| ~ ilf_type(X31,set_type)
| ~ ilf_type(X30,set_type) )
& ( subset(cross_product(X32,X30),cross_product(X32,X31))
| ~ subset(X30,X31)
| ~ ilf_type(X32,set_type)
| ~ ilf_type(X31,set_type)
| ~ ilf_type(X30,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p3])])])]) ).
cnf(c_0_14,plain,
( subset(X1,X3)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( subset(cross_product(X1,X2),cross_product(X3,X2))
| ~ subset(X1,X3)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[p24]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_19,plain,
( subset(cross_product(X1,X2),cross_product(X3,X2))
| ~ subset(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15]),c_0_15])]) ).
fof(c_0_20,plain,
! [X24] :
( ~ ilf_type(X24,binary_relation_type)
| subset(X24,cross_product(domain_of(X24),range_of(X24))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,binary_relation_type)
=> ( subset(domain_of(X2),X1)
=> ilf_type(X2,relation_type(X1,range_of(X2))) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_9]) ).
fof(c_0_22,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ~ empty(X2)
& ilf_type(X2,set_type) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[p22]) ).
fof(c_0_23,plain,
! [X41,X42] :
( ( ~ empty(X41)
| ~ ilf_type(X42,set_type)
| ~ member(X42,X41)
| ~ ilf_type(X41,set_type) )
& ( ilf_type(esk8_1(X41),set_type)
| empty(X41)
| ~ ilf_type(X41,set_type) )
& ( member(esk8_1(X41),X41)
| empty(X41)
| ~ ilf_type(X41,set_type) ) ),
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_17])])])])]) ).
fof(c_0_24,plain,
! [X11,X12,X13] :
( ( ~ subset(X11,X12)
| ~ ilf_type(X13,set_type)
| ~ member(X13,X11)
| member(X13,X12)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) )
& ( ilf_type(esk4_2(X11,X12),set_type)
| subset(X11,X12)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) )
& ( member(esk4_2(X11,X12),X11)
| subset(X11,X12)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) )
& ( ~ member(esk4_2(X11,X12),X12)
| subset(X11,X12)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p12])])])])]) ).
cnf(c_0_25,plain,
( subset(X1,cross_product(X2,X3))
| ~ subset(X1,cross_product(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( subset(X1,cross_product(domain_of(X1),range_of(X1)))
| ~ ilf_type(X1,binary_relation_type) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,negated_conjecture,
( ilf_type(esk1_0,set_type)
& ilf_type(esk2_0,binary_relation_type)
& subset(domain_of(esk2_0),esk1_0)
& ~ ilf_type(esk2_0,relation_type(esk1_0,range_of(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_28,plain,
! [X17,X18,X19,X20] :
( ( ~ ilf_type(X19,subset_type(cross_product(X17,X18)))
| ilf_type(X19,relation_type(X17,X18))
| ~ ilf_type(X18,set_type)
| ~ ilf_type(X17,set_type) )
& ( ~ ilf_type(X20,relation_type(X17,X18))
| ilf_type(X20,subset_type(cross_product(X17,X18)))
| ~ ilf_type(X18,set_type)
| ~ ilf_type(X17,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p4])])])]) ).
fof(c_0_29,plain,
! [X57,X58] :
( ( ~ ilf_type(X58,subset_type(X57))
| ilf_type(X58,member_type(power_set(X57)))
| ~ ilf_type(X58,set_type)
| ~ ilf_type(X57,set_type) )
& ( ~ ilf_type(X58,member_type(power_set(X57)))
| ilf_type(X58,subset_type(X57))
| ~ ilf_type(X58,set_type)
| ~ ilf_type(X57,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p15])])])]) ).
fof(c_0_30,plain,
! [X55,X56] :
( ( ~ ilf_type(X55,member_type(X56))
| member(X55,X56)
| empty(X56)
| ~ ilf_type(X56,set_type)
| ~ ilf_type(X55,set_type) )
& ( ~ member(X55,X56)
| ilf_type(X55,member_type(X56))
| empty(X56)
| ~ ilf_type(X56,set_type)
| ~ ilf_type(X55,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| ~ ilf_type(X2,set_type)
| ~ member(X2,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
! [X51,X52,X53] :
( ( ~ member(X51,power_set(X52))
| ~ ilf_type(X53,set_type)
| ~ member(X53,X51)
| member(X53,X52)
| ~ ilf_type(X52,set_type)
| ~ ilf_type(X51,set_type) )
& ( ilf_type(esk12_2(X51,X52),set_type)
| member(X51,power_set(X52))
| ~ ilf_type(X52,set_type)
| ~ ilf_type(X51,set_type) )
& ( member(esk12_2(X51,X52),X51)
| member(X51,power_set(X52))
| ~ ilf_type(X52,set_type)
| ~ ilf_type(X51,set_type) )
& ( ~ member(esk12_2(X51,X52),X52)
| member(X51,power_set(X52))
| ~ ilf_type(X52,set_type)
| ~ ilf_type(X51,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p20])])])])]) ).
cnf(c_0_33,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ ilf_type(X3,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( subset(X1,cross_product(X2,range_of(X1)))
| ~ subset(domain_of(X1),X2)
| ~ ilf_type(X1,binary_relation_type) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
subset(domain_of(esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
ilf_type(esk2_0,binary_relation_type),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ilf_type(X1,member_type(X2))
| empty(X2)
| ~ member(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_15]),c_0_15])]) ).
cnf(c_0_41,plain,
( member(X1,power_set(X2))
| ~ member(esk12_2(X1,X2),X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_43,negated_conjecture,
subset(esk2_0,cross_product(esk1_0,range_of(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_44,negated_conjecture,
~ ilf_type(esk2_0,relation_type(esk1_0,range_of(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_45,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_15]),c_0_15])]) ).
cnf(c_0_46,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_15]),c_0_15])]) ).
cnf(c_0_47,plain,
( ilf_type(X1,member_type(X2))
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_15]),c_0_15])]),c_0_40]) ).
cnf(c_0_48,plain,
( member(X1,power_set(X2))
| ~ member(esk12_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_15]),c_0_15])]) ).
cnf(c_0_49,negated_conjecture,
( member(X1,cross_product(esk1_0,range_of(esk2_0)))
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( member(esk12_2(X1,X2),X1)
| member(X1,power_set(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_51,negated_conjecture,
~ ilf_type(esk2_0,subset_type(cross_product(esk1_0,range_of(esk2_0)))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( ilf_type(X1,subset_type(X2))
| ~ member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( member(X1,power_set(cross_product(esk1_0,range_of(esk2_0))))
| ~ member(esk12_2(X1,cross_product(esk1_0,range_of(esk2_0))),esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( member(esk12_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_15]),c_0_15])]) ).
cnf(c_0_55,negated_conjecture,
~ member(esk2_0,power_set(cross_product(esk1_0,range_of(esk2_0)))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : SET647+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.14 % Command : run_E %s %d THM
% 0.10/0.33 % Computer : n026.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 16:57:14 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.1DeXCEKllu/E---3.1_18037.p
% 4.21/1.00 # Version: 3.1pre001
% 4.21/1.00 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/1.00 # Starting new_bool_3 with 300s (1) cores
% 4.21/1.00 # Starting new_bool_1 with 300s (1) cores
% 4.21/1.00 # Starting sh5l with 300s (1) cores
% 4.21/1.00 # sh5l with pid 18153 completed with status 0
% 4.21/1.00 # Result found by sh5l
% 4.21/1.00 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/1.00 # Starting new_bool_3 with 300s (1) cores
% 4.21/1.00 # Starting new_bool_1 with 300s (1) cores
% 4.21/1.00 # Starting sh5l with 300s (1) cores
% 4.21/1.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.21/1.00 # Search class: FGHSF-FFMS21-SFFFFFNN
% 4.21/1.00 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.21/1.00 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 163s (1) cores
% 4.21/1.00 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 18161 completed with status 0
% 4.21/1.00 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 4.21/1.00 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/1.00 # Starting new_bool_3 with 300s (1) cores
% 4.21/1.00 # Starting new_bool_1 with 300s (1) cores
% 4.21/1.00 # Starting sh5l with 300s (1) cores
% 4.21/1.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.21/1.00 # Search class: FGHSF-FFMS21-SFFFFFNN
% 4.21/1.00 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 4.21/1.00 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 163s (1) cores
% 4.21/1.00 # Preprocessing time : 0.002 s
% 4.21/1.00 # Presaturation interreduction done
% 4.21/1.00
% 4.21/1.00 # Proof found!
% 4.21/1.00 # SZS status Theorem
% 4.21/1.00 # SZS output start CNFRefutation
% See solution above
% 4.21/1.00 # Parsed axioms : 27
% 4.21/1.00 # Removed by relevancy pruning/SinE : 0
% 4.21/1.00 # Initial clauses : 54
% 4.21/1.00 # Removed in clause preprocessing : 1
% 4.21/1.00 # Initial clauses in saturation : 53
% 4.21/1.00 # Processed clauses : 2448
% 4.21/1.00 # ...of these trivial : 17
% 4.21/1.00 # ...subsumed : 825
% 4.21/1.00 # ...remaining for further processing : 1606
% 4.21/1.00 # Other redundant clauses eliminated : 1
% 4.21/1.00 # Clauses deleted for lack of memory : 0
% 4.21/1.00 # Backward-subsumed : 149
% 4.21/1.00 # Backward-rewritten : 12
% 4.21/1.00 # Generated clauses : 25838
% 4.21/1.00 # ...of the previous two non-redundant : 25405
% 4.21/1.00 # ...aggressively subsumed : 0
% 4.21/1.00 # Contextual simplify-reflections : 50
% 4.21/1.00 # Paramodulations : 25837
% 4.21/1.00 # Factorizations : 0
% 4.21/1.00 # NegExts : 0
% 4.21/1.00 # Equation resolutions : 1
% 4.21/1.00 # Total rewrite steps : 575
% 4.21/1.00 # Propositional unsat checks : 0
% 4.21/1.00 # Propositional check models : 0
% 4.21/1.00 # Propositional check unsatisfiable : 0
% 4.21/1.00 # Propositional clauses : 0
% 4.21/1.00 # Propositional clauses after purity: 0
% 4.21/1.00 # Propositional unsat core size : 0
% 4.21/1.00 # Propositional preprocessing time : 0.000
% 4.21/1.00 # Propositional encoding time : 0.000
% 4.21/1.00 # Propositional solver time : 0.000
% 4.21/1.00 # Success case prop preproc time : 0.000
% 4.21/1.00 # Success case prop encoding time : 0.000
% 4.21/1.00 # Success case prop solver time : 0.000
% 4.21/1.00 # Current number of processed clauses : 1406
% 4.21/1.00 # Positive orientable unit clauses : 83
% 4.21/1.00 # Positive unorientable unit clauses: 0
% 4.21/1.00 # Negative unit clauses : 4
% 4.21/1.00 # Non-unit-clauses : 1319
% 4.21/1.00 # Current number of unprocessed clauses: 23008
% 4.21/1.00 # ...number of literals in the above : 85857
% 4.21/1.00 # Current number of archived formulas : 0
% 4.21/1.00 # Current number of archived clauses : 200
% 4.21/1.00 # Clause-clause subsumption calls (NU) : 306694
% 4.21/1.00 # Rec. Clause-clause subsumption calls : 212519
% 4.21/1.00 # Non-unit clause-clause subsumptions : 957
% 4.21/1.00 # Unit Clause-clause subsumption calls : 2906
% 4.21/1.00 # Rewrite failures with RHS unbound : 0
% 4.21/1.00 # BW rewrite match attempts : 345
% 4.21/1.00 # BW rewrite match successes : 12
% 4.21/1.00 # Condensation attempts : 0
% 4.21/1.00 # Condensation successes : 0
% 4.21/1.00 # Termbank termtop insertions : 532001
% 4.21/1.00
% 4.21/1.00 # -------------------------------------------------
% 4.21/1.00 # User time : 0.525 s
% 4.21/1.00 # System time : 0.012 s
% 4.21/1.00 # Total time : 0.537 s
% 4.21/1.00 # Maximum resident set size: 1860 pages
% 4.21/1.00
% 4.21/1.00 # -------------------------------------------------
% 4.21/1.00 # User time : 0.526 s
% 4.21/1.00 # System time : 0.014 s
% 4.21/1.00 # Total time : 0.540 s
% 4.21/1.00 # Maximum resident set size: 1728 pages
% 4.21/1.00 % E---3.1 exiting
% 4.21/1.00 % E---3.1 exiting
%------------------------------------------------------------------------------