TSTP Solution File: LAT183-10 by E-SAT---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.2.0
% Problem  : LAT183-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d SAT

% Computer : n019.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  : 300s
% DateTime : Mon Jun 24 10:22:20 EDT 2024

% Result   : Unsatisfiable 10.31s 1.79s
% Output   : CNFRefutation 10.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   36
%            Number of leaves      :   13
% Syntax   : Number of clauses     :  105 ( 105 unt;   0 nHn;   4 RR)
%            Number of literals    :  105 ( 104 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :  211 (  34 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',absorption1) ).

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',complement_join) ).

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

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

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',complement_meet) ).

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

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

cnf(equation_H7,axiom,
    meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))))),
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',equation_H7) ).

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

cnf(meet_join_complement,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',meet_join_complement) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',ifeq_axiom) ).

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

cnf(prove_distributivity,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    file('/export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p',prove_distributivity) ).

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

cnf(c_0_14,axiom,
    join(X1,complement(X1)) = one,
    complement_join ).

cnf(c_0_15,plain,
    meet(X1,one) = X1,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

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

cnf(c_0_18,axiom,
    meet(X1,complement(X1)) = zero,
    complement_meet ).

cnf(c_0_19,plain,
    meet(one,X1) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

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

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

cnf(c_0_23,plain,
    join(one,X1) = one,
    inference(spm,[status(thm)],[c_0_13,c_0_19]) ).

cnf(c_0_24,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_25,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,axiom,
    meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))))),
    equation_H7 ).

cnf(c_0_27,plain,
    join(X1,join(complement(X1),X2)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_23]) ).

cnf(c_0_28,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_22]) ).

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

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

cnf(c_0_31,plain,
    meet(zero,X1) = zero,
    inference(spm,[status(thm)],[c_0_17,c_0_25]) ).

cnf(c_0_32,plain,
    meet(X1,join(complement(X1),join(X2,meet(X1,join(meet(X1,join(complement(X1),X2)),X3))))) = meet(X1,join(complement(X1),join(X2,meet(X1,X3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]),c_0_22]),c_0_22]) ).

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

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

cnf(c_0_35,plain,
    join(X1,one) = one,
    inference(spm,[status(thm)],[c_0_23,c_0_21]) ).

cnf(c_0_36,plain,
    meet(X1,meet(X2,X1)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_30]) ).

cnf(c_0_37,plain,
    meet(X1,meet(complement(X1),X2)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_31]) ).

cnf(c_0_38,plain,
    meet(X1,zero) = zero,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_39,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    meet_join_complement ).

cnf(c_0_40,plain,
    meet(X1,join(complement(X1),join(X2,meet(X1,complement(meet(X1,join(complement(X1),X2))))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_14]),c_0_15]),c_0_33]),c_0_27]),c_0_15]) ).

cnf(c_0_41,plain,
    join(complement(X1),join(X2,join(X3,X1))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_35]),c_0_35]),c_0_22]) ).

cnf(c_0_42,plain,
    meet(complement(X1),meet(X2,X1)) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_30]) ).

cnf(c_0_43,plain,
    ifeq(join(X1,join(X2,X3)),one,ifeq(meet(join(X1,X2),X3),zero,complement(join(X1,X2)),X3),X3) = X3,
    inference(spm,[status(thm)],[c_0_39,c_0_22]) ).

cnf(c_0_44,plain,
    join(complement(X1),join(X2,meet(X1,complement(meet(X1,join(complement(X1),X2)))))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_22]),c_0_22]),c_0_41]) ).

cnf(c_0_45,plain,
    meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_16]),c_0_30]) ).

cnf(c_0_46,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_47,plain,
    meet(X1,complement(meet(X1,join(complement(X1),X2)))) = complement(join(complement(X1),X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_46]) ).

cnf(c_0_48,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(spm,[status(thm)],[c_0_17,c_0_47]) ).

cnf(c_0_49,plain,
    ifeq(join(X1,X2),one,ifeq(meet(X2,X1),zero,complement(X1),X2),X2) = X2,
    inference(spm,[status(thm)],[c_0_39,c_0_16]) ).

cnf(c_0_50,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_48,c_0_21]) ).

cnf(c_0_51,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_18]),c_0_21]),c_0_14]),c_0_46]),c_0_46]) ).

