%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU238+3 : 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 02:28:41 PM UTC 2026
% Result : Theorem 0.45s 0.54s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 11 unt; 0 def)
% Number of atoms : 224 ( 27 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 286 ( 122 ~; 103 |; 37 &)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ordinal(succ(X1))
& epsilon_connected(succ(X1))
& epsilon_transitive(succ(X1))
& ~ empty(succ(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( X1 != X2
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(t33_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(t41_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_ordinal1) ).
fof(t42_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( being_limit_ordinal(X1)
& ? [X2] :
( X1 = succ(X2)
& ordinal(X2) ) )
& ~ ( ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) )
& ~ being_limit_ordinal(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t42_ordinal1) ).
fof(t21_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_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(c_0_10,plain,
! [X1] :
( ordinal(X1)
=> ( ordinal(succ(X1))
& epsilon_connected(succ(X1))
& epsilon_transitive(succ(X1))
& ~ empty(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
fof(c_0_11,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_12,plain,
! [X51] : in(X51,succ(X51)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_13,plain,
! [X18] : succ(X18) = set_union2(X18,singleton(X18)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_14,plain,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( X1 != X2
& subset(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[d8_xboole_0]) ).
fof(c_0_15,plain,
! [X59,X60] :
( ( ~ ordinal(X59)
| ~ ordinal(X60)
| in(X59,X60)
| ~ ordinal_subset(succ(X59),X60) )
& ( ~ ordinal(X59)
| ~ ordinal(X60)
| ordinal_subset(succ(X59),X60)
| ~ in(X59,X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_ordinal1])])])])]) ).
fof(c_0_16,plain,
! [X28] :
( ( ~ ordinal(X28)
| ordinal(succ(X28)) )
& ( ~ ordinal(X28)
| epsilon_connected(succ(X28)) )
& ( ~ ordinal(X28)
| epsilon_transitive(succ(X28)) )
& ( ~ ordinal(X28)
| ~ empty(succ(X28)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_17,plain,
! [X4,X5] :
( ~ in(X5,X4)
| ~ in(X4,X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_18,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X63,X64] :
( ( ~ ordinal(X63)
| being_limit_ordinal(X63)
| ~ in(succ(esk15_1(X63)),X63) )
& ( ~ ordinal(X63)
| being_limit_ordinal(X63)
| in(esk15_1(X63),X63) )
& ( ~ ordinal(X63)
| being_limit_ordinal(X63)
| ordinal(esk15_1(X63)) )
& ( ~ ordinal(X63)
| in(succ(X64),X63)
| ~ in(X64,X63)
| ~ ordinal(X64)
| ~ being_limit_ordinal(X63) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t41_ordinal1])])])])])]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( being_limit_ordinal(X1)
& ? [X2] :
( X1 = succ(X2)
& ordinal(X2) ) )
& ~ ( ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) )
& ~ being_limit_ordinal(X1) ) ) ),
inference(assume_negation,[status(cth)],[t42_ordinal1]) ).
fof(c_0_22,plain,
! [X55,X56] :
( in(X55,X56)
| ~ proper_subset(X55,X56)
| ~ ordinal(X56)
| ~ epsilon_transitive(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_ordinal1])])])]) ).
fof(c_0_23,plain,
! [X19,X20] :
( ( proper_subset(X19,X20)
| X19 = X20
| ~ subset(X19,X20) )
& ( ~ proper_subset(X19,X20)
| X19 != X20 )
& ( ~ proper_subset(X19,X20)
| subset(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_24,plain,
! [X46,X47] :
( ( ~ ordinal(X47)
| ~ ordinal(X46)
| ordinal_subset(X46,X47)
| ~ subset(X46,X47) )
& ( ~ ordinal(X47)
| ~ ordinal(X46)
| subset(X46,X47)
| ~ ordinal_subset(X46,X47) ) ),
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_25,plain,
( ~ ordinal(X1)
| ~ ordinal(X2)
| ~ in(X1,X2)
| ordinal_subset(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ ordinal(X1)
| ordinal(succ(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
( ~ ordinal(X1)
| ~ in(X2,X1)
| ~ ordinal(X2)
| ~ being_limit_ordinal(X1)
| in(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_30,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( being_limit_ordinal(X1)
& ? [X2] :
( X1 = succ(X2)
& ordinal(X2) ) )
& ~ ( ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) )
& ~ being_limit_ordinal(X1) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( ~ proper_subset(X1,X2)
| ~ ordinal(X2)
| ~ epsilon_transitive(X1)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( ~ subset(X1,X2)
| proper_subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ordinal_subset(set_union2(X1,singleton(X1)),X2) ),
inference(rw,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_35,plain,
( ~ ordinal(X1)
| ordinal(set_union2(X1,singleton(X1))) ),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_36,plain,
( ~ ordinal(X1)
| epsilon_transitive(succ(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,plain,
( ~ in(X2,X1)
| ~ being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| in(set_union2(X2,singleton(X2)),X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_39,negated_conjecture,
! [X67] :
( ( esk16_0 != succ(X67)
| ~ ordinal(X67)
| being_limit_ordinal(esk16_0) )
& ( esk16_0 != succ(X67)
| ~ ordinal(X67)
| esk16_0 = succ(esk17_0) )
& ( esk16_0 != succ(X67)
| ~ ordinal(X67)
| ordinal(esk17_0) )
& ( ~ being_limit_ordinal(esk16_0)
| being_limit_ordinal(esk16_0) )
& ( ~ being_limit_ordinal(esk16_0)
| esk16_0 = succ(esk17_0) )
& ( ~ being_limit_ordinal(esk16_0)
| ordinal(esk17_0) )
& ordinal(esk16_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])])]) ).
cnf(c_0_40,plain,
( ~ ordinal(X1)
| ~ in(succ(esk15_1(X1)),X1)
| being_limit_ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_41,plain,
( ~ ordinal(X2)
| ~ epsilon_transitive(X1)
| ~ subset(X1,X2)
| in(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| subset(set_union2(X1,singleton(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,plain,
( ~ ordinal(X1)
| epsilon_transitive(set_union2(X1,singleton(X1))) ),
inference(rw,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_44,plain,
( ~ in(X1,X1)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( ~ being_limit_ordinal(esk16_0)
| esk16_0 = succ(esk17_0) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( esk16_0 != succ(X1)
| ~ ordinal(X1)
| being_limit_ordinal(esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( ~ in(set_union2(esk15_1(X1),singleton(esk15_1(X1))),X1)
| ~ ordinal(X1)
| being_limit_ordinal(X1) ),
inference(rw,[status(thm)],[c_0_40,c_0_19]) ).
cnf(c_0_48,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| in(set_union2(X1,singleton(X1)),X2)
| set_union2(X1,singleton(X1)) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_49,plain,
( ~ ordinal(X1)
| being_limit_ordinal(X1)
| in(esk15_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_50,plain,
( ~ ordinal(X1)
| being_limit_ordinal(X1)
| ordinal(esk15_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_51,plain,
( ~ ordinal(X1)
| ~ being_limit_ordinal(set_union2(X1,singleton(X1))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_28])]),c_0_35]) ).
cnf(c_0_52,negated_conjecture,
( ~ being_limit_ordinal(esk16_0)
| esk16_0 = set_union2(esk17_0,singleton(esk17_0)) ),
inference(rw,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( ~ being_limit_ordinal(esk16_0)
| ordinal(esk17_0) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_54,negated_conjecture,
( ~ ordinal(X1)
| esk16_0 != set_union2(X1,singleton(X1))
| being_limit_ordinal(esk16_0) ),
inference(rw,[status(thm)],[c_0_46,c_0_19]) ).
cnf(c_0_55,plain,
( ~ ordinal(X1)
| being_limit_ordinal(X1)
| set_union2(esk15_1(X1),singleton(esk15_1(X1))) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_56,negated_conjecture,
~ being_limit_ordinal(esk16_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( ~ ordinal(X1)
| X1 != esk16_0
| being_limit_ordinal(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
ordinal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU238+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 06:01:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.45/0.54 % Version: 3.5.1
% 0.45/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.54 % Starting sh5l with 300s (1) cores
% 0.45/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 87419 completed with status 0
% 0.45/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.45/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.54 % No SInE strategy applied
% 0.45/0.54 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.45/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.54 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.45/0.54 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.45/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.45/0.54 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 87429 completed with status 0
% 0.45/0.54 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.45/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.54 % No SInE strategy applied
% 0.45/0.54 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.45/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.54 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.45/0.54 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.45/0.54 % Preprocessing time : 0.003 s
% 0.45/0.54
% 0.45/0.54 % Proof found!
% 0.45/0.54 % SZS status Theorem
% 0.45/0.54 % SZS output start CNFRefutation
% See solution above
% 0.45/0.54 % Parsed axioms : 54
% 0.45/0.54 % Removed by relevancy pruning/SinE : 0
% 0.45/0.54 % Initial clauses : 109
% 0.45/0.54 % Removed in clause preprocessing : 4
% 0.45/0.54 % Initial clauses in saturation : 105
% 0.45/0.54 % Processed clauses : 628
% 0.45/0.54 % ...of these trivial : 9
% 0.45/0.54 % ...subsumed : 242
% 0.45/0.54 % ...remaining for further processing : 377
% 0.45/0.54 % Other redundant clauses eliminated : 1
% 0.45/0.54 % Clauses deleted for lack of memory : 0
% 0.45/0.54 % Backward-subsumed : 25
% 0.45/0.54 % Backward-rewritten : 24
% 0.45/0.54 % Generated clauses : 1187
% 0.45/0.54 % ...of the previous two non-redundant : 1069
% 0.45/0.54 % ...aggressively subsumed : 0
% 0.45/0.54 % Contextual simplify-reflections : 29
% 0.45/0.54 % Paramodulations : 1186
% 0.45/0.54 % Factorizations : 0
% 0.45/0.54 % NegExts : 0
% 0.45/0.54 % Equation resolutions : 1
% 0.45/0.54 % Disequality decompositions : 0
% 0.45/0.54 % Total rewrite steps : 493
% 0.45/0.54 % ...of those cached : 451
% 0.45/0.54 % Propositional unsat checks : 0
% 0.45/0.54 % Propositional check models : 0
% 0.45/0.54 % Propositional check unsatisfiable : 0
% 0.45/0.54 % Propositional clauses : 0
% 0.45/0.54 % Propositional clauses after purity: 0
% 0.45/0.54 % Propositional unsat core size : 0
% 0.45/0.54 % Propositional preprocessing time : 0.000
% 0.45/0.54 % Propositional encoding time : 0.000
% 0.45/0.54 % Propositional solver time : 0.000
% 0.45/0.54 % Success case prop preproc time : 0.000
% 0.45/0.54 % Success case prop encoding time : 0.000
% 0.45/0.54 % Success case prop solver time : 0.000
% 0.45/0.54 % Current number of processed clauses : 327
% 0.45/0.54 % Positive orientable unit clauses : 56
% 0.45/0.54 % Positive unorientable unit clauses: 1
% 0.45/0.54 % Negative unit clauses : 18
% 0.45/0.54 % Non-unit-clauses : 252
% 0.45/0.54 % Current number of unprocessed clauses: 469
% 0.45/0.54 % ...number of literals in the above : 2464
% 0.45/0.54 % Current number of archived formulas : 0
% 0.45/0.54 % Current number of archived clauses : 50
% 0.45/0.54 % Clause-clause subsumption calls (NU) : 16802
% 0.45/0.54 % Rec. Clause-clause subsumption calls : 6773
% 0.45/0.54 % Non-unit clause-clause subsumptions : 212
% 0.45/0.54 % Unit Clause-clause subsumption calls : 534
% 0.45/0.54 % Rewrite failures with RHS unbound : 0
% 0.45/0.54 % BW rewrite match attempts : 25
% 0.45/0.54 % BW rewrite match successes : 23
% 0.45/0.54 % Condensation attempts : 0
% 0.45/0.54 % Condensation successes : 0
% 0.45/0.54 % Termbank termtop insertions : 33131
% 0.45/0.54 % Search garbage collected termcells : 786
% 0.45/0.54
% 0.45/0.54 % -------------------------------------------------
% 0.45/0.54 % User time : 0.069 s
% 0.45/0.54 % System time : 0.006 s
% 0.45/0.54 % Total time : 0.075 s
% 0.45/0.54 % Maximum resident set size: 3676 pages
% 0.45/0.54
% 0.45/0.54 % -------------------------------------------------
% 0.45/0.54 % User time : 0.425 s
% 0.45/0.54 % System time : 0.024 s
% 0.45/0.54 % Total time : 0.449 s
% 0.45/0.54 % Maximum resident set size: 4608 pages
% 0.45/0.54 % E exiting
%------------------------------------------------------------------------------