TSTP Solution File: SEU236+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU236+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 03:32:07 EDT 2024
% Result : Theorem 1.49s 0.67s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 75 ( 19 unt; 0 def)
% Number of atoms : 213 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 233 ( 95 ~; 85 |; 29 &)
% ( 7 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 101 ( 1 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_ordinal1) ).
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(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
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(t24_ordinal1,lemma,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(t10_ordinal1,lemma,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(t8_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t33_ordinal1]) ).
fof(c_0_15,plain,
! [X11,X12] :
( ( ~ ordinal_subset(X11,X12)
| subset(X11,X12)
| ~ ordinal(X11)
| ~ ordinal(X12) )
& ( ~ subset(X11,X12)
| ordinal_subset(X11,X12)
| ~ ordinal(X11)
| ~ ordinal(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
fof(c_0_16,negated_conjecture,
( ordinal(esk1_0)
& ordinal(esk2_0)
& ( ~ in(esk1_0,esk2_0)
| ~ ordinal_subset(succ(esk1_0),esk2_0) )
& ( in(esk1_0,esk2_0)
| ordinal_subset(succ(esk1_0),esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_17,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( in(esk1_0,esk2_0)
| ordinal_subset(succ(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X21] :
( ( ~ empty(succ(X21))
| ~ ordinal(X21) )
& ( epsilon_transitive(succ(X21))
| ~ ordinal(X21) )
& ( epsilon_connected(succ(X21))
| ~ ordinal(X21) )
& ( ordinal(succ(X21))
| ~ ordinal(X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_22,plain,
! [X47,X48] :
( ( subset(X47,X48)
| X47 != X48 )
& ( subset(X48,X47)
| X47 != X48 )
& ( ~ subset(X47,X48)
| ~ subset(X48,X47)
| X47 = X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_23,negated_conjecture,
( subset(succ(esk1_0),esk2_0)
| in(esk1_0,esk2_0)
| ~ ordinal(succ(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_26,plain,
! [X167,X168,X169] :
( ( ~ epsilon_transitive(X167)
| ~ in(X168,X167)
| subset(X168,X167) )
& ( in(esk25_1(X169),X169)
| epsilon_transitive(X169) )
& ( ~ subset(esk25_1(X169),X169)
| epsilon_transitive(X169) ) ),
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_ordinal1])])])])])])]) ).
fof(c_0_27,lemma,
! [X96,X97] : subset(X96,set_union2(X96,X97)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_28,plain,
! [X19] : succ(X19) = set_union2(X19,singleton(X19)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_29,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( subset(succ(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_32,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( epsilon_transitive(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ subset(X25,X26)
| ~ in(X27,X25)
| in(X27,X26) )
& ( in(esk4_2(X28,X29),X28)
| subset(X28,X29) )
& ( ~ in(esk4_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)],[d3_tarski])])])])])])]) ).
cnf(c_0_35,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_37,lemma,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
fof(c_0_38,plain,
! [X23,X24] :
( ~ in(X23,X24)
| ~ in(X24,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
fof(c_0_39,lemma,
! [X22] : in(X22,succ(X22)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_40,negated_conjecture,
( succ(esk1_0) = esk2_0
| in(esk1_0,esk2_0)
| ~ subset(esk2_0,succ(esk1_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
( subset(X1,succ(X2))
| ~ ordinal(X2)
| ~ in(X1,succ(X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,lemma,
subset(X1,succ(X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(esk1_0,esk2_0)
| ~ ordinal_subset(succ(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_46,lemma,
! [X98,X99,X100] :
( ~ subset(X98,X99)
| ~ subset(X100,X99)
| subset(set_union2(X98,X100),X99) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_47,plain,
! [X154] :
( ( epsilon_transitive(X154)
| ~ ordinal(X154) )
& ( epsilon_connected(X154)
| ~ ordinal(X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
fof(c_0_48,lemma,
! [X43,X44] :
( ~ ordinal(X43)
| ~ ordinal(X44)
| in(X43,X44)
| X43 = X44
| in(X44,X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])]) ).
cnf(c_0_49,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_50,lemma,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( succ(esk1_0) = esk2_0
| in(esk1_0,esk2_0)
| ~ in(esk2_0,succ(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25])]) ).
cnf(c_0_52,lemma,
( in(X1,succ(X2))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
( ~ subset(succ(esk1_0),esk2_0)
| ~ ordinal(succ(esk1_0))
| ~ in(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20])]) ).
cnf(c_0_54,lemma,
( subset(set_union2(X1,X3),X2)
| ~ subset(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_55,lemma,
! [X110,X111] :
( ( ~ subset(singleton(X110),X111)
| in(X110,X111) )
& ( ~ in(X110,X111)
| subset(singleton(X110),X111) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])]) ).
cnf(c_0_56,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,lemma,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,lemma,
~ in(succ(X1),X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,lemma,
( succ(esk1_0) = esk2_0
| ~ in(esk2_0,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_49]) ).
cnf(c_0_60,negated_conjecture,
( ~ subset(succ(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_24]),c_0_25])]) ).
cnf(c_0_61,lemma,
( subset(succ(X1),X2)
| ~ subset(singleton(X1),X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_62,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( X1 = esk2_0
| in(esk2_0,X1)
| in(X1,esk2_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_20]) ).
cnf(c_0_65,lemma,
~ in(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( ~ subset(singleton(esk1_0),esk2_0)
| ~ subset(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_67,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_68,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_63,c_0_20]) ).
cnf(c_0_69,negated_conjecture,
( esk2_0 = esk1_0
| in(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_25]),c_0_65]) ).
cnf(c_0_70,lemma,
~ in(esk1_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
esk2_0 = esk1_0,
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,lemma,
~ in(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,negated_conjecture,
succ(esk1_0) = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_71]),c_0_71]),c_0_71]),c_0_50])]),c_0_72]) ).
cnf(c_0_74,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_73]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU236+2 : TPTP v8.2.0. Released v3.3.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:39:37 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.49/0.67 # Version: 3.1.0
% 1.49/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.49/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.49/0.67 # Starting sh5l with 300s (1) cores
% 1.49/0.67 # new_bool_3 with pid 29311 completed with status 0
% 1.49/0.67 # Result found by new_bool_3
% 1.49/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.49/0.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/0.67 # Search class: FGHSM-FSLM31-SFFFFFNN
% 1.49/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.49/0.67 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 1.49/0.67 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 29314 completed with status 0
% 1.49/0.67 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.49/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.49/0.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/0.67 # Search class: FGHSM-FSLM31-SFFFFFNN
% 1.49/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.49/0.67 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 1.49/0.67 # Preprocessing time : 0.005 s
% 1.49/0.67
% 1.49/0.67 # Proof found!
% 1.49/0.67 # SZS status Theorem
% 1.49/0.67 # SZS output start CNFRefutation
% See solution above
% 1.49/0.67 # Parsed axioms : 276
% 1.49/0.67 # Removed by relevancy pruning/SinE : 163
% 1.49/0.67 # Initial clauses : 220
% 1.49/0.67 # Removed in clause preprocessing : 4
% 1.49/0.67 # Initial clauses in saturation : 216
% 1.49/0.67 # Processed clauses : 1233
% 1.49/0.67 # ...of these trivial : 27
% 1.49/0.67 # ...subsumed : 503
% 1.49/0.67 # ...remaining for further processing : 703
% 1.49/0.67 # Other redundant clauses eliminated : 30
% 1.49/0.67 # Clauses deleted for lack of memory : 0
% 1.49/0.67 # Backward-subsumed : 25
% 1.49/0.67 # Backward-rewritten : 108
% 1.49/0.67 # Generated clauses : 6389
% 1.49/0.67 # ...of the previous two non-redundant : 5852
% 1.49/0.67 # ...aggressively subsumed : 0
% 1.49/0.67 # Contextual simplify-reflections : 17
% 1.49/0.67 # Paramodulations : 6311
% 1.49/0.67 # Factorizations : 11
% 1.49/0.67 # NegExts : 0
% 1.49/0.67 # Equation resolutions : 62
% 1.49/0.67 # Disequality decompositions : 0
% 1.49/0.67 # Total rewrite steps : 936
% 1.49/0.67 # ...of those cached : 828
% 1.49/0.67 # Propositional unsat checks : 0
% 1.49/0.67 # Propositional check models : 0
% 1.49/0.67 # Propositional check unsatisfiable : 0
% 1.49/0.67 # Propositional clauses : 0
% 1.49/0.67 # Propositional clauses after purity: 0
% 1.49/0.67 # Propositional unsat core size : 0
% 1.49/0.67 # Propositional preprocessing time : 0.000
% 1.49/0.67 # Propositional encoding time : 0.000
% 1.49/0.67 # Propositional solver time : 0.000
% 1.49/0.67 # Success case prop preproc time : 0.000
% 1.49/0.67 # Success case prop encoding time : 0.000
% 1.49/0.67 # Success case prop solver time : 0.000
% 1.49/0.67 # Current number of processed clauses : 562
% 1.49/0.67 # Positive orientable unit clauses : 75
% 1.49/0.67 # Positive unorientable unit clauses: 3
% 1.49/0.67 # Negative unit clauses : 58
% 1.49/0.67 # Non-unit-clauses : 426
% 1.49/0.67 # Current number of unprocessed clauses: 4730
% 1.49/0.67 # ...number of literals in the above : 18951
% 1.49/0.67 # Current number of archived formulas : 0
% 1.49/0.67 # Current number of archived clauses : 138
% 1.49/0.67 # Clause-clause subsumption calls (NU) : 42388
% 1.49/0.67 # Rec. Clause-clause subsumption calls : 21010
% 1.49/0.67 # Non-unit clause-clause subsumptions : 259
% 1.49/0.67 # Unit Clause-clause subsumption calls : 5019
% 1.49/0.67 # Rewrite failures with RHS unbound : 0
% 1.49/0.67 # BW rewrite match attempts : 40
% 1.49/0.67 # BW rewrite match successes : 18
% 1.49/0.67 # Condensation attempts : 0
% 1.49/0.67 # Condensation successes : 0
% 1.49/0.67 # Termbank termtop insertions : 88921
% 1.49/0.67 # Search garbage collected termcells : 4151
% 1.49/0.67
% 1.49/0.67 # -------------------------------------------------
% 1.49/0.67 # User time : 0.166 s
% 1.49/0.67 # System time : 0.010 s
% 1.49/0.67 # Total time : 0.176 s
% 1.49/0.67 # Maximum resident set size: 2500 pages
% 1.49/0.67
% 1.49/0.67 # -------------------------------------------------
% 1.49/0.67 # User time : 0.172 s
% 1.49/0.67 # System time : 0.013 s
% 1.49/0.67 # Total time : 0.185 s
% 1.49/0.67 # Maximum resident set size: 1976 pages
% 1.49/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------