cnf(c_0_52,plain,
    join(complement(X1),join(X2,X1)) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_35]),c_0_22]) ).

cnf(c_0_53,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,plain,
    join(X1,complement(meet(X2,X1))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_24]),c_0_21]) ).

cnf(c_0_55,plain,
    join(complement(X1),complement(meet(X2,X1))) = complement(meet(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_24]),c_0_21]) ).

cnf(c_0_56,plain,
    join(X1,complement(meet(X2,meet(X3,X1)))) = one,
    inference(spm,[status(thm)],[c_0_54,c_0_30]) ).

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

cnf(c_0_58,plain,
    meet(X1,complement(meet(X1,complement(meet(X2,X1))))) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_55]),c_0_51]) ).

cnf(c_0_59,plain,
    join(X1,join(X2,complement(meet(X3,join(X2,X1))))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_22]) ).

cnf(c_0_60,plain,
    join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_17]),c_0_21]) ).

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

cnf(c_0_62,plain,
    meet(join(X1,X2),complement(meet(complement(X1),join(X1,X2)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_13]),c_0_16]) ).

cnf(c_0_63,plain,
    join(X1,complement(meet(X2,join(complement(X2),X1)))) = one,
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X2),X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_49,c_0_21]) ).

cnf(c_0_65,plain,
    meet(X1,complement(meet(complement(X2),join(X2,X1)))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_66,plain,
    join(X1,complement(meet(complement(X2),join(X2,X1)))) = one,
    inference(spm,[status(thm)],[c_0_63,c_0_51]) ).

cnf(c_0_67,plain,
    ifeq(meet(X1,X2),zero,meet(complement(X2),join(X2,X1)),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_51]),c_0_46]) ).

cnf(c_0_68,plain,
    meet(X1,complement(join(X1,X2))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_13]),c_0_16]) ).

cnf(c_0_69,plain,
    meet(join(X1,X2),join(X1,complement(join(X1,X2)))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_51]),c_0_21]),c_0_46]) ).

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

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

cnf(c_0_72,plain,
    meet(X1,join(X2,complement(join(X1,X2)))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_70,c_0_21]) ).

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

cnf(c_0_74,plain,
    meet(X1,join(complement(X1),meet(X1,X2))) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_17]),c_0_21]),c_0_73]) ).

cnf(c_0_75,plain,
    complement(join(complement(X1),meet(X1,X2))) = meet(X1,complement(meet(X1,X2))),
    inference(spm,[status(thm)],[c_0_47,c_0_74]) ).

cnf(c_0_76,plain,
    join(complement(X1),complement(join(X1,X2))) = complement(X1),
    inference(spm,[status(thm)],[c_0_48,c_0_51]) ).

cnf(c_0_77,plain,
    complement(meet(X1,complement(meet(X1,X2)))) = join(complement(X1),meet(X1,X2)),
    inference(spm,[status(thm)],[c_0_51,c_0_75]) ).

cnf(c_0_78,plain,
    meet(complement(X1),complement(join(X1,X2))) = complement(join(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_76]),c_0_16]) ).

cnf(c_0_79,plain,
    complement(meet(complement(X1),join(X1,X2))) = join(X1,complement(join(X1,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_51]),c_0_51]) ).

cnf(c_0_80,plain,
    meet(complement(X1),join(X1,complement(join(X1,X2)))) = complement(join(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_76]),c_0_51]),c_0_21]),c_0_78]) ).

cnf(c_0_81,plain,
    complement(join(X1,complement(join(X1,X2)))) = meet(complement(X1),join(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_78]),c_0_51]),c_0_51]) ).

cnf(c_0_82,plain,
    join(X1,meet(complement(X1),join(X1,X2))) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_51]),c_0_81]) ).

cnf(c_0_83,plain,
    join(X1,meet(complement(X1),join(X2,X1))) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_82,c_0_21]) ).

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

cnf(c_0_85,plain,
    join(meet(X1,X2),meet(X1,complement(meet(X1,X2)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_17]),c_0_16]) ).

cnf(c_0_86,plain,
    ifeq(meet(X1,X2),zero,meet(complement(X2),join(X1,X2)),X1) = X1,
    inference(spm,[status(thm)],[c_0_67,c_0_21]) ).

