TSTP Solution File: SET973+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET973+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 02:56:41 EDT 2024
% Result : Theorem 6.32s 1.29s
% Output : CNFRefutation 6.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 36 unt; 0 def)
% Number of atoms : 167 ( 72 equ)
% Maximal formula atoms : 28 ( 2 avg)
% Number of connectives : 161 ( 60 ~; 69 |; 23 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-4 aty)
% Number of variables : 195 ( 12 sgn 84 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(t125_zfmisc_1,axiom,
! [X1,X2,X3] :
( cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& cartesian_product2(X3,set_difference(X1,X2)) = set_difference(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t125_zfmisc_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t54_xboole_1,axiom,
! [X1,X2,X3] : set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_xboole_1) ).
fof(t126_zfmisc_1,conjecture,
! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t126_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_12,plain,
! [X49,X50,X51,X52,X53,X54,X55,X56] :
( ( in(X52,X49)
| ~ in(X52,X51)
| X51 != set_difference(X49,X50) )
& ( ~ in(X52,X50)
| ~ in(X52,X51)
| X51 != set_difference(X49,X50) )
& ( ~ in(X53,X49)
| in(X53,X50)
| in(X53,X51)
| X51 != set_difference(X49,X50) )
& ( ~ in(esk8_3(X54,X55,X56),X56)
| ~ in(esk8_3(X54,X55,X56),X54)
| in(esk8_3(X54,X55,X56),X55)
| X56 = set_difference(X54,X55) )
& ( in(esk8_3(X54,X55,X56),X54)
| in(esk8_3(X54,X55,X56),X56)
| X56 = set_difference(X54,X55) )
& ( ~ in(esk8_3(X54,X55,X56),X55)
| in(esk8_3(X54,X55,X56),X56)
| X56 = set_difference(X54,X55) ) ),
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)],[c_0_11])])])])])])]) ).
fof(c_0_13,plain,
! [X26,X27,X28,X29,X32,X33,X34,X35,X36,X37,X39,X40] :
( ( in(esk2_4(X26,X27,X28,X29),X26)
| ~ in(X29,X28)
| X28 != cartesian_product2(X26,X27) )
& ( in(esk3_4(X26,X27,X28,X29),X27)
| ~ in(X29,X28)
| X28 != cartesian_product2(X26,X27) )
& ( X29 = ordered_pair(esk2_4(X26,X27,X28,X29),esk3_4(X26,X27,X28,X29))
| ~ in(X29,X28)
| X28 != cartesian_product2(X26,X27) )
& ( ~ in(X33,X26)
| ~ in(X34,X27)
| X32 != ordered_pair(X33,X34)
| in(X32,X28)
| X28 != cartesian_product2(X26,X27) )
& ( ~ in(esk4_3(X35,X36,X37),X37)
| ~ in(X39,X35)
| ~ in(X40,X36)
| esk4_3(X35,X36,X37) != ordered_pair(X39,X40)
| X37 = cartesian_product2(X35,X36) )
& ( in(esk5_3(X35,X36,X37),X35)
| in(esk4_3(X35,X36,X37),X37)
| X37 = cartesian_product2(X35,X36) )
& ( in(esk6_3(X35,X36,X37),X36)
| in(esk4_3(X35,X36,X37),X37)
| X37 = cartesian_product2(X35,X36) )
& ( esk4_3(X35,X36,X37) = ordered_pair(esk5_3(X35,X36,X37),esk6_3(X35,X36,X37))
| in(esk4_3(X35,X36,X37),X37)
| X37 = cartesian_product2(X35,X36) ) ),
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)],[d2_zfmisc_1])])])])])])]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X83,X84,X85] :
( cartesian_product2(set_difference(X83,X84),X85) = set_difference(cartesian_product2(X83,X85),cartesian_product2(X84,X85))
& cartesian_product2(X85,set_difference(X83,X84)) = set_difference(cartesian_product2(X85,X83),cartesian_product2(X85,X84)) ),
inference(variable_rename,[status(thm)],[t125_zfmisc_1]) ).
cnf(c_0_21,plain,
( ~ in(esk2_4(set_difference(X1,X2),X3,cartesian_product2(set_difference(X1,X2),X3),X4),X2)
| ~ in(X4,cartesian_product2(set_difference(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( in(esk2_4(set_difference(X1,X2),X3,cartesian_product2(set_difference(X1,X2),X3),X4),X1)
| ~ in(X4,cartesian_product2(set_difference(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( in(esk8_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| ~ in(esk8_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( in(esk8_3(X1,X2,X3),X1)
| in(esk8_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X15,X16] :
( ( subset(X15,X16)
| X15 != X16 )
& ( subset(X16,X15)
| X15 != X16 )
& ( ~ subset(X15,X16)
| ~ subset(X16,X15)
| X15 = X16 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
fof(c_0_26,plain,
! [X90,X91] : subset(set_intersection2(X90,X91),X90),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_27,plain,
cartesian_product2(X1,set_difference(X2,X3)) = set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
~ in(X1,cartesian_product2(set_difference(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( X1 = set_difference(X2,X2)
| in(esk8_3(X2,X2,X1),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X43,X44,X45,X46,X47] :
( ( ~ subset(X43,X44)
| ~ in(X45,X43)
| in(X45,X44) )
& ( in(esk7_2(X46,X47),X46)
| subset(X46,X47) )
& ( ~ in(esk7_2(X46,X47),X47)
| subset(X46,X47) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_33,plain,
( in(X1,cartesian_product2(X2,X3))
| ~ in(X1,cartesian_product2(X2,set_difference(X3,X4))) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_34,plain,
cartesian_product2(set_difference(X1,X1),X2) = set_difference(X3,X3),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( in(esk8_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| ~ in(esk8_3(X1,X2,X3),X3)
| ~ in(esk8_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
( set_difference(X1,X2) = X1
| in(esk8_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( in(esk7_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,plain,
! [X95,X96,X97] : set_difference(X95,set_intersection2(X96,X97)) = set_union2(set_difference(X95,X96),set_difference(X95,X97)),
inference(variable_rename,[status(thm)],[t54_xboole_1]) ).
cnf(c_0_40,plain,
~ in(X1,set_difference(X2,X2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28]) ).
cnf(c_0_41,plain,
( set_difference(X1,X2) = X1
| in(esk8_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_42,plain,
( set_intersection2(X1,X2) = X1
| in(esk7_2(X1,set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
set_difference(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
set_intersection2(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_40,c_0_42]) ).
fof(c_0_46,negated_conjecture,
~ ! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
inference(assume_negation,[status(cth)],[t126_zfmisc_1]) ).
fof(c_0_47,plain,
! [X11,X12] : set_union2(X11,X12) = set_union2(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_48,plain,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_44]) ).
cnf(c_0_49,plain,
set_difference(X1,X1) = set_difference(X2,X2),
inference(spm,[status(thm)],[c_0_34,c_0_34]) ).
fof(c_0_50,negated_conjecture,
set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)) != set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
cnf(c_0_51,plain,
cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_52,plain,
! [X79,X80,X81,X82] : cartesian_product2(set_intersection2(X79,X80),set_intersection2(X81,X82)) = set_intersection2(cartesian_product2(X79,X81),cartesian_product2(X80,X82)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
fof(c_0_53,plain,
! [X13,X14] : set_intersection2(X13,X14) = set_intersection2(X14,X13),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_54,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
set_union2(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)) != set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
set_union2(set_difference(cartesian_product2(X1,X2),X3),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(X3,cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_58,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
set_union2(set_difference(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
set_union2(cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)),cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0)) != set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)),
inference(rw,[status(thm)],[c_0_56,c_0_54]) ).
cnf(c_0_62,plain,
set_union2(cartesian_product2(X1,set_difference(X2,X3)),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_57,c_0_27]) ).
cnf(c_0_63,plain,
set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_58]) ).
cnf(c_0_64,plain,
set_difference(X1,set_intersection2(X1,X2)) = set_difference(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET973+1 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 11:34:38 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/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/benchmark/theBenchmark.p
% 6.32/1.29 # Version: 3.1.0
% 6.32/1.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.32/1.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.32/1.29 # Starting new_bool_3 with 300s (1) cores
% 6.32/1.29 # Starting new_bool_1 with 300s (1) cores
% 6.32/1.29 # Starting sh5l with 300s (1) cores
% 6.32/1.29 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8720 completed with status 0
% 6.32/1.29 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.32/1.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.32/1.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.32/1.29 # No SInE strategy applied
% 6.32/1.29 # Search class: FGHSM-FFMF32-MFFFFFNN
% 6.32/1.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 811s (1) cores
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.32/1.29 # Starting new_bool_3 with 136s (1) cores
% 6.32/1.29 # Starting new_bool_1 with 136s (1) cores
% 6.32/1.29 # Starting sh5l with 136s (1) cores
% 6.32/1.29 # G-E--_208_C18_F1_SE_CS_SP_PS_S038I with pid 8729 completed with status 0
% 6.32/1.29 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S038I
% 6.32/1.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.32/1.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.32/1.29 # No SInE strategy applied
% 6.32/1.29 # Search class: FGHSM-FFMF32-MFFFFFNN
% 6.32/1.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.32/1.29 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 811s (1) cores
% 6.32/1.29 # Preprocessing time : 0.001 s
% 6.32/1.29 # Presaturation interreduction done
% 6.32/1.29
% 6.32/1.29 # Proof found!
% 6.32/1.29 # SZS status Theorem
% 6.32/1.29 # SZS output start CNFRefutation
% See solution above
% 6.32/1.29 # Parsed axioms : 26
% 6.32/1.29 # Removed by relevancy pruning/SinE : 0
% 6.32/1.29 # Initial clauses : 50
% 6.32/1.29 # Removed in clause preprocessing : 1
% 6.32/1.29 # Initial clauses in saturation : 49
% 6.32/1.29 # Processed clauses : 4857
% 6.32/1.29 # ...of these trivial : 258
% 6.32/1.29 # ...subsumed : 3800
% 6.32/1.29 # ...remaining for further processing : 799
% 6.32/1.29 # Other redundant clauses eliminated : 13
% 6.32/1.29 # Clauses deleted for lack of memory : 0
% 6.32/1.29 # Backward-subsumed : 17
% 6.32/1.29 # Backward-rewritten : 22
% 6.32/1.29 # Generated clauses : 70006
% 6.32/1.29 # ...of the previous two non-redundant : 66425
% 6.32/1.29 # ...aggressively subsumed : 0
% 6.32/1.29 # Contextual simplify-reflections : 4
% 6.32/1.29 # Paramodulations : 69780
% 6.32/1.29 # Factorizations : 214
% 6.32/1.29 # NegExts : 0
% 6.32/1.29 # Equation resolutions : 13
% 6.32/1.29 # Disequality decompositions : 0
% 6.32/1.29 # Total rewrite steps : 14637
% 6.32/1.29 # ...of those cached : 11626
% 6.32/1.29 # Propositional unsat checks : 0
% 6.32/1.29 # Propositional check models : 0
% 6.32/1.29 # Propositional check unsatisfiable : 0
% 6.32/1.29 # Propositional clauses : 0
% 6.32/1.29 # Propositional clauses after purity: 0
% 6.32/1.29 # Propositional unsat core size : 0
% 6.32/1.29 # Propositional preprocessing time : 0.000
% 6.32/1.29 # Propositional encoding time : 0.000
% 6.32/1.29 # Propositional solver time : 0.000
% 6.32/1.29 # Success case prop preproc time : 0.000
% 6.32/1.29 # Success case prop encoding time : 0.000
% 6.32/1.29 # Success case prop solver time : 0.000
% 6.32/1.29 # Current number of processed clauses : 702
% 6.32/1.29 # Positive orientable unit clauses : 107
% 6.32/1.29 # Positive unorientable unit clauses: 25
% 6.32/1.29 # Negative unit clauses : 44
% 6.32/1.29 # Non-unit-clauses : 526
% 6.32/1.29 # Current number of unprocessed clauses: 61544
% 6.32/1.29 # ...number of literals in the above : 162705
% 6.32/1.29 # Current number of archived formulas : 0
% 6.32/1.29 # Current number of archived clauses : 86
% 6.32/1.29 # Clause-clause subsumption calls (NU) : 115808
% 6.32/1.29 # Rec. Clause-clause subsumption calls : 58994
% 6.32/1.29 # Non-unit clause-clause subsumptions : 1612
% 6.32/1.29 # Unit Clause-clause subsumption calls : 2381
% 6.32/1.29 # Rewrite failures with RHS unbound : 7987
% 6.32/1.29 # BW rewrite match attempts : 1214
% 6.32/1.29 # BW rewrite match successes : 212
% 6.32/1.29 # Condensation attempts : 0
% 6.32/1.29 # Condensation successes : 0
% 6.32/1.29 # Termbank termtop insertions : 1121734
% 6.32/1.29 # Search garbage collected termcells : 806
% 6.32/1.29
% 6.32/1.29 # -------------------------------------------------
% 6.32/1.29 # User time : 0.774 s
% 6.32/1.29 # System time : 0.028 s
% 6.32/1.29 # Total time : 0.802 s
% 6.32/1.29 # Maximum resident set size: 1880 pages
% 6.32/1.29
% 6.32/1.29 # -------------------------------------------------
% 6.32/1.29 # User time : 3.927 s
% 6.32/1.29 # System time : 0.067 s
% 6.32/1.29 # Total time : 3.994 s
% 6.32/1.29 # Maximum resident set size: 1720 pages
% 6.32/1.29 % E---3.1 exiting
% 6.32/1.29 % E exiting
%------------------------------------------------------------------------------