%------------------------------------------------------------------------------
% File : E-SAT---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 : n001.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:42 PM UTC 2026
% Result : Theorem 41.13s 11.64s
% Output : CNFRefutation 41.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 7 unt; 0 def)
% Number of atoms : 247 ( 0 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 321 ( 139 ~; 139 |; 25 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 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 : 48 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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(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(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(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(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(c_0_8,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
inference(assume_negation,[status(cth)],[t8_wellord1]) ).
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,
( ( 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_8])])])]) ).
fof(c_0_11,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])])])]) ).
fof(c_0_12,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])])])]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_well_founded_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( well_ordering(esk120_0)
| well_orders(esk120_0,relation_field(esk120_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
relation(esk120_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,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])])])]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,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_21,lemma,
( ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( is_well_founded_in(esk120_0,relation_field(esk120_0))
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1))
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( is_connected_in(esk120_0,relation_field(esk120_0))
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_15])]) ).
fof(c_0_25,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])])])]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_antisymmetric_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_27,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])])])]) ).
cnf(c_0_28,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_transitive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| reflexive(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_30,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,lemma,
( well_founded_relation(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15])]) ).
cnf(c_0_32,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,negated_conjecture,
( connected(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15])]) ).
cnf(c_0_34,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( is_antisymmetric_in(esk120_0,relation_field(esk120_0))
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15])]) ).
cnf(c_0_36,plain,
( ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1))
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
( is_transitive_in(esk120_0,relation_field(esk120_0))
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_15])]) ).
cnf(c_0_38,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_20]) ).
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_29,c_0_14]),c_0_15])]) ).
cnf(c_0_40,lemma,
well_founded_relation(esk120_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_15])]) ).
cnf(c_0_41,negated_conjecture,
connected(esk120_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15])]) ).
cnf(c_0_42,negated_conjecture,
( antisymmetric(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15])]) ).
cnf(c_0_43,negated_conjecture,
( transitive(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_15])]) ).
cnf(c_0_44,negated_conjecture,
( ~ well_ordering(esk120_0)
| ~ well_orders(esk120_0,relation_field(esk120_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
well_ordering(esk120_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_15])]),c_0_42]),c_0_43]) ).
cnf(c_0_46,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_47,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,negated_conjecture,
~ well_orders(esk120_0,relation_field(esk120_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ reflexive(X1)
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ is_antisymmetric_in(esk120_0,relation_field(esk120_0))
| ~ is_connected_in(esk120_0,relation_field(esk120_0))
| ~ is_transitive_in(esk120_0,relation_field(esk120_0))
| ~ is_well_founded_in(esk120_0,relation_field(esk120_0))
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_15])]) ).
cnf(c_0_51,lemma,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| is_well_founded_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,lemma,
( ~ is_antisymmetric_in(esk120_0,relation_field(esk120_0))
| ~ is_connected_in(esk120_0,relation_field(esk120_0))
| ~ is_transitive_in(esk120_0,relation_field(esk120_0))
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]),c_0_15])]) ).
cnf(c_0_53,plain,
( ~ relation(X1)
| ~ connected(X1)
| is_connected_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_54,lemma,
( ~ is_antisymmetric_in(esk120_0,relation_field(esk120_0))
| ~ is_transitive_in(esk120_0,relation_field(esk120_0))
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_41]),c_0_15])]) ).
cnf(c_0_55,plain,
( ~ relation(X1)
| ~ antisymmetric(X1)
| is_antisymmetric_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_56,lemma,
( ~ antisymmetric(esk120_0)
| ~ is_transitive_in(esk120_0,relation_field(esk120_0))
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_15])]) ).
cnf(c_0_57,plain,
( ~ relation(X1)
| ~ transitive(X1)
| is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_58,lemma,
( ~ antisymmetric(esk120_0)
| ~ transitive(esk120_0)
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_15])]) ).
cnf(c_0_59,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_60,lemma,
( ~ antisymmetric(esk120_0)
| ~ transitive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_45]),c_0_15])]) ).
cnf(c_0_61,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_62,lemma,
~ antisymmetric(esk120_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_45]),c_0_15])]) ).
cnf(c_0_63,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_64,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_45]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU244+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 % Computer : n001.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Mon Sep 21 06:08:49 UTC 2026
% 0.16/5.45 % CPUTime :
% 0.16/5.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.52 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
% 41.13/11.64 % Version: 3.5.1
% 41.13/11.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 41.13/11.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.13/11.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 41.13/11.64 % Starting new_bool_3 with 300s (1) cores
% 41.13/11.64 % Starting new_bool_1 with 300s (1) cores
% 41.13/11.64 % Starting sh5l with 300s (1) cores
% 41.13/11.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2354495 completed with status 0
% 41.13/11.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 41.13/11.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 41.13/11.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.13/11.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 41.13/11.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 41.13/11.64 % No SInE strategy applied
% 41.13/11.64 % Search class: FGHSM-FSLM32-MFFFFFNN
% 41.13/11.64 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 41.13/11.64 % Starting SubtermCWHack with 136s (1) cores
% 41.13/11.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 41.13/11.64 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 41.13/11.64 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 41.13/11.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 41.13/11.64 % G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 2354506 completed with status 0
% 41.13/11.64 % Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 41.13/11.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 41.13/11.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.13/11.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 41.13/11.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 41.13/11.64 % No SInE strategy applied
% 41.13/11.64 % Search class: FGHSM-FSLM32-MFFFFFNN
% 41.13/11.64 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 41.13/11.64 % Starting SubtermCWHack with 136s (1) cores
% 41.13/11.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 41.13/11.64 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 41.13/11.64 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 41.13/11.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 41.13/11.64 % Preprocessing time : 0.012 s
% 41.13/11.64 % Presaturation interreduction done
% 41.13/11.64
% 41.13/11.64 % Proof found!
% 41.13/11.64 % SZS status Theorem
% 41.13/11.64 % SZS output start CNFRefutation
% See solution above
% 41.13/11.64 % Parsed axioms : 299
% 41.13/11.64 % Removed by relevancy pruning/SinE : 0
% 41.13/11.64 % Initial clauses : 646
% 41.13/11.64 % Removed in clause preprocessing : 30
% 41.13/11.64 % Initial clauses in saturation : 616
% 41.13/11.64 % Processed clauses : 14133
% 41.13/11.64 % ...of these trivial : 73
% 41.13/11.64 % ...subsumed : 9808
% 41.13/11.64 % ...remaining for further processing : 4252
% 41.13/11.64 % Other redundant clauses eliminated : 679
% 41.13/11.64 % Clauses deleted for lack of memory : 0
% 41.13/11.64 % Backward-subsumed : 254
% 41.13/11.64 % Backward-rewritten : 99
% 41.13/11.64 % Generated clauses : 146338
% 41.13/11.64 % ...of the previous two non-redundant : 135452
% 41.13/11.64 % ...aggressively subsumed : 0
% 41.13/11.64 % Contextual simplify-reflections : 147
% 41.13/11.64 % Paramodulations : 145546
% 41.13/11.64 % Factorizations : 119
% 41.13/11.64 % NegExts : 0
% 41.13/11.64 % Equation resolutions : 687
% 41.13/11.64 % Disequality decompositions : 0
% 41.13/11.64 % Total rewrite steps : 29697
% 41.13/11.64 % ...of those cached : 28287
% 41.13/11.64 % Propositional unsat checks : 0
% 41.13/11.64 % Propositional check models : 0
% 41.13/11.64 % Propositional check unsatisfiable : 0
% 41.13/11.64 % Propositional clauses : 0
% 41.13/11.64 % Propositional clauses after purity: 0
% 41.13/11.64 % Propositional unsat core size : 0
% 41.13/11.64 % Propositional preprocessing time : 0.000
% 41.13/11.64 % Propositional encoding time : 0.000
% 41.13/11.64 % Propositional solver time : 0.000
% 41.13/11.64 % Success case prop preproc time : 0.000
% 41.13/11.64 % Success case prop encoding time : 0.000
% 41.13/11.64 % Success case prop solver time : 0.000
% 41.13/11.64 % Current number of processed clauses : 3252
% 41.13/11.64 % Positive orientable unit clauses : 163
% 41.13/11.64 % Positive unorientable unit clauses: 3
% 41.13/11.64 % Negative unit clauses : 533
% 41.13/11.64 % Non-unit-clauses : 2553
% 41.13/11.64 % Current number of unprocessed clauses: 122012
% 41.13/11.64 % ...number of literals in the above : 467803
% 41.13/11.64 % Current number of archived formulas : 0
% 41.13/11.64 % Current number of archived clauses : 913
% 41.13/11.64 % Clause-clause subsumption calls (NU) : 1803190
% 41.13/11.64 % Rec. Clause-clause subsumption calls : 1122593
% 41.13/11.64 % Non-unit clause-clause subsumptions : 5477
% 41.13/11.64 % Unit Clause-clause subsumption calls : 45097
% 41.13/11.64 % Rewrite failures with RHS unbound : 0
% 41.13/11.64 % BW rewrite match attempts : 182
% 41.13/11.64 % BW rewrite match successes : 109
% 41.13/11.64 % Condensation attempts : 0
% 41.13/11.64 % Condensation successes : 0
% 41.13/11.64 % Termbank termtop insertions : 1975107
% 41.13/11.64 % Search garbage collected termcells : 11152
% 41.13/11.64
% 41.13/11.64 % -------------------------------------------------
% 41.13/11.64 % User time : 5.652 s
% 41.13/11.64 % System time : 0.204 s
% 41.13/11.64 % Total time : 5.856 s
% 41.13/11.64 % Maximum resident set size: 5748 pages
% 41.13/11.64
% 41.13/11.64 % -------------------------------------------------
% 41.13/11.64 % User time : 28.411 s
% 41.13/11.64 % System time : 0.936 s
% 41.13/11.64 % Total time : 29.347 s
% 41.13/11.64 % Maximum resident set size: 4864 pages
% 41.13/11.64 % E exiting
%------------------------------------------------------------------------------