%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU244+1 : 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 : n008.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 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 5 unt; 0 def)
% Number of atoms : 271 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 371 ( 165 ~; 163 |; 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 : 56 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',d5_wellord1) ).
fof(t5_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_wellord1) ).
fof(t8_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d12_relat_2) ).
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d14_relat_2) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d4_wellord1) ).
fof(c_0_8,plain,
! [X5,X6] :
( ( ~ relation(X5)
| well_orders(X5,X6)
| ~ is_well_founded_in(X5,X6)
| ~ is_connected_in(X5,X6)
| ~ is_antisymmetric_in(X5,X6)
| ~ is_transitive_in(X5,X6)
| ~ is_reflexive_in(X5,X6) )
& ( ~ relation(X5)
| ~ well_orders(X5,X6)
| is_well_founded_in(X5,X6) )
& ( ~ relation(X5)
| ~ well_orders(X5,X6)
| is_connected_in(X5,X6) )
& ( ~ relation(X5)
| ~ well_orders(X5,X6)
| is_antisymmetric_in(X5,X6) )
& ( ~ relation(X5)
| ~ well_orders(X5,X6)
| is_transitive_in(X5,X6) )
& ( ~ relation(X5)
| ~ well_orders(X5,X6)
| is_reflexive_in(X5,X6) ) ),
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_9,plain,
! [X7] :
( ( ~ relation(X7)
| well_founded_relation(X7)
| ~ is_well_founded_in(X7,relation_field(X7)) )
& ( ~ relation(X7)
| is_well_founded_in(X7,relation_field(X7))
| ~ well_founded_relation(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_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,
! [X9] :
( ( ~ relation(X9)
| antisymmetric(X9)
| ~ is_antisymmetric_in(X9,relation_field(X9)) )
& ( ~ relation(X9)
| is_antisymmetric_in(X9,relation_field(X9))
| ~ antisymmetric(X9) ) ),
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,
! [X8] :
( ( ~ relation(X8)
| connected(X8)
| ~ is_connected_in(X8,relation_field(X8)) )
& ( ~ relation(X8)
| is_connected_in(X8,relation_field(X8))
| ~ connected(X8) ) ),
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_13,plain,
! [X10] :
( ( ~ relation(X10)
| transitive(X10)
| ~ is_transitive_in(X10,relation_field(X10)) )
& ( ~ relation(X10)
| is_transitive_in(X10,relation_field(X10))
| ~ transitive(X10) ) ),
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_14,plain,
! [X11] :
( ( ~ relation(X11)
| reflexive(X11)
| ~ is_reflexive_in(X11,relation_field(X11)) )
& ( ~ relation(X11)
| is_reflexive_in(X11,relation_field(X11))
| ~ reflexive(X11) ) ),
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_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_8]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| is_well_founded_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_well_founded_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,negated_conjecture,
( ( well_ordering(esk1_0)
| well_orders(esk1_0,relation_field(esk1_0)) )
& ( ~ well_ordering(esk1_0)
| ~ well_orders(esk1_0,relation_field(esk1_0)) )
& relation(esk1_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_20,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_antisymmetric_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1))
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1))
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_transitive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| ~ well_orders(X1,X2)
| is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ well_founded_relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X4] :
( ( ~ relation(X4)
| well_ordering(X4)
| ~ well_founded_relation(X4)
| ~ connected(X4)
| ~ antisymmetric(X4)
| ~ transitive(X4)
| ~ reflexive(X4) )
& ( ~ relation(X4)
| ~ well_ordering(X4)
| well_founded_relation(X4) )
& ( ~ relation(X4)
| ~ well_ordering(X4)
| connected(X4) )
& ( ~ relation(X4)
| ~ well_ordering(X4)
| antisymmetric(X4) )
& ( ~ relation(X4)
| ~ well_ordering(X4)
| transitive(X4) )
& ( ~ relation(X4)
| ~ well_ordering(X4)
| reflexive(X4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
cnf(c_0_31,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( well_ordering(esk1_0)
| well_orders(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_35,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| connected(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_36,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| transitive(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_37,plain,
( ~ relation(X1)
| ~ well_orders(X1,relation_field(X1))
| reflexive(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_38,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ well_founded_relation(X1)
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( ~ relation(X1)
| ~ transitive(X1)
| is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,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_30]) ).
cnf(c_0_41,negated_conjecture,
( well_ordering(esk1_0)
| well_founded_relation(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
( antisymmetric(esk1_0)
| well_ordering(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_33])]) ).
cnf(c_0_43,negated_conjecture,
( connected(esk1_0)
| well_ordering(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_33])]) ).
cnf(c_0_44,negated_conjecture,
( transitive(esk1_0)
| well_ordering(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_33])]) ).
cnf(c_0_45,negated_conjecture,
( well_ordering(esk1_0)
| reflexive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_33])]) ).
cnf(c_0_46,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ transitive(X1)
| ~ reflexive(X1)
| ~ well_founded_relation(X1)
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( ~ relation(X1)
| ~ connected(X1)
| is_connected_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( ~ well_ordering(esk1_0)
| ~ well_orders(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,negated_conjecture,
well_ordering(esk1_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_40,c_0_41]),c_0_33])]),c_0_42]),c_0_43]),c_0_44]),c_0_45]) ).
cnf(c_0_50,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ connected(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| ~ well_founded_relation(X1)
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ relation(X1)
| ~ antisymmetric(X1)
| is_antisymmetric_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_52,negated_conjecture,
~ well_orders(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_53,plain,
( ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| ~ well_founded_relation(X1)
| well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( ~ antisymmetric(esk1_0)
| ~ connected(esk1_0)
| ~ transitive(esk1_0)
| ~ reflexive(esk1_0)
| ~ well_founded_relation(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33])]) ).
cnf(c_0_55,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_56,negated_conjecture,
( ~ antisymmetric(esk1_0)
| ~ connected(esk1_0)
| ~ transitive(esk1_0)
| ~ reflexive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]),c_0_33])]) ).
cnf(c_0_57,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_58,negated_conjecture,
( ~ antisymmetric(esk1_0)
| ~ connected(esk1_0)
| ~ transitive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_49]),c_0_33])]) ).
cnf(c_0_59,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_60,negated_conjecture,
( ~ antisymmetric(esk1_0)
| ~ connected(esk1_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_49]),c_0_33])]) ).
cnf(c_0_61,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_62,negated_conjecture,
~ antisymmetric(esk1_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_49]),c_0_33])]) ).
cnf(c_0_63,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_64,negated_conjecture,
$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_49]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU244+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 06:03:39 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_1 with pid 302004 completed with status 0
% 0.14/0.45 % Result found by new_bool_1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 302010 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 15
% 0.14/0.45 % Removed by relevancy pruning/SinE : 7
% 0.14/0.45 % Initial clauses : 25
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 25
% 0.14/0.45 % Processed clauses : 47
% 0.14/0.45 % ...of these trivial : 0
% 0.14/0.45 % ...subsumed : 0
% 0.14/0.45 % ...remaining for further processing : 47
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 4
% 0.14/0.45 % Backward-rewritten : 7
% 0.14/0.45 % Generated clauses : 39
% 0.14/0.45 % ...of the previous two non-redundant : 22
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 4
% 0.14/0.45 % Paramodulations : 39
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 24
% 0.14/0.45 % ...of those cached : 22
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 36
% 0.14/0.45 % Positive orientable unit clauses : 2
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 2
% 0.14/0.45 % Non-unit-clauses : 32
% 0.14/0.45 % Current number of unprocessed clauses: 0
% 0.14/0.45 % ...number of literals in the above : 0
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 11
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 287
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 70
% 0.14/0.45 % Non-unit clause-clause subsumptions : 7
% 0.14/0.45 % Unit Clause-clause subsumption calls : 2
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 1
% 0.14/0.45 % BW rewrite match successes : 1
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 2417
% 0.14/0.45 % Search garbage collected termcells : 375
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.006 s
% 0.14/0.45 % System time : 0.002 s
% 0.14/0.45 % Total time : 0.007 s
% 0.14/0.45 % Maximum resident set size: 3640 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.008 s
% 0.14/0.45 % System time : 0.006 s
% 0.14/0.45 % Total time : 0.013 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------