TSTP Solution File: LAT310+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT310+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:46:52 EDT 2022
% Result : Theorem 2.40s 253.56s
% Output : CNFRefutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 25 unt; 0 def)
% Number of atoms : 231 ( 11 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 295 ( 118 ~; 114 |; 41 &)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 64 ( 1 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_filter_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> ! [X3] :
( ( ~ v1_xboole_0(X3)
& m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1))) )
=> ! [X4] :
( ( ~ v1_xboole_0(X4)
& m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X1))) )
=> ( ( r1_tarski(X3,X4)
=> r1_tarski(k19_filter_2(X1,X3),k19_filter_2(X1,X4)) )
& r1_tarski(k19_filter_2(X1,k19_filter_2(X1,X2)),k19_filter_2(X1,X2)) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t39_filter_2) ).
fof(dt_k19_filter_2,axiom,
! [X1,X2] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> m2_filter_2(k19_filter_2(X1,X2),X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k19_filter_2) ).
fof(dt_m2_filter_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( ~ v1_xboole_0(X2)
& m2_lattice4(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_m2_filter_2) ).
fof(dt_m2_lattice4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+375.ax',dt_m2_lattice4) ).
fof(d11_filter_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> ! [X3] :
( m2_filter_2(X3,X1)
=> ( X3 = k19_filter_2(X1,X2)
<=> ( r1_tarski(X2,X3)
& ! [X4] :
( m2_filter_2(X4,X1)
=> ( r1_tarski(X2,X4)
=> r1_tarski(X3,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d11_filter_2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X2,X3) )
=> r1_tarski(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t1_xboole_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> ! [X3] :
( ( ~ v1_xboole_0(X3)
& m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1))) )
=> ! [X4] :
( ( ~ v1_xboole_0(X4)
& m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X1))) )
=> ( ( r1_tarski(X3,X4)
=> r1_tarski(k19_filter_2(X1,X3),k19_filter_2(X1,X4)) )
& r1_tarski(k19_filter_2(X1,k19_filter_2(X1,X2)),k19_filter_2(X1,X2)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t39_filter_2]) ).
fof(c_0_8,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3)
| v1_xboole_0(X4)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| m2_filter_2(k19_filter_2(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k19_filter_2])])]) ).
fof(c_0_9,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& l3_lattices(esk1_0)
& ~ v1_xboole_0(esk2_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ~ v1_xboole_0(esk3_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ~ v1_xboole_0(esk4_0)
& m1_subset_1(esk4_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ( r1_tarski(esk3_0,esk4_0)
| ~ r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),k19_filter_2(esk1_0,esk2_0)) )
& ( ~ r1_tarski(k19_filter_2(esk1_0,esk3_0),k19_filter_2(esk1_0,esk4_0))
| ~ r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),k19_filter_2(esk1_0,esk2_0)) ) ),
inference(distribute,[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_7])])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ( ~ v1_xboole_0(X4)
| ~ m2_filter_2(X4,X3)
| v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3) )
& ( m2_lattice4(X4,X3)
| ~ m2_filter_2(X4,X3)
| v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3) ) ),
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)],[dt_m2_filter_2])])])])])])]) ).
cnf(c_0_11,plain,
( m2_filter_2(k19_filter_2(X1,X2),X1)
| v1_xboole_0(X2)
| v3_struct_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l3_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3)
| ~ m2_lattice4(X4,X3)
| m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3))) ),
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)],[dt_m2_lattice4])])])])])]) ).
cnf(c_0_18,plain,
( v3_struct_0(X1)
| m2_lattice4(X2,X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m2_filter_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
m2_filter_2(k19_filter_2(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]),c_0_16]) ).
fof(c_0_20,plain,
! [X5,X6,X7,X8] :
( ( r1_tarski(X6,X7)
| X7 != k19_filter_2(X5,X6)
| ~ m2_filter_2(X7,X5)
| v1_xboole_0(X6)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X5)))
| v3_struct_0(X5)
| ~ v10_lattices(X5)
| ~ l3_lattices(X5) )
& ( ~ m2_filter_2(X8,X5)
| ~ r1_tarski(X6,X8)
| r1_tarski(X7,X8)
| X7 != k19_filter_2(X5,X6)
| ~ m2_filter_2(X7,X5)
| v1_xboole_0(X6)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X5)))
| v3_struct_0(X5)
| ~ v10_lattices(X5)
| ~ l3_lattices(X5) )
& ( m2_filter_2(esk9_3(X5,X6,X7),X5)
| ~ r1_tarski(X6,X7)
| X7 = k19_filter_2(X5,X6)
| ~ m2_filter_2(X7,X5)
| v1_xboole_0(X6)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X5)))
| v3_struct_0(X5)
| ~ v10_lattices(X5)
| ~ l3_lattices(X5) )
& ( r1_tarski(X6,esk9_3(X5,X6,X7))
| ~ r1_tarski(X6,X7)
| X7 = k19_filter_2(X5,X6)
| ~ m2_filter_2(X7,X5)
| v1_xboole_0(X6)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X5)))
| v3_struct_0(X5)
| ~ v10_lattices(X5)
| ~ l3_lattices(X5) )
& ( ~ r1_tarski(X7,esk9_3(X5,X6,X7))
| ~ r1_tarski(X6,X7)
| X7 = k19_filter_2(X5,X6)
| ~ m2_filter_2(X7,X5)
| v1_xboole_0(X6)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X5)))
| v3_struct_0(X5)
| ~ v10_lattices(X5)
| ~ l3_lattices(X5) ) ),
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)],[d11_filter_2])])])])])])])]) ).
cnf(c_0_21,plain,
( m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| v3_struct_0(X2)
| ~ m2_lattice4(X1,X2)
| ~ l3_lattices(X2)
| ~ v10_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
m2_lattice4(k19_filter_2(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_23,plain,
( v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m2_filter_2(X2,X1)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( v3_struct_0(X1)
| v1_xboole_0(X2)
| r1_tarski(X3,X4)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ m2_filter_2(X3,X1)
| X3 != k19_filter_2(X1,X2)
| ~ r1_tarski(X2,X4)
| ~ m2_filter_2(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
m1_subset_1(k19_filter_2(esk1_0,esk2_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_21,c_0_22]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ v1_xboole_0(k19_filter_2(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_23,c_0_19]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_27,plain,
( v3_struct_0(X1)
| v1_xboole_0(X2)
| r1_tarski(X2,X3)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ m2_filter_2(X3,X1)
| X3 != k19_filter_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
~ v1_xboole_0(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
( r1_tarski(X1,X2)
| X1 != k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0))
| ~ m2_filter_2(X2,esk1_0)
| ~ m2_filter_2(X1,esk1_0)
| ~ r1_tarski(k19_filter_2(esk1_0,esk2_0),X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_13]),c_0_14])]),c_0_15]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
m2_filter_2(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_25]),c_0_13]),c_0_14])]),c_0_15]),c_0_26]) ).
fof(c_0_32,plain,
! [X3] : r1_tarski(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_33,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
~ v1_xboole_0(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_35,plain,
! [X4,X5,X6] :
( ~ r1_tarski(X4,X5)
| ~ r1_tarski(X5,X6)
| r1_tarski(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_36,negated_conjecture,
( r1_tarski(esk4_0,X1)
| X1 != k19_filter_2(esk1_0,esk4_0)
| ~ m2_filter_2(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_27,c_0_28]),c_0_13]),c_0_14])]),c_0_15]),c_0_29]) ).
cnf(c_0_37,negated_conjecture,
m2_filter_2(k19_filter_2(esk1_0,esk4_0),esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_28]),c_0_13]),c_0_14])]),c_0_15]),c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),X1)
| ~ m2_filter_2(X1,esk1_0)
| ~ r1_tarski(k19_filter_2(esk1_0,esk2_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( r1_tarski(X1,X2)
| X1 != k19_filter_2(esk1_0,esk3_0)
| ~ m2_filter_2(X2,esk1_0)
| ~ m2_filter_2(X1,esk1_0)
| ~ r1_tarski(esk3_0,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_33]),c_0_13]),c_0_14])]),c_0_15]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
m2_filter_2(k19_filter_2(esk1_0,esk3_0),esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_33]),c_0_13]),c_0_14])]),c_0_15]),c_0_34]) ).
cnf(c_0_42,plain,
( r1_tarski(X1,X2)
| ~ r1_tarski(X3,X2)
| ~ r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
r1_tarski(esk4_0,k19_filter_2(esk1_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
( r1_tarski(esk3_0,esk4_0)
| ~ r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),k19_filter_2(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),k19_filter_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_39]),c_0_19])]) ).
cnf(c_0_46,negated_conjecture,
( r1_tarski(k19_filter_2(esk1_0,esk3_0),X1)
| ~ m2_filter_2(X1,esk1_0)
| ~ r1_tarski(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( r1_tarski(X1,k19_filter_2(esk1_0,esk4_0))
| ~ r1_tarski(X1,esk4_0) ),
inference(pm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
r1_tarski(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
( ~ r1_tarski(k19_filter_2(esk1_0,k19_filter_2(esk1_0,esk2_0)),k19_filter_2(esk1_0,esk2_0))
| ~ r1_tarski(k19_filter_2(esk1_0,esk3_0),k19_filter_2(esk1_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_50,negated_conjecture,
( r1_tarski(k19_filter_2(esk1_0,esk3_0),k19_filter_2(esk1_0,esk4_0))
| ~ r1_tarski(esk3_0,k19_filter_2(esk1_0,esk4_0)) ),
inference(pm,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
r1_tarski(esk3_0,k19_filter_2(esk1_0,esk4_0)),
inference(pm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ r1_tarski(k19_filter_2(esk1_0,esk3_0),k19_filter_2(esk1_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_45])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT310+3 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 28 19:45:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.02/24.06 eprover: CPU time limit exceeded, terminating
% 1.02/24.07 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.02/24.07
% 1.02/24.07 eprover: CPU time limit exceeded, terminating
% 1.15/47.08 eprover: CPU time limit exceeded, terminating
% 1.15/47.09 eprover: CPU time limit exceeded, terminating
% 1.15/47.10 eprover: CPU time limit exceeded, terminating
% 1.15/47.10 eprover: CPU time limit exceeded, terminating
% 1.29/70.11 eprover: CPU time limit exceeded, terminating
% 1.29/70.11 eprover: CPU time limit exceeded, terminating
% 1.29/70.12 eprover: CPU time limit exceeded, terminating
% 1.29/70.12 eprover: CPU time limit exceeded, terminating
% 1.43/93.14 eprover: CPU time limit exceeded, terminating
% 1.43/93.14 eprover: CPU time limit exceeded, terminating
% 1.43/93.14 eprover: CPU time limit exceeded, terminating
% 1.43/93.16 eprover: CPU time limit exceeded, terminating
% 1.57/116.17 eprover: CPU time limit exceeded, terminating
% 1.57/116.17 eprover: CPU time limit exceeded, terminating
% 1.57/116.18 eprover: CPU time limit exceeded, terminating
% 1.57/116.20 eprover: CPU time limit exceeded, terminating
% 1.70/139.19 eprover: CPU time limit exceeded, terminating
% 1.70/139.19 eprover: CPU time limit exceeded, terminating
% 1.70/139.21 eprover: CPU time limit exceeded, terminating
% 1.70/139.22 eprover: CPU time limit exceeded, terminating
% 1.85/162.21 eprover: CPU time limit exceeded, terminating
% 1.85/162.24 eprover: CPU time limit exceeded, terminating
% 1.85/162.24 eprover: CPU time limit exceeded, terminating
% 1.85/162.24 eprover: CPU time limit exceeded, terminating
% 1.99/185.25 eprover: CPU time limit exceeded, terminating
% 1.99/185.26 eprover: CPU time limit exceeded, terminating
% 1.99/185.26 eprover: CPU time limit exceeded, terminating
% 1.99/185.27 eprover: CPU time limit exceeded, terminating
% 2.13/208.27 eprover: CPU time limit exceeded, terminating
% 2.13/208.27 eprover: CPU time limit exceeded, terminating
% 2.13/208.30 eprover: CPU time limit exceeded, terminating
% 2.13/208.31 eprover: CPU time limit exceeded, terminating
% 2.27/231.30 eprover: CPU time limit exceeded, terminating
% 2.27/231.31 eprover: CPU time limit exceeded, terminating
% 2.27/231.32 eprover: CPU time limit exceeded, terminating
% 2.27/231.33 eprover: CPU time limit exceeded, terminating
% 2.40/253.56 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 2.40/253.56 # Preprocessing time : 0.470 s
% 2.40/253.56 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 2.40/253.56 # Preprocessing time : 0.463 s
% 2.40/253.56 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 2.40/253.56 # Preprocessing time : 0.470 s
% 2.40/253.56 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # Preprocessing time : 2.295 s
% 2.40/253.56 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 2.40/253.56 # Preprocessing time : 0.351 s
% 2.40/253.56 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # Preprocessing time : 2.294 s
% 2.40/253.56 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 2.40/253.56 # Preprocessing time : 0.335 s
% 2.40/253.56 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 2.40/253.56 # Preprocessing time : 0.351 s
% 2.40/253.56 # Running protocol protocol_eprover_334d43c175335e554899225728a5c2ebd420f86b for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # Preprocessing time : 2.105 s
% 2.40/253.56 # Running protocol protocol_eprover_13918ce26d63c8fe682016bfda2032977bcbf85b for 23 seconds:
% 2.40/253.56
% 2.40/253.56 # Failure: Resource limit exceeded (time)
% 2.40/253.56 # OLD status Res
% 2.40/253.56 # Preprocessing time : 2.200 s
% 2.40/253.56 # Running protocol protocol_eprover_374255c1532cc4daa30b60038971be8183a2c553 for 23 seconds:
% 2.40/253.56 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 2.40/253.56 # Preprocessing time : 0.468 s
% 2.40/253.56
% 2.40/253.56 # Proof found!
% 2.40/253.56 # SZS status Theorem
% 2.40/253.56 # SZS output start CNFRefutation
% See solution above
% 2.40/253.56 # Proof object total steps : 54
% 2.40/253.56 # Proof object clause steps : 39
% 2.40/253.56 # Proof object formula steps : 15
% 2.40/253.56 # Proof object conjectures : 34
% 2.40/253.56 # Proof object clause conjectures : 31
% 2.40/253.56 # Proof object formula conjectures : 3
% 2.40/253.56 # Proof object initial clauses used : 19
% 2.40/253.56 # Proof object initial formulas used : 7
% 2.40/253.56 # Proof object generating inferences : 17
% 2.40/253.56 # Proof object simplifying inferences : 62
% 2.40/253.56 # Training examples: 0 positive, 0 negative
% 2.40/253.56 # Parsed axioms : 13627
% 2.40/253.56 # Removed by relevancy pruning/SinE : 13526
% 2.40/253.56 # Initial clauses : 267
% 2.40/253.56 # Removed in clause preprocessing : 4
% 2.40/253.56 # Initial clauses in saturation : 263
% 2.40/253.56 # Processed clauses : 11143
% 2.40/253.56 # ...of these trivial : 183
% 2.40/253.56 # ...subsumed : 1686
% 2.40/253.56 # ...remaining for further processing : 9274
% 2.40/253.56 # Other redundant clauses eliminated : 7
% 2.40/253.56 # Clauses deleted for lack of memory : 494203
% 2.40/253.56 # Backward-subsumed : 16
% 2.40/253.56 # Backward-rewritten : 209
% 2.40/253.56 # Generated clauses : 586528
% 2.40/253.56 # ...of the previous two non-trivial : 583450
% 2.40/253.56 # Contextual simplify-reflections : 0
% 2.40/253.56 # Paramodulations : 586275
% 2.40/253.56 # Factorizations : 46
% 2.40/253.56 # Equation resolutions : 206
% 2.40/253.56 # Current number of processed clauses : 9043
% 2.40/253.56 # Positive orientable unit clauses : 1137
% 2.40/253.56 # Positive unorientable unit clauses: 0
% 2.40/253.56 # Negative unit clauses : 734
% 2.40/253.56 # Non-unit-clauses : 7172
% 2.40/253.56 # Current number of unprocessed clauses: 72848
% 2.40/253.56 # ...number of literals in the above : 305001
% 2.40/253.56 # Current number of archived formulas : 0
% 2.40/253.56 # Current number of archived clauses : 225
% 2.40/253.56 # Clause-clause subsumption calls (NU) : 2570328
% 2.40/253.56 # Rec. Clause-clause subsumption calls : 274465
% 2.40/253.56 # Non-unit clause-clause subsumptions : 662
% 2.40/253.56 # Unit Clause-clause subsumption calls : 745197
% 2.40/253.56 # Rewrite failures with RHS unbound : 0
% 2.40/253.56 # BW rewrite match attempts : 5988
% 2.40/253.56 # BW rewrite match successes : 18
% 2.40/253.56 # Condensation attempts : 0
% 2.40/253.56 # Condensation successes : 0
% 2.40/253.56 # Termbank termtop insertions : 12873491
% 2.40/253.56
% 2.40/253.56 # -------------------------------------------------
% 2.40/253.56 # User time : 21.931 s
% 2.40/253.56 # System time : 0.145 s
% 2.40/253.56 # Total time : 22.076 s
% 2.40/253.56 # Maximum resident set size: 177720 pages
%------------------------------------------------------------------------------