%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM401+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:48:58 PM UTC 2026
% Result : Theorem 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 77 ( 13 unt; 0 def)
% Number of atoms : 245 ( 49 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 263 ( 95 ~; 120 |; 25 &)
% ( 9 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 113 ( 7 sgn 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X2,X1)
| ordinal_subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X2,X1)
& X1 != X2
& ~ in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
| in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_12,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_13,negated_conjecture,
( ( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,succ(esk19_0)) )
& ( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,succ(esk19_0)) )
& ordinal(esk19_0)
& ordinal(esk18_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_14,plain,
! [X19] : succ(X19) = set_union2(X19,singleton(X19)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
cnf(c_0_15,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,succ(esk19_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X15,X16] :
( ordinal_subset(X16,X15)
| ordinal_subset(X15,X16)
| ~ ordinal(X16)
| ~ ordinal(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))
| ~ ordinal_subset(esk18_0,esk19_0) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ordinal_subset(X2,X1)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,succ(esk19_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X64,X65] :
( ( ~ ordinal(X65)
| ~ ordinal(X64)
| ordinal_subset(X64,X65)
| ~ subset(X64,X65) )
& ( ~ ordinal(X65)
| ~ ordinal(X64)
| subset(X64,X65)
| ~ ordinal_subset(X64,X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))
| ordinal_subset(esk19_0,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
( in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))
| ordinal_subset(esk18_0,esk19_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
fof(c_0_26,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X2,X1)
& X1 != X2
& ~ in(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
cnf(c_0_27,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ordinal_subset(esk19_0,esk18_0)
| ordinal_subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X74,X75] :
( in(X75,X74)
| X74 = X75
| in(X74,X75)
| ~ ordinal(X75)
| ~ ordinal(X74) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_30,negated_conjecture,
( ordinal_subset(esk19_0,esk18_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]),c_0_21])]) ).
fof(c_0_31,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( X38 = set_union2(X36,X37)
| in(esk3_3(X36,X37,X38),X37)
| 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),X38)
| ~ in(esk3_3(X36,X37,X38),X37) )
& ( X38 = set_union2(X36,X37)
| ~ in(esk3_3(X36,X37,X38),X38)
| ~ in(esk3_3(X36,X37,X38),X36) )
& ( X33 != set_union2(X31,X32)
| in(X35,X33)
| ~ in(X35,X32) )
& ( X33 != set_union2(X31,X32)
| in(X35,X33)
| ~ in(X35,X31) )
& ( X33 != set_union2(X31,X32)
| in(X34,X32)
| in(X34,X31)
| ~ in(X34,X33) ) ),
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_xboole_0])])])])])])]) ).
cnf(c_0_32,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| in(X2,X1)
| X1 = X2
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( subset(esk19_0,esk18_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_21]),c_0_20])]) ).
cnf(c_0_35,plain,
( X3 != set_union2(X2,X4)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ ordinal(X1)
| in(X1,esk19_0)
| in(esk19_0,X1)
| esk19_0 = X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| subset(esk19_0,esk18_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_20]),c_0_21])]) ).
cnf(c_0_38,plain,
( ~ in(X1,X2)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( in(esk19_0,esk18_0)
| in(esk18_0,esk19_0)
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
fof(c_0_40,plain,
! [X17,X18] :
( ( X17 = X18
| ~ subset(X18,X17)
| ~ subset(X17,X18) )
& ( X17 != X18
| subset(X18,X17) )
& ( X17 != X18
| subset(X17,X18) ) ),
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_41,negated_conjecture,
( ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))
| subset(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( in(esk19_0,esk18_0)
| in(esk18_0,set_union2(esk19_0,X1))
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_43,plain,
! [X27,X28,X29] :
( ( epsilon_transitive(X29)
| ~ subset(esk2_1(X29),X29) )
& ( epsilon_transitive(X29)
| in(esk2_1(X29),X29) )
& ( subset(X28,X27)
| ~ in(X28,X27)
| ~ epsilon_transitive(X27) ) ),
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])])])])])])]) ).
cnf(c_0_44,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( in(esk19_0,esk18_0)
| subset(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( X2 != set_union2(X3,X4)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_47,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| in(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_49,plain,
! [X8] :
( ( ~ ordinal(X8)
| epsilon_connected(X8) )
& ( ~ ordinal(X8)
| epsilon_transitive(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
cnf(c_0_50,plain,
( ~ in(X1,set_union2(X3,X2))
| in(X1,X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_46]) ).
fof(c_0_51,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( X25 = singleton(X24)
| esk1_2(X24,X25) = X24
| in(esk1_2(X24,X25),X25) )
& ( X25 = singleton(X24)
| esk1_2(X24,X25) != X24
| ~ in(esk1_2(X24,X25),X25) )
& ( X21 != singleton(X20)
| in(X23,X21)
| X23 != X20 )
& ( X21 != singleton(X20)
| X22 = X20
| ~ in(X22,X21) ) ),
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)],[d1_tarski])])])])])])]) ).
cnf(c_0_52,negated_conjecture,
( ~ epsilon_transitive(esk19_0)
| in(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_48]) ).
cnf(c_0_53,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_54,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_55,negated_conjecture,
( in(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_56,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( in(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_20])]) ).
fof(c_0_58,plain,
! [X5,X6] :
( ~ in(X6,X5)
| ~ in(X5,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_59,negated_conjecture,
( in(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0))
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_55]),c_0_20]),c_0_21])]) ).
cnf(c_0_60,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ epsilon_transitive(esk18_0)
| subset(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_47,c_0_57]) ).
cnf(c_0_62,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_64,plain,
( X3 != singleton(X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_65,negated_conjecture,
( ~ subset(esk19_0,esk18_0)
| in(esk18_0,esk19_0)
| esk18_0 = esk19_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_59]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( subset(esk19_0,esk18_0)
| esk18_0 = esk19_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_53]),c_0_21])]) ).
cnf(c_0_67,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| esk18_0 = esk19_0 ),
inference(spm,[status(thm)],[c_0_62,c_0_57]) ).
cnf(c_0_68,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_69,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_64])]) ).
fof(c_0_70,plain,
! [X68] : subset(X68,X68),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_71,negated_conjecture,
esk18_0 = esk19_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_72,plain,
in(X1,set_union2(X2,singleton(X1))),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_74,negated_conjecture,
~ ordinal_subset(esk19_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_71]),c_0_71]),c_0_72])]) ).
cnf(c_0_75,plain,
( ~ ordinal(X1)
| ordinal_subset(X1,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM401+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 02:26:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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/benchmark/theBenchmark.p
% 0.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3947593 completed with status 0
% 0.14/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.14/0.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.50 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3947609 completed with status 0
% 0.14/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.50 % Preprocessing time : 0.004 s
% 0.14/0.50 % Presaturation interreduction done
% 0.14/0.50
% 0.14/0.50 % Proof found!
% 0.14/0.50 % SZS status Theorem
% 0.14/0.50 % SZS output start CNFRefutation
% See solution above
% 0.14/0.50 % Parsed axioms : 54
% 0.14/0.50 % Removed by relevancy pruning/SinE : 0
% 0.14/0.50 % Initial clauses : 112
% 0.14/0.50 % Removed in clause preprocessing : 3
% 0.14/0.50 % Initial clauses in saturation : 109
% 0.14/0.50 % Processed clauses : 763
% 0.14/0.50 % ...of these trivial : 12
% 0.14/0.50 % ...subsumed : 380
% 0.14/0.50 % ...remaining for further processing : 371
% 0.14/0.50 % Other redundant clauses eliminated : 14
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 22
% 0.14/0.50 % Backward-rewritten : 80
% 0.14/0.50 % Generated clauses : 1263
% 0.14/0.50 % ...of the previous two non-redundant : 1183
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 7
% 0.14/0.50 % Paramodulations : 1240
% 0.14/0.50 % Factorizations : 10
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 14
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 353
% 0.14/0.50 % ...of those cached : 300
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 162
% 0.14/0.50 % Positive orientable unit clauses : 54
% 0.14/0.50 % Positive unorientable unit clauses: 1
% 0.14/0.50 % Negative unit clauses : 13
% 0.14/0.50 % Non-unit-clauses : 94
% 0.14/0.50 % Current number of unprocessed clauses: 608
% 0.14/0.50 % ...number of literals in the above : 2273
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 203
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 8048
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 6119
% 0.14/0.50 % Non-unit clause-clause subsumptions : 281
% 0.14/0.50 % Unit Clause-clause subsumption calls : 718
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 47
% 0.14/0.50 % BW rewrite match successes : 31
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 17918
% 0.14/0.50 % Search garbage collected termcells : 934
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.072 s
% 0.14/0.50 % System time : 0.009 s
% 0.14/0.50 % Total time : 0.080 s
% 0.14/0.50 % Maximum resident set size: 3616 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.300 s
% 0.14/0.50 % System time : 0.033 s
% 0.14/0.50 % Total time : 0.334 s
% 0.14/0.50 % Maximum resident set size: 4864 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------