%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU342+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:19:10 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 69 ( 15 unt; 0 def)
% Number of atoms : 251 ( 47 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 291 ( 109 ~; 137 |; 29 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 125 ( 9 sgn 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t32_filter_1,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t32_filter_1) ).
fof(d8_filter_1,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> relation_of_lattice(X1) = a_1_0_filter_1(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_filter_1) ).
fof(fraenkel_a_1_0_filter_1,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ( in(X1,a_1_0_filter_1(X2))
<=> ? [X3,X4] :
( element(X3,the_carrier(X2))
& element(X4,the_carrier(X2))
& X1 = ordered_pair_as_product_element(the_carrier(X2),the_carrier(X2),X3,X4)
& below_refl(X2,X3,X4) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fraenkel_a_1_0_filter_1) ).
fof(redefinition_k1_domain_1,axiom,
! [X1,X2,X3,X4] :
( ( ~ empty(X1)
& ~ empty(X2)
& element(X3,X1)
& element(X4,X2) )
=> ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair(X3,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k1_domain_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(dt_l1_lattices,axiom,
! [X1] :
( meet_semilatt_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_lattices) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l3_lattices) ).
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_zfmisc_1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_struct_0) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(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_11,negated_conjecture,
( ~ empty_carrier(esk12_0)
& lattice(esk12_0)
& latt_str(esk12_0)
& element(esk13_0,the_carrier(esk12_0))
& element(esk14_0,the_carrier(esk12_0))
& ( ~ in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))
| ~ below_refl(esk12_0,esk13_0,esk14_0) )
& ( in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0))
| below_refl(esk12_0,esk13_0,esk14_0) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])])])]) ).
fof(c_0_12,plain,
! [X2] :
( empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2)
| relation_of_lattice(X2) = a_1_0_filter_1(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d8_filter_1])])]) ).
fof(c_0_13,plain,
! [X5,X6,X9,X10] :
( ( element(esk6_2(X5,X6),the_carrier(X6))
| ~ in(X5,a_1_0_filter_1(X6))
| empty_carrier(X6)
| ~ lattice(X6)
| ~ latt_str(X6) )
& ( element(esk7_2(X5,X6),the_carrier(X6))
| ~ in(X5,a_1_0_filter_1(X6))
| empty_carrier(X6)
| ~ lattice(X6)
| ~ latt_str(X6) )
& ( X5 = ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),esk6_2(X5,X6),esk7_2(X5,X6))
| ~ in(X5,a_1_0_filter_1(X6))
| empty_carrier(X6)
| ~ lattice(X6)
| ~ latt_str(X6) )
& ( below_refl(X6,esk6_2(X5,X6),esk7_2(X5,X6))
| ~ in(X5,a_1_0_filter_1(X6))
| empty_carrier(X6)
| ~ lattice(X6)
| ~ latt_str(X6) )
& ( ~ element(X9,the_carrier(X6))
| ~ element(X10,the_carrier(X6))
| X5 != ordered_pair_as_product_element(the_carrier(X6),the_carrier(X6),X9,X10)
| ~ below_refl(X6,X9,X10)
| in(X5,a_1_0_filter_1(X6))
| empty_carrier(X6)
| ~ lattice(X6)
| ~ latt_str(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fraenkel_a_1_0_filter_1])])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ below_refl(esk12_0,esk13_0,esk14_0)
| ~ in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( relation_of_lattice(X1) = a_1_0_filter_1(X1)
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
lattice(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
latt_str(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ empty_carrier(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( empty_carrier(X1)
| in(X2,a_1_0_filter_1(X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ below_refl(X1,X3,X4)
| X2 != ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X3,X4)
| ~ element(X4,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X5,X6,X7,X8] :
( empty(X5)
| empty(X6)
| ~ element(X7,X5)
| ~ element(X8,X6)
| ordered_pair_as_product_element(X5,X6,X7,X8) = ordered_pair(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_k1_domain_1])])]) ).
fof(c_0_21,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_22,negated_conjecture,
( ~ below_refl(esk12_0,esk13_0,esk14_0)
| ~ in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),a_1_0_filter_1(esk12_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_23,plain,
( empty_carrier(X1)
| in(ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),X2,X3),a_1_0_filter_1(X1))
| ~ below_refl(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
element(esk14_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
element(esk13_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
( ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair(X3,X4)
| empty(X2)
| empty(X1)
| ~ element(X4,X2)
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X2] :
( ~ meet_semilatt_str(X2)
| one_sorted_str(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_lattices])]) ).
fof(c_0_29,plain,
! [X2] :
( ( meet_semilatt_str(X2)
| ~ latt_str(X2) )
& ( join_semilatt_str(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
cnf(c_0_30,negated_conjecture,
( below_refl(esk12_0,esk13_0,esk14_0)
| in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
~ below_refl(esk12_0,esk13_0,esk14_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_22,c_0_23]),c_0_24]),c_0_25]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_32,plain,
( ordered_pair_as_product_element(X1,X2,X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3))
| empty(X2)
| empty(X1)
| ~ element(X4,X2)
| ~ element(X3,X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_33,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| ordered_pair(X5,X6) != ordered_pair(X7,X8) )
& ( X6 = X8
| ordered_pair(X5,X6) != ordered_pair(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
fof(c_0_34,plain,
! [X2] :
( empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ empty(the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_struct_0])])]) ).
cnf(c_0_35,plain,
( one_sorted_str(X1)
| ~ meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
in(ordered_pair_as_product_element(the_carrier(esk12_0),the_carrier(esk12_0),esk13_0,esk14_0),relation_of_lattice(esk12_0)),
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ordered_pair_as_product_element(X1,X2,X3,X4) = ordered_pair_as_product_element(X5,X6,X3,X4)
| empty(X6)
| empty(X5)
| empty(X2)
| empty(X1)
| ~ element(X4,X2)
| ~ element(X3,X1)
| ~ element(X4,X6)
| ~ element(X3,X5) ),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_39,plain,
( X2 = X4
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_40,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_41,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( one_sorted_str(X1)
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( empty(the_carrier(esk12_0))
| empty(X1)
| empty(X2)
| in(ordered_pair_as_product_element(X1,X2,esk13_0,esk14_0),relation_of_lattice(esk12_0))
| ~ element(esk14_0,X2)
| ~ element(esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24]),c_0_25])]) ).
cnf(c_0_44,plain,
( X2 = X4
| unordered_pair(unordered_pair(X1,X2),singleton(X1)) != unordered_pair(unordered_pair(X3,X4),singleton(X3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_27]),c_0_27]) ).
cnf(c_0_45,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( empty_carrier(X1)
| X2 = ordered_pair_as_product_element(the_carrier(X1),the_carrier(X1),esk6_2(X2,X1),esk7_2(X2,X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ in(X2,a_1_0_filter_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,plain,
( empty_carrier(X1)
| element(esk6_2(X2,X1),the_carrier(X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ in(X2,a_1_0_filter_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_48,plain,
( empty_carrier(X1)
| element(esk7_2(X2,X1),the_carrier(X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ in(X2,a_1_0_filter_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( empty(the_carrier(esk12_0))
| empty(X1)
| empty(X2)
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0))
| ~ element(esk14_0,X1)
| ~ element(esk13_0,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_51,plain,
( X1 = X2
| unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(singleton(X4),unordered_pair(X4,X2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( unordered_pair(singleton(esk6_2(X1,X2)),unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2))) = X1
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2)
| ~ in(X1,a_1_0_filter_1(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_32]),c_0_45]),c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( empty(the_carrier(esk12_0))
| empty(X1)
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0))
| ~ element(esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_24]) ).
cnf(c_0_54,plain,
( X1 = esk7_2(X2,X3)
| empty_carrier(X3)
| unordered_pair(unordered_pair(X4,X1),singleton(X4)) != X2
| ~ lattice(X3)
| ~ latt_str(X3)
| ~ in(X2,a_1_0_filter_1(X3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( empty(the_carrier(esk12_0))
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),relation_of_lattice(esk12_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_25]) ).
cnf(c_0_56,plain,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_57,plain,
( esk7_2(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) = X2
| empty_carrier(X3)
| ~ lattice(X3)
| ~ latt_str(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),a_1_0_filter_1(X3)) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( empty(the_carrier(esk12_0))
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),a_1_0_filter_1(esk12_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_59,plain,
( X1 = X3
| unordered_pair(unordered_pair(X1,X2),singleton(X1)) != unordered_pair(unordered_pair(X3,X4),singleton(X3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_27]),c_0_27]) ).
cnf(c_0_60,negated_conjecture,
( esk7_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0) = esk14_0
| empty(the_carrier(esk12_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_61,plain,
( X1 = X2
| unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X4,X2),singleton(X2)) ),
inference(spm,[status(thm)],[c_0_59,c_0_45]) ).
cnf(c_0_62,negated_conjecture,
( unordered_pair(unordered_pair(esk14_0,esk6_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)),singleton(esk6_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0))) = unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0))
| empty(the_carrier(esk12_0)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_60]),c_0_16]),c_0_17])]),c_0_18]),c_0_45]),c_0_45]),c_0_58]) ).
cnf(c_0_63,plain,
( empty_carrier(X1)
| below_refl(X1,esk6_2(X2,X1),esk7_2(X2,X1))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ in(X2,a_1_0_filter_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_64,negated_conjecture,
( X1 = esk6_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0)
| empty(the_carrier(esk12_0))
| unordered_pair(unordered_pair(X1,X2),singleton(X1)) != unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( below_refl(esk12_0,esk6_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0),esk14_0)
| empty(the_carrier(esk12_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_60]),c_0_16]),c_0_17])]),c_0_18]),c_0_58]) ).
cnf(c_0_66,negated_conjecture,
( esk6_2(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk12_0) = esk13_0
| empty(the_carrier(esk12_0)) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
empty(the_carrier(esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_31]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_67]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU342+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 04:18:17 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 27
% 0.23/1.41 # Initial clauses : 26
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 26
% 0.23/1.41 # Processed clauses : 67
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 14
% 0.23/1.41 # ...remaining for further processing : 53
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 51
% 0.23/1.41 # ...of the previous two non-trivial : 42
% 0.23/1.41 # Contextual simplify-reflections : 3
% 0.23/1.41 # Paramodulations : 47
% 0.23/1.41 # Factorizations : 2
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 52
% 0.23/1.41 # Positive orientable unit clauses : 9
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 39
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 230
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 210
% 0.23/1.41 # Non-unit clause-clause subsumptions : 18
% 0.23/1.41 # Unit Clause-clause subsumption calls : 7
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 2443
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.017 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.020 s
% 0.23/1.41 # Maximum resident set size: 3012 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.020 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 69
% 0.23/1.41 # Proof object clause steps : 48
% 0.23/1.41 # Proof object formula steps : 21
% 0.23/1.41 # Proof object conjectures : 25
% 0.23/1.41 # Proof object clause conjectures : 22
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 21
% 0.23/1.41 # Proof object initial formulas used : 10
% 0.23/1.41 # Proof object generating inferences : 23
% 0.23/1.41 # Proof object simplifying inferences : 47
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 66
% 0.23/1.41 # Removed in clause preprocessing : 11
% 0.23/1.41 # Initial clauses in saturation : 55
% 0.23/1.41 # Processed clauses : 1098
% 0.23/1.41 # ...of these trivial : 7
% 0.23/1.41 # ...subsumed : 755
% 0.23/1.41 # ...remaining for further processing : 336
% 0.23/1.41 # Other redundant clauses eliminated : 7
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 18
% 0.23/1.41 # Backward-rewritten : 67
% 0.23/1.41 # Generated clauses : 3139
% 0.23/1.41 # ...of the previous two non-trivial : 3090
% 0.23/1.41 # Contextual simplify-reflections : 706
% 0.23/1.41 # Paramodulations : 3092
% 0.23/1.41 # Factorizations : 4
% 0.23/1.41 # Equation resolutions : 39
% 0.23/1.41 # Current number of processed clauses : 247
% 0.23/1.41 # Positive orientable unit clauses : 19
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 13
% 0.23/1.41 # Non-unit-clauses : 214
% 0.23/1.41 # Current number of unprocessed clauses: 1525
% 0.23/1.41 # ...number of literals in the above : 15180
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 90
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 85011
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 11256
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1439
% 0.23/1.41 # Unit Clause-clause subsumption calls : 88
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 8
% 0.23/1.41 # BW rewrite match successes : 8
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 93846
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.182 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.187 s
% 0.23/1.41 # Maximum resident set size: 6172 pages
% 0.23/23.48 eprover: CPU time limit exceeded, terminating
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53 eprover: No such file or directory
% 0.23/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53 eprover: No such file or directory
% 0.23/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.54 eprover: No such file or directory
% 0.23/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.54 eprover: No such file or directory
%------------------------------------------------------------------------------