TSTP Solution File: SET648+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET648+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:07 EDT 2023
% Result : Theorem 4.86s 1.02s
% Output : CNFRefutation 4.86s
% 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.E5NtCnooZi/E---3.1_10089.p',p1) ).
fof(p26,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/tmp/tmp.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.p',p2) ).
fof(prove_relset_1_10,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,binary_relation_type)
=> ( subset(range_of(X2),X1)
=> ilf_type(X2,relation_type(domain_of(X2),X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5NtCnooZi/E---3.1_10089.p',prove_relset_1_10) ).
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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.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.E5NtCnooZi/E---3.1_10089.p',p20) ).
fof(c_0_11,plain,
! [X21,X22,X23] :
( ~ ilf_type(X21,set_type)
| ~ ilf_type(X22,set_type)
| ~ ilf_type(X23,set_type)
| ~ subset(X21,X22)
| ~ subset(X22,X23)
| subset(X21,X23) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
fof(c_0_12,plain,
! [X7] : ilf_type(X7,set_type),
inference(variable_rename,[status(thm)],[p26]) ).
fof(c_0_13,plain,
! [X24,X25,X26] :
( ( subset(cross_product(X24,X26),cross_product(X25,X26))
| ~ subset(X24,X25)
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type)
| ~ ilf_type(X24,set_type) )
& ( subset(cross_product(X26,X24),cross_product(X26,X25))
| ~ subset(X24,X25)
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type)
| ~ ilf_type(X24,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(X1,X3))
| ~ subset(X2,X3)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,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(X1,X3))
| ~ subset(X2,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,
! [X15] :
( ~ ilf_type(X15,binary_relation_type)
| subset(X15,cross_product(domain_of(X15),range_of(X15))) ),
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(range_of(X2),X1)
=> ilf_type(X2,relation_type(domain_of(X2),X1)) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_10]) ).
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,
! [X47,X48] :
( ( ~ empty(X47)
| ~ ilf_type(X48,set_type)
| ~ member(X48,X47)
| ~ ilf_type(X47,set_type) )
& ( ilf_type(esk9_1(X47),set_type)
| empty(X47)
| ~ ilf_type(X47,set_type) )
& ( member(esk9_1(X47),X47)
| empty(X47)
| ~ ilf_type(X47,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,
! [X27,X28,X29] :
( ( ~ subset(X27,X28)
| ~ ilf_type(X29,set_type)
| ~ member(X29,X27)
| member(X29,X28)
| ~ ilf_type(X28,set_type)
| ~ ilf_type(X27,set_type) )
& ( ilf_type(esk5_2(X27,X28),set_type)
| subset(X27,X28)
| ~ ilf_type(X28,set_type)
| ~ ilf_type(X27,set_type) )
& ( member(esk5_2(X27,X28),X27)
| subset(X27,X28)
| ~ ilf_type(X28,set_type)
| ~ ilf_type(X27,set_type) )
& ( ~ member(esk5_2(X27,X28),X28)
| subset(X27,X28)
| ~ ilf_type(X28,set_type)
| ~ ilf_type(X27,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(X2,X4))
| ~ subset(X4,X3) ),
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(range_of(esk2_0),esk1_0)
& ~ ilf_type(esk2_0,relation_type(domain_of(esk2_0),esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_28,plain,
! [X8,X9,X10,X11] :
( ( ~ ilf_type(X10,subset_type(cross_product(X8,X9)))
| ilf_type(X10,relation_type(X8,X9))
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X8,set_type) )
& ( ~ ilf_type(X11,relation_type(X8,X9))
| ilf_type(X11,subset_type(cross_product(X8,X9)))
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X8,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,
! [X38,X39] :
( ( ~ ilf_type(X39,subset_type(X38))
| ilf_type(X39,member_type(power_set(X38)))
| ~ ilf_type(X39,set_type)
| ~ ilf_type(X38,set_type) )
& ( ~ ilf_type(X39,member_type(power_set(X38)))
| ilf_type(X39,subset_type(X38))
| ~ ilf_type(X39,set_type)
| ~ ilf_type(X38,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,
! [X59,X60] :
( ( ~ ilf_type(X59,member_type(X60))
| member(X59,X60)
| empty(X60)
| ~ ilf_type(X60,set_type)
| ~ ilf_type(X59,set_type) )
& ( ~ member(X59,X60)
| ilf_type(X59,member_type(X60))
| empty(X60)
| ~ ilf_type(X60,set_type)
| ~ ilf_type(X59,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,
! [X63,X64,X65] :
( ( ~ member(X63,power_set(X64))
| ~ ilf_type(X65,set_type)
| ~ member(X65,X63)
| member(X65,X64)
| ~ ilf_type(X64,set_type)
| ~ ilf_type(X63,set_type) )
& ( ilf_type(esk14_2(X63,X64),set_type)
| member(X63,power_set(X64))
| ~ ilf_type(X64,set_type)
| ~ ilf_type(X63,set_type) )
& ( member(esk14_2(X63,X64),X63)
| member(X63,power_set(X64))
| ~ ilf_type(X64,set_type)
| ~ ilf_type(X63,set_type) )
& ( ~ member(esk14_2(X63,X64),X64)
| member(X63,power_set(X64))
| ~ ilf_type(X64,set_type)
| ~ ilf_type(X63,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(domain_of(X1),X2))
| ~ subset(range_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(range_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(esk14_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(domain_of(esk2_0),esk1_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(domain_of(esk2_0),esk1_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(esk14_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(domain_of(esk2_0),esk1_0))
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( member(esk14_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(domain_of(esk2_0),esk1_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(domain_of(esk2_0),esk1_0)))
| ~ member(esk14_2(X1,cross_product(domain_of(esk2_0),esk1_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( member(esk14_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(domain_of(esk2_0),esk1_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.09/0.11 % Problem : SET648+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n007.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 17:31:54 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.E5NtCnooZi/E---3.1_10089.p
% 4.86/1.02 # Version: 3.1pre001
% 4.86/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.86/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.86/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.86/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.86/1.02 # Starting new_bool_1 with 300s (1) cores
% 4.86/1.02 # Starting sh5l with 300s (1) cores
% 4.86/1.02 # new_bool_3 with pid 10169 completed with status 0
% 4.86/1.02 # Result found by new_bool_3
% 4.86/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.86/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.86/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.86/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.86/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.86/1.02 # Search class: FGHSF-FFMS21-SFFFFFNN
% 4.86/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.86/1.02 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 4.86/1.02 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 10172 completed with status 0
% 4.86/1.02 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 4.86/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.86/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.86/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.86/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.86/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.86/1.02 # Search class: FGHSF-FFMS21-SFFFFFNN
% 4.86/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.86/1.02 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 4.86/1.02 # Preprocessing time : 0.002 s
% 4.86/1.02 # Presaturation interreduction done
% 4.86/1.02
% 4.86/1.02 # Proof found!
% 4.86/1.02 # SZS status Theorem
% 4.86/1.02 # SZS output start CNFRefutation
% See solution above
% 4.86/1.03 # Parsed axioms : 27
% 4.86/1.03 # Removed by relevancy pruning/SinE : 0
% 4.86/1.03 # Initial clauses : 54
% 4.86/1.03 # Removed in clause preprocessing : 1
% 4.86/1.03 # Initial clauses in saturation : 53
% 4.86/1.03 # Processed clauses : 2430
% 4.86/1.03 # ...of these trivial : 20
% 4.86/1.03 # ...subsumed : 821
% 4.86/1.03 # ...remaining for further processing : 1589
% 4.86/1.03 # Other redundant clauses eliminated : 1
% 4.86/1.03 # Clauses deleted for lack of memory : 0
% 4.86/1.03 # Backward-subsumed : 149
% 4.86/1.03 # Backward-rewritten : 11
% 4.86/1.03 # Generated clauses : 25490
% 4.86/1.03 # ...of the previous two non-redundant : 25071
% 4.86/1.03 # ...aggressively subsumed : 0
% 4.86/1.03 # Contextual simplify-reflections : 50
% 4.86/1.03 # Paramodulations : 25489
% 4.86/1.03 # Factorizations : 0
% 4.86/1.03 # NegExts : 0
% 4.86/1.03 # Equation resolutions : 1
% 4.86/1.03 # Total rewrite steps : 571
% 4.86/1.03 # Propositional unsat checks : 0
% 4.86/1.03 # Propositional check models : 0
% 4.86/1.03 # Propositional check unsatisfiable : 0
% 4.86/1.03 # Propositional clauses : 0
% 4.86/1.03 # Propositional clauses after purity: 0
% 4.86/1.03 # Propositional unsat core size : 0
% 4.86/1.03 # Propositional preprocessing time : 0.000
% 4.86/1.03 # Propositional encoding time : 0.000
% 4.86/1.03 # Propositional solver time : 0.000
% 4.86/1.03 # Success case prop preproc time : 0.000
% 4.86/1.03 # Success case prop encoding time : 0.000
% 4.86/1.03 # Success case prop solver time : 0.000
% 4.86/1.03 # Current number of processed clauses : 1390
% 4.86/1.03 # Positive orientable unit clauses : 83
% 4.86/1.03 # Positive unorientable unit clauses: 0
% 4.86/1.03 # Negative unit clauses : 4
% 4.86/1.03 # Non-unit-clauses : 1303
% 4.86/1.03 # Current number of unprocessed clauses: 22692
% 4.86/1.03 # ...number of literals in the above : 84283
% 4.86/1.03 # Current number of archived formulas : 0
% 4.86/1.03 # Current number of archived clauses : 199
% 4.86/1.03 # Clause-clause subsumption calls (NU) : 314608
% 4.86/1.03 # Rec. Clause-clause subsumption calls : 204846
% 4.86/1.03 # Non-unit clause-clause subsumptions : 952
% 4.86/1.03 # Unit Clause-clause subsumption calls : 2629
% 4.86/1.03 # Rewrite failures with RHS unbound : 0
% 4.86/1.03 # BW rewrite match attempts : 342
% 4.86/1.03 # BW rewrite match successes : 11
% 4.86/1.03 # Condensation attempts : 0
% 4.86/1.03 # Condensation successes : 0
% 4.86/1.03 # Termbank termtop insertions : 525802
% 4.86/1.03
% 4.86/1.03 # -------------------------------------------------
% 4.86/1.03 # User time : 0.561 s
% 4.86/1.03 # System time : 0.015 s
% 4.86/1.03 # Total time : 0.577 s
% 4.86/1.03 # Maximum resident set size: 1860 pages
% 4.86/1.03
% 4.86/1.03 # -------------------------------------------------
% 4.86/1.03 # User time : 0.562 s
% 4.86/1.03 # System time : 0.017 s
% 4.86/1.03 # Total time : 0.580 s
% 4.86/1.03 # Maximum resident set size: 1732 pages
% 4.86/1.03 % E---3.1 exiting
% 4.86/1.03 % E---3.1 exiting
%------------------------------------------------------------------------------