TSTP Solution File: SET646+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET646+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 12 unt; 0 def)
% Number of atoms : 236 ( 15 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 304 ( 117 ~; 119 |; 27 &)
% ( 7 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 98 ( 3 sgn; 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p5,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( X3 = singleton(X2)
<=> ! [X4] :
( ilf_type(X4,set_type)
=> ( member(X4,X3)
<=> X4 = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HPXXnexnJx/E---3.1_10292.p',p5) ).
fof(p25,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/tmp/tmp.HPXXnexnJx/E---3.1_10292.p',p25) ).
fof(p17,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.HPXXnexnJx/E---3.1_10292.p',p17) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( member(ordered_pair(X1,X2),cross_product(X3,X4))
<=> ( member(X1,X3)
& member(X2,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HPXXnexnJx/E---3.1_10292.p',p2) ).
fof(prove_relset_1_8,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( ( member(X3,X1)
& member(X4,X2) )
=> ilf_type(singleton(ordered_pair(X3,X4)),relation_type(X1,X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HPXXnexnJx/E---3.1_10292.p',prove_relset_1_8) ).
fof(p19,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.HPXXnexnJx/E---3.1_10292.p',p19) ).
fof(p18,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HPXXnexnJx/E---3.1_10292.p',p18) ).
fof(p12,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.HPXXnexnJx/E---3.1_10292.p',p12) ).
fof(p3,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.HPXXnexnJx/E---3.1_10292.p',p3) ).
fof(c_0_9,plain,
! [X18,X19,X20,X21] :
( ( ~ member(X21,X20)
| X21 = X19
| ~ ilf_type(X21,set_type)
| X20 != singleton(X19)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( X21 != X19
| member(X21,X20)
| ~ ilf_type(X21,set_type)
| X20 != singleton(X19)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( ilf_type(esk6_2(X19,X20),set_type)
| X20 = singleton(X19)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( ~ member(esk6_2(X19,X20),X20)
| esk6_2(X19,X20) != X19
| X20 = singleton(X19)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( member(esk6_2(X19,X20),X20)
| esk6_2(X19,X20) = X19
| X20 = singleton(X19)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) ) ),
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)],[p5])])])])])]) ).
fof(c_0_10,plain,
! [X10] : ilf_type(X10,set_type),
inference(variable_rename,[status(thm)],[p25]) ).
fof(c_0_11,plain,
! [X47,X48,X49] :
( ( ~ member(X47,power_set(X48))
| ~ ilf_type(X49,set_type)
| ~ member(X49,X47)
| member(X49,X48)
| ~ ilf_type(X48,set_type)
| ~ ilf_type(X47,set_type) )
& ( ilf_type(esk10_2(X47,X48),set_type)
| member(X47,power_set(X48))
| ~ ilf_type(X48,set_type)
| ~ ilf_type(X47,set_type) )
& ( member(esk10_2(X47,X48),X47)
| member(X47,power_set(X48))
| ~ ilf_type(X48,set_type)
| ~ ilf_type(X47,set_type) )
& ( ~ member(esk10_2(X47,X48),X48)
| member(X47,power_set(X48))
| ~ ilf_type(X48,set_type)
| ~ 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)],[p17])])])])]) ).
fof(c_0_12,plain,
! [X24,X25,X26,X27] :
( ( member(X24,X26)
| ~ member(ordered_pair(X24,X25),cross_product(X26,X27))
| ~ ilf_type(X27,set_type)
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type)
| ~ ilf_type(X24,set_type) )
& ( member(X25,X27)
| ~ member(ordered_pair(X24,X25),cross_product(X26,X27))
| ~ ilf_type(X27,set_type)
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type)
| ~ ilf_type(X24,set_type) )
& ( ~ member(X24,X26)
| ~ member(X25,X27)
| member(ordered_pair(X24,X25),cross_product(X26,X27))
| ~ ilf_type(X27,set_type)
| ~ 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)],[p2])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( ( member(X3,X1)
& member(X4,X2) )
=> ilf_type(singleton(ordered_pair(X3,X4)),relation_type(X1,X2)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_8]) ).
cnf(c_0_14,plain,
( X1 = X3
| ~ member(X1,X2)
| ~ ilf_type(X1,set_type)
| X2 != singleton(X3)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X4,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( member(esk10_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_11]) ).
cnf(c_0_17,plain,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( ilf_type(esk1_0,set_type)
& ilf_type(esk2_0,set_type)
& ilf_type(esk3_0,set_type)
& ilf_type(esk4_0,set_type)
& member(esk3_0,esk1_0)
& member(esk4_0,esk2_0)
& ~ ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),relation_type(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_19,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)],[p19]) ).
cnf(c_0_20,plain,
( member(X1,power_set(X2))
| ~ member(esk10_2(X1,X2),X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[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]),c_0_15])])]) ).
cnf(c_0_22,plain,
( member(esk10_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15])]) ).
cnf(c_0_23,plain,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_24,negated_conjecture,
member(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
inference(fof_simplification,[status(thm)],[p18]) ).
fof(c_0_26,plain,
! [X43,X44] :
( ( ~ ilf_type(X43,member_type(X44))
| member(X43,X44)
| empty(X44)
| ~ ilf_type(X44,set_type)
| ~ ilf_type(X43,set_type) )
& ( ~ member(X43,X44)
| ilf_type(X43,member_type(X44))
| empty(X44)
| ~ ilf_type(X44,set_type)
| ~ ilf_type(X43,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_27,plain,
( member(X1,power_set(X2))
| ~ member(esk10_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_15]),c_0_15])]) ).
cnf(c_0_28,plain,
( esk10_2(singleton(X1),X2) = X1
| member(singleton(X1),power_set(X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( member(ordered_pair(X1,esk4_0),cross_product(X2,esk2_0))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
member(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_31,plain,
! [X51] :
( ( ~ empty(power_set(X51))
| ~ ilf_type(X51,set_type) )
& ( ilf_type(power_set(X51),set_type)
| ~ ilf_type(X51,set_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
fof(c_0_32,plain,
! [X34,X35] :
( ( ~ ilf_type(X35,subset_type(X34))
| ilf_type(X35,member_type(power_set(X34)))
| ~ ilf_type(X35,set_type)
| ~ ilf_type(X34,set_type) )
& ( ~ ilf_type(X35,member_type(power_set(X34)))
| ilf_type(X35,subset_type(X34))
| ~ ilf_type(X35,set_type)
| ~ ilf_type(X34,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p12])])])]) ).
cnf(c_0_33,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_26]) ).
cnf(c_0_34,plain,
( member(singleton(X1),power_set(X2))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
member(ordered_pair(esk3_0,esk4_0),cross_product(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ empty(power_set(X1))
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_37,plain,
! [X11,X12,X13,X14] :
( ( ~ ilf_type(X13,subset_type(cross_product(X11,X12)))
| ilf_type(X13,relation_type(X11,X12))
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) )
& ( ~ ilf_type(X14,relation_type(X11,X12))
| ilf_type(X14,subset_type(cross_product(X11,X12)))
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,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_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_32]) ).
cnf(c_0_39,plain,
( empty(X1)
| ilf_type(X2,member_type(X1))
| ~ member(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_15]),c_0_15])]) ).
cnf(c_0_40,negated_conjecture,
member(singleton(ordered_pair(esk3_0,esk4_0)),power_set(cross_product(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_15])]) ).
cnf(c_0_42,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_37]) ).
cnf(c_0_43,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_44,negated_conjecture,
ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),member_type(power_set(cross_product(esk1_0,esk2_0)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
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_42,c_0_15]),c_0_15])]) ).
cnf(c_0_46,negated_conjecture,
ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),subset_type(cross_product(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
~ ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),relation_type(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SET646+3 : TPTP v8.1.2. Released v2.2.0.
% 0.04/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 17:27:40 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.HPXXnexnJx/E---3.1_10292.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_3 with pid 10389 completed with status 0
% 0.15/0.44 # Result found by new_bool_3
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 10394 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 26
% 0.15/0.45 # Removed by relevancy pruning/SinE : 7
% 0.15/0.45 # Initial clauses : 47
% 0.15/0.45 # Removed in clause preprocessing : 2
% 0.15/0.45 # Initial clauses in saturation : 45
% 0.15/0.45 # Processed clauses : 222
% 0.15/0.45 # ...of these trivial : 10
% 0.15/0.45 # ...subsumed : 22
% 0.15/0.45 # ...remaining for further processing : 190
% 0.15/0.45 # Other redundant clauses eliminated : 5
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 0
% 0.15/0.45 # Backward-rewritten : 4
% 0.15/0.45 # Generated clauses : 997
% 0.15/0.45 # ...of the previous two non-redundant : 891
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 1
% 0.15/0.45 # Paramodulations : 991
% 0.15/0.45 # Factorizations : 2
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 5
% 0.15/0.45 # Total rewrite steps : 201
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 153
% 0.15/0.45 # Positive orientable unit clauses : 58
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 2
% 0.15/0.45 # Non-unit-clauses : 93
% 0.15/0.45 # Current number of unprocessed clauses: 745
% 0.15/0.45 # ...number of literals in the above : 1794
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 35
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 1363
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 1193
% 0.15/0.45 # Non-unit clause-clause subsumptions : 23
% 0.15/0.45 # Unit Clause-clause subsumption calls : 13
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 44
% 0.15/0.45 # BW rewrite match successes : 4
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 19818
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.024 s
% 0.15/0.45 # System time : 0.001 s
% 0.15/0.45 # Total time : 0.025 s
% 0.15/0.45 # Maximum resident set size: 1860 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.025 s
% 0.15/0.45 # System time : 0.004 s
% 0.15/0.45 # Total time : 0.028 s
% 0.15/0.45 # Maximum resident set size: 1732 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------