TSTP Solution File: NUM401+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM401+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:07:00 EDT 2023
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 16 unt; 0 def)
% Number of atoms : 227 ( 44 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 247 ( 94 ~; 106 |; 25 &)
% ( 9 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 125 ( 13 sgn; 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',t34_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',d1_ordinal1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',d2_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',redefinition_r1_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',t24_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',d1_tarski) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',cc1_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',d2_ordinal1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',t1_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',t7_boole) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',d10_xboole_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',t2_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p',reflexivity_r1_tarski) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t34_ordinal1]) ).
fof(c_0_14,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,succ(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) )
& ( in(esk18_0,succ(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_15,plain,
! [X19] : succ(X19) = set_union2(X19,singleton(X19)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_16,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( ~ in(X34,X33)
| in(X34,X31)
| in(X34,X32)
| X33 != set_union2(X31,X32) )
& ( ~ in(X35,X31)
| in(X35,X33)
| X33 != set_union2(X31,X32) )
& ( ~ in(X35,X32)
| in(X35,X33)
| X33 != set_union2(X31,X32) )
& ( ~ in(esk3_3(X36,X37,X38),X36)
| ~ in(esk3_3(X36,X37,X38),X38)
| X38 = set_union2(X36,X37) )
& ( ~ in(esk3_3(X36,X37,X38),X37)
| ~ in(esk3_3(X36,X37,X38),X38)
| X38 = set_union2(X36,X37) )
& ( in(esk3_3(X36,X37,X38),X38)
| in(esk3_3(X36,X37,X38),X36)
| in(esk3_3(X36,X37,X38),X37)
| X38 = set_union2(X36,X37) ) ),
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)],[d2_xboole_0])])])])])]) ).
fof(c_0_17,plain,
! [X64,X65] :
( ( ~ ordinal_subset(X64,X65)
| subset(X64,X65)
| ~ ordinal(X64)
| ~ ordinal(X65) )
& ( ~ subset(X64,X65)
| ordinal_subset(X64,X65)
| ~ ordinal(X64)
| ~ ordinal(X65) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_18,negated_conjecture,
( in(esk18_0,succ(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
fof(c_0_21,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ in(X22,X21)
| X22 = X20
| X21 != singleton(X20) )
& ( X23 != X20
| in(X23,X21)
| X21 != singleton(X20) )
& ( ~ in(esk1_2(X24,X25),X25)
| esk1_2(X24,X25) != X24
| X25 = singleton(X24) )
& ( in(esk1_2(X24,X25),X25)
| esk1_2(X24,X25) = X24
| X25 = singleton(X24) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_22,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(esk18_0,succ(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X74,X75] :
( ~ ordinal(X74)
| ~ ordinal(X75)
| in(X74,X75)
| X74 = X75
| in(X75,X74) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_29,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
fof(c_0_32,plain,
! [X8] :
( ( epsilon_transitive(X8)
| ~ ordinal(X8) )
& ( epsilon_connected(X8)
| ~ ordinal(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_34,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_37,plain,
! [X27,X28,X29] :
( ( ~ epsilon_transitive(X27)
| ~ in(X28,X27)
| subset(X28,X27) )
& ( in(esk2_1(X29),X29)
| epsilon_transitive(X29) )
& ( ~ subset(esk2_1(X29),X29)
| epsilon_transitive(X29) ) ),
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)],[d2_ordinal1])])])])])]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0))
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_41,plain,
! [X72,X73] :
( ~ in(X72,X73)
| element(X72,X73) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_42,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_43,plain,
! [X89,X90] :
( ~ in(X89,X90)
| ~ empty(X90) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_44,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25]),c_0_26])]) ).
cnf(c_0_45,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk19_0
| in(X1,esk19_0)
| in(esk19_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_47,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,negated_conjecture,
( esk18_0 = esk19_0
| subset(esk18_0,esk19_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
epsilon_transitive(esk19_0),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
fof(c_0_50,plain,
! [X17,X18] :
( ( subset(X17,X18)
| X17 != X18 )
& ( subset(X18,X17)
| X17 != X18 )
& ( ~ subset(X17,X18)
| ~ subset(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_51,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_53,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_54,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( esk18_0 = esk19_0
| in(esk19_0,esk18_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_57,negated_conjecture,
( esk18_0 = esk19_0
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_58,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_59,plain,
! [X76,X77] :
( ~ element(X76,X77)
| empty(X77)
| in(X76,X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_60,plain,
( element(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]) ).
cnf(c_0_62,plain,
( ~ empty(set_union2(X1,X2))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_63,negated_conjecture,
( esk18_0 = esk19_0
| in(esk19_0,esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_64,negated_conjecture,
epsilon_transitive(esk18_0),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_65,negated_conjecture,
( esk18_0 = esk19_0
| ~ subset(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
fof(c_0_66,plain,
! [X68] : subset(X68,X68),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_67,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,plain,
element(X1,set_union2(X2,singleton(X1))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
~ empty(set_union2(X1,singleton(X2))),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_70,negated_conjecture,
esk18_0 = esk19_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_63]),c_0_64])]),c_0_65]) ).
cnf(c_0_71,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_72,plain,
in(X1,set_union2(X2,singleton(X1))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_70]),c_0_71]),c_0_70]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM401+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 14:33:24 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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/tmp/tmp.J0L0E1xLiE/E---3.1_2962.p
% 0.18/0.50 # Version: 3.1pre001
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3039 completed with status 0
% 0.18/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.50 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.18/0.50 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3049 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.50 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.18/0.50 # Preprocessing time : 0.002 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 54
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 112
% 0.18/0.50 # Removed in clause preprocessing : 3
% 0.18/0.50 # Initial clauses in saturation : 109
% 0.18/0.50 # Processed clauses : 740
% 0.18/0.50 # ...of these trivial : 23
% 0.18/0.50 # ...subsumed : 287
% 0.18/0.50 # ...remaining for further processing : 430
% 0.18/0.50 # Other redundant clauses eliminated : 8
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 21
% 0.18/0.50 # Backward-rewritten : 77
% 0.18/0.50 # Generated clauses : 1267
% 0.18/0.50 # ...of the previous two non-redundant : 1161
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 7
% 0.18/0.50 # Paramodulations : 1254
% 0.18/0.50 # Factorizations : 6
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 8
% 0.18/0.50 # Total rewrite steps : 347
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 225
% 0.18/0.50 # Positive orientable unit clauses : 68
% 0.18/0.50 # Positive unorientable unit clauses: 1
% 0.18/0.50 # Negative unit clauses : 29
% 0.18/0.50 # Non-unit-clauses : 127
% 0.18/0.50 # Current number of unprocessed clauses: 584
% 0.18/0.50 # ...number of literals in the above : 1630
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 199
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 6158
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 4999
% 0.18/0.50 # Non-unit clause-clause subsumptions : 122
% 0.18/0.50 # Unit Clause-clause subsumption calls : 1654
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 51
% 0.18/0.50 # BW rewrite match successes : 33
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 16406
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.030 s
% 0.18/0.50 # System time : 0.004 s
% 0.18/0.50 # Total time : 0.034 s
% 0.18/0.50 # Maximum resident set size: 1936 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.138 s
% 0.18/0.50 # System time : 0.011 s
% 0.18/0.50 # Total time : 0.149 s
% 0.18/0.50 # Maximum resident set size: 1732 pages
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------