%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU244+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:24:26 PM UTC 2026
% Result : Theorem 25.19s 14.39s
% Output : CNFRefutation 25.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 4 unt; 0 def)
% Number of atoms : 228 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 298 ( 126 ~; 129 |; 25 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14_relat_2) ).
fof(d5_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( well_orders(X1,X2)
<=> ( is_well_founded_in(X1,X2)
& is_connected_in(X1,X2)
& is_antisymmetric_in(X1,X2)
& is_transitive_in(X1,X2)
& is_reflexive_in(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_wellord1) ).
fof(t8_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_wellord1) ).
fof(d12_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> is_antisymmetric_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_2) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d16_relat_2) ).
fof(t5_wellord1,lemma,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord1) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( well_founded_relation(X1)
& connected(X1)
& antisymmetric(X1)
& transitive(X1)
& reflexive(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(c_0_8,plain,
! [X98] :
( ( ~ relation(X98)
| connected(X98)
| ~ is_connected_in(X98,relation_field(X98)) )
& ( ~ relation(X98)
| is_connected_in(X98,relation_field(X98))
| ~ connected(X98) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])])]) ).
fof(c_0_9,plain,
! [X311,X312] :
( ( ~ relation(X311)
| well_orders(X311,X312)
| ~ is_well_founded_in(X311,X312)
| ~ is_connected_in(X311,X312)
| ~ is_antisymmetric_in(X311,X312)
| ~ is_transitive_in(X311,X312)
| ~ is_reflexive_in(X311,X312) )
& ( ~ relation(X311)
| ~ well_orders(X311,X312)
| is_well_founded_in(X311,X312) )
& ( ~ relation(X311)
| ~ well_orders(X311,X312)
| is_connected_in(X311,X312) )
& ( ~ relation(X311)
| ~ well_orders(X311,X312)
| is_antisymmetric_in(X311,X312) )
& ( ~ relation(X311)
| ~ well_orders(X311,X312)
| is_transitive_in(X311,X312) )
& ( ~ relation(X311)
| ~ well_orders(X311,X312)
| is_reflexive_in(X311,X312) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_wellord1])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
inference(assume_negation,[status(cth)],[t8_wellord1]) ).
fof(c_0_11,plain,
! [X65] :
( ( ~ relation(X65)
| antisymmetric(X65)
| ~ is_antisymmetric_in(X65,relation_field(X65)) )
& ( ~ relation(X65)
| is_antisymmetric_in(X65,relation_field(X65))
| ~ antisymmetric(X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_relat_2])])])]) ).
fof(c_0_12,plain,
! [X99] :
( ( ~ relation(X99)
| transitive(X99)
| ~ is_transitive_in(X99,relation_field(X99)) )
& ( ~ relation(X99)
| is_transitive_in(X99,relation_field(X99))
| ~ transitive(X99) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])])]) ).
fof(c_0_13,lemma,
! [X747] :
( ( ~ relation(X747)
| well_founded_relation(X747)
| ~ is_well_founded_in(X747,relation_field(X747)) )
& ( ~ relation(X747)
| is_well_founded_in(X747,relation_field(X747))
| ~ well_founded_relation(X747) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_wellord1])])])]) ).
fof(c_0_14,plain,
! [X367] :
( ( ~ relation(X367)
| reflexive(X367)
| ~ is_reflexive_in(X367,relation_field(X367)) )
& ( ~ relation(X367)
| is_reflexive_in(X367,relation_field(X367))
| ~ reflexive(X367) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])])]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1))
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,negated_conjecture,
( ( well_ordering(esk120_0)
| well_orders(esk120_0,relation_field(esk120_0)) )
& ( ~ well_ordering(esk120_0)
| ~ well_orders(esk120_0,relation_field(esk120_0)) )
& relation(esk120_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_antisymmetric_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1))
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_transitive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,lemma,
( ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_well_founded_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X277] :
( ( ~ relation(X277)
| well_ordering(X277)
| ~ well_founded_relation(X277)
| ~ connected(X277)
| ~ antisymmetric(X277)
| ~ transitive(X277)
| ~ reflexive(X277) )
& ( ~ relation(X277)
| ~ well_ordering(X277)
| well_founded_relation(X277) )
& ( ~ relation(X277)
| ~ well_ordering(X277)
| connected(X277) )
& ( ~ relation(X277)
| ~ well_ordering(X277)
| antisymmetric(X277) )
& ( ~ relation(X277)
| ~ well_ordering(X277)
| transitive(X277) )
& ( ~ relation(X277)
| ~ well_ordering(X277)
| reflexive(X277) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| connected(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( well_ordering(esk120_0)
| well_orders(esk120_0,relation_field(esk120_0)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
relation(esk120_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_31,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| transitive(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_32,lemma,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_33,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| reflexive(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( connected(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
( antisymmetric(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_29])]) ).
cnf(c_0_37,negated_conjecture,
( transitive(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_29])]) ).
cnf(c_0_38,negated_conjecture,
( well_founded_relation(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29])]) ).
cnf(c_0_39,negated_conjecture,
( well_ordering(esk120_0)
| reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_29])]) ).
cnf(c_0_40,plain,
( ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ is_connected_in(X1,X2)
| ~ is_antisymmetric_in(X1,X2)
| ~ is_transitive_in(X1,X2)
| ~ is_reflexive_in(X1,X2)
| well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
( ~ relation(X1)
| ~ transitive(X1)
| is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,negated_conjecture,
( ~ well_ordering(esk120_0)
| ~ well_orders(esk120_0,relation_field(esk120_0)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_43,negated_conjecture,
well_ordering(esk120_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29])]),c_0_36]),c_0_37]),c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
( ~ transitive(X1)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ is_reflexive_in(X1,relation_field(X1))
| ~ is_well_founded_in(X1,relation_field(X1))
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,lemma,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| is_well_founded_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_47,plain,
( ~ relation(X1)
| ~ connected(X1)
| is_connected_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_48,plain,
( ~ relation(X1)
| ~ antisymmetric(X1)
| is_antisymmetric_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_50,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_51,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_52,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_53,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_54,negated_conjecture,
~ well_orders(esk120_0,relation_field(esk120_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_55,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_44,c_0_45,c_0_46,c_0_47,c_0_48,c_0_49,c_0_50,c_0_51,c_0_52,c_0_53,c_0_54,c_0_43,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU244+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/10.65 % Computer : n013.cluster.edu
% 0.17/10.65 % Model : x86_64 x86_64
% 0.17/10.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.65 % Memory : 8046.5625MB
% 0.17/10.65 % OS : Linux 6.8.0-71-generic
% 0.17/10.65 % CPULimit : 300
% 0.17/10.65 % WCLimit : 300
% 0.17/10.65 % DateTime : Mon Sep 21 06:02:46 UTC 2026
% 0.17/10.66 % CPUTime :
% 0.17/10.66 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/10.69 Running first-order theorem proving
% 0.17/10.69 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
% 25.19/14.39 % Version: 3.5.1
% 25.19/14.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 25.19/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.19/14.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 25.19/14.39 % Starting new_bool_3 with 300s (1) cores
% 25.19/14.39 % Starting new_bool_1 with 300s (1) cores
% 25.19/14.39 % Starting sh5l with 300s (1) cores
% 25.19/14.39 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 89169 completed with status 0
% 25.19/14.39 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 25.19/14.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 25.19/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.19/14.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 25.19/14.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 25.19/14.39 % No SInE strategy applied
% 25.19/14.39 % Search class: FGHSM-FSLM32-MFFFFFNN
% 25.19/14.39 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 25.19/14.39 % Starting SubtermCWHack with 136s (1) cores
% 25.19/14.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 25.19/14.39 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 25.19/14.39 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 25.19/14.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 25.19/14.39 % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 89179 completed with status 0
% 25.19/14.39 % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 25.19/14.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 25.19/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.19/14.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 25.19/14.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 25.19/14.39 % No SInE strategy applied
% 25.19/14.39 % Search class: FGHSM-FSLM32-MFFFFFNN
% 25.19/14.39 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 25.19/14.39 % Starting SubtermCWHack with 136s (1) cores
% 25.19/14.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 25.19/14.39 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 25.19/14.39 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 25.19/14.39 % Preprocessing time : 0.012 s
% 25.19/14.39 % Presaturation interreduction done
% 25.19/14.39 % SatCheck found unsatisfiable ground set
% 25.19/14.39
% 25.19/14.39 % Proof found!
% 25.19/14.39 % SZS status Theorem
% 25.19/14.39 % SZS output start CNFRefutation
% See solution above
% 25.19/14.39 % Parsed axioms : 299
% 25.19/14.39 % Removed by relevancy pruning/SinE : 0
% 25.19/14.39 % Initial clauses : 646
% 25.19/14.39 % Removed in clause preprocessing : 30
% 25.19/14.39 % Initial clauses in saturation : 616
% 25.19/14.39 % Processed clauses : 13592
% 25.19/14.39 % ...of these trivial : 69
% 25.19/14.39 % ...subsumed : 8523
% 25.19/14.39 % ...remaining for further processing : 5000
% 25.19/14.39 % Other redundant clauses eliminated : 304
% 25.19/14.39 % Clauses deleted for lack of memory : 0
% 25.19/14.39 % Backward-subsumed : 103
% 25.19/14.39 % Backward-rewritten : 100
% 25.19/14.39 % Generated clauses : 123582
% 25.19/14.39 % ...of the previous two non-redundant : 108716
% 25.19/14.39 % ...aggressively subsumed : 0
% 25.19/14.39 % Contextual simplify-reflections : 107
% 25.19/14.39 % Paramodulations : 123268
% 25.19/14.39 % Factorizations : 14
% 25.19/14.39 % NegExts : 0
% 25.19/14.39 % Equation resolutions : 309
% 25.19/14.39 % Disequality decompositions : 0
% 25.19/14.39 % Total rewrite steps : 50618
% 25.19/14.39 % ...of those cached : 49492
% 25.19/14.39 % Propositional unsat checks : 1
% 25.19/14.39 % Propositional check models : 0
% 25.19/14.39 % Propositional check unsatisfiable : 1
% 25.19/14.39 % Propositional clauses : 100241
% 25.19/14.39 % Propositional clauses after purity: 6357
% 25.19/14.39 % Propositional unsat core size : 13
% 25.19/14.39 % Propositional preprocessing time : 0.000
% 25.19/14.39 % Propositional encoding time : 0.276
% 25.19/14.39 % Propositional solver time : 0.031
% 25.19/14.39 % Success case prop preproc time : 0.000
% 25.19/14.39 % Success case prop encoding time : 0.276
% 25.19/14.39 % Success case prop solver time : 0.031
% 25.19/14.39 % Current number of processed clauses : 4145
% 25.19/14.39 % Positive orientable unit clauses : 197
% 25.19/14.39 % Positive unorientable unit clauses: 3
% 25.19/14.39 % Negative unit clauses : 119
% 25.19/14.39 % Non-unit-clauses : 3826
% 25.19/14.39 % Current number of unprocessed clauses: 96096
% 25.19/14.39 % ...number of literals in the above : 349622
% 25.19/14.39 % Current number of archived formulas : 0
% 25.19/14.39 % Current number of archived clauses : 768
% 25.19/14.39 % Clause-clause subsumption calls (NU) : 3548941
% 25.19/14.39 % Rec. Clause-clause subsumption calls : 2361182
% 25.19/14.39 % Non-unit clause-clause subsumptions : 7184
% 25.19/14.39 % Unit Clause-clause subsumption calls : 14413
% 25.19/14.39 % Rewrite failures with RHS unbound : 0
% 25.19/14.39 % BW rewrite match attempts : 126
% 25.19/14.39 % BW rewrite match successes : 84
% 25.19/14.39 % Condensation attempts : 0
% 25.19/14.39 % Condensation successes : 0
% 25.19/14.39 % Termbank termtop insertions : 3273475
% 25.19/14.39 % Search garbage collected termcells : 11152
% 25.19/14.39
% 25.19/14.39 % -------------------------------------------------
% 25.19/14.39 % User time : 3.440 s
% 25.19/14.39 % System time : 0.142 s
% 25.19/14.39 % Total time : 3.583 s
% 25.19/14.39 % Maximum resident set size: 5748 pages
% 25.19/14.39
% 25.19/14.39 % -------------------------------------------------
% 25.19/14.39 % User time : 17.098 s
% 25.19/14.39 % System time : 0.635 s
% 25.19/14.39 % Total time : 17.733 s
% 25.19/14.39 % Maximum resident set size: 4864 pages
% 25.19/14.39 % E exiting
%------------------------------------------------------------------------------