cnf(c_0_87,plain,
    join(X1,meet(X2,complement(meet(X2,X1)))) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_88,plain,
    meet(join(X1,X2),join(complement(X2),meet(X2,X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_45]),c_0_77]),c_0_46]),c_0_16]) ).

cnf(c_0_89,plain,
    join(complement(X1),meet(X1,X2)) = join(complement(X1),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_88]),c_0_22]),c_0_21]),c_0_24]) ).

cnf(c_0_90,plain,
    meet(X1,join(complement(X1),X2)) = meet(X1,X2),
    inference(rw,[status(thm)],[c_0_74,c_0_89]) ).

cnf(c_0_91,plain,
    meet(X1,complement(join(X2,X1))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_16]) ).

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

cnf(c_0_93,plain,
    meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
    inference(spm,[status(thm)],[c_0_90,c_0_51]) ).

cnf(c_0_94,plain,
    join(complement(X1),join(meet(X1,X2),X3)) = join(complement(X1),join(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_89]),c_0_22]) ).

cnf(c_0_95,plain,
    ifeq(meet(X1,X2),zero,meet(complement(X1),join(X1,X2)),X2) = X2,
    inference(spm,[status(thm)],[c_0_67,c_0_16]) ).

cnf(c_0_96,plain,
    meet(complement(join(X1,X2)),join(meet(X1,X3),X2)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_16]) ).

cnf(c_0_97,plain,
    meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_51]),c_0_90]),c_0_51]) ).

cnf(c_0_98,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    inference(fof_simplification,[status(thm)],[prove_distributivity]) ).

cnf(c_0_99,plain,
    ifeq(meet(X1,X2),zero,meet(complement(X1),X2),X2) = X2,
    inference(rw,[status(thm)],[c_0_95,c_0_93]) ).

cnf(c_0_100,plain,
    meet(complement(X1),join(meet(X1,X2),meet(X1,X3))) = zero,
    inference(spm,[status(thm)],[c_0_96,c_0_17]) ).

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

cnf(c_0_102,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    c_0_98 ).

cnf(c_0_103,plain,
    join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X3,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_51]),c_0_97]),c_0_101]),c_0_46]) ).

cnf(c_0_104,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : LAT183-10 : TPTP v8.2.0. Released v7.3.0.
% 0.12/0.12  % Command    : run_E %s %d SAT
% 0.12/0.33  % Computer : n019.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    : 300
% 0.12/0.33  % DateTime   : Sat Jun 22 00:10:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.IsUl9BX8DM/E---3.1_6558.p
% 10.31/1.79  # Version: 3.2.0
% 10.31/1.79  # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.31/1.79  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.31/1.79  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.31/1.79  # Starting new_bool_3 with 300s (1) cores
% 10.31/1.79  # Starting new_bool_1 with 300s (1) cores
% 10.31/1.79  # Starting sh5l with 300s (1) cores
% 10.31/1.79  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6635 completed with status 0
% 10.31/1.79  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 10.31/1.79  # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.31/1.79  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.31/1.79  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.31/1.79  # No SInE strategy applied
% 10.31/1.79  # Search class: FUUPM-FFSF32-DFFFFFNN
% 10.31/1.79  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.31/1.79  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with 811s (1) cores
% 10.31/1.79  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.31/1.79  # Starting new_bool_3 with 136s (1) cores
% 10.31/1.79  # Starting new_bool_1 with 136s (1) cores
% 10.31/1.79  # Starting sh5l with 136s (1) cores
% 10.31/1.79  # G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with pid 6639 completed with status 0
% 10.31/1.79  # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 10.31/1.79  # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.31/1.79  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.31/1.79  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.31/1.79  # No SInE strategy applied
% 10.31/1.79  # Search class: FUUPM-FFSF32-DFFFFFNN
% 10.31/1.79  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.31/1.79  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN with 811s (1) cores
% 10.31/1.79  # Preprocessing time       : 0.001 s
% 10.31/1.79  # Presaturation interreduction done
% 10.31/1.79  
% 10.31/1.79  # Proof found!
% 10.31/1.79  # SZS status Unsatisfiable
% 10.31/1.79  # SZS output start CNFRefutation
% See solution above
% 10.31/1.79  # Parsed axioms                        : 14
% 10.31/1.79  # Removed by relevancy pruning/SinE    : 0
% 10.31/1.79  # Initial clauses                      : 14
% 10.31/1.79  # Removed in clause preprocessing      : 0
% 10.31/1.79  # Initial clauses in saturation        : 14
% 10.31/1.79  # Processed clauses                    : 3869
% 10.31/1.79  # ...of these trivial                  : 2400
% 10.31/1.79  # ...subsumed                          : 926
% 10.31/1.79  # ...remaining for further processing  : 543
% 10.31/1.79  # Other redundant clauses eliminated   : 0
% 10.31/1.79  # Clauses deleted for lack of memory   : 0
% 10.31/1.79  # Backward-subsumed                    : 0
% 10.31/1.79  # Backward-rewritten                   : 233
% 10.31/1.79  # Generated clauses                    : 162709
% 10.31/1.79  # ...of the previous two non-redundant : 87894
% 10.31/1.79  # ...aggressively subsumed             : 0
% 10.31/1.79  # Contextual simplify-reflections      : 0
% 10.31/1.79  # Paramodulations                      : 162709
% 10.31/1.79  # Factorizations                       : 0
% 10.31/1.79  # NegExts                              : 0
% 10.31/1.79  # Equation resolutions                 : 0
% 10.31/1.79  # Disequality decompositions           : 0
% 10.31/1.79  # Total rewrite steps                  : 421692
% 10.31/1.79  # ...of those cached                   : 360031
% 10.31/1.79  # Propositional unsat checks           : 0
% 10.31/1.79  #    Propositional check models        : 0
% 10.31/1.79  #    Propositional check unsatisfiable : 0
% 10.31/1.79  #    Propositional clauses             : 0
% 10.31/1.79  #    Propositional clauses after purity: 0
% 10.31/1.79  #    Propositional unsat core size     : 0
% 10.31/1.79  #    Propositional preprocessing time  : 0.000
% 10.31/1.79  #    Propositional encoding time       : 0.000
% 10.31/1.79  #    Propositional solver time         : 0.000
% 10.31/1.79  #    Success case prop preproc time    : 0.000
% 10.31/1.79  #    Success case prop encoding time   : 0.000
% 10.31/1.79  #    Success case prop solver time     : 0.000
% 10.31/1.79  # Current number of processed clauses  : 296
% 10.31/1.79  #    Positive orientable unit clauses  : 286
% 10.31/1.79  #    Positive unorientable unit clauses: 10
% 10.31/1.79  #    Negative unit clauses             : 0
% 10.31/1.79  #    Non-unit-clauses                  : 0
% 10.31/1.79  # Current number of unprocessed clauses: 83727
% 10.31/1.79  # ...number of literals in the above   : 83727
% 10.31/1.79  # Current number of archived formulas  : 0
% 10.31/1.79  # Current number of archived clauses   : 247
% 10.31/1.79  # Clause-clause subsumption calls (NU) : 0
% 10.31/1.79  # Rec. Clause-clause subsumption calls : 0
% 10.31/1.79  # Non-unit clause-clause subsumptions  : 0
% 10.31/1.79  # Unit Clause-clause subsumption calls : 290
% 10.31/1.79  # Rewrite failures with RHS unbound    : 0
% 10.31/1.79  # BW rewrite match attempts            : 4763
% 10.31/1.79  # BW rewrite match successes           : 989
% 10.31/1.79  # Condensation attempts                : 0
% 10.31/1.79  # Condensation successes               : 0
% 10.31/1.79  # Termbank termtop insertions          : 2498104
% 10.31/1.79  # Search garbage collected termcells   : 2
% 10.31/1.79  
% 10.31/1.79  # -------------------------------------------------
% 10.31/1.79  # User time                : 1.213 s
% 10.31/1.79  # System time              : 0.057 s
% 10.31/1.79  # Total time               : 1.270 s
% 10.31/1.79  # Maximum resident set size: 1604 pages
% 10.31/1.79  
% 10.31/1.79  # -------------------------------------------------
% 10.31/1.79  # User time                : 6.199 s
% 10.31/1.79  # System time              : 0.134 s
% 10.31/1.79  # Total time               : 6.333 s
% 10.31/1.79  # Maximum resident set size: 1696 pages
% 10.31/1.79  % E---3.1 exiting
% 10.31/1.80  % E exiting
%------------------------------------------------------------------------------