TSTP Solution File: SET611+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET611+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:19:34 EDT 2024
% Result : Theorem 1.33s 0.65s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 78 ( 20 unt; 0 def)
% Number of atoms : 181 ( 37 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 171 ( 68 ~; 76 |; 15 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 137 ( 11 sgn 50 !; 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.pfyJyqImnv/E---3.1_16567.p',difference_defn) ).
fof(prove_th84,conjecture,
! [X1,X2] :
( intersection(X1,X2) = empty_set
<=> difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',prove_th84) ).
fof(empty_defn,axiom,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',empty_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',intersection_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',empty_set_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',commutativity_of_intersection) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',subset_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',equal_defn) ).
fof(member_equal,axiom,
! [X1,X2] :
( ! [X3] :
( member(X3,X1)
<=> member(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.pfyJyqImnv/E---3.1_16567.p',member_equal) ).
fof(c_0_9,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_10,negated_conjecture,
~ ! [X1,X2] :
( intersection(X1,X2) = empty_set
<=> difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[prove_th84]) ).
fof(c_0_11,plain,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[empty_defn]) ).
fof(c_0_12,plain,
! [X10,X11,X12] :
( ( member(X12,X10)
| ~ member(X12,difference(X10,X11)) )
& ( ~ member(X12,X11)
| ~ member(X12,difference(X10,X11)) )
& ( ~ member(X12,X10)
| member(X12,X11)
| member(X12,difference(X10,X11)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,negated_conjecture,
( ( intersection(esk5_0,esk6_0) != empty_set
| difference(esk5_0,esk6_0) != esk5_0 )
& ( intersection(esk5_0,esk6_0) = empty_set
| difference(esk5_0,esk6_0) = esk5_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X7,X8,X9] :
( ( member(X9,X7)
| ~ member(X9,intersection(X7,X8)) )
& ( member(X9,X8)
| ~ member(X9,intersection(X7,X8)) )
& ( ~ member(X9,X7)
| ~ member(X9,X8)
| member(X9,intersection(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
fof(c_0_15,plain,
! [X32,X33,X34] :
( ( ~ empty(X32)
| ~ member(X33,X32) )
& ( member(esk4_1(X34),X34)
| empty(X34) ) ),
inference(fof_nnf,[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)],[c_0_11])])])])])]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| difference(esk5_0,esk6_0) = esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( member(esk4_1(X1),X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
cnf(c_0_21,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| ~ member(X1,esk5_0)
| ~ member(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( empty(intersection(X1,X2))
| member(esk4_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X16,X17] : intersection(X16,X17) = intersection(X17,X16),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_24,plain,
! [X13] : ~ member(X13,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
fof(c_0_25,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ subset(X25,X26)
| ~ member(X27,X25)
| member(X27,X26) )
& ( member(esk3_2(X28,X29),X28)
| subset(X28,X29) )
& ( ~ member(esk3_2(X28,X29),X29)
| subset(X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_26,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| empty(intersection(X1,esk6_0))
| ~ member(esk4_1(intersection(X1,esk6_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_28,plain,
! [X14,X15] :
( ( subset(X14,X15)
| X14 != X15 )
& ( subset(X15,X14)
| X14 != X15 )
& ( ~ subset(X14,X15)
| ~ subset(X15,X14)
| X14 = X15 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_29,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| empty(intersection(esk6_0,X1))
| ~ member(esk4_1(intersection(esk6_0,X1)),esk5_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| empty(intersection(esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_22]),c_0_27]) ).
cnf(c_0_37,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| subset(intersection(esk5_0,esk6_0),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ empty(intersection(X1,X2))
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
intersection(esk5_0,esk6_0) = empty_set,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
empty(empty_set),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
( ~ member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
( empty(intersection(X1,esk6_0))
| ~ member(esk4_1(intersection(X1,esk6_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_45,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
( empty(intersection(esk6_0,X1))
| ~ member(esk4_1(intersection(esk6_0,X1)),esk5_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_47,plain,
( empty(intersection(X1,difference(X2,X3)))
| member(esk4_1(intersection(X1,difference(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_22]) ).
fof(c_0_48,plain,
! [X4,X5] :
( ( ~ member(esk1_2(X4,X5),X4)
| ~ member(esk1_2(X4,X5),X5)
| X4 = X5 )
& ( member(esk1_2(X4,X5),X4)
| member(esk1_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[member_equal])])])])]) ).
cnf(c_0_49,negated_conjecture,
empty(intersection(esk6_0,difference(esk5_0,X1))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( empty(difference(X1,X2))
| ~ member(esk4_1(difference(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_51,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_53,plain,
( member(esk1_2(X1,X2),X1)
| member(esk1_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(X1,difference(esk5_0,X2))
| ~ member(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_55,plain,
( empty(difference(X1,difference(X2,X3)))
| member(esk4_1(difference(X1,difference(X2,X3))),X3)
| ~ member(esk4_1(difference(X1,difference(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( empty(difference(X1,X2))
| member(esk4_1(difference(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_57,plain,
( subset(difference(X1,difference(X2,X3)),X4)
| member(esk3_2(difference(X1,difference(X2,X3)),X4),X3)
| ~ member(esk3_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,plain,
( subset(difference(X1,X2),X3)
| member(esk3_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_59,plain,
( empty_set = X1
| member(esk1_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( empty(difference(esk5_0,X1))
| ~ member(esk4_1(difference(esk5_0,X1)),esk6_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_61,plain,
( empty(difference(X1,difference(X1,X2)))
| member(esk4_1(difference(X1,difference(X1,X2))),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_63,plain,
( subset(difference(X1,difference(X1,X2)),X3)
| member(esk3_2(difference(X1,difference(X1,X2)),X3),X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( empty_set = X1
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
empty(difference(esk5_0,difference(esk5_0,esk6_0))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( subset(X1,difference(X2,X3))
| member(esk3_2(X1,difference(X2,X3)),X3)
| ~ member(esk3_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_51]) ).
cnf(c_0_67,plain,
subset(difference(X1,difference(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
difference(esk5_0,difference(esk5_0,esk6_0)) = empty_set,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
( subset(X1,difference(X1,X2))
| member(esk3_2(X1,difference(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_70,negated_conjecture,
subset(difference(esk5_0,empty_set),difference(esk5_0,esk6_0)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
subset(X1,difference(X1,empty_set)),
inference(spm,[status(thm)],[c_0_29,c_0_69]) ).
cnf(c_0_72,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_62,c_0_58]) ).
cnf(c_0_73,negated_conjecture,
( intersection(esk5_0,esk6_0) != empty_set
| difference(esk5_0,esk6_0) != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_74,negated_conjecture,
( difference(esk5_0,empty_set) = difference(esk5_0,esk6_0)
| ~ subset(difference(esk5_0,esk6_0),difference(esk5_0,empty_set)) ),
inference(spm,[status(thm)],[c_0_33,c_0_70]) ).
cnf(c_0_75,plain,
difference(X1,empty_set) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_71]),c_0_72])]) ).
cnf(c_0_76,negated_conjecture,
difference(esk5_0,esk6_0) != esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_41])]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_72])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET611+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 10:52:45 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.pfyJyqImnv/E---3.1_16567.p
% 1.33/0.65 # Version: 3.1.0
% 1.33/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.33/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.33/0.65 # Starting sh5l with 300s (1) cores
% 1.33/0.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16707 completed with status 0
% 1.33/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.33/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.65 # No SInE strategy applied
% 1.33/0.65 # Search class: FGHSS-FFSF21-SFFFFFNN
% 1.33/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.33/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.33/0.65 # Starting new_bool_3 with 136s (1) cores
% 1.33/0.65 # Starting new_bool_1 with 136s (1) cores
% 1.33/0.65 # Starting sh5l with 136s (1) cores
% 1.33/0.65 # SAT001_MinMin_p005000_rr_RG with pid 16717 completed with status 0
% 1.33/0.65 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.33/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.65 # No SInE strategy applied
% 1.33/0.65 # Search class: FGHSS-FFSF21-SFFFFFNN
% 1.33/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.33/0.65 # Preprocessing time : 0.001 s
% 1.33/0.65 # Presaturation interreduction done
% 1.33/0.65
% 1.33/0.65 # Proof found!
% 1.33/0.65 # SZS status Theorem
% 1.33/0.65 # SZS output start CNFRefutation
% See solution above
% 1.33/0.65 # Parsed axioms : 11
% 1.33/0.65 # Removed by relevancy pruning/SinE : 0
% 1.33/0.65 # Initial clauses : 25
% 1.33/0.65 # Removed in clause preprocessing : 2
% 1.33/0.65 # Initial clauses in saturation : 23
% 1.33/0.65 # Processed clauses : 2594
% 1.33/0.65 # ...of these trivial : 34
% 1.33/0.65 # ...subsumed : 2023
% 1.33/0.65 # ...remaining for further processing : 537
% 1.33/0.65 # Other redundant clauses eliminated : 2
% 1.33/0.65 # Clauses deleted for lack of memory : 0
% 1.33/0.65 # Backward-subsumed : 11
% 1.33/0.65 # Backward-rewritten : 74
% 1.33/0.65 # Generated clauses : 16151
% 1.33/0.65 # ...of the previous two non-redundant : 9366
% 1.33/0.65 # ...aggressively subsumed : 0
% 1.33/0.65 # Contextual simplify-reflections : 3
% 1.33/0.65 # Paramodulations : 16121
% 1.33/0.65 # Factorizations : 28
% 1.33/0.65 # NegExts : 0
% 1.33/0.65 # Equation resolutions : 2
% 1.33/0.65 # Disequality decompositions : 0
% 1.33/0.65 # Total rewrite steps : 12766
% 1.33/0.65 # ...of those cached : 12318
% 1.33/0.65 # Propositional unsat checks : 0
% 1.33/0.65 # Propositional check models : 0
% 1.33/0.65 # Propositional check unsatisfiable : 0
% 1.33/0.65 # Propositional clauses : 0
% 1.33/0.65 # Propositional clauses after purity: 0
% 1.33/0.65 # Propositional unsat core size : 0
% 1.33/0.65 # Propositional preprocessing time : 0.000
% 1.33/0.65 # Propositional encoding time : 0.000
% 1.33/0.65 # Propositional solver time : 0.000
% 1.33/0.65 # Success case prop preproc time : 0.000
% 1.33/0.65 # Success case prop encoding time : 0.000
% 1.33/0.65 # Success case prop solver time : 0.000
% 1.33/0.65 # Current number of processed clauses : 429
% 1.33/0.65 # Positive orientable unit clauses : 43
% 1.33/0.65 # Positive unorientable unit clauses: 1
% 1.33/0.65 # Negative unit clauses : 2
% 1.33/0.65 # Non-unit-clauses : 383
% 1.33/0.65 # Current number of unprocessed clauses: 6494
% 1.33/0.65 # ...number of literals in the above : 19883
% 1.33/0.65 # Current number of archived formulas : 0
% 1.33/0.65 # Current number of archived clauses : 106
% 1.33/0.65 # Clause-clause subsumption calls (NU) : 39714
% 1.33/0.65 # Rec. Clause-clause subsumption calls : 30237
% 1.33/0.65 # Non-unit clause-clause subsumptions : 1233
% 1.33/0.65 # Unit Clause-clause subsumption calls : 2429
% 1.33/0.65 # Rewrite failures with RHS unbound : 0
% 1.33/0.65 # BW rewrite match attempts : 146
% 1.33/0.65 # BW rewrite match successes : 38
% 1.33/0.65 # Condensation attempts : 0
% 1.33/0.65 # Condensation successes : 0
% 1.33/0.65 # Termbank termtop insertions : 187401
% 1.33/0.65 # Search garbage collected termcells : 413
% 1.33/0.65
% 1.33/0.65 # -------------------------------------------------
% 1.33/0.65 # User time : 0.161 s
% 1.33/0.65 # System time : 0.005 s
% 1.33/0.65 # Total time : 0.166 s
% 1.33/0.65 # Maximum resident set size: 1752 pages
% 1.33/0.65
% 1.33/0.65 # -------------------------------------------------
% 1.33/0.65 # User time : 0.799 s
% 1.33/0.65 # System time : 0.014 s
% 1.33/0.65 # Total time : 0.813 s
% 1.33/0.65 # Maximum resident set size: 1692 pages
% 1.33/0.65 % E---3.1 exiting
% 1.33/0.66 % E exiting
%------------------------------------------------------------------------------