%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU311+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 : 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:40 PM UTC 2026
% Result : Theorem 0.14s 0.75s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 18 unt; 0 def)
% Number of atoms : 195 ( 6 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 228 ( 94 ~; 87 |; 29 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 5 sgn 40 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& X1 != X2
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(s1_xboole_0__e2_37_1_1__pre_topc__1,axiom,
! [X1,X2] :
( ( element(X2,powerset(powerset(the_carrier(X1))))
& top_str(X1)
& topological_space(X1) )
=> ? [X3] :
! [X4] :
( in(X4,X3)
<=> ( in(set_difference(cast_as_carrier_subset(X1),X4),X2)
& in(X4,powerset(the_carrier(X1))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e2_37_1_1__pre_topc__1) ).
fof(l71_subset_1,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
fof(s3_subset_1__e2_37_1_1__pre_topc,conjecture,
! [X1,X2] :
( ( element(X2,powerset(powerset(the_carrier(X1))))
& top_str(X1)
& topological_space(X1) )
=> ? [X3] :
( ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) )
& element(X3,powerset(powerset(the_carrier(X1)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s3_subset_1__e2_37_1_1__pre_topc) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(c_0_9,plain,
! [X1,X2] :
~ ( empty(X2)
& X1 != X2
& empty(X1) ),
inference(fof_simplification,[status(thm)],[t8_boole]) ).
fof(c_0_10,plain,
! [X50,X51] :
( ~ empty(X51)
| X50 = X51
| ~ empty(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_11,plain,
empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_12,plain,
( ~ empty(X2)
| ~ empty(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X45] :
( empty(esk8_1(X45))
& element(esk8_1(X45),powerset(X45)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
fof(c_0_15,plain,
! [X11,X12,X14,X15] :
( ( ~ element(X12,powerset(powerset(the_carrier(X11))))
| ~ top_str(X11)
| ~ topological_space(X11)
| in(X15,esk4_2(X11,X12))
| ~ in(set_difference(cast_as_carrier_subset(X11),X15),X12)
| ~ in(X15,powerset(the_carrier(X11))) )
& ( ~ element(X12,powerset(powerset(the_carrier(X11))))
| ~ top_str(X11)
| ~ topological_space(X11)
| ~ in(X14,esk4_2(X11,X12))
| in(set_difference(cast_as_carrier_subset(X11),X14),X12) )
& ( ~ element(X12,powerset(powerset(the_carrier(X11))))
| ~ top_str(X11)
| ~ topological_space(X11)
| ~ in(X14,esk4_2(X11,X12))
| in(X14,powerset(the_carrier(X11))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[s1_xboole_0__e2_37_1_1__pre_topc__1])])])])])])]) ).
fof(c_0_16,plain,
! [X18,X19] :
( ( element(X18,powerset(X19))
| ~ in(esk5_2(X18,X19),X19) )
& ( element(X18,powerset(X19))
| in(esk5_2(X18,X19),X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])])]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2] :
( ( element(X2,powerset(powerset(the_carrier(X1))))
& top_str(X1)
& topological_space(X1) )
=> ? [X3] :
( ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) )
& element(X3,powerset(powerset(the_carrier(X1)))) ) ),
inference(assume_negation,[status(cth)],[s3_subset_1__e2_37_1_1__pre_topc]) ).
cnf(c_0_18,plain,
( ~ empty(X1)
| X1 = esk9_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
empty(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ element(X3,powerset(powerset(the_carrier(X2))))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(X1,esk4_2(X2,X3))
| in(X1,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( element(X1,powerset(X2))
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,negated_conjecture,
! [X7] :
( ( ~ element(X7,powerset(powerset(the_carrier(esk1_0))))
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| in(esk3_1(X7),X7) )
& ( ~ element(X7,powerset(powerset(the_carrier(esk1_0))))
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| ~ in(esk3_1(X7),X7) )
& ( ~ element(X7,powerset(powerset(the_carrier(esk1_0))))
| element(esk3_1(X7),powerset(the_carrier(esk1_0))) )
& element(esk2_0,powerset(powerset(the_carrier(esk1_0))))
& top_str(esk1_0)
& topological_space(esk1_0) ),
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_17])])])])])]) ).
cnf(c_0_23,plain,
element(esk8_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
esk8_1(X1) = esk9_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
cnf(c_0_26,plain,
( ~ in(esk5_2(X1,X2),X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| element(esk4_2(X1,X2),powerset(X3))
| in(esk5_2(esk4_2(X1,X2),X3),powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_28,plain,
! [X21,X22] :
( ~ empty(X22)
| ~ in(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
element(esk9_0,powerset(X1)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_31,plain,
! [X16,X17] :
( ( ~ empty(X16)
| element(X17,X16)
| ~ empty(X17) )
& ( ~ empty(X16)
| empty(X17)
| ~ element(X17,X16) )
& ( empty(X16)
| element(X17,X16)
| ~ in(X17,X16) )
& ( empty(X16)
| in(X17,X16)
| ~ element(X17,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_32,plain,
( ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| element(esk4_2(X1,X2),powerset(powerset(the_carrier(X1)))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( in(esk3_1(esk9_0),esk9_0)
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk9_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ in(X1,X2)
| empty(X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| in(esk3_1(esk4_2(esk1_0,X1)),esk4_2(esk1_0,X1))
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk4_2(esk1_0,X1))),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_39,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_40,negated_conjecture,
( ~ empty(esk2_0)
| in(esk3_1(esk9_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(csr,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_42,plain,
( ~ element(X3,powerset(powerset(the_carrier(X1))))
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ in(X2,esk4_2(X1,X3))
| in(set_difference(cast_as_carrier_subset(X1),X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( in(esk3_1(esk4_2(esk1_0,esk2_0)),esk4_2(esk1_0,esk2_0))
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk4_2(esk1_0,esk2_0))),esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| ~ in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_45,plain,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_46,negated_conjecture,
~ empty(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_40]),c_0_13])]) ).
cnf(c_0_47,plain,
( ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X3,powerset(powerset(the_carrier(X1))))
| ~ in(X2,esk4_2(X1,X3))
| element(set_difference(cast_as_carrier_subset(X1),X2),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( element(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk4_2(esk1_0,esk2_0))),esk2_0)
| in(esk3_1(esk4_2(esk1_0,esk2_0)),esk4_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| ~ element(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| ~ in(esk3_1(X1),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
element(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk4_2(esk1_0,esk2_0))),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_39]),c_0_33]),c_0_34])]) ).
cnf(c_0_51,plain,
( ~ element(X3,powerset(powerset(the_carrier(X2))))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(set_difference(cast_as_carrier_subset(X2),X1),X3)
| ~ in(X1,powerset(the_carrier(X2)))
| in(X1,esk4_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_52,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
cnf(c_0_53,negated_conjecture,
( ~ element(esk4_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0))))
| ~ in(esk3_1(esk4_2(esk1_0,esk2_0)),esk4_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( ~ topological_space(X3)
| ~ top_str(X3)
| ~ element(set_difference(cast_as_carrier_subset(X3),X2),X1)
| ~ element(X1,powerset(powerset(the_carrier(X3))))
| ~ in(X2,powerset(the_carrier(X3)))
| in(X2,esk4_2(X3,X1))
| empty(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
fof(c_0_55,plain,
! [X47] : ~ empty(powerset(X47)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
( ~ element(esk4_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0))))
| ~ in(esk3_1(esk4_2(esk1_0,esk2_0)),powerset(the_carrier(esk1_0))) ),
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_53,c_0_54]),c_0_39]),c_0_50]),c_0_33]),c_0_34])]),c_0_46]) ).
cnf(c_0_57,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| element(esk3_1(X1),powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_59,negated_conjecture,
~ element(esk4_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_45]),c_0_57]),c_0_58]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_32]),c_0_39]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU311+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.57 % Computer : n003.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Mon Sep 21 06:12:03 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.61 Running first-order theorem proving
% 0.09/0.62 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.75 % Version: 3.5.1
% 0.14/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.75 % Starting sh5l with 300s (1) cores
% 0.14/0.75 % new_bool_1 with pid 3583447 completed with status 0
% 0.14/0.75 % Result found by new_bool_1
% 0.14/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.75 % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.14/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.75 % SubtermCWHack with pid 3583449 completed with status 0
% 0.14/0.75 % Result found by SubtermCWHack
% 0.14/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.75 % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.14/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.75 % Preprocessing time : 0.002 s
% 0.14/0.75
% 0.14/0.75 % Proof found!
% 0.14/0.75 % SZS status Theorem
% 0.14/0.75 % SZS output start CNFRefutation
% See solution above
% 0.14/0.75 % Parsed axioms : 46
% 0.14/0.75 % Removed by relevancy pruning/SinE : 17
% 0.14/0.75 % Initial clauses : 71
% 0.14/0.75 % Removed in clause preprocessing : 0
% 0.14/0.75 % Initial clauses in saturation : 71
% 0.14/0.75 % Processed clauses : 1832
% 0.14/0.75 % ...of these trivial : 5
% 0.14/0.75 % ...subsumed : 1351
% 0.14/0.75 % ...remaining for further processing : 476
% 0.14/0.75 % Other redundant clauses eliminated : 0
% 0.14/0.75 % Clauses deleted for lack of memory : 0
% 0.14/0.75 % Backward-subsumed : 70
% 0.14/0.75 % Backward-rewritten : 11
% 0.14/0.75 % Generated clauses : 3220
% 0.14/0.75 % ...of the previous two non-redundant : 2899
% 0.14/0.75 % ...aggressively subsumed : 0
% 0.14/0.75 % Contextual simplify-reflections : 16
% 0.14/0.75 % Paramodulations : 3219
% 0.14/0.75 % Factorizations : 0
% 0.14/0.75 % NegExts : 0
% 0.14/0.75 % Equation resolutions : 0
% 0.14/0.75 % Disequality decompositions : 0
% 0.14/0.75 % Total rewrite steps : 1774
% 0.14/0.75 % ...of those cached : 1743
% 0.14/0.75 % Propositional unsat checks : 0
% 0.14/0.75 % Propositional check models : 0
% 0.14/0.75 % Propositional check unsatisfiable : 0
% 0.14/0.75 % Propositional clauses : 0
% 0.14/0.75 % Propositional clauses after purity: 0
% 0.14/0.75 % Propositional unsat core size : 0
% 0.14/0.75 % Propositional preprocessing time : 0.000
% 0.14/0.75 % Propositional encoding time : 0.000
% 0.14/0.75 % Propositional solver time : 0.000
% 0.14/0.75 % Success case prop preproc time : 0.000
% 0.14/0.75 % Success case prop encoding time : 0.000
% 0.14/0.75 % Success case prop solver time : 0.000
% 0.14/0.75 % Current number of processed clauses : 394
% 0.14/0.75 % Positive orientable unit clauses : 24
% 0.14/0.75 % Positive unorientable unit clauses: 0
% 0.14/0.75 % Negative unit clauses : 15
% 0.14/0.75 % Non-unit-clauses : 355
% 0.14/0.75 % Current number of unprocessed clauses: 893
% 0.14/0.75 % ...number of literals in the above : 6696
% 0.14/0.75 % Current number of archived formulas : 0
% 0.14/0.75 % Current number of archived clauses : 82
% 0.14/0.75 % Clause-clause subsumption calls (NU) : 62869
% 0.14/0.75 % Rec. Clause-clause subsumption calls : 21277
% 0.14/0.75 % Non-unit clause-clause subsumptions : 1077
% 0.14/0.75 % Unit Clause-clause subsumption calls : 162
% 0.14/0.75 % Rewrite failures with RHS unbound : 0
% 0.14/0.75 % BW rewrite match attempts : 44
% 0.14/0.75 % BW rewrite match successes : 9
% 0.14/0.75 % Condensation attempts : 0
% 0.14/0.75 % Condensation successes : 0
% 0.14/0.75 % Termbank termtop insertions : 64981
% 0.14/0.75 % Search garbage collected termcells : 793
% 0.14/0.75
% 0.14/0.75 % -------------------------------------------------
% 0.14/0.75 % User time : 0.108 s
% 0.14/0.75 % System time : 0.005 s
% 0.14/0.75 % Total time : 0.113 s
% 0.14/0.75 % Maximum resident set size: 3676 pages
% 0.14/0.75
% 0.14/0.75 % -------------------------------------------------
% 0.14/0.75 % User time : 0.111 s
% 0.14/0.75 % System time : 0.009 s
% 0.14/0.75 % Total time : 0.119 s
% 0.14/0.75 % Maximum resident set size: 4608 pages
% 0.14/0.75 % E exiting
%------------------------------------------------------------------------------