TSTP Solution File: LAT359+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT359+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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 : Sun Jul 17 04:47:48 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 13 unt; 0 def)
% Number of atoms : 217 ( 42 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 259 ( 108 ~; 97 |; 32 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 142 ( 21 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_pboole,axiom,
! [X1,X2] :
( ( v1_relat_1(X2)
& v1_funct_1(X2) )
=> ( m1_pboole(X2,X1)
<=> k1_relat_1(X2) = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pboole) ).
fof(dt_m1_pboole,axiom,
! [X1,X2] :
( m1_pboole(X2,X1)
=> ( v1_relat_1(X2)
& v1_funct_1(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_m1_pboole) ).
fof(d1_binop_1,axiom,
! [X1] :
( ( v1_relat_1(X1)
& v1_funct_1(X1) )
=> ! [X2,X3] : k1_binop_1(X1,X2,X3) = k1_funct_1(X1,k4_tarski(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_binop_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( r2_hidden(k4_tarski(X1,X2),k2_zfmisc_1(X3,X4))
<=> ( r2_hidden(X1,X3)
& r2_hidden(X2,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t106_zfmisc_1) ).
fof(dt_u1_altcat_1,axiom,
! [X1] :
( l1_altcat_1(X1)
=> m1_pboole(u1_altcat_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_u1_altcat_1) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( v1_relat_1(X1)
& v1_funct_1(X1) )
=> ! [X2,X3] :
( ( r2_hidden(X2,k1_relat_1(X1))
=> ( X3 = k1_funct_1(X1,X2)
<=> r2_hidden(k4_tarski(X2,X3),X1) ) )
& ( ~ r2_hidden(X2,k1_relat_1(X1))
=> ( X3 = k1_funct_1(X1,X2)
<=> X3 = k1_xboole_0 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_funct_1) ).
fof(t12_waybel34,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& l2_altcat_1(X1) )
=> ! [X2,X3,X4] :
~ ( r2_hidden(X4,k1_binop_1(u1_altcat_1(X1),X2,X3))
& ! [X5] :
( m1_subset_1(X5,u1_struct_0(X1))
=> ! [X6] :
( m1_subset_1(X6,u1_struct_0(X1))
=> ~ ( X5 = X2
& X6 = X3
& r2_hidden(X4,k1_altcat_1(X1,X5,X6))
& m1_subset_1(X4,k1_altcat_1(X1,X5,X6)) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_waybel34) ).
fof(dt_l2_altcat_1,axiom,
! [X1] :
( l2_altcat_1(X1)
=> l1_altcat_1(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l2_altcat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( r2_hidden(X1,X2)
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_subset) ).
fof(d2_altcat_1,axiom,
! [X1] :
( l1_altcat_1(X1)
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> k1_altcat_1(X1,X2,X3) = k1_binop_1(u1_altcat_1(X1),X2,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_altcat_1) ).
fof(fc6_membered,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v5_membered(k1_xboole_0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc6_membered) ).
fof(c_0_13,plain,
! [X3,X4] :
( ( ~ m1_pboole(X4,X3)
| k1_relat_1(X4) = X3
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) )
& ( k1_relat_1(X4) != X3
| m1_pboole(X4,X3)
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pboole])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ( v1_relat_1(X4)
| ~ m1_pboole(X4,X3) )
& ( v1_funct_1(X4)
| ~ m1_pboole(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_pboole])])]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ v1_relat_1(X4)
| ~ v1_funct_1(X4)
| k1_binop_1(X4,X5,X6) = k1_funct_1(X4,k4_tarski(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_binop_1])])])])]) ).
fof(c_0_16,plain,
! [X3,X4] : k4_tarski(X3,X4) = k2_tarski(k2_tarski(X3,X4),k1_tarski(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( r2_hidden(X5,X7)
| ~ r2_hidden(k4_tarski(X5,X6),k2_zfmisc_1(X7,X8)) )
& ( r2_hidden(X6,X8)
| ~ r2_hidden(k4_tarski(X5,X6),k2_zfmisc_1(X7,X8)) )
& ( ~ r2_hidden(X5,X7)
| ~ r2_hidden(X6,X8)
| r2_hidden(k4_tarski(X5,X6),k2_zfmisc_1(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])])]) ).
cnf(c_0_18,plain,
( k1_relat_1(X1) = X2
| ~ v1_funct_1(X1)
| ~ v1_relat_1(X1)
| ~ m1_pboole(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( v1_relat_1(X1)
| ~ m1_pboole(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( v1_funct_1(X1)
| ~ m1_pboole(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X2] :
( ~ l1_altcat_1(X2)
| m1_pboole(u1_altcat_1(X2),k2_zfmisc_1(u1_struct_0(X2),u1_struct_0(X2))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_altcat_1])]) ).
fof(c_0_22,plain,
! [X4,X5,X6,X6,X5,X6,X6] :
( ( X6 != k1_funct_1(X4,X5)
| r2_hidden(k4_tarski(X5,X6),X4)
| ~ r2_hidden(X5,k1_relat_1(X4))
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) )
& ( ~ r2_hidden(k4_tarski(X5,X6),X4)
| X6 = k1_funct_1(X4,X5)
| ~ r2_hidden(X5,k1_relat_1(X4))
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) )
& ( X6 != k1_funct_1(X4,X5)
| X6 = k1_xboole_0
| r2_hidden(X5,k1_relat_1(X4))
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) )
& ( X6 != k1_xboole_0
| X6 = k1_funct_1(X4,X5)
| r2_hidden(X5,k1_relat_1(X4))
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[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)],[d4_funct_1])])])])])])]) ).
cnf(c_0_23,plain,
( k1_binop_1(X1,X2,X3) = k1_funct_1(X1,k4_tarski(X2,X3))
| ~ v1_funct_1(X1)
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& l2_altcat_1(X1) )
=> ! [X2,X3,X4] :
~ ( r2_hidden(X4,k1_binop_1(u1_altcat_1(X1),X2,X3))
& ! [X5] :
( m1_subset_1(X5,u1_struct_0(X1))
=> ! [X6] :
( m1_subset_1(X6,u1_struct_0(X1))
=> ~ ( X5 = X2
& X6 = X3
& r2_hidden(X4,k1_altcat_1(X1,X5,X6))
& m1_subset_1(X4,k1_altcat_1(X1,X5,X6)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t12_waybel34]) ).
cnf(c_0_26,plain,
( r2_hidden(X1,X3)
| ~ r2_hidden(k4_tarski(X1,X2),k2_zfmisc_1(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( k1_relat_1(X1) = X2
| ~ m1_pboole(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_28,plain,
( m1_pboole(u1_altcat_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)))
| ~ l1_altcat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( r2_hidden(X2,k1_relat_1(X1))
| X3 = k1_xboole_0
| ~ v1_funct_1(X1)
| ~ v1_relat_1(X1)
| X3 != k1_funct_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( k1_binop_1(X1,X2,X3) = k1_funct_1(X1,k2_tarski(k2_tarski(X2,X3),k1_tarski(X2)))
| ~ v1_funct_1(X1)
| ~ v1_relat_1(X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_31,plain,
! [X2] :
( ~ l2_altcat_1(X2)
| l1_altcat_1(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l2_altcat_1])]) ).
fof(c_0_32,negated_conjecture,
! [X11,X12] :
( ~ v3_struct_0(esk1_0)
& l2_altcat_1(esk1_0)
& r2_hidden(esk4_0,k1_binop_1(u1_altcat_1(esk1_0),esk2_0,esk3_0))
& ( ~ m1_subset_1(X11,u1_struct_0(esk1_0))
| ~ m1_subset_1(X12,u1_struct_0(esk1_0))
| X11 != esk2_0
| X12 != esk3_0
| ~ r2_hidden(esk4_0,k1_altcat_1(esk1_0,X11,X12))
| ~ m1_subset_1(esk4_0,k1_altcat_1(esk1_0,X11,X12)) ) ),
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)],[c_0_25])])])])])])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| ~ v1_xboole_0(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_34,plain,
( r2_hidden(X1,X3)
| ~ r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),k2_zfmisc_1(X3,X4)) ),
inference(rw,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_35,plain,
( k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)) = k1_relat_1(u1_altcat_1(X1))
| ~ l1_altcat_1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( X1 = k1_xboole_0
| r2_hidden(k2_tarski(k2_tarski(X2,X3),k1_tarski(X2)),k1_relat_1(X4))
| X1 != k1_binop_1(X4,X2,X3)
| ~ v1_relat_1(X4)
| ~ v1_funct_1(X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( r2_hidden(X2,X4)
| ~ r2_hidden(k4_tarski(X1,X2),k2_zfmisc_1(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_38,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_39,plain,
! [X4,X5,X6] :
( ~ l1_altcat_1(X4)
| ~ m1_subset_1(X5,u1_struct_0(X4))
| ~ m1_subset_1(X6,u1_struct_0(X4))
| k1_altcat_1(X4,X5,X6) = k1_binop_1(u1_altcat_1(X4),X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_altcat_1])])])])]) ).
cnf(c_0_40,plain,
( l1_altcat_1(X1)
| ~ l2_altcat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,negated_conjecture,
l2_altcat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,negated_conjecture,
r2_hidden(esk4_0,k1_binop_1(u1_altcat_1(esk1_0),esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ l1_altcat_1(X2)
| ~ r2_hidden(k2_tarski(k2_tarski(X1,X3),k1_tarski(X1)),k1_relat_1(u1_altcat_1(X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( k1_binop_1(X1,X2,X3) = k1_xboole_0
| r2_hidden(k2_tarski(k2_tarski(X2,X3),k1_tarski(X2)),k1_relat_1(X1))
| ~ v1_relat_1(X1)
| ~ v1_funct_1(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( v1_funct_1(u1_altcat_1(X1))
| ~ l1_altcat_1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_47,plain,
( v1_relat_1(u1_altcat_1(X1))
| ~ l1_altcat_1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_48,plain,
( r2_hidden(X2,X4)
| ~ r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),k2_zfmisc_1(X3,X4)) ),
inference(rw,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_49,negated_conjecture,
( ~ m1_subset_1(esk4_0,k1_altcat_1(esk1_0,X1,X2))
| ~ r2_hidden(esk4_0,k1_altcat_1(esk1_0,X1,X2))
| X2 != esk3_0
| X1 != esk2_0
| ~ m1_subset_1(X2,u1_struct_0(esk1_0))
| ~ m1_subset_1(X1,u1_struct_0(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_50,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_51,plain,
( k1_altcat_1(X1,X2,X3) = k1_binop_1(u1_altcat_1(X1),X2,X3)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_altcat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_52,negated_conjecture,
l1_altcat_1(esk1_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_53,negated_conjecture,
~ v1_xboole_0(k1_binop_1(u1_altcat_1(esk1_0),esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,plain,
( k1_binop_1(u1_altcat_1(X1),X2,X3) = k1_xboole_0
| r2_hidden(X2,u1_struct_0(X1))
| ~ l1_altcat_1(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]) ).
cnf(c_0_55,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_56,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ l1_altcat_1(X2)
| ~ r2_hidden(k2_tarski(k2_tarski(X3,X1),k1_tarski(X3)),k1_relat_1(u1_altcat_1(X2))) ),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_57,negated_conjecture,
( X1 != esk3_0
| X2 != esk2_0
| ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ m1_subset_1(X2,u1_struct_0(esk1_0))
| ~ r2_hidden(esk4_0,k1_altcat_1(esk1_0,X2,X1)) ),
inference(csr,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( r2_hidden(esk4_0,k1_altcat_1(esk1_0,esk2_0,esk3_0))
| ~ m1_subset_1(esk3_0,u1_struct_0(esk1_0))
| ~ m1_subset_1(esk2_0,u1_struct_0(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_51]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
r2_hidden(esk2_0,u1_struct_0(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_52])]) ).
cnf(c_0_60,plain,
( k1_binop_1(u1_altcat_1(X1),X2,X3) = k1_xboole_0
| r2_hidden(X3,u1_struct_0(X1))
| ~ l1_altcat_1(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_45]),c_0_46]),c_0_47]) ).
cnf(c_0_61,negated_conjecture,
( ~ m1_subset_1(esk3_0,u1_struct_0(esk1_0))
| ~ m1_subset_1(esk2_0,u1_struct_0(esk1_0)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
m1_subset_1(esk2_0,u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_50,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_60]),c_0_55]),c_0_52])]) ).
cnf(c_0_64,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LAT359+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 28 20:19:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 73
% 0.22/1.40 # Removed by relevancy pruning/SinE : 41
% 0.22/1.40 # Initial clauses : 46
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 45
% 0.22/1.40 # Processed clauses : 140
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 62
% 0.22/1.40 # ...remaining for further processing : 78
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 2
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 117
% 0.22/1.40 # ...of the previous two non-trivial : 97
% 0.22/1.40 # Contextual simplify-reflections : 2
% 0.22/1.40 # Paramodulations : 117
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 76
% 0.22/1.40 # Positive orientable unit clauses : 20
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 9
% 0.22/1.40 # Non-unit-clauses : 46
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 3
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2036
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1862
% 0.22/1.40 # Non-unit clause-clause subsumptions : 64
% 0.22/1.40 # Unit Clause-clause subsumption calls : 48
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 4080
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.022 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.023 s
% 0.22/1.40 # Maximum resident set size: 3100 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.020 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 66
% 0.22/1.40 # Proof object clause steps : 40
% 0.22/1.40 # Proof object formula steps : 26
% 0.22/1.40 # Proof object conjectures : 16
% 0.22/1.40 # Proof object clause conjectures : 13
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 17
% 0.22/1.40 # Proof object initial formulas used : 13
% 0.22/1.40 # Proof object generating inferences : 17
% 0.22/1.40 # Proof object simplifying inferences : 21
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 73
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 141
% 0.22/1.40 # Removed in clause preprocessing : 15
% 0.22/1.40 # Initial clauses in saturation : 126
% 0.22/1.40 # Processed clauses : 851
% 0.22/1.40 # ...of these trivial : 20
% 0.22/1.40 # ...subsumed : 386
% 0.22/1.40 # ...remaining for further processing : 445
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 9
% 0.22/1.40 # Backward-rewritten : 5
% 0.22/1.40 # Generated clauses : 1446
% 0.22/1.40 # ...of the previous two non-trivial : 1334
% 0.22/1.40 # Contextual simplify-reflections : 94
% 0.22/1.40 # Paramodulations : 1436
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 10
% 0.22/1.40 # Current number of processed clauses : 431
% 0.22/1.40 # Positive orientable unit clauses : 46
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 13
% 0.22/1.40 # Non-unit-clauses : 371
% 0.22/1.40 # Current number of unprocessed clauses: 601
% 0.22/1.40 # ...number of literals in the above : 2138
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 15
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 69064
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 42001
% 0.22/1.40 # Non-unit clause-clause subsumptions : 453
% 0.22/1.40 # Unit Clause-clause subsumption calls : 1066
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 11
% 0.22/1.40 # BW rewrite match successes : 5
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 30771
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.075 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.078 s
% 0.22/1.40 # Maximum resident set size: 4448 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------