TSTP Solution File: LAT005-10 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : LAT005-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 18:07:19 EDT 2023

% Result   : Unsatisfiable 51.50s 7.05s
% Output   : CNFRefutation 51.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   19
% Syntax   : Number of clauses     :  126 ( 126 unt;   0 nHn;  29 RR)
%            Number of literals    :  126 ( 125 equ;   6 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-4 aty)
%            Number of variables   :  199 (  41 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(complement_meet,axiom,
    ifeq(complement(X1,X2),true,meet(X1,X2),n0) = n0,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',complement_meet) ).

cnf(complement_of_a_join_b,hypothesis,
    complement(r1,join(a,b)) = true,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',complement_of_a_join_b) ).

cnf(ifeq_axiom_002,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',ifeq_axiom_002) ).

cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',associativity_of_meet) ).

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',absorption1) ).

cnf(modular,axiom,
    ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',modular) ).

cnf(x_join_0,axiom,
    join(X1,n0) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',x_join_0) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',commutativity_of_join) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',commutativity_of_meet) ).

cnf(ifeq_axiom,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',ifeq_axiom) ).

cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',absorption2) ).

cnf(associativity_of_join,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',associativity_of_join) ).

cnf(complement_of_a_meet_b,hypothesis,
    complement(r2,meet(a,b)) = true,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',complement_of_a_meet_b) ).

cnf(x_meet_0,axiom,
    meet(X1,n0) = n0,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',x_meet_0) ).

cnf(complement_join,axiom,
    ifeq(complement(X1,X2),true,join(X1,X2),n1) = n1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',complement_join) ).

cnf(x_meet_1,axiom,
    meet(X1,n1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',x_meet_1) ).

cnf(idempotence_of_meet,axiom,
    meet(X1,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',idempotence_of_meet) ).

cnf(idempotence_of_join,axiom,
    join(X1,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',idempotence_of_join) ).

cnf(prove_lemma,negated_conjecture,
    r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
    file('/export/starexec/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p',prove_lemma) ).

cnf(c_0_19,axiom,
    ifeq(complement(X1,X2),true,meet(X1,X2),n0) = n0,
    complement_meet ).

cnf(c_0_20,hypothesis,
    complement(r1,join(a,b)) = true,
    complement_of_a_join_b ).

cnf(c_0_21,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom_002 ).

cnf(c_0_22,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    associativity_of_meet ).

cnf(c_0_23,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption1 ).

cnf(c_0_24,axiom,
    ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
    modular ).

cnf(c_0_25,hypothesis,
    meet(r1,join(a,b)) = n0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_26,axiom,
    join(X1,n0) = X1,
    x_join_0 ).

cnf(c_0_27,axiom,
    join(X1,X2) = join(X2,X1),
    commutativity_of_join ).

cnf(c_0_28,plain,
    meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,axiom,
    meet(X1,X2) = meet(X2,X1),
    commutativity_of_meet ).

cnf(c_0_30,hypothesis,
    ifeq3(meet(X1,join(a,b)),X1,meet(join(a,b),join(X1,r1)),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_26]) ).

cnf(c_0_31,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_23,c_0_27]) ).

cnf(c_0_32,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_33,axiom,
    join(X1,meet(X1,X2)) = X1,
    absorption2 ).

cnf(c_0_34,plain,
    meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,hypothesis,
    meet(join(r1,b),join(a,b)) = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_32]),c_0_29]) ).

cnf(c_0_36,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    associativity_of_join ).

cnf(c_0_37,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_33,c_0_29]) ).

cnf(c_0_38,plain,
    join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_33,c_0_22]) ).

cnf(c_0_39,hypothesis,
    meet(a,join(r1,b)) = meet(a,b),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,hypothesis,
    complement(r2,meet(a,b)) = true,
    complement_of_a_meet_b ).

cnf(c_0_41,axiom,
    meet(X1,n0) = n0,
    x_meet_0 ).

cnf(c_0_42,plain,
    join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,hypothesis,
    join(meet(a,b),meet(a,meet(join(r1,b),X1))) = meet(a,b),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,plain,
    ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_45,hypothesis,
    meet(r2,meet(a,b)) = n0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_40]),c_0_21]) ).

cnf(c_0_46,plain,
    meet(n0,X1) = n0,
    inference(spm,[status(thm)],[c_0_41,c_0_29]) ).

cnf(c_0_47,hypothesis,
    join(b,meet(a,meet(join(r1,b),X1))) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37]) ).

cnf(c_0_48,plain,
    meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,join(X1,X2))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_32]) ).

cnf(c_0_49,plain,
    meet(join(X1,X2),join(X2,X3)) = join(X2,meet(join(X1,X2),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_32]) ).

cnf(c_0_50,hypothesis,
    meet(r2,meet(a,meet(b,X1))) = n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_45]),c_0_46]),c_0_22]) ).

cnf(c_0_51,hypothesis,
    join(b,meet(a,join(r1,meet(X1,join(r1,b))))) = b,
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_52,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_27,c_0_36]) ).

cnf(c_0_53,plain,
    meet(X1,meet(X2,X1)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_22]) ).

cnf(c_0_54,plain,
    meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X1,X3)),
    inference(spm,[status(thm)],[c_0_49,c_0_33]) ).

cnf(c_0_55,axiom,
    ifeq(complement(X1,X2),true,join(X1,X2),n1) = n1,
    complement_join ).

cnf(c_0_56,hypothesis,
    meet(r2,meet(a,meet(X1,b))) = n0,
    inference(spm,[status(thm)],[c_0_50,c_0_29]) ).

cnf(c_0_57,plain,
    meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_22]) ).

cnf(c_0_58,plain,
    meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
    inference(spm,[status(thm)],[c_0_29,c_0_22]) ).

cnf(c_0_59,hypothesis,
    join(b,meet(a,join(r1,meet(join(r1,b),X1)))) = b,
    inference(spm,[status(thm)],[c_0_51,c_0_29]) ).

cnf(c_0_60,hypothesis,
    meet(join(r1,b),meet(join(a,b),X1)) = meet(b,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_35]) ).

cnf(c_0_61,plain,
    meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_62,plain,
    join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
    inference(spm,[status(thm)],[c_0_52,c_0_27]) ).

cnf(c_0_63,plain,
    join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_42,c_0_53]) ).

cnf(c_0_64,plain,
    join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_37,c_0_53]) ).

cnf(c_0_65,plain,
    meet(X1,join(X2,meet(X1,X3))) = join(meet(X1,X3),meet(X1,X2)),
    inference(spm,[status(thm)],[c_0_54,c_0_27]) ).

cnf(c_0_66,hypothesis,
    join(r2,meet(a,b)) = n1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_21]) ).

cnf(c_0_67,axiom,
    meet(X1,n1) = X1,
    x_meet_1 ).

cnf(c_0_68,hypothesis,
    meet(a,meet(b,meet(r2,X1))) = n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).

cnf(c_0_69,hypothesis,
    join(b,meet(a,join(r1,meet(b,X1)))) = b,
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_70,plain,
    meet(X1,meet(X2,join(meet(X2,X1),X3))) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_61,c_0_29]) ).

cnf(c_0_71,axiom,
    meet(X1,X1) = X1,
    idempotence_of_meet ).

cnf(c_0_72,hypothesis,
    meet(join(r1,a),join(a,b)) = a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_27]),c_0_32]),c_0_29]) ).

cnf(c_0_73,plain,
    ifeq3(meet(X1,X2),X1,meet(join(X1,X3),X2),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_74,plain,
    meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_32]) ).

cnf(c_0_75,plain,
    join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).

cnf(c_0_76,hypothesis,
    join(meet(a,b),meet(a,r2)) = a,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).

cnf(c_0_77,axiom,
    join(X1,X1) = X1,
    idempotence_of_join ).

cnf(c_0_78,hypothesis,
    meet(a,meet(b,meet(X1,meet(r2,X2)))) = n0,
    inference(spm,[status(thm)],[c_0_68,c_0_58]) ).

cnf(c_0_79,hypothesis,
    join(b,meet(a,join(r1,meet(X1,b)))) = b,
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_80,plain,
    meet(X1,meet(X1,X2)) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_22,c_0_71]) ).

cnf(c_0_81,hypothesis,
    join(a,meet(join(r1,a),meet(join(a,b),X1))) = a,
    inference(spm,[status(thm)],[c_0_38,c_0_72]) ).

cnf(c_0_82,plain,
    meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_57,c_0_31]) ).

cnf(c_0_83,plain,
    join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,join(X1,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_23]),c_0_32]),c_0_74]) ).

cnf(c_0_84,hypothesis,
    meet(join(r1,b),meet(X1,join(a,b))) = meet(X1,b),
    inference(spm,[status(thm)],[c_0_57,c_0_35]) ).

cnf(c_0_85,plain,
    meet(X1,join(X2,meet(X3,X1))) = join(meet(X1,X3),meet(X1,X2)),
    inference(spm,[status(thm)],[c_0_54,c_0_75]) ).

cnf(c_0_86,hypothesis,
    join(b,meet(a,r2)) = join(a,b),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_76]),c_0_27]) ).

cnf(c_0_87,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_23]),c_0_36]) ).

cnf(c_0_88,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_36,c_0_77]) ).

cnf(c_0_89,hypothesis,
    meet(a,meet(r2,meet(X1,meet(b,X2)))) = n0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_58]),c_0_22]) ).

cnf(c_0_90,hypothesis,
    meet(a,meet(b,join(r1,meet(X1,b)))) = meet(a,join(r1,meet(X1,b))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_79]),c_0_22]),c_0_29]) ).

cnf(c_0_91,plain,
    meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
    inference(spm,[status(thm)],[c_0_80,c_0_58]) ).

cnf(c_0_92,hypothesis,
    meet(r1,meet(join(a,b),X1)) = n0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_46]) ).

cnf(c_0_93,hypothesis,
    join(a,meet(join(r1,a),meet(X1,join(a,b)))) = a,
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_94,negated_conjecture,
    r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
    prove_lemma ).

cnf(c_0_95,hypothesis,
    join(r1,meet(b,join(r1,meet(X1,join(a,b))))) = join(r1,meet(X1,b)),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_96,hypothesis,
    meet(r2,join(a,b)) = join(meet(a,r2),meet(b,r2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_29]),c_0_29]) ).

cnf(c_0_97,plain,
    meet(join(X1,X2),join(X3,X2)) = join(X2,meet(join(X1,X2),X3)),
    inference(spm,[status(thm)],[c_0_49,c_0_27]) ).

cnf(c_0_98,plain,
    join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X1,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_87]),c_0_83]),c_0_49]),c_0_88]) ).

cnf(c_0_99,hypothesis,
    meet(a,meet(r2,join(r1,meet(X1,b)))) = n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_57]) ).

cnf(c_0_100,hypothesis,
    meet(r1,meet(X1,join(a,b))) = n0,
    inference(spm,[status(thm)],[c_0_92,c_0_29]) ).

cnf(c_0_101,hypothesis,
    meet(b,join(r1,a)) = meet(a,b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_72]),c_0_29]),c_0_29]) ).

cnf(c_0_102,hypothesis,
    meet(join(r1,a),join(a,meet(X1,join(a,b)))) = a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_93]),c_0_31]),c_0_32]) ).

cnf(c_0_103,negated_conjecture,
    meet(join(r1,meet(a,r2)),join(r1,meet(b,r2))) != r1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_104,plain,
    meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_23,c_0_36]) ).

cnf(c_0_105,hypothesis,
    join(r1,meet(b,join(r1,join(meet(a,r2),meet(b,r2))))) = join(r1,meet(b,r2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_29]) ).

cnf(c_0_106,plain,
    meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,join(X1,X3))),
    inference(rw,[status(thm)],[c_0_74,c_0_83]) ).

cnf(c_0_107,plain,
    meet(join(X1,X2),join(X3,X2)) = join(X2,meet(X1,join(X2,X3))),
    inference(rw,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_108,plain,
    meet(X1,join(meet(X2,X1),X3)) = join(meet(X2,X1),meet(X1,X3)),
    inference(spm,[status(thm)],[c_0_49,c_0_37]) ).

cnf(c_0_109,hypothesis,
    meet(a,join(meet(r1,r2),meet(b,r2))) = n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_65]),c_0_29]),c_0_29]),c_0_27]) ).

cnf(c_0_110,hypothesis,
    meet(r1,b) = n0,
    inference(spm,[status(thm)],[c_0_100,c_0_31]) ).

cnf(c_0_111,hypothesis,
    meet(b,meet(join(r1,a),X1)) = meet(a,meet(b,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_101]),c_0_22]) ).

cnf(c_0_112,hypothesis,
    meet(join(r1,a),meet(X1,join(a,b))) = meet(X1,a),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_102]),c_0_22]),c_0_29]),c_0_23]) ).

cnf(c_0_113,negated_conjecture,
    join(r1,meet(b,meet(r2,join(r1,meet(a,r2))))) != r1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_74]),c_0_57]),c_0_29]) ).

cnf(c_0_114,plain,
    meet(join(X1,X2),meet(X3,join(X1,join(X2,X4)))) = meet(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_57,c_0_104]) ).

cnf(c_0_115,hypothesis,
    meet(b,join(r1,join(meet(a,r2),meet(b,r2)))) = meet(b,r2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_105]),c_0_22]),c_0_106]),c_0_107]),c_0_22]),c_0_108]),c_0_29]),c_0_27]),c_0_109]),c_0_26]),c_0_65]),c_0_29]),c_0_110]),c_0_26]) ).

cnf(c_0_116,hypothesis,
    meet(b,meet(X1,join(r1,a))) = meet(a,meet(b,X1)),
    inference(spm,[status(thm)],[c_0_111,c_0_29]) ).

cnf(c_0_117,hypothesis,
    join(r1,meet(a,join(r1,meet(X1,join(a,b))))) = join(r1,meet(X1,a)),
    inference(spm,[status(thm)],[c_0_83,c_0_112]) ).

cnf(c_0_118,negated_conjecture,
    join(r1,meet(b,join(meet(r1,r2),meet(a,r2)))) != r1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_85]),c_0_29]),c_0_29]),c_0_27]) ).

cnf(c_0_119,hypothesis,
    meet(b,join(meet(r1,r2),meet(a,r2))) = meet(b,join(r1,meet(a,r2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_57]),c_0_29]),c_0_85]),c_0_29]),c_0_29]),c_0_27]) ).

cnf(c_0_120,hypothesis,
    meet(b,join(r1,meet(a,join(r1,X1)))) = meet(a,meet(b,join(r1,X1))),
    inference(spm,[status(thm)],[c_0_116,c_0_48]) ).

cnf(c_0_121,hypothesis,
    join(r1,meet(a,join(r1,join(meet(a,r2),meet(b,r2))))) = join(r1,meet(a,r2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_96]),c_0_29]) ).

cnf(c_0_122,hypothesis,
    meet(a,meet(b,r2)) = n0,
    inference(rw,[status(thm)],[c_0_45,c_0_58]) ).

cnf(c_0_123,negated_conjecture,
    join(r1,meet(b,join(r1,meet(a,r2)))) != r1,
    inference(rw,[status(thm)],[c_0_118,c_0_119]) ).

cnf(c_0_124,hypothesis,
    meet(b,join(r1,meet(a,r2))) = n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_115]),c_0_122]) ).

cnf(c_0_125,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LAT005-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Oct  2 09:55:35 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.HC6Xy2Os59/E---3.1_5249.p
% 51.50/7.05  # Version: 3.1pre001
% 51.50/7.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.50/7.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/7.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.50/7.05  # Starting new_bool_3 with 300s (1) cores
% 51.50/7.05  # Starting new_bool_1 with 300s (1) cores
% 51.50/7.05  # Starting sh5l with 300s (1) cores
% 51.50/7.05  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5327 completed with status 0
% 51.50/7.05  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 51.50/7.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.50/7.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/7.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.50/7.05  # No SInE strategy applied
% 51.50/7.05  # Search class: FUUPM-FFSF33-MFFFFFNN
% 51.50/7.05  # partial match(1): FUUPM-FFSF32-MFFFFFNN
% 51.50/7.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.50/7.05  # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 51.50/7.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 51.50/7.05  # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 51.50/7.05  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 51.50/7.05  # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 51.50/7.05  # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 5336 completed with status 0
% 51.50/7.05  # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 51.50/7.05  # Preprocessing class: FSMSSMSSSSSNFFN.
% 51.50/7.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/7.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 51.50/7.05  # No SInE strategy applied
% 51.50/7.05  # Search class: FUUPM-FFSF33-MFFFFFNN
% 51.50/7.05  # partial match(1): FUUPM-FFSF32-MFFFFFNN
% 51.50/7.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.50/7.05  # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 51.50/7.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 51.50/7.05  # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 51.50/7.05  # Preprocessing time       : 0.001 s
% 51.50/7.05  # Presaturation interreduction done
% 51.50/7.05  
% 51.50/7.05  # Proof found!
% 51.50/7.05  # SZS status Unsatisfiable
% 51.50/7.05  # SZS output start CNFRefutation
% See solution above
% 51.50/7.05  # Parsed axioms                        : 22
% 51.50/7.05  # Removed by relevancy pruning/SinE    : 0
% 51.50/7.05  # Initial clauses                      : 22
% 51.50/7.05  # Removed in clause preprocessing      : 0
% 51.50/7.05  # Initial clauses in saturation        : 22
% 51.50/7.05  # Processed clauses                    : 14598
% 51.50/7.05  # ...of these trivial                  : 7792
% 51.50/7.05  # ...subsumed                          : 5131
% 51.50/7.05  # ...remaining for further processing  : 1675
% 51.50/7.05  # Other redundant clauses eliminated   : 0
% 51.50/7.05  # Clauses deleted for lack of memory   : 0
% 51.50/7.05  # Backward-subsumed                    : 0
% 51.50/7.05  # Backward-rewritten                   : 437
% 51.50/7.05  # Generated clauses                    : 670873
% 51.50/7.05  # ...of the previous two non-redundant : 426373
% 51.50/7.05  # ...aggressively subsumed             : 0
% 51.50/7.05  # Contextual simplify-reflections      : 0
% 51.50/7.05  # Paramodulations                      : 670873
% 51.50/7.05  # Factorizations                       : 0
% 51.50/7.05  # NegExts                              : 0
% 51.50/7.05  # Equation resolutions                 : 0
% 51.50/7.05  # Total rewrite steps                  : 1187603
% 51.50/7.05  # Propositional unsat checks           : 0
% 51.50/7.05  #    Propositional check models        : 0
% 51.50/7.05  #    Propositional check unsatisfiable : 0
% 51.50/7.05  #    Propositional clauses             : 0
% 51.50/7.05  #    Propositional clauses after purity: 0
% 51.50/7.05  #    Propositional unsat core size     : 0
% 51.50/7.05  #    Propositional preprocessing time  : 0.000
% 51.50/7.05  #    Propositional encoding time       : 0.000
% 51.50/7.05  #    Propositional solver time         : 0.000
% 51.50/7.05  #    Success case prop preproc time    : 0.000
% 51.50/7.05  #    Success case prop encoding time   : 0.000
% 51.50/7.05  #    Success case prop solver time     : 0.000
% 51.50/7.05  # Current number of processed clauses  : 1216
% 51.50/7.05  #    Positive orientable unit clauses  : 1190
% 51.50/7.05  #    Positive unorientable unit clauses: 25
% 51.50/7.05  #    Negative unit clauses             : 1
% 51.50/7.05  #    Non-unit-clauses                  : 0
% 51.50/7.05  # Current number of unprocessed clauses: 410683
% 51.50/7.05  # ...number of literals in the above   : 410683
% 51.50/7.05  # Current number of archived formulas  : 0
% 51.50/7.05  # Current number of archived clauses   : 459
% 51.50/7.05  # Clause-clause subsumption calls (NU) : 0
% 51.50/7.05  # Rec. Clause-clause subsumption calls : 0
% 51.50/7.05  # Non-unit clause-clause subsumptions  : 0
% 51.50/7.05  # Unit Clause-clause subsumption calls : 1765
% 51.50/7.05  # Rewrite failures with RHS unbound    : 5576
% 51.50/7.05  # BW rewrite match attempts            : 26790
% 51.50/7.05  # BW rewrite match successes           : 4168
% 51.50/7.05  # Condensation attempts                : 0
% 51.50/7.05  # Condensation successes               : 0
% 51.50/7.05  # Termbank termtop insertions          : 13277645
% 51.50/7.05  
% 51.50/7.05  # -------------------------------------------------
% 51.50/7.05  # User time                : 5.951 s
% 51.50/7.05  # System time              : 0.251 s
% 51.50/7.05  # Total time               : 6.202 s
% 51.50/7.05  # Maximum resident set size: 1616 pages
% 51.50/7.05  
% 51.50/7.05  # -------------------------------------------------
% 51.50/7.05  # User time                : 30.390 s
% 51.50/7.05  # System time              : 1.311 s
% 51.50/7.05  # Total time               : 31.701 s
% 51.50/7.05  # Maximum resident set size: 1680 pages
% 51.50/7.05  % E---3.1 exiting
% 51.50/7.06  % E---3.1 exiting
%------------------------------------------------------------------------------