%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU257+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:45 PM UTC 2026
% Result : Theorem 68.90s 10.72s
% Output : CNFRefutation 68.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 20 unt; 0 def)
% Number of atoms : 173 ( 7 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 191 ( 82 ~; 77 |; 12 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 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 : 86 ( 8 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t32_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_wellord1) ).
fof(t22_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_wellord1) ).
fof(t18_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_wellord1) ).
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/sandbox2/benchmark/theBenchmark.p',d4_wellord1) ).
fof(t31_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( well_founded_relation(X2)
=> well_founded_relation(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t31_wellord1) ).
fof(t24_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_wellord1) ).
fof(t23_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_wellord1) ).
fof(t25_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_wellord1) ).
fof(t94_relat_1,lemma,
! [X1,X2] :
( relation(X2)
=> relation_dom_restriction(X2,X1) = relation_composition(identity_relation(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_relat_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X2)
& relation(X1) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_relat_1) ).
fof(dt_k6_relat_1,axiom,
! [X1] : relation(identity_relation(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_relat_1) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t32_wellord1]) ).
fof(c_0_13,lemma,
! [X640,X641] :
( reflexive(relation_restriction(X641,X640))
| ~ reflexive(X641)
| ~ relation(X641) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t22_wellord1])])]) ).
fof(c_0_14,lemma,
! [X609,X610] :
( relation_restriction(X610,X609) = relation_rng_restriction(X609,relation_dom_restriction(X610,X609))
| ~ relation(X610) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t18_wellord1])])]) ).
fof(c_0_15,plain,
! [X285] :
( ( ~ relation(X285)
| well_ordering(X285)
| ~ well_founded_relation(X285)
| ~ connected(X285)
| ~ antisymmetric(X285)
| ~ transitive(X285)
| ~ reflexive(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| well_founded_relation(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| connected(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| antisymmetric(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| transitive(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| reflexive(X285) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
fof(c_0_16,negated_conjecture,
( ~ well_ordering(relation_restriction(esk109_0,esk108_0))
& well_ordering(esk109_0)
& relation(esk109_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_17,lemma,
! [X674,X675] :
( well_founded_relation(relation_restriction(X675,X674))
| ~ well_founded_relation(X675)
| ~ relation(X675) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t31_wellord1])])]) ).
fof(c_0_18,lemma,
! [X651,X652] :
( transitive(relation_restriction(X652,X651))
| ~ transitive(X652)
| ~ relation(X652) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_wellord1])])]) ).
fof(c_0_19,lemma,
! [X647,X648] :
( connected(relation_restriction(X648,X647))
| ~ connected(X648)
| ~ relation(X648) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_wellord1])])]) ).
fof(c_0_20,lemma,
! [X655,X656] :
( antisymmetric(relation_restriction(X656,X655))
| ~ antisymmetric(X656)
| ~ relation(X656) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t25_wellord1])])]) ).
cnf(c_0_21,lemma,
( ~ reflexive(X1)
| ~ relation(X1)
| reflexive(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,lemma,
( ~ relation(X1)
| relation_restriction(X1,X2) = relation_rng_restriction(X2,relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
well_ordering(esk109_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
relation(esk109_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,lemma,
( ~ well_founded_relation(X1)
| ~ relation(X1)
| well_founded_relation(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,lemma,
( ~ transitive(X1)
| ~ relation(X1)
| transitive(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,lemma,
( ~ connected(X1)
| ~ relation(X1)
| connected(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,lemma,
( ~ antisymmetric(X1)
| ~ relation(X1)
| antisymmetric(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_34,lemma,
! [X852,X853] :
( relation_dom_restriction(X853,X852) = relation_composition(identity_relation(X852),X853)
| ~ relation(X853) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t94_relat_1])])]) ).
cnf(c_0_35,negated_conjecture,
~ well_ordering(relation_restriction(esk109_0,esk108_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,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_15]) ).
cnf(c_0_37,lemma,
( ~ relation(X2)
| ~ reflexive(X2)
| reflexive(relation_rng_restriction(X1,relation_dom_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
reflexive(esk109_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_39,lemma,
( ~ relation(X2)
| ~ well_founded_relation(X2)
| well_founded_relation(relation_rng_restriction(X1,relation_dom_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_40,negated_conjecture,
well_founded_relation(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25])]) ).
cnf(c_0_41,lemma,
( ~ relation(X2)
| ~ transitive(X2)
| transitive(relation_rng_restriction(X1,relation_dom_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_42,negated_conjecture,
transitive(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_25])]) ).
cnf(c_0_43,lemma,
( ~ relation(X2)
| ~ connected(X2)
| connected(relation_rng_restriction(X1,relation_dom_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_44,negated_conjecture,
connected(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_25])]) ).
cnf(c_0_45,lemma,
( ~ relation(X2)
| ~ antisymmetric(X2)
| antisymmetric(relation_rng_restriction(X1,relation_dom_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_46,negated_conjecture,
antisymmetric(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_25])]) ).
fof(c_0_47,plain,
! [X385,X386] :
( relation(relation_composition(X385,X386))
| ~ relation(X386)
| ~ relation(X385) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])])]) ).
cnf(c_0_48,lemma,
( ~ relation(X1)
| relation_dom_restriction(X1,X2) = relation_composition(identity_relation(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_49,plain,
! [X389] : relation(identity_relation(X389)),
inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).
cnf(c_0_50,negated_conjecture,
( ~ relation(relation_restriction(esk109_0,esk108_0))
| ~ antisymmetric(relation_restriction(esk109_0,esk108_0))
| ~ connected(relation_restriction(esk109_0,esk108_0))
| ~ transitive(relation_restriction(esk109_0,esk108_0))
| ~ well_founded_relation(relation_restriction(esk109_0,esk108_0))
| ~ reflexive(relation_restriction(esk109_0,esk108_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_51,negated_conjecture,
reflexive(relation_rng_restriction(X1,relation_dom_restriction(esk109_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_25]),c_0_38])]) ).
cnf(c_0_52,negated_conjecture,
well_founded_relation(relation_rng_restriction(X1,relation_dom_restriction(esk109_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
transitive(relation_rng_restriction(X1,relation_dom_restriction(esk109_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_42])]) ).
cnf(c_0_54,negated_conjecture,
connected(relation_rng_restriction(X1,relation_dom_restriction(esk109_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_44])]) ).
cnf(c_0_55,negated_conjecture,
antisymmetric(relation_rng_restriction(X1,relation_dom_restriction(esk109_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_25]),c_0_46])]) ).
fof(c_0_56,plain,
! [X399,X400] :
( relation(relation_rng_restriction(X399,X400))
| ~ relation(X400) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])])]) ).
cnf(c_0_57,plain,
( ~ relation(X2)
| ~ relation(X1)
| relation(relation_composition(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_58,negated_conjecture,
relation_composition(identity_relation(X1),esk109_0) = relation_dom_restriction(esk109_0,X1),
inference(spm,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_59,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_60,lemma,
~ relation(relation_rng_restriction(esk108_0,relation_dom_restriction(esk109_0,esk108_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_22]),c_0_51]),c_0_52]),c_0_53]),c_0_54]),c_0_55]),c_0_25])]) ).
cnf(c_0_61,plain,
( ~ relation(X1)
| relation(relation_rng_restriction(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
relation(relation_dom_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_25]),c_0_59])]) ).
cnf(c_0_63,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU257+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n010.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 06:04:25 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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
% 68.90/10.72 % Version: 3.5.1
% 68.90/10.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 68.90/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.90/10.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 68.90/10.72 % Starting new_bool_3 with 300s (1) cores
% 68.90/10.72 % Starting new_bool_1 with 300s (1) cores
% 68.90/10.72 % Starting sh5l with 300s (1) cores
% 68.90/10.72 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 176191 completed with status 0
% 68.90/10.72 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 68.90/10.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 68.90/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.90/10.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 68.90/10.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 68.90/10.72 % No SInE strategy applied
% 68.90/10.72 % Search class: FGHSM-FSLM32-MFFFFFNN
% 68.90/10.72 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 68.90/10.72 % Starting SubtermCWHack with 136s (1) cores
% 68.90/10.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 68.90/10.72 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 68.90/10.72 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 68.90/10.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 68.90/10.72 % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 176200 completed with status 0
% 68.90/10.72 % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 68.90/10.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 68.90/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.90/10.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 68.90/10.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 68.90/10.72 % No SInE strategy applied
% 68.90/10.72 % Search class: FGHSM-FSLM32-MFFFFFNN
% 68.90/10.72 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 68.90/10.72 % Starting SubtermCWHack with 136s (1) cores
% 68.90/10.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 68.90/10.72 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 68.90/10.72 % Preprocessing time : 0.019 s
% 68.90/10.72 % Presaturation interreduction done
% 68.90/10.72
% 68.90/10.72 % Proof found!
% 68.90/10.72 % SZS status Theorem
% 68.90/10.72 % SZS output start CNFRefutation
% See solution above
% 68.90/10.72 % Parsed axioms : 316
% 68.90/10.72 % Removed by relevancy pruning/SinE : 0
% 68.90/10.72 % Initial clauses : 674
% 68.90/10.72 % Removed in clause preprocessing : 30
% 68.90/10.72 % Initial clauses in saturation : 644
% 68.90/10.72 % Processed clauses : 15895
% 68.90/10.72 % ...of these trivial : 318
% 68.90/10.72 % ...subsumed : 9756
% 68.90/10.72 % ...remaining for further processing : 5821
% 68.90/10.72 % Other redundant clauses eliminated : 318
% 68.90/10.72 % Clauses deleted for lack of memory : 0
% 68.90/10.72 % Backward-subsumed : 504
% 68.90/10.72 % Backward-rewritten : 127
% 68.90/10.72 % Generated clauses : 288126
% 68.90/10.72 % ...of the previous two non-redundant : 262897
% 68.90/10.72 % ...aggressively subsumed : 0
% 68.90/10.72 % Contextual simplify-reflections : 115
% 68.90/10.72 % Paramodulations : 287786
% 68.90/10.72 % Factorizations : 32
% 68.90/10.72 % NegExts : 0
% 68.90/10.72 % Equation resolutions : 325
% 68.90/10.72 % Disequality decompositions : 0
% 68.90/10.72 % Total rewrite steps : 62746
% 68.90/10.72 % ...of those cached : 61449
% 68.90/10.72 % Propositional unsat checks : 1
% 68.90/10.72 % Propositional check models : 0
% 68.90/10.72 % Propositional check unsatisfiable : 0
% 68.90/10.72 % Propositional clauses : 0
% 68.90/10.72 % Propositional clauses after purity: 0
% 68.90/10.72 % Propositional unsat core size : 0
% 68.90/10.72 % Propositional preprocessing time : 0.000
% 68.90/10.72 % Propositional encoding time : 0.572
% 68.90/10.72 % Propositional solver time : 0.342
% 68.90/10.72 % Success case prop preproc time : 0.000
% 68.90/10.72 % Success case prop encoding time : 0.000
% 68.90/10.72 % Success case prop solver time : 0.000
% 68.90/10.72 % Current number of processed clauses : 4515
% 68.90/10.72 % Positive orientable unit clauses : 421
% 68.90/10.72 % Positive unorientable unit clauses: 3
% 68.90/10.72 % Negative unit clauses : 164
% 68.90/10.72 % Non-unit-clauses : 3927
% 68.90/10.72 % Current number of unprocessed clauses: 242726
% 68.90/10.72 % ...number of literals in the above : 927689
% 68.90/10.72 % Current number of archived formulas : 0
% 68.90/10.72 % Current number of archived clauses : 1216
% 68.90/10.72 % Clause-clause subsumption calls (NU) : 3421790
% 68.90/10.72 % Rec. Clause-clause subsumption calls : 2520054
% 68.90/10.72 % Non-unit clause-clause subsumptions : 8400
% 68.90/10.72 % Unit Clause-clause subsumption calls : 235765
% 68.90/10.72 % Rewrite failures with RHS unbound : 0
% 68.90/10.72 % BW rewrite match attempts : 382
% 68.90/10.72 % BW rewrite match successes : 110
% 68.90/10.72 % Condensation attempts : 0
% 68.90/10.72 % Condensation successes : 0
% 68.90/10.72 % Termbank termtop insertions : 5488957
% 68.90/10.72 % Search garbage collected termcells : 11573
% 68.90/10.72
% 68.90/10.72 % -------------------------------------------------
% 68.90/10.72 % User time : 9.629 s
% 68.90/10.72 % System time : 0.314 s
% 68.90/10.72 % Total time : 9.943 s
% 68.90/10.72 % Maximum resident set size: 5772 pages
% 68.90/10.72
% 68.90/10.72 % -------------------------------------------------
% 68.90/10.72 % User time : 47.269 s
% 68.90/10.72 % System time : 1.546 s
% 68.90/10.72 % Total time : 48.816 s
% 68.90/10.72 % Maximum resident set size: 5120 pages
% 68.90/10.72 % E exiting
%------------------------------------------------------------------------------