%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU391+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 : n003.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:57 PM UTC 2026
% Result : Theorem 4.65s 1.30s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 14 unt; 0 def)
% Number of atoms : 195 ( 19 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 227 ( 81 ~; 86 |; 39 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k2_yellow19,axiom,
! [X1,X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2)
& one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_yellow19) ).
fof(t11_yellow19,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( element(X3,powerset(the_carrier(X1)))
& is_eventually_in(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_yellow19) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(d3_yellow19,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_yellow19) ).
fof(fraenkel_a_2_1_yellow19,axiom,
! [X1,X2,X3] :
( ( net_str(X3,X2)
& ~ empty_carrier(X3)
& one_sorted_str(X2)
& ~ empty_carrier(X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( is_eventually_in(X2,X3,X4)
& X1 = X4
& element(X4,powerset(the_carrier(X2))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fraenkel_a_2_1_yellow19) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(c_0_7,plain,
! [X1,X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2)
& one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
inference(fof_simplification,[status(thm)],[dt_k2_yellow19]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( element(X3,powerset(the_carrier(X1)))
& is_eventually_in(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t11_yellow19]) ).
fof(c_0_9,plain,
! [X62,X63] :
( element(filter_of_net_str(X62,X63),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X62)))))
| ~ net_str(X63,X62)
| empty_carrier(X63)
| ~ one_sorted_str(X62)
| empty_carrier(X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,lemma,
! [X142] : the_carrier(boole_POSet(X142)) = powerset(X142),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( element(X3,powerset(the_carrier(X1)))
& is_eventually_in(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[d3_yellow19]) ).
cnf(c_0_13,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
( ( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| element(esk3_0,powerset(the_carrier(esk1_0))) )
& ( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk3_0) )
& ( ~ element(esk3_0,powerset(the_carrier(esk1_0)))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) )
& net_str(esk2_0,esk1_0)
& ~ empty_carrier(esk2_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_16,plain,
! [X1,X2,X3] :
( ( net_str(X3,X2)
& ~ empty_carrier(X3)
& one_sorted_str(X2)
& ~ empty_carrier(X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( is_eventually_in(X2,X3,X4)
& X1 = X4
& element(X4,powerset(the_carrier(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[fraenkel_a_2_1_yellow19]) ).
fof(c_0_17,plain,
! [X60,X61] :
( filter_of_net_str(X60,X61) = a_2_1_yellow19(X60,X61)
| ~ net_str(X61,X60)
| empty_carrier(X61)
| ~ one_sorted_str(X60)
| empty_carrier(X60) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_18,plain,
! [X34,X35,X36] :
( element(X34,X36)
| ~ element(X35,powerset(X36))
| ~ in(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_19,plain,
( ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| element(filter_of_net_str(X1,X2),powerset(powerset(cast_as_carrier_subset(X1))))
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,plain,
! [X143] :
( cast_as_carrier_subset(X143) = the_carrier(X143)
| ~ one_sorted_str(X143) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_25,plain,
! [X134,X135,X136,X138] :
( ( ~ net_str(X136,X135)
| empty_carrier(X136)
| ~ one_sorted_str(X135)
| empty_carrier(X135)
| in(X134,a_2_1_yellow19(X135,X136))
| ~ is_eventually_in(X135,X136,X138)
| X134 != X138
| ~ element(X138,powerset(the_carrier(X135))) )
& ( ~ net_str(X136,X135)
| empty_carrier(X136)
| ~ one_sorted_str(X135)
| empty_carrier(X135)
| ~ in(X134,a_2_1_yellow19(X135,X136))
| is_eventually_in(X135,X136,esk22_3(X134,X135,X136)) )
& ( ~ net_str(X136,X135)
| empty_carrier(X136)
| ~ one_sorted_str(X135)
| empty_carrier(X135)
| ~ in(X134,a_2_1_yellow19(X135,X136))
| X134 = esk22_3(X134,X135,X136) )
& ( ~ net_str(X136,X135)
| empty_carrier(X136)
| ~ one_sorted_str(X135)
| empty_carrier(X135)
| ~ in(X134,a_2_1_yellow19(X135,X136))
| element(esk22_3(X134,X135,X136),powerset(the_carrier(X135))) ) ),
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_16])])])])])]) ).
cnf(c_0_26,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
element(filter_of_net_str(esk1_0,esk2_0),powerset(powerset(cast_as_carrier_subset(esk1_0)))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ in(X3,a_2_1_yellow19(X1,X2))
| empty_carrier(X2)
| empty_carrier(X1)
| is_eventually_in(X1,X2,esk22_3(X3,X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
a_2_1_yellow19(esk1_0,esk2_0) = filter_of_net_str(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_33,plain,
( ~ net_str(X3,X2)
| ~ one_sorted_str(X2)
| ~ in(X1,a_2_1_yellow19(X2,X3))
| empty_carrier(X3)
| empty_carrier(X2)
| X1 = esk22_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( ~ element(filter_of_net_str(esk1_0,esk2_0),powerset(X1))
| element(esk3_0,X1)
| element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
element(filter_of_net_str(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
( ~ in(X1,filter_of_net_str(esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk22_3(X1,esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_32]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_37,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,negated_conjecture,
( ~ in(X1,filter_of_net_str(esk1_0,esk2_0))
| esk22_3(X1,esk1_0,esk2_0) = X1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_32]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( ~ element(esk3_0,powerset(the_carrier(esk1_0)))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,negated_conjecture,
element(esk3_0,powerset(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| is_eventually_in(esk1_0,esk2_0,esk22_3(esk3_0,esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| esk22_3(esk3_0,esk1_0,esk2_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_43,plain,
( ~ net_str(X4,X2)
| ~ one_sorted_str(X2)
| ~ is_eventually_in(X2,X4,X1)
| X3 != X1
| ~ element(X1,powerset(the_carrier(X2)))
| empty_carrier(X4)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_45,negated_conjecture,
is_eventually_in(esk1_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ is_eventually_in(X2,X1,X3)
| in(X3,a_2_1_yellow19(X2,X1))
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_32]),c_0_40]),c_0_20]),c_0_21])]),c_0_23]),c_0_22]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU391+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n003.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:20:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 4.65/1.30 % Version: 3.5.1
% 4.65/1.30 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.65/1.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.30 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.65/1.30 % Starting new_bool_3 with 600s (2) cores
% 4.65/1.30 % Starting new_bool_1 with 600s (2) cores
% 4.65/1.30 % Starting sh5l with 300s (1) cores
% 4.65/1.30 % new_bool_1 with pid 3594579 completed with status 0
% 4.65/1.30 % Result found by new_bool_1
% 4.65/1.30 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.65/1.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.30 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.65/1.30 % Starting new_bool_3 with 600s (2) cores
% 4.65/1.30 % Starting new_bool_1 with 600s (2) cores
% 4.65/1.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.65/1.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.65/1.30 % Search class: FGHSM-FSLM31-MFFFFFNN
% 4.65/1.30 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 4.65/1.30 % Starting SubtermCWHack with 55s (1) cores
% 4.65/1.30 % Starting new_bool_1 with 61s (1) cores
% 4.65/1.30 % new_bool_1 with pid 3594582 completed with status 0
% 4.65/1.30 % Result found by new_bool_1
% 4.65/1.30 % Preprocessing class: FSLMSMSSSSSNFFN.
% 4.65/1.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.30 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 4.65/1.30 % Starting new_bool_3 with 600s (2) cores
% 4.65/1.30 % Starting new_bool_1 with 600s (2) cores
% 4.65/1.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.65/1.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.65/1.30 % Search class: FGHSM-FSLM31-MFFFFFNN
% 4.65/1.30 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 4.65/1.30 % Starting SubtermCWHack with 55s (1) cores
% 4.65/1.30 % Starting new_bool_1 with 61s (1) cores
% 4.65/1.30 % Preprocessing time : 0.014 s
% 4.65/1.30 % Presaturation interreduction done
% 4.65/1.30
% 4.65/1.30 % Proof found!
% 4.65/1.30 % SZS status Theorem
% 4.65/1.30 % SZS output start CNFRefutation
% See solution above
% 4.65/1.30 % Parsed axioms : 901
% 4.65/1.30 % Removed by relevancy pruning/SinE : 765
% 4.65/1.30 % Initial clauses : 433
% 4.65/1.30 % Removed in clause preprocessing : 17
% 4.65/1.30 % Initial clauses in saturation : 416
% 4.65/1.30 % Processed clauses : 3877
% 4.65/1.30 % ...of these trivial : 53
% 4.65/1.30 % ...subsumed : 2194
% 4.65/1.30 % ...remaining for further processing : 1629
% 4.65/1.30 % Other redundant clauses eliminated : 90
% 4.65/1.30 % Clauses deleted for lack of memory : 0
% 4.65/1.30 % Backward-subsumed : 26
% 4.65/1.30 % Backward-rewritten : 103
% 4.65/1.30 % Generated clauses : 9654
% 4.65/1.30 % ...of the previous two non-redundant : 8721
% 4.65/1.30 % ...aggressively subsumed : 0
% 4.65/1.30 % Contextual simplify-reflections : 25
% 4.65/1.30 % Paramodulations : 9573
% 4.65/1.30 % Factorizations : 4
% 4.65/1.30 % NegExts : 0
% 4.65/1.30 % Equation resolutions : 90
% 4.65/1.30 % Disequality decompositions : 0
% 4.65/1.30 % Total rewrite steps : 2121
% 4.65/1.30 % ...of those cached : 1701
% 4.65/1.30 % Propositional unsat checks : 0
% 4.65/1.30 % Propositional check models : 0
% 4.65/1.30 % Propositional check unsatisfiable : 0
% 4.65/1.30 % Propositional clauses : 0
% 4.65/1.30 % Propositional clauses after purity: 0
% 4.65/1.30 % Propositional unsat core size : 0
% 4.65/1.30 % Propositional preprocessing time : 0.000
% 4.65/1.30 % Propositional encoding time : 0.000
% 4.65/1.30 % Propositional solver time : 0.000
% 4.65/1.31 % Success case prop preproc time : 0.000
% 4.65/1.31 % Success case prop encoding time : 0.000
% 4.65/1.31 % Success case prop solver time : 0.000
% 4.65/1.31 % Current number of processed clauses : 1073
% 4.65/1.31 % Positive orientable unit clauses : 249
% 4.65/1.31 % Positive unorientable unit clauses: 1
% 4.65/1.31 % Negative unit clauses : 183
% 4.65/1.31 % Non-unit-clauses : 640
% 4.65/1.31 % Current number of unprocessed clauses: 5611
% 4.65/1.31 % ...number of literals in the above : 21629
% 4.65/1.31 % Current number of archived formulas : 0
% 4.65/1.31 % Current number of archived clauses : 526
% 4.65/1.31 % Clause-clause subsumption calls (NU) : 147245
% 4.65/1.31 % Rec. Clause-clause subsumption calls : 24348
% 4.65/1.31 % Non-unit clause-clause subsumptions : 853
% 4.65/1.31 % Unit Clause-clause subsumption calls : 8068
% 4.65/1.31 % Rewrite failures with RHS unbound : 0
% 4.65/1.31 % BW rewrite match attempts : 40
% 4.65/1.31 % BW rewrite match successes : 9
% 4.65/1.31 % Condensation attempts : 0
% 4.65/1.31 % Condensation successes : 0
% 4.65/1.31 % Termbank termtop insertions : 174536
% 4.65/1.31 % Search garbage collected termcells : 12543
% 4.65/1.31
% 4.65/1.31 % -------------------------------------------------
% 4.65/1.31 % User time : 0.629 s
% 4.65/1.31 % System time : 0.029 s
% 4.65/1.31 % Total time : 0.658 s
% 4.65/1.31 % Maximum resident set size: 5880 pages
% 4.65/1.31
% 4.65/1.31 % -------------------------------------------------
% 4.65/1.31 % User time : 1.409 s
% 4.65/1.31 % System time : 0.060 s
% 4.65/1.31 % Total time : 1.469 s
% 4.65/1.31 % Maximum resident set size: 6144 pages
% 4.65/1.31 % E exiting
%------------------------------------------------------------------------------