TSTP Solution File: SEU407+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU407+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:20 EDT 2023
% Result : Theorem 14.04s 6.93s
% Output : CNFRefutation 14.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 75 ( 22 unt; 0 def)
% Number of atoms : 246 ( 42 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 279 ( 108 ~; 99 |; 39 &)
% ( 12 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-6 aty)
% Number of variables : 113 ( 1 sgn; 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_latsum_1,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,u1_struct_0(X1))
| r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t7_latsum_1) ).
fof(t65_zfmisc_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,k1_tarski(X2)) = X1
<=> ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t65_zfmisc_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',d2_subset_1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',fc1_struct_0) ).
fof(t67_zfmisc_1,axiom,
! [X1,X2] :
( k4_xboole_0(k1_tarski(X1),X2) = k1_tarski(X1)
<=> ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t67_zfmisc_1) ).
fof(t79_xboole_1,axiom,
! [X1,X2] : r1_xboole_0(k4_xboole_0(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t79_xboole_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( r1_xboole_0(X1,X2)
=> r1_xboole_0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',symmetry_r1_xboole_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',dt_l1_orders_2) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( v1_orders_2(X3)
& l1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',dt_k1_latsum_1) ).
fof(t83_xboole_1,axiom,
! [X1,X2] :
( r1_xboole_0(X1,X2)
<=> k4_xboole_0(X1,X2) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t83_xboole_1) ).
fof(fc1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ( ~ v3_struct_0(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',fc1_latsum_1) ).
fof(t81_xboole_1,axiom,
! [X1,X2,X3] :
( r1_xboole_0(X1,k4_xboole_0(X2,X3))
=> r1_xboole_0(X2,k4_xboole_0(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',t81_xboole_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p',d2_xboole_0) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,u1_struct_0(X1))
| r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1))) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t7_latsum_1])]) ).
fof(c_0_15,plain,
! [X1,X2] :
( k4_xboole_0(X1,k1_tarski(X2)) = X1
<=> ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
fof(c_0_16,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_17,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& l1_orders_2(esk1_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(esk2_0)
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& ~ r2_hidden(esk3_0,u1_struct_0(esk1_0))
& ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_18,plain,
! [X195,X196] :
( ( k4_xboole_0(X195,k1_tarski(X196)) != X195
| ~ r2_hidden(X196,X195) )
& ( r2_hidden(X196,X195)
| k4_xboole_0(X195,k1_tarski(X196)) = X195 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])]) ).
fof(c_0_19,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_20,plain,
! [X29,X30] :
( ( ~ m1_subset_1(X30,X29)
| r2_hidden(X30,X29)
| v1_xboole_0(X29) )
& ( ~ r2_hidden(X30,X29)
| m1_subset_1(X30,X29)
| v1_xboole_0(X29) )
& ( ~ m1_subset_1(X30,X29)
| v1_xboole_0(X30)
| ~ v1_xboole_0(X29) )
& ( ~ v1_xboole_0(X30)
| m1_subset_1(X30,X29)
| ~ v1_xboole_0(X29) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( k4_xboole_0(k1_tarski(X1),X2) = k1_tarski(X1)
<=> ~ r2_hidden(X1,X2) ),
inference(fof_simplification,[status(thm)],[t67_zfmisc_1]) ).
fof(c_0_22,plain,
! [X142,X143] : r1_xboole_0(k4_xboole_0(X142,X143),X143),
inference(variable_rename,[status(thm)],[t79_xboole_1]) ).
cnf(c_0_23,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( r2_hidden(X1,X2)
| k4_xboole_0(X2,k1_tarski(X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X2451] :
( v3_struct_0(X2451)
| ~ l1_struct_0(X2451)
| ~ v1_xboole_0(u1_struct_0(X2451)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_26,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_28,plain,
! [X199,X200] :
( ( k4_xboole_0(k1_tarski(X199),X200) != k1_tarski(X199)
| ~ r2_hidden(X199,X200) )
& ( r2_hidden(X199,X200)
| k4_xboole_0(k1_tarski(X199),X200) = k1_tarski(X199) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
fof(c_0_29,plain,
! [X733,X734] :
( ~ r1_xboole_0(X733,X734)
| r1_xboole_0(X734,X733) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
cnf(c_0_30,plain,
r1_xboole_0(k4_xboole_0(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
k4_xboole_0(u1_struct_0(esk1_0),k1_tarski(esk3_0)) = u1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( v3_struct_0(X1)
| ~ l1_struct_0(X1)
| ~ v1_xboole_0(u1_struct_0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( v1_xboole_0(u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X2461] :
( ~ l1_orders_2(X2461)
| l1_struct_0(X2461) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
fof(c_0_35,plain,
! [X265,X266,X267] :
( ( u1_struct_0(X267) = k2_xboole_0(u1_struct_0(X265),u1_struct_0(X266))
| X267 != k1_latsum_1(X265,X266)
| ~ v1_orders_2(X267)
| ~ l1_orders_2(X267)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X265) )
& ( u1_orders_2(X267) = k2_xboole_0(k2_xboole_0(u1_orders_2(X265),u1_orders_2(X266)),k7_relset_1(u1_struct_0(X265),u1_struct_0(X265),u1_struct_0(X266),u1_struct_0(X266),u1_orders_2(X265),u1_orders_2(X266)))
| X267 != k1_latsum_1(X265,X266)
| ~ v1_orders_2(X267)
| ~ l1_orders_2(X267)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X265) )
& ( u1_struct_0(X267) != k2_xboole_0(u1_struct_0(X265),u1_struct_0(X266))
| u1_orders_2(X267) != k2_xboole_0(k2_xboole_0(u1_orders_2(X265),u1_orders_2(X266)),k7_relset_1(u1_struct_0(X265),u1_struct_0(X265),u1_struct_0(X266),u1_struct_0(X266),u1_orders_2(X265),u1_orders_2(X266)))
| X267 = k1_latsum_1(X265,X266)
| ~ v1_orders_2(X267)
| ~ l1_orders_2(X267)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X265) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])]) ).
fof(c_0_36,plain,
! [X263,X264] :
( ( v1_orders_2(k1_latsum_1(X263,X264))
| ~ l1_orders_2(X263)
| ~ l1_orders_2(X264) )
& ( l1_orders_2(k1_latsum_1(X263,X264))
| ~ l1_orders_2(X263)
| ~ l1_orders_2(X264) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_37,negated_conjecture,
~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,plain,
( r2_hidden(X1,X2)
| k4_xboole_0(k1_tarski(X1),X2) = k1_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_39,plain,
! [X152,X153] :
( ( ~ r1_xboole_0(X152,X153)
| k4_xboole_0(X152,X153) = X152 )
& ( k4_xboole_0(X152,X153) != X152
| r1_xboole_0(X152,X153) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).
cnf(c_0_40,plain,
( r1_xboole_0(X2,X1)
| ~ r1_xboole_0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
r1_xboole_0(u1_struct_0(esk1_0),k1_tarski(esk3_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_42,plain,
! [X1,X2] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ( ~ v3_struct_0(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[fc1_latsum_1]) ).
cnf(c_0_43,negated_conjecture,
( v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| ~ l1_struct_0(k1_latsum_1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,plain,
( l1_struct_0(X1)
| ~ l1_orders_2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_45,plain,
( u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3))
| X1 != k1_latsum_1(X2,X3)
| ~ v1_orders_2(X1)
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_48,plain,
! [X147,X148,X149] :
( ~ r1_xboole_0(X147,k4_xboole_0(X148,X149))
| r1_xboole_0(X148,k4_xboole_0(X147,X149)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t81_xboole_1])]) ).
cnf(c_0_49,negated_conjecture,
k4_xboole_0(k1_tarski(esk3_0),k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))) = k1_tarski(esk3_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,plain,
( k4_xboole_0(X1,X2) = X1
| ~ r1_xboole_0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,negated_conjecture,
r1_xboole_0(k1_tarski(esk3_0),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_52,plain,
! [X268,X269] :
( ( ~ v3_struct_0(k1_latsum_1(X268,X269))
| ~ l1_orders_2(X268)
| v3_struct_0(X269)
| ~ l1_orders_2(X269) )
& ( v1_orders_2(k1_latsum_1(X268,X269))
| ~ l1_orders_2(X268)
| v3_struct_0(X269)
| ~ l1_orders_2(X269) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_53,negated_conjecture,
( v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_55,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_56,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46]),c_0_47]) ).
cnf(c_0_57,plain,
( r1_xboole_0(X2,k4_xboole_0(X1,X3))
| ~ r1_xboole_0(X1,k4_xboole_0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,negated_conjecture,
r1_xboole_0(k1_tarski(esk3_0),k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(spm,[status(thm)],[c_0_30,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
k4_xboole_0(k1_tarski(esk3_0),u1_struct_0(esk1_0)) = k1_tarski(esk3_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_60,plain,
! [X430,X431,X432,X433,X434,X435,X436,X437] :
( ( ~ r2_hidden(X433,X432)
| r2_hidden(X433,X430)
| r2_hidden(X433,X431)
| X432 != k2_xboole_0(X430,X431) )
& ( ~ r2_hidden(X434,X430)
| r2_hidden(X434,X432)
| X432 != k2_xboole_0(X430,X431) )
& ( ~ r2_hidden(X434,X431)
| r2_hidden(X434,X432)
| X432 != k2_xboole_0(X430,X431) )
& ( ~ r2_hidden(esk27_3(X435,X436,X437),X435)
| ~ r2_hidden(esk27_3(X435,X436,X437),X437)
| X437 = k2_xboole_0(X435,X436) )
& ( ~ r2_hidden(esk27_3(X435,X436,X437),X436)
| ~ r2_hidden(esk27_3(X435,X436,X437),X437)
| X437 = k2_xboole_0(X435,X436) )
& ( r2_hidden(esk27_3(X435,X436,X437),X437)
| r2_hidden(esk27_3(X435,X436,X437),X435)
| r2_hidden(esk27_3(X435,X436,X437),X436)
| X437 = k2_xboole_0(X435,X436) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).
cnf(c_0_61,plain,
( v3_struct_0(X2)
| ~ v3_struct_0(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_54]),c_0_55])]) ).
cnf(c_0_63,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_64,negated_conjecture,
( u1_struct_0(k1_latsum_1(esk1_0,X1)) = k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(X1))
| ~ l1_orders_2(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
r1_xboole_0(u1_struct_0(esk2_0),k1_tarski(esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_66,plain,
( r2_hidden(X1,X3)
| r2_hidden(X1,X4)
| ~ r2_hidden(X1,X2)
| X2 != k2_xboole_0(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_54]),c_0_55])]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
u1_struct_0(k1_latsum_1(esk1_0,esk2_0)) = k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),
inference(spm,[status(thm)],[c_0_64,c_0_54]) ).
cnf(c_0_69,plain,
( k4_xboole_0(X1,k1_tarski(X2)) != X1
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_70,negated_conjecture,
k4_xboole_0(u1_struct_0(esk2_0),k1_tarski(esk3_0)) = u1_struct_0(esk2_0),
inference(spm,[status(thm)],[c_0_50,c_0_65]) ).
cnf(c_0_71,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_72,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_23]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.23/1.23 % Problem : SEU407+3 : TPTP v8.1.2. Released v3.4.0.
% 1.23/1.24 % Command : run_E %s %d THM
% 1.23/1.45 % Computer : n022.cluster.edu
% 1.23/1.45 % Model : x86_64 x86_64
% 1.23/1.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.23/1.45 % Memory : 8042.1875MB
% 1.23/1.45 % OS : Linux 3.10.0-693.el7.x86_64
% 1.23/1.45 % CPULimit : 2400
% 1.23/1.45 % WCLimit : 300
% 1.23/1.45 % DateTime : Mon Oct 2 09:11:43 EDT 2023
% 1.23/1.45 % CPUTime :
% 4.88/5.08 Running first-order theorem proving
% 4.88/5.08 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/tmp/tmp.1U1JRBUAl2/E---3.1_23257.p
% 14.04/6.93 # Version: 3.1pre001
% 14.04/6.93 # Preprocessing class: FMLLMMLLSSSNFFN.
% 14.04/6.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.04/6.93 # Starting new_bool_3 with 900s (3) cores
% 14.04/6.93 # Starting new_bool_1 with 900s (3) cores
% 14.04/6.93 # Starting sh5l with 300s (1) cores
% 14.04/6.93 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 14.04/6.93 # new_bool_3 with pid 23335 completed with status 0
% 14.04/6.93 # Result found by new_bool_3
% 14.04/6.93 # Preprocessing class: FMLLMMLLSSSNFFN.
% 14.04/6.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.04/6.93 # Starting new_bool_3 with 900s (3) cores
% 14.04/6.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.04/6.93 # Search class: FGHSM-SMLM32-MFFFFFNN
% 14.04/6.93 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 14.04/6.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 14.04/6.93 # Starting new_bool_3 with 91s (1) cores
% 14.04/6.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 14.04/6.93 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 23339 completed with status 0
% 14.04/6.93 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 14.04/6.93 # Preprocessing class: FMLLMMLLSSSNFFN.
% 14.04/6.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.04/6.93 # Starting new_bool_3 with 900s (3) cores
% 14.04/6.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.04/6.93 # Search class: FGHSM-SMLM32-MFFFFFNN
% 14.04/6.93 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 14.04/6.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 14.04/6.93 # Preprocessing time : 0.054 s
% 14.04/6.93 # Presaturation interreduction done
% 14.04/6.93
% 14.04/6.93 # Proof found!
% 14.04/6.93 # SZS status Theorem
% 14.04/6.93 # SZS output start CNFRefutation
% See solution above
% 14.04/6.93 # Parsed axioms : 19033
% 14.04/6.93 # Removed by relevancy pruning/SinE : 18095
% 14.04/6.93 # Initial clauses : 1915
% 14.04/6.93 # Removed in clause preprocessing : 48
% 14.04/6.93 # Initial clauses in saturation : 1867
% 14.04/6.93 # Processed clauses : 9478
% 14.04/6.93 # ...of these trivial : 169
% 14.04/6.93 # ...subsumed : 4473
% 14.04/6.93 # ...remaining for further processing : 4836
% 14.04/6.93 # Other redundant clauses eliminated : 219
% 14.04/6.93 # Clauses deleted for lack of memory : 0
% 14.04/6.93 # Backward-subsumed : 41
% 14.04/6.93 # Backward-rewritten : 224
% 14.04/6.93 # Generated clauses : 31784
% 14.04/6.93 # ...of the previous two non-redundant : 27917
% 14.04/6.93 # ...aggressively subsumed : 0
% 14.04/6.93 # Contextual simplify-reflections : 122
% 14.04/6.93 # Paramodulations : 31559
% 14.04/6.93 # Factorizations : 5
% 14.04/6.93 # NegExts : 0
% 14.04/6.93 # Equation resolutions : 230
% 14.04/6.93 # Total rewrite steps : 10315
% 14.04/6.93 # Propositional unsat checks : 0
% 14.04/6.93 # Propositional check models : 0
% 14.04/6.93 # Propositional check unsatisfiable : 0
% 14.04/6.93 # Propositional clauses : 0
% 14.04/6.93 # Propositional clauses after purity: 0
% 14.04/6.93 # Propositional unsat core size : 0
% 14.04/6.93 # Propositional preprocessing time : 0.000
% 14.04/6.93 # Propositional encoding time : 0.000
% 14.04/6.93 # Propositional solver time : 0.000
% 14.04/6.93 # Success case prop preproc time : 0.000
% 14.04/6.93 # Success case prop encoding time : 0.000
% 14.04/6.93 # Success case prop solver time : 0.000
% 14.04/6.93 # Current number of processed clauses : 2730
% 14.04/6.93 # Positive orientable unit clauses : 923
% 14.04/6.93 # Positive unorientable unit clauses: 3
% 14.04/6.93 # Negative unit clauses : 730
% 14.04/6.93 # Non-unit-clauses : 1074
% 14.04/6.93 # Current number of unprocessed clauses: 21749
% 14.04/6.93 # ...number of literals in the above : 45107
% 14.04/6.93 # Current number of archived formulas : 0
% 14.04/6.93 # Current number of archived clauses : 1949
% 14.04/6.93 # Clause-clause subsumption calls (NU) : 1594893
% 14.04/6.93 # Rec. Clause-clause subsumption calls : 361756
% 14.04/6.93 # Non-unit clause-clause subsumptions : 601
% 14.04/6.93 # Unit Clause-clause subsumption calls : 144821
% 14.04/6.93 # Rewrite failures with RHS unbound : 0
% 14.04/6.93 # BW rewrite match attempts : 747
% 14.04/6.93 # BW rewrite match successes : 266
% 14.04/6.93 # Condensation attempts : 0
% 14.04/6.93 # Condensation successes : 0
% 14.04/6.93 # Termbank termtop insertions : 1004948
% 14.04/6.93
% 14.04/6.93 # -------------------------------------------------
% 14.04/6.93 # User time : 1.093 s
% 14.04/6.93 # System time : 0.087 s
% 14.04/6.93 # Total time : 1.180 s
% 14.04/6.93 # Maximum resident set size: 39040 pages
% 14.04/6.93
% 14.04/6.93 # -------------------------------------------------
% 14.04/6.93 # User time : 3.507 s
% 14.04/6.93 # System time : 0.183 s
% 14.04/6.93 # Total time : 3.690 s
% 14.04/6.93 # Maximum resident set size: 29612 pages
% 14.04/6.93 % E---3.1 exiting
% 14.04/6.93 % E---3.1 exiting
%------------------------------------------------------------------------------