%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU345+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 : n010.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:47 PM UTC 2026
% Result : Theorem 2.65s 0.86s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 20 unt; 0 def)
% Number of atoms : 245 ( 72 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 291 ( 109 ~; 116 |; 40 &)
% ( 5 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 2 con; 0-3 aty)
% Number of variables : 98 ( 10 sgn 52 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_lattice3,axiom,
! [X1,X2] :
( ( latt_str(X2)
& strict_latt_str(X2) )
=> ( X2 = boole_lattice(X1)
<=> ( ! [X3] :
( element(X3,powerset(X1))
=> ! [X4] :
( element(X4,powerset(X1))
=> ( apply_binary(the_L_meet(X2),X3,X4) = subset_intersection2(X1,X3,X4)
& apply_binary(the_L_join(X2),X3,X4) = subset_union2(X1,X3,X4) ) ) )
& the_carrier(X2) = powerset(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( latt_str(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t1_lattice3,axiom,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
& join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_lattice3) ).
fof(d16_lattices,axiom,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ( lower_bounded_semilattstr(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( X2 = bottom_of_semilattstr(X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X3,X2) = X2
& meet(X1,X2,X3) = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_lattices) ).
fof(dt_k5_lattices,axiom,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> element(bottom_of_semilattstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_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(fc1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_lattice3) ).
fof(d13_lattices,axiom,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ( lower_bounded_semilattstr(X1)
<=> ? [X2] :
( ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X3,X2) = X2
& meet(X1,X2,X3) = X2 ) )
& element(X2,the_carrier(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d13_lattices) ).
fof(t3_lattice3,conjecture,
! [X1] :
( bottom_of_semilattstr(boole_lattice(X1)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_lattice3) ).
fof(c_0_13,plain,
! [X42,X43,X44,X45] :
( ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 = boole_lattice(X42)
| the_carrier(X43) != powerset(X42)
| apply_binary(the_L_meet(X43),esk4_2(X42,X43),esk5_2(X42,X43)) != subset_intersection2(X42,esk4_2(X42,X43),esk5_2(X42,X43))
| apply_binary(the_L_join(X43),esk4_2(X42,X43),esk5_2(X42,X43)) != subset_union2(X42,esk4_2(X42,X43),esk5_2(X42,X43)) )
& ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 = boole_lattice(X42)
| the_carrier(X43) != powerset(X42)
| element(esk5_2(X42,X43),powerset(X42)) )
& ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 = boole_lattice(X42)
| the_carrier(X43) != powerset(X42)
| element(esk4_2(X42,X43),powerset(X42)) )
& ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 != boole_lattice(X42)
| ~ element(X44,powerset(X42))
| ~ element(X45,powerset(X42))
| apply_binary(the_L_meet(X43),X44,X45) = subset_intersection2(X42,X44,X45) )
& ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 != boole_lattice(X42)
| ~ element(X44,powerset(X42))
| ~ element(X45,powerset(X42))
| apply_binary(the_L_join(X43),X44,X45) = subset_union2(X42,X44,X45) )
& ( ~ latt_str(X43)
| ~ strict_latt_str(X43)
| X43 != boole_lattice(X42)
| the_carrier(X43) = powerset(X42) ) ),
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)],[d1_lattice3])])])])])]) ).
fof(c_0_14,plain,
! [X59] :
( latt_str(boole_lattice(X59))
& strict_latt_str(boole_lattice(X59)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_15,plain,
! [X186] :
( X186 = empty_set
| ~ empty(X186) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_16,plain,
! [X139] :
( empty(esk15_1(X139))
& element(esk15_1(X139),powerset(X139)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
fof(c_0_17,plain,
! [X173] : set_intersection2(X173,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_18,plain,
! [X19,X20] : set_intersection2(X19,X20) = set_intersection2(X20,X19),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_19,plain,
! [X168,X169,X170] :
( ( ~ element(X169,the_carrier(boole_lattice(X168)))
| ~ element(X170,the_carrier(boole_lattice(X168)))
| meet(boole_lattice(X168),X169,X170) = set_intersection2(X169,X170) )
& ( ~ element(X169,the_carrier(boole_lattice(X168)))
| ~ element(X170,the_carrier(boole_lattice(X168)))
| join(boole_lattice(X168),X169,X170) = set_union2(X169,X170) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_lattice3])])])])]) ).
cnf(c_0_20,plain,
( ~ latt_str(X1)
| ~ strict_latt_str(X1)
| X1 != boole_lattice(X2)
| the_carrier(X1) = powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
strict_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
empty(esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ( lower_bounded_semilattstr(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( X2 = bottom_of_semilattstr(X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X3,X2) = X2
& meet(X1,X2,X3) = X2 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d16_lattices]) ).
fof(c_0_26,plain,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> element(bottom_of_semilattstr(X1),the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k5_lattices]) ).
fof(c_0_27,plain,
! [X84] :
( ( ~ latt_str(X84)
| join_semilatt_str(X84) )
& ( ~ latt_str(X84)
| meet_semilatt_str(X84) ) ),
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_28,plain,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lattice3]) ).
cnf(c_0_29,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,plain,
( ~ element(X2,the_carrier(boole_lattice(X1)))
| ~ element(X3,the_carrier(boole_lattice(X1)))
| meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_33,plain,
element(esk15_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,plain,
esk15_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_35,plain,
! [X35,X36,X37] :
( ( ~ meet_semilatt_str(X35)
| empty_carrier(X35)
| ~ lower_bounded_semilattstr(X35)
| ~ element(X36,the_carrier(X35))
| X36 = bottom_of_semilattstr(X35)
| meet(X35,esk3_2(X35,X36),X36) != X36
| meet(X35,X36,esk3_2(X35,X36)) != X36 )
& ( ~ meet_semilatt_str(X35)
| empty_carrier(X35)
| ~ lower_bounded_semilattstr(X35)
| ~ element(X36,the_carrier(X35))
| X36 = bottom_of_semilattstr(X35)
| element(esk3_2(X35,X36),the_carrier(X35)) )
& ( ~ meet_semilatt_str(X35)
| empty_carrier(X35)
| ~ lower_bounded_semilattstr(X35)
| ~ element(X36,the_carrier(X35))
| X36 != bottom_of_semilattstr(X35)
| ~ element(X37,the_carrier(X35))
| meet(X35,X37,X36) = X36 )
& ( ~ meet_semilatt_str(X35)
| empty_carrier(X35)
| ~ lower_bounded_semilattstr(X35)
| ~ element(X36,the_carrier(X35))
| X36 != bottom_of_semilattstr(X35)
| ~ element(X37,the_carrier(X35))
| meet(X35,X36,X37) = X36 ) ),
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_25])])])])])]) ).
fof(c_0_36,plain,
! [X78] :
( element(bottom_of_semilattstr(X78),the_carrier(X78))
| ~ meet_semilatt_str(X78)
| empty_carrier(X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_37,plain,
( ~ latt_str(X1)
| meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_38,plain,
! [X102] :
( strict_latt_str(boole_lattice(X102))
& ~ empty_carrier(boole_lattice(X102)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_39,plain,
! [X1] :
( ( meet_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ( lower_bounded_semilattstr(X1)
<=> ? [X2] :
( ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X3,X2) = X2
& meet(X1,X2,X3) = X2 ) )
& element(X2,the_carrier(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[d13_lattices]) ).
fof(c_0_40,negated_conjecture,
~ ! [X1] :
( bottom_of_semilattstr(boole_lattice(X1)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(assume_negation,[status(cth)],[t3_lattice3]) ).
cnf(c_0_41,plain,
set_intersection2(empty_set,X1) = empty_set,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,plain,
( ~ element(X2,powerset(X1))
| ~ element(X3,powerset(X1))
| meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_43,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
( ~ meet_semilatt_str(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ element(X3,the_carrier(X1))
| X3 != bottom_of_semilattstr(X1)
| ~ element(X2,the_carrier(X1))
| empty_carrier(X1)
| meet(X1,X2,X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( ~ meet_semilatt_str(X1)
| element(bottom_of_semilattstr(X1),the_carrier(X1))
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
meet_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_47,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_48,plain,
! [X30,X32,X33] :
( ( ~ meet_semilatt_str(X30)
| empty_carrier(X30)
| lower_bounded_semilattstr(X30)
| ~ element(X33,the_carrier(X30))
| meet(X30,esk2_2(X30,X33),X33) != X33
| meet(X30,X33,esk2_2(X30,X33)) != X33 )
& ( ~ meet_semilatt_str(X30)
| empty_carrier(X30)
| lower_bounded_semilattstr(X30)
| ~ element(X33,the_carrier(X30))
| element(esk2_2(X30,X33),the_carrier(X30)) )
& ( ~ meet_semilatt_str(X30)
| empty_carrier(X30)
| ~ lower_bounded_semilattstr(X30)
| ~ element(X32,the_carrier(X30))
| meet(X30,X32,esk1_1(X30)) = esk1_1(X30) )
& ( ~ meet_semilatt_str(X30)
| empty_carrier(X30)
| ~ lower_bounded_semilattstr(X30)
| ~ element(X32,the_carrier(X30))
| meet(X30,esk1_1(X30),X32) = esk1_1(X30) )
& ( ~ meet_semilatt_str(X30)
| empty_carrier(X30)
| ~ lower_bounded_semilattstr(X30)
| element(esk1_1(X30),the_carrier(X30)) ) ),
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_39])])])])])]) ).
fof(c_0_49,negated_conjecture,
( bottom_of_semilattstr(boole_lattice(esk22_0)) != empty_set
| ~ lower_bounded_semilattstr(boole_lattice(esk22_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_50,plain,
( ~ element(X2,powerset(X1))
| meet(boole_lattice(X1),empty_set,X2) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_51,plain,
( ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ lower_bounded_semilattstr(X1)
| empty_carrier(X1)
| meet(X1,X2,bottom_of_semilattstr(X1)) = bottom_of_semilattstr(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_44]),c_0_45]) ).
cnf(c_0_52,plain,
element(bottom_of_semilattstr(boole_lattice(X1)),powerset(X1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_46])]),c_0_47]) ).
cnf(c_0_53,plain,
( ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| meet(X1,esk2_2(X1,X2),X2) != X2
| meet(X1,X2,esk2_2(X1,X2)) != X2
| empty_carrier(X1)
| lower_bounded_semilattstr(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( ~ element(X2,powerset(X1))
| meet(boole_lattice(X1),X2,empty_set) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_43])]) ).
cnf(c_0_55,plain,
( ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| element(esk2_2(X1,X2),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( bottom_of_semilattstr(boole_lattice(esk22_0)) != empty_set
| ~ lower_bounded_semilattstr(boole_lattice(esk22_0)) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
( ~ lower_bounded_semilattstr(boole_lattice(X1))
| bottom_of_semilattstr(boole_lattice(X1)) = empty_set ),
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_50,c_0_51]),c_0_52]),c_0_46]),c_0_32]),c_0_43])]),c_0_47]) ).
cnf(c_0_58,plain,
( ~ element(esk2_2(boole_lattice(X1),empty_set),powerset(X1))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[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_46]),c_0_32]),c_0_43])]),c_0_47]),c_0_50]) ).
cnf(c_0_59,plain,
( ~ element(X2,powerset(X1))
| element(esk2_2(boole_lattice(X1),X2),powerset(X1))
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_46])]),c_0_47]) ).
cnf(c_0_60,negated_conjecture,
~ lower_bounded_semilattstr(boole_lattice(esk22_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
lower_bounded_semilattstr(boole_lattice(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_43])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU345+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.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 06:14:25 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 2.65/0.86 % Version: 3.5.1
% 2.65/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.65/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.65/0.86 % Starting new_bool_3 with 300s (1) cores
% 2.65/0.86 % Starting new_bool_1 with 300s (1) cores
% 2.65/0.86 % Starting sh5l with 300s (1) cores
% 2.65/0.86 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 188720 completed with status 0
% 2.65/0.86 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.65/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.65/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.65/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.65/0.86 % No SInE strategy applied
% 2.65/0.86 % Search class: FGHSM-FSLM31-MFFFFFNN
% 2.65/0.86 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.65/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.65/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.65/0.86 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 2.65/0.86 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 2.65/0.86 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.65/0.86 % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 188735 completed with status 0
% 2.65/0.86 % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 2.65/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.65/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.65/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.65/0.86 % No SInE strategy applied
% 2.65/0.86 % Search class: FGHSM-FSLM31-MFFFFFNN
% 2.65/0.86 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.65/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.65/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.65/0.86 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 2.65/0.86 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 2.65/0.86 % Preprocessing time : 0.006 s
% 2.65/0.86 % Presaturation interreduction done
% 2.65/0.86
% 2.65/0.86 % Proof found!
% 2.65/0.86 % SZS status Theorem
% 2.65/0.86 % SZS output start CNFRefutation
% See solution above
% 2.65/0.86 % Parsed axioms : 102
% 2.65/0.86 % Removed by relevancy pruning/SinE : 0
% 2.65/0.86 % Initial clauses : 175
% 2.65/0.86 % Removed in clause preprocessing : 17
% 2.65/0.86 % Initial clauses in saturation : 158
% 2.65/0.86 % Processed clauses : 1283
% 2.65/0.86 % ...of these trivial : 5
% 2.65/0.86 % ...subsumed : 627
% 2.65/0.86 % ...remaining for further processing : 651
% 2.65/0.86 % Other redundant clauses eliminated : 6
% 2.65/0.86 % Clauses deleted for lack of memory : 0
% 2.65/0.86 % Backward-subsumed : 36
% 2.65/0.86 % Backward-rewritten : 36
% 2.65/0.86 % Generated clauses : 2927
% 2.65/0.86 % ...of the previous two non-redundant : 2768
% 2.65/0.86 % ...aggressively subsumed : 0
% 2.65/0.86 % Contextual simplify-reflections : 23
% 2.65/0.86 % Paramodulations : 2907
% 2.65/0.86 % Factorizations : 0
% 2.65/0.86 % NegExts : 0
% 2.65/0.86 % Equation resolutions : 20
% 2.65/0.86 % Disequality decompositions : 0
% 2.65/0.86 % Total rewrite steps : 672
% 2.65/0.86 % ...of those cached : 619
% 2.65/0.86 % Propositional unsat checks : 0
% 2.65/0.86 % Propositional check models : 0
% 2.65/0.86 % Propositional check unsatisfiable : 0
% 2.65/0.86 % Propositional clauses : 0
% 2.65/0.86 % Propositional clauses after purity: 0
% 2.65/0.86 % Propositional unsat core size : 0
% 2.65/0.86 % Propositional preprocessing time : 0.000
% 2.65/0.86 % Propositional encoding time : 0.000
% 2.65/0.86 % Propositional solver time : 0.000
% 2.65/0.86 % Success case prop preproc time : 0.000
% 2.65/0.86 % Success case prop encoding time : 0.000
% 2.65/0.86 % Success case prop solver time : 0.000
% 2.65/0.86 % Current number of processed clauses : 433
% 2.65/0.86 % Positive orientable unit clauses : 66
% 2.65/0.86 % Positive unorientable unit clauses: 3
% 2.65/0.86 % Negative unit clauses : 18
% 2.65/0.86 % Non-unit-clauses : 346
% 2.65/0.86 % Current number of unprocessed clauses: 1689
% 2.65/0.86 % ...number of literals in the above : 8868
% 2.65/0.86 % Current number of archived formulas : 0
% 2.65/0.86 % Current number of archived clauses : 219
% 2.65/0.86 % Clause-clause subsumption calls (NU) : 46526
% 2.65/0.86 % Rec. Clause-clause subsumption calls : 19892
% 2.65/0.86 % Non-unit clause-clause subsumptions : 667
% 2.65/0.86 % Unit Clause-clause subsumption calls : 1131
% 2.65/0.86 % Rewrite failures with RHS unbound : 0
% 2.65/0.86 % BW rewrite match attempts : 59
% 2.65/0.86 % BW rewrite match successes : 35
% 2.65/0.86 % Condensation attempts : 0
% 2.65/0.86 % Condensation successes : 0
% 2.65/0.86 % Termbank termtop insertions : 64139
% 2.65/0.86 % Search garbage collected termcells : 1915
% 2.65/0.86
% 2.65/0.86 % -------------------------------------------------
% 2.65/0.86 % User time : 0.230 s
% 2.65/0.86 % System time : 0.013 s
% 2.65/0.86 % Total time : 0.243 s
% 2.65/0.86 % Maximum resident set size: 3996 pages
% 2.65/0.86
% 2.65/0.86 % -------------------------------------------------
% 2.65/0.86 % User time : 1.569 s
% 2.65/0.86 % System time : 0.084 s
% 2.65/0.86 % Total time : 1.653 s
% 2.65/0.86 % Maximum resident set size: 4864 pages
% 2.65/0.86 % E exiting
%------------------------------------------------------------------------------