%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU394+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 : n020.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:29:13 PM UTC 2026
% Result : Theorem 27.90s 9.77s
% Output : CNFRefutation 27.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 25 unt; 0 def)
% Number of atoms : 170 ( 25 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 190 ( 74 ~; 54 |; 43 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 56 ( 1 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_yellow19,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_yellow19) ).
fof(t14_yellow19,lemma,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_yellow19) ).
fof(t2_yellow19,lemma,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yellow19) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(t65_zfmisc_1,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(t1_zfmisc_1,lemma,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_zfmisc_1) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_struct_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(assume_negation,[status(cth)],[t15_yellow19]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,lemma,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t14_yellow19]) ).
fof(c_0_13,lemma,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[t2_yellow19]) ).
fof(c_0_14,negated_conjecture,
( esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
& element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& ~ empty(esk2_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk1_0) ),
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_15,lemma,
! [X101] : the_carrier(boole_POSet(X101)) = powerset(X101),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_16,lemma,
! [X32,X33] :
( set_difference(X33,singleton(empty_set)) = filter_of_net_str(X32,net_of_bool_filter(X32,cast_as_carrier_subset(X32),X33))
| ~ element(X33,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X32)))))
| ~ upper_relstr_subset(X33,boole_POSet(cast_as_carrier_subset(X32)))
| ~ filtered_subset(X33,boole_POSet(cast_as_carrier_subset(X32)))
| empty(X33)
| ~ one_sorted_str(X32)
| empty_carrier(X32) ),
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_17,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
fof(c_0_18,lemma,
! [X108,X109,X110] :
( ~ empty(X110)
| ~ in(X110,X109)
| ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
| ~ proper_element(X109,powerset(the_carrier(boole_POSet(X108))))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ filtered_subset(X109,boole_POSet(X108))
| empty(X109)
| empty(X108) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_19,plain,
! [X136,X137] :
( ~ empty(X137)
| ~ in(X136,X137) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_20,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X43] :
( cast_as_carrier_subset(X43) = the_carrier(X43)
| ~ one_sorted_str(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
cnf(c_0_23,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,lemma,
( ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ one_sorted_str(X1)
| set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
| empty(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,lemma,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).
fof(c_0_26,lemma,
! [X231,X232] :
( ( set_difference(X231,singleton(X232)) = X231
| in(X232,X231) )
& ( ~ in(X232,X231)
| set_difference(X231,singleton(X232)) != X231 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_27,lemma,
( ~ empty(X3)
| ~ in(X3,X2)
| ~ element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ filtered_subset(X2,boole_POSet(X1))
| empty(X2)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
proper_element(esk2_0,powerset(powerset(cast_as_carrier_subset(esk1_0)))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_34,negated_conjecture,
element(esk2_0,powerset(powerset(cast_as_carrier_subset(esk1_0)))),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,lemma,
( ~ one_sorted_str(X1)
| ~ element(X2,powerset(powerset(cast_as_carrier_subset(X1))))
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| empty_carrier(X1)
| empty(X2)
| filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) = set_difference(X2,powerset(empty_set)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_21]) ).
cnf(c_0_37,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,lemma,
( set_difference(X2,singleton(X1)) = X2
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,lemma,
( ~ in(X3,X2)
| ~ element(X2,powerset(powerset(X1)))
| ~ empty(X3)
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ proper_element(X2,powerset(powerset(X1)))
| empty(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_21]),c_0_21]),c_0_28]) ).
cnf(c_0_41,negated_conjecture,
proper_element(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_31])]) ).
cnf(c_0_42,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_30]),c_0_31])]) ).
cnf(c_0_44,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31])]) ).
cnf(c_0_45,negated_conjecture,
set_difference(esk2_0,powerset(empty_set)) != esk2_0,
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_35,c_0_36]),c_0_32]),c_0_33]),c_0_34]),c_0_31])]),c_0_37]),c_0_38]) ).
cnf(c_0_46,lemma,
( in(empty_set,X1)
| set_difference(X1,powerset(empty_set)) = X1 ),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
fof(c_0_47,plain,
! [X123] :
( ( ~ one_sorted_str(X123)
| empty_carrier(X123)
| ~ empty(the_carrier(X123)) )
& ( ~ one_sorted_str(X123)
| empty(the_carrier(X123))
| ~ empty_carrier(X123) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])])]) ).
cnf(c_0_48,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ empty(X1)
| empty(the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]),c_0_44])]) ).
cnf(c_0_49,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_50,negated_conjecture,
in(empty_set,esk2_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1))
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
empty(the_carrier(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_31])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU394+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.47 % Computer : n020.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.47 % CPULimit : 300
% 0.19/5.47 % WCLimit : 300
% 0.19/5.47 % DateTime : Mon Sep 21 06:20:23 UTC 2026
% 0.19/5.48 % CPUTime :
% 0.19/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.54 Running first-order theorem proving
% 0.24/5.54 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
% 27.90/9.77 % Version: 3.5.1
% 27.90/9.77 % Preprocessing class: FSLMSMSSSSSNFFN.
% 27.90/9.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.90/9.77 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 27.90/9.77 % Starting new_bool_3 with 600s (2) cores
% 27.90/9.77 % Starting new_bool_1 with 600s (2) cores
% 27.90/9.77 % Starting sh5l with 300s (1) cores
% 27.90/9.77 % new_bool_3 with pid 2188538 completed with status 0
% 27.90/9.77 % Result found by new_bool_3
% 27.90/9.77 % Preprocessing class: FSLMSMSSSSSNFFN.
% 27.90/9.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.90/9.77 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 27.90/9.77 % Starting new_bool_3 with 600s (2) cores
% 27.90/9.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 27.90/9.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.90/9.77 % Search class: FGHSM-SMLM32-MFFFFFNN
% 27.90/9.77 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 27.90/9.77 % Starting SubtermCWHack with 55s (1) cores
% 27.90/9.77 % Starting new_bool_3 with 61s (1) cores
% 27.90/9.77 % SubtermCWHack with pid 2188541 completed with status 0
% 27.90/9.77 % Result found by SubtermCWHack
% 27.90/9.77 % Preprocessing class: FSLMSMSSSSSNFFN.
% 27.90/9.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.90/9.77 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 27.90/9.77 % Starting new_bool_3 with 600s (2) cores
% 27.90/9.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 27.90/9.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.90/9.77 % Search class: FGHSM-SMLM32-MFFFFFNN
% 27.90/9.77 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 27.90/9.77 % Starting SubtermCWHack with 55s (1) cores
% 27.90/9.77 % Preprocessing time : 0.021 s
% 27.90/9.77
% 27.90/9.77 % Proof found!
% 27.90/9.77 % SZS status Theorem
% 27.90/9.77 % SZS output start CNFRefutation
% See solution above
% 27.90/9.77 % Parsed axioms : 916
% 27.90/9.77 % Removed by relevancy pruning/SinE : 573
% 27.90/9.77 % Initial clauses : 1958
% 27.90/9.77 % Removed in clause preprocessing : 70
% 27.90/9.77 % Initial clauses in saturation : 1888
% 27.90/9.77 % Processed clauses : 21591
% 27.90/9.77 % ...of these trivial : 149
% 27.90/9.77 % ...subsumed : 15129
% 27.90/9.77 % ...remaining for further processing : 6313
% 27.90/9.77 % Other redundant clauses eliminated : 782
% 27.90/9.77 % Clauses deleted for lack of memory : 0
% 27.90/9.77 % Backward-subsumed : 278
% 27.90/9.77 % Backward-rewritten : 150
% 27.90/9.77 % Generated clauses : 133050
% 27.90/9.77 % ...of the previous two non-redundant : 125038
% 27.90/9.77 % ...aggressively subsumed : 0
% 27.90/9.77 % Contextual simplify-reflections : 221
% 27.90/9.77 % Paramodulations : 132390
% 27.90/9.77 % Factorizations : 17
% 27.90/9.77 % NegExts : 0
% 27.90/9.77 % Equation resolutions : 784
% 27.90/9.77 % Disequality decompositions : 0
% 27.90/9.77 % Total rewrite steps : 15560
% 27.90/9.77 % ...of those cached : 14780
% 27.90/9.77 % Propositional unsat checks : 0
% 27.90/9.77 % Propositional check models : 0
% 27.90/9.77 % Propositional check unsatisfiable : 0
% 27.90/9.77 % Propositional clauses : 0
% 27.90/9.77 % Propositional clauses after purity: 0
% 27.90/9.77 % Propositional unsat core size : 0
% 27.90/9.77 % Propositional preprocessing time : 0.000
% 27.90/9.77 % Propositional encoding time : 0.000
% 27.90/9.77 % Propositional solver time : 0.000
% 27.90/9.77 % Success case prop preproc time : 0.000
% 27.90/9.77 % Success case prop encoding time : 0.000
% 27.90/9.77 % Success case prop solver time : 0.000
% 27.90/9.77 % Current number of processed clauses : 5495
% 27.90/9.77 % Positive orientable unit clauses : 448
% 27.90/9.77 % Positive unorientable unit clauses: 2
% 27.90/9.77 % Negative unit clauses : 1071
% 27.90/9.77 % Non-unit-clauses : 3974
% 27.90/9.77 % Current number of unprocessed clauses: 103852
% 27.90/9.77 % ...number of literals in the above : 474620
% 27.90/9.77 % Current number of archived formulas : 0
% 27.90/9.77 % Current number of archived clauses : 428
% 27.90/9.77 % Clause-clause subsumption calls (NU) : 5159964
% 27.90/9.77 % Rec. Clause-clause subsumption calls : 1529754
% 27.90/9.77 % Non-unit clause-clause subsumptions : 9875
% 27.90/9.77 % Unit Clause-clause subsumption calls : 301344
% 27.90/9.77 % Rewrite failures with RHS unbound : 0
% 27.90/9.77 % BW rewrite match attempts : 105
% 27.90/9.77 % BW rewrite match successes : 61
% 27.90/9.77 % Condensation attempts : 0
% 27.90/9.77 % Condensation successes : 0
% 27.90/9.77 % Termbank termtop insertions : 1989436
% 27.90/9.77 % Search garbage collected termcells : 26013
% 27.90/9.77
% 27.90/9.77 % -------------------------------------------------
% 27.90/9.77 % User time : 3.994 s
% 27.90/9.77 % System time : 0.083 s
% 27.90/9.77 % Total time : 4.077 s
% 27.90/9.77 % Maximum resident set size: 8780 pages
% 27.90/9.77
% 27.90/9.77 % -------------------------------------------------
% 27.90/9.77 % User time : 7.907 s
% 27.90/9.77 % System time : 0.194 s
% 27.90/9.77 % Total time : 8.101 s
% 27.90/9.77 % Maximum resident set size: 6144 pages
% 27.90/9.77 % E exiting
%------------------------------------------------------------------------------