%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU342+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 : n026.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:46 PM UTC 2026
% Result : Theorem 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 234 ( 28 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 284 ( 106 ~; 111 |; 42 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 98 ( 4 sgn 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc1_struct_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(dt_l1_lattices,axiom,
! [X1] :
( meet_semilatt_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_lattices) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( join_semilatt_str(X1)
& meet_semilatt_str(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l3_lattices) ).
fof(redefinition_k1_domain_1,axiom,
! [X1,X2,X3,X4] :
( ( element(X4,X2)
& element(X3,X1)
& ~ empty(X2)
& ~ empty(X1) )
=> ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k1_domain_1) ).
fof(fraenkel_a_1_0_filter_1,axiom,
! [X1,X2] :
( ( latt_str(X2)
& lattice(X2)
& ~ empty_carrier(X2) )
=> ( in(X1,a_1_0_filter_1(X2))
<=> ? [X3,X4] :
( below_refl(X2,X3,X4)
& X1 = ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4)
& element(X4,the_carrier(X2))
& element(X3,the_carrier(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fraenkel_a_1_0_filter_1) ).
fof(t32_filter_1,conjecture,
! [X1] :
( ( latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))
<=> below_refl(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_filter_1) ).
fof(d8_filter_1,axiom,
! [X1] :
( ( latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> relation_of_lattice(X1) = a_1_0_filter_1(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_filter_1) ).
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(c_0_8,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_9,plain,
! [X63] :
( one_sorted_str(X63)
| ~ meet_semilatt_str(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_lattices])])]) ).
fof(c_0_10,plain,
! [X46] :
( ( ~ latt_str(X46)
| join_semilatt_str(X46) )
& ( ~ latt_str(X46)
| meet_semilatt_str(X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])]) ).
fof(c_0_11,plain,
! [X1,X2,X3,X4] :
( ( element(X4,X2)
& element(X3,X1)
& ~ empty(X2)
& ~ empty(X1) )
=> ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair(X3,X4) ),
inference(fof_simplification,[status(thm)],[redefinition_k1_domain_1]) ).
fof(c_0_12,plain,
! [X1,X2] :
( ( latt_str(X2)
& lattice(X2)
& ~ empty_carrier(X2) )
=> ( in(X1,a_1_0_filter_1(X2))
<=> ? [X3,X4] :
( below_refl(X2,X3,X4)
& X1 = ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4)
& element(X4,the_carrier(X2))
& element(X3,the_carrier(X2)) ) ) ),
inference(fof_simplification,[status(thm)],[fraenkel_a_1_0_filter_1]) ).
fof(c_0_13,plain,
! [X41] :
( ~ empty(the_carrier(X41))
| ~ one_sorted_str(X41)
| empty_carrier(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( ~ meet_semilatt_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ latt_str(X1)
| meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))
<=> below_refl(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t32_filter_1]) ).
fof(c_0_17,plain,
! [X37,X38,X39,X40] :
( ordered_pair_as_product_element(X37,X38,X39,X40) = ordered_pair(X39,X40)
| ~ element(X40,X38)
| ~ element(X39,X37)
| empty(X38)
| empty(X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_18,plain,
! [X8,X9,X12,X13] :
( ( ~ latt_str(X9)
| ~ lattice(X9)
| empty_carrier(X9)
| in(X8,a_1_0_filter_1(X9))
| ~ below_refl(X9,X12,X13)
| X8 != ordered_pair_as_product_element(the_carrier(X9),the_carrier(X9),X12,X13)
| ~ element(X13,the_carrier(X9))
| ~ element(X12,the_carrier(X9)) )
& ( ~ latt_str(X9)
| ~ lattice(X9)
| empty_carrier(X9)
| ~ in(X8,a_1_0_filter_1(X9))
| below_refl(X9,esk4_2(X8,X9),esk5_2(X8,X9)) )
& ( ~ latt_str(X9)
| ~ lattice(X9)
| empty_carrier(X9)
| ~ in(X8,a_1_0_filter_1(X9))
| X8 = ordered_pair_as_product_element(the_carrier(X9),the_carrier(X9),esk4_2(X8,X9),esk5_2(X8,X9)) )
& ( ~ latt_str(X9)
| ~ lattice(X9)
| empty_carrier(X9)
| ~ in(X8,a_1_0_filter_1(X9))
| element(esk5_2(X8,X9),the_carrier(X9)) )
& ( ~ latt_str(X9)
| ~ lattice(X9)
| empty_carrier(X9)
| ~ in(X8,a_1_0_filter_1(X9))
| element(esk4_2(X8,X9),the_carrier(X9)) ) ),
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_12])])])])])]) ).
cnf(c_0_19,plain,
( ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ latt_str(X1)
| one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ( latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),relation_of_lattice(X1))
<=> below_refl(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X1] :
( ( latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> relation_of_lattice(X1) = a_1_0_filter_1(X1) ),
inference(fof_simplification,[status(thm)],[d8_filter_1]) ).
fof(c_0_23,plain,
! [X59,X60,X61,X62] :
( ( ordered_pair(X59,X60) != ordered_pair(X61,X62)
| X60 = X62 )
& ( ordered_pair(X59,X60) != ordered_pair(X61,X62)
| X59 = X61 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])])]) ).
cnf(c_0_24,plain,
( ~ element(X4,X2)
| ~ element(X3,X1)
| ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair(X3,X4)
| empty(X2)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ latt_str(X2)
| ~ lattice(X2)
| ~ in(X1,a_1_0_filter_1(X2))
| empty_carrier(X2)
| X1 = ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),esk4_2(X1,X2),esk5_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ latt_str(X2)
| ~ lattice(X2)
| ~ in(X1,a_1_0_filter_1(X2))
| empty_carrier(X2)
| element(esk4_2(X1,X2),the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ latt_str(X2)
| ~ lattice(X2)
| ~ in(X1,a_1_0_filter_1(X2))
| empty_carrier(X2)
| element(esk5_2(X1,X2),the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( ~ latt_str(X1)
| ~ empty(the_carrier(X1))
| empty_carrier(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_29,negated_conjecture,
( ( below_refl(esk1_0,esk2_0,esk3_0)
| in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),relation_of_lattice(esk1_0)) )
& ( ~ below_refl(esk1_0,esk2_0,esk3_0)
| ~ in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),relation_of_lattice(esk1_0)) )
& element(esk3_0,the_carrier(esk1_0))
& element(esk2_0,the_carrier(esk1_0))
& latt_str(esk1_0)
& lattice(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_21])])])]) ).
fof(c_0_30,plain,
! [X31] :
( relation_of_lattice(X31) = a_1_0_filter_1(X31)
| ~ latt_str(X31)
| ~ lattice(X31)
| empty_carrier(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_31,plain,
( ordered_pair(X3,X1) != ordered_pair(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( ~ in(X1,a_1_0_filter_1(X2))
| ~ latt_str(X2)
| ~ lattice(X2)
| empty_carrier(X2)
| ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( below_refl(esk1_0,esk2_0,esk3_0)
| in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),relation_of_lattice(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ~ latt_str(X1)
| ~ lattice(X1)
| relation_of_lattice(X1) = a_1_0_filter_1(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
lattice(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
latt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( ~ below_refl(esk1_0,esk2_0,esk3_0)
| ~ in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),relation_of_lattice(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ~ latt_str(X2)
| ~ lattice(X2)
| ~ below_refl(X2,X1,X3)
| X4 != ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X1,X3)
| ~ element(X3,the_carrier(X2))
| ~ element(X1,the_carrier(X2))
| empty_carrier(X2)
| in(X4,a_1_0_filter_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_40,plain,
( ~ latt_str(X1)
| ~ lattice(X1)
| ~ in(X2,a_1_0_filter_1(X1))
| empty_carrier(X1)
| below_refl(X1,esk4_2(X2,X1),esk5_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_41,plain,
( ~ in(ordered_pair(X1,X2),a_1_0_filter_1(X3))
| ~ latt_str(X3)
| ~ lattice(X3)
| empty_carrier(X3)
| esk5_2(ordered_pair(X1,X2),X3) = X2 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_42,plain,
( ordered_pair(X1,X3) != ordered_pair(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_43,negated_conjecture,
( in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),a_1_0_filter_1(esk1_0))
| below_refl(esk1_0,esk2_0,esk3_0) ),
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_34]),c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_44,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_45,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_46,negated_conjecture,
( ~ in(ordered_pair_as_product_element(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0,esk3_0),a_1_0_filter_1(esk1_0))
| ~ below_refl(esk1_0,esk2_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_47,plain,
( ~ latt_str(X1)
| ~ lattice(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ below_refl(X1,X2,X3)
| in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),a_1_0_filter_1(X1))
| empty_carrier(X1) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( ~ in(ordered_pair(X2,X3),a_1_0_filter_1(X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| below_refl(X1,esk4_2(ordered_pair(X2,X3),X1),X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( ~ in(ordered_pair(X1,X2),a_1_0_filter_1(X3))
| ~ latt_str(X3)
| ~ lattice(X3)
| empty_carrier(X3)
| esk4_2(ordered_pair(X1,X2),X3) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
( in(ordered_pair(esk2_0,esk3_0),a_1_0_filter_1(esk1_0))
| empty(the_carrier(esk1_0))
| below_refl(esk1_0,esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_44]),c_0_45])]) ).
cnf(c_0_51,negated_conjecture,
~ below_refl(esk1_0,esk2_0,esk3_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_46,c_0_47]),c_0_44]),c_0_45]),c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_52,plain,
( ~ in(ordered_pair(X2,X3),a_1_0_filter_1(X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| below_refl(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( in(ordered_pair(esk2_0,esk3_0),a_1_0_filter_1(esk1_0))
| empty(the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
empty(the_carrier(esk1_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_52,c_0_53]),c_0_35]),c_0_36])]),c_0_51]),c_0_37]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_54]),c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU342+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n026.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 06:16:37 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % sh5l with pid 1541897 completed with status 0
% 0.23/0.60 % Result found by sh5l
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.60 % Search class: FGHSS-FFMM31-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.60 % SubtermCWHack with pid 1541905 completed with status 0
% 0.23/0.60 % Result found by SubtermCWHack
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.60 % Search class: FGHSS-FFMM31-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.60 % Preprocessing time : 0.002 s
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 44
% 0.23/0.60 % Removed by relevancy pruning/SinE : 10
% 0.23/0.60 % Initial clauses : 56
% 0.23/0.60 % Removed in clause preprocessing : 2
% 0.23/0.60 % Initial clauses in saturation : 54
% 0.23/0.60 % Processed clauses : 364
% 0.23/0.60 % ...of these trivial : 60
% 0.23/0.60 % ...subsumed : 113
% 0.23/0.60 % ...remaining for further processing : 191
% 0.23/0.60 % Other redundant clauses eliminated : 5
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 26
% 0.23/0.60 % Backward-rewritten : 8
% 0.23/0.60 % Generated clauses : 1006
% 0.23/0.60 % ...of the previous two non-redundant : 911
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 12
% 0.23/0.60 % Paramodulations : 987
% 0.23/0.60 % Factorizations : 4
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 7
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 352
% 0.23/0.60 % ...of those cached : 267
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 148
% 0.23/0.60 % Positive orientable unit clauses : 42
% 0.23/0.60 % Positive unorientable unit clauses: 1
% 0.23/0.60 % Negative unit clauses : 15
% 0.23/0.60 % Non-unit-clauses : 90
% 0.23/0.60 % Current number of unprocessed clauses: 587
% 0.23/0.60 % ...number of literals in the above : 922
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 42
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 4337
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 1518
% 0.23/0.60 % Non-unit clause-clause subsumptions : 100
% 0.23/0.60 % Unit Clause-clause subsumption calls : 85
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 23
% 0.23/0.60 % BW rewrite match successes : 3
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 32108
% 0.23/0.60 % Search garbage collected termcells : 798
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.050 s
% 0.23/0.60 % System time : 0.007 s
% 0.23/0.60 % Total time : 0.056 s
% 0.23/0.60 % Maximum resident set size: 3672 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.054 s
% 0.23/0.60 % System time : 0.012 s
% 0.23/0.60 % Total time : 0.066 s
% 0.23/0.60 % Maximum resident set size: 4608 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------