↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT255-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:04:33 PM UTC 2026

% Result   : Unsatisfiable 158.48s 28.84s
% Output   : CNFRefutation 158.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   14
% Syntax   : Number of clauses     :  116 ( 110 unt;   0 nHn;  22 RR)
%            Number of literals    :  127 ( 126 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  187 (  44 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).

cnf(prove_distributivity_hypothesis,hypothesis,
    meet(b,a) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).

cnf(associativity_of_join,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).

cnf(idempotence_of_join,axiom,
    join(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

cnf(idempotence_of_meet,axiom,
    meet(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_meet) ).

cnf(equation_H80,axiom,
    meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = join(meet(X1,X2),meet(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H80) ).

cnf(meet_join_complement,axiom,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).

cnf(prove_distributivity,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).

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

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

cnf(c_0_16,hypothesis,
    meet(b,a) = a,
    prove_distributivity_hypothesis ).

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

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

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

cnf(c_0_20,hypothesis,
    meet(a,b) = a,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

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

cnf(c_0_22,plain,
    meet(one,X1) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

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

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

cnf(c_0_25,hypothesis,
    meet(a,meet(b,X1)) = meet(a,X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

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

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

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

cnf(c_0_30,hypothesis,
    meet(a,join(b,X1)) = a,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_20]) ).

cnf(c_0_31,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_23]) ).

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

cnf(c_0_33,plain,
    join(X1,one) = one,
    inference(spm,[status(thm)],[c_0_28,c_0_15]) ).

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

cnf(c_0_35,hypothesis,
    join(b,join(X1,a)) = join(b,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_23]) ).

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

cnf(c_0_37,plain,
    join(complement(X1),join(X2,X1)) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_23]) ).

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

cnf(c_0_39,plain,
    meet(X1,meet(X1,X2)) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_19,c_0_36]) ).

cnf(c_0_40,plain,
    join(X1,complement(meet(X2,X1))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_29]) ).

cnf(c_0_41,plain,
    meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
    inference(spm,[status(thm)],[c_0_19,c_0_14]) ).

cnf(c_0_42,plain,
    meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_19]) ).

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

cnf(c_0_44,plain,
    meet(X1,meet(X2,X1)) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_39,c_0_17]) ).

cnf(c_0_45,plain,
    meet(X1,meet(X2,X3)) = meet(X2,meet(X3,X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_46,hypothesis,
    join(b,a) = b,
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

cnf(c_0_47,plain,
    join(complement(meet(X1,X2)),meet(join(X1,X3),X2)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29]) ).

cnf(c_0_48,hypothesis,
    meet(join(X1,a),meet(X2,join(X1,b))) = meet(X2,join(X1,a)),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

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

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

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

cnf(c_0_52,hypothesis,
    meet(a,meet(X1,b)) = meet(a,X1),
    inference(spm,[status(thm)],[c_0_25,c_0_17]) ).

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

cnf(c_0_54,hypothesis,
    join(b,join(a,X1)) = join(b,X1),
    inference(spm,[status(thm)],[c_0_23,c_0_46]) ).

cnf(c_0_55,hypothesis,
    join(complement(meet(X1,X2)),meet(X2,join(X1,a))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).

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

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

cnf(c_0_58,hypothesis,
    join(meet(X1,b),meet(a,X1)) = meet(X1,b),
    inference(spm,[status(thm)],[c_0_26,c_0_52]) ).

cnf(c_0_59,plain,
    meet(X1,zero) = zero,
    inference(spm,[status(thm)],[c_0_39,c_0_53]) ).

cnf(c_0_60,hypothesis,
    join(b,meet(a,X1)) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_21]),c_0_46]) ).

cnf(c_0_61,hypothesis,
    join(complement(X1),meet(join(X1,X2),join(X1,a))) = one,
    inference(spm,[status(thm)],[c_0_55,c_0_14]) ).

cnf(c_0_62,plain,
    meet(X1,join(X2,X3)) = meet(join(X3,X2),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_56]),c_0_57]) ).

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

cnf(c_0_64,hypothesis,
    join(meet(X1,b),join(meet(a,X1),X2)) = join(meet(X1,b),X2),
    inference(spm,[status(thm)],[c_0_23,c_0_58]) ).

cnf(c_0_65,plain,
    join(X1,complement(meet(X1,X2))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_21]),c_0_29]) ).

cnf(c_0_66,hypothesis,
    meet(join(a,X1),join(b,X1)) = join(a,X1),
    inference(spm,[status(thm)],[c_0_34,c_0_54]) ).

cnf(c_0_67,axiom,
    meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = join(meet(X1,X2),meet(X1,X3)),
    equation_H80 ).

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

cnf(c_0_69,hypothesis,
    join(b,complement(a)) = join(b,one),
    inference(spm,[status(thm)],[c_0_54,c_0_15]) ).

cnf(c_0_70,plain,
    meet(X1,complement(join(X1,X2))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_53]),c_0_59]) ).

cnf(c_0_71,plain,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    inference(fof_simplification,[status(thm)],[meet_join_complement]) ).

cnf(c_0_72,hypothesis,
    join(b,complement(meet(a,X1))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_60]),c_0_29]) ).

cnf(c_0_73,hypothesis,
    join(complement(X1),meet(join(X1,a),join(X2,X1))) = one,
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_74,hypothesis,
    join(b,join(X1,meet(X2,a))) = join(b,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_30]),c_0_23]) ).

cnf(c_0_75,hypothesis,
    join(meet(X1,b),complement(meet(a,meet(X1,X2)))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_33]),c_0_19]) ).

cnf(c_0_76,hypothesis,
    meet(join(a,X1),meet(join(b,X1),X2)) = meet(join(a,X1),X2),
    inference(spm,[status(thm)],[c_0_19,c_0_66]) ).

cnf(c_0_77,plain,
    meet(X1,join(meet(X1,X2),meet(complement(X1),join(X1,X2)))) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_15]),c_0_18]),c_0_53]),c_0_68]) ).

cnf(c_0_78,hypothesis,
    join(b,complement(a)) = one,
    inference(rw,[status(thm)],[c_0_69,c_0_33]) ).

cnf(c_0_79,plain,
    meet(X1,complement(join(X2,X1))) = zero,
    inference(spm,[status(thm)],[c_0_70,c_0_29]) ).

cnf(c_0_80,plain,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    c_0_71 ).

cnf(c_0_81,hypothesis,
    meet(b,join(meet(b,X1),meet(complement(meet(a,X2)),join(b,X1)))) = join(meet(b,X1),meet(b,complement(meet(a,X2)))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_72]),c_0_18]) ).

cnf(c_0_82,hypothesis,
    join(X1,join(a,complement(join(X1,meet(X2,a))))) = one,
    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_73,c_0_74]),c_0_23]),c_0_29]),c_0_26]),c_0_38]),c_0_29]),c_0_23]) ).

cnf(c_0_83,hypothesis,
    join(b,meet(X1,a)) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_26]),c_0_46]) ).

cnf(c_0_84,hypothesis,
    join(meet(b,join(a,X1)),complement(meet(a,X2))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_17]),c_0_41]) ).

cnf(c_0_85,hypothesis,
    meet(b,join(complement(b),meet(b,complement(a)))) = meet(b,complement(a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_18]),c_0_29]) ).

cnf(c_0_86,hypothesis,
    meet(join(a,X1),complement(join(b,X1))) = zero,
    inference(spm,[status(thm)],[c_0_79,c_0_54]) ).

cnf(c_0_87,plain,
    ( join(X1,X2) != one
    | meet(X2,X1) != zero
    | complement(X1) = X2 ),
    inference(spm,[status(thm)],[c_0_80,c_0_17]) ).

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

cnf(c_0_89,hypothesis,
    join(meet(b,join(a,complement(b))),meet(b,complement(meet(a,X1)))) = b,
    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_81,c_0_82]),c_0_83]),c_0_18]),c_0_84]),c_0_18]),c_0_83]) ).

cnf(c_0_90,hypothesis,
    meet(a,join(complement(b),meet(b,complement(a)))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_85]),c_0_25]),c_0_53]) ).

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

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

cnf(c_0_93,hypothesis,
    meet(complement(b),join(a,meet(b,X1))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_21]),c_0_17]) ).

cnf(c_0_94,plain,
    complement(complement(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_53]),c_0_29]),c_0_15])]) ).

cnf(c_0_95,plain,
    join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
    inference(spm,[status(thm)],[c_0_23,c_0_29]) ).

cnf(c_0_96,hypothesis,
    join(a,join(complement(b),meet(b,complement(meet(a,X1))))) = one,
    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_88,c_0_89]),c_0_23]),c_0_29]),c_0_15]),c_0_33]),c_0_23]) ).

cnf(c_0_97,hypothesis,
    meet(a,meet(join(complement(b),meet(b,complement(a))),X1)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_90]),c_0_91]) ).

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

cnf(c_0_99,plain,
    meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_14,c_0_19]) ).

cnf(c_0_100,plain,
    join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_14]),c_0_23]) ).

cnf(c_0_101,hypothesis,
    ( join(a,join(complement(b),meet(b,X1))) != one
    | join(a,meet(b,X1)) = b ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_93]),c_0_94]),c_0_95]),c_0_29]) ).

cnf(c_0_102,hypothesis,
    join(a,join(complement(b),meet(b,complement(a)))) = one,
    inference(spm,[status(thm)],[c_0_96,c_0_18]) ).

cnf(c_0_103,hypothesis,
    meet(a,join(meet(b,X1),meet(X2,join(b,meet(X1,join(b,X2)))))) = meet(a,join(meet(b,X1),meet(b,X2))),
    inference(spm,[status(thm)],[c_0_25,c_0_67]) ).

cnf(c_0_104,hypothesis,
    meet(a,join(meet(b,complement(a)),meet(complement(b),X1))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_29]) ).

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

cnf(c_0_106,plain,
    join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_100]),c_0_23]),c_0_95]),c_0_88]) ).

cnf(c_0_107,hypothesis,
    join(a,meet(b,complement(a))) = b,
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_108,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    inference(fof_simplification,[status(thm)],[prove_distributivity]) ).

cnf(c_0_109,hypothesis,
    ( meet(a,join(meet(b,X1),meet(b,X2))) != zero
    | join(a,join(meet(b,X1),meet(X2,join(b,meet(X1,join(b,X2)))))) != one
    | join(meet(b,X1),meet(X2,join(b,meet(X1,join(b,X2))))) = complement(a) ),
    inference(spm,[status(thm)],[c_0_80,c_0_103]) ).

cnf(c_0_110,hypothesis,
    meet(a,join(meet(b,complement(a)),meet(X1,complement(b)))) = zero,
    inference(spm,[status(thm)],[c_0_104,c_0_105]) ).

cnf(c_0_111,hypothesis,
    join(a,join(X1,meet(b,complement(a)))) = join(X1,b),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_95]) ).

cnf(c_0_112,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    c_0_108 ).

cnf(c_0_113,hypothesis,
    join(complement(b),meet(b,complement(a))) = complement(a),
    inference(cn,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_15]),c_0_18]),c_0_69]),c_0_33]),c_0_18]),c_0_29]),c_0_15]),c_0_18]),c_0_69]),c_0_33]),c_0_18]),c_0_29]),c_0_111]),c_0_29]),c_0_15])]) ).

cnf(c_0_114,negated_conjecture,
    join(complement(a),complement(b)) != complement(a),
    inference(rw,[status(thm)],[c_0_112,c_0_29]) ).

cnf(c_0_115,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_113]),c_0_29]),c_0_114]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LAT255-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.46  % Computer : n008.cluster.edu
% 0.17/5.46  % Model    : x86_64 x86_64
% 0.17/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.46  % Memory   : 8046.5625MB
% 0.17/5.46  % OS       : Linux 6.8.0-71-generic
% 0.17/5.46  % CPULimit : 300
% 0.17/5.46  % WCLimit  : 300
% 0.17/5.46  % DateTime : Sun Sep 20 23:24:17 UTC 2026
% 0.17/5.46  % CPUTime  : 
% 0.17/5.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.52  Running first-order theorem proving
% 0.23/5.52  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 158.48/28.84  % Version: 3.5.1
% 158.48/28.84  % Preprocessing class: FSSSSMSSSSSNFFN.
% 158.48/28.84  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 158.48/28.84  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 158.48/28.84  % Starting new_bool_3 with 300s (1) cores
% 158.48/28.84  % Starting new_bool_1 with 300s (1) cores
% 158.48/28.84  % Starting sh5l with 300s (1) cores
% 158.48/28.84  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3813296 completed with status 0
% 158.48/28.84  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 158.48/28.84  % Preprocessing class: FSSSSMSSSSSNFFN.
% 158.48/28.84  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 158.48/28.84  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 158.48/28.84  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 158.48/28.84  % No SInE strategy applied
% 158.48/28.84  % Search class: FHUPM-FFSF21-DFFFFFNN
% 158.48/28.84  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 158.48/28.84  % Starting SubtermCWHack with 136s (1) cores
% 158.48/28.84  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 158.48/28.84  % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 158.48/28.84  % Starting new_bool_3 with 136s (1) cores
% 158.48/28.84  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 158.48/28.84  % G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 3813302 completed with status 0
% 158.48/28.84  % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 158.48/28.84  % Preprocessing class: FSSSSMSSSSSNFFN.
% 158.48/28.84  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 158.48/28.84  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 158.48/28.84  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 158.48/28.84  % No SInE strategy applied
% 158.48/28.84  % Search class: FHUPM-FFSF21-DFFFFFNN
% 158.48/28.84  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 158.48/28.84  % Starting SubtermCWHack with 136s (1) cores
% 158.48/28.84  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 158.48/28.84  % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 158.48/28.84  % Preprocessing time       : 0.002 s
% 158.48/28.84  % Presaturation interreduction done
% 158.48/28.84  
% 158.48/28.84  % Proof found!
% 158.48/28.84  % SZS status Unsatisfiable
% 158.48/28.84  % SZS output start CNFRefutation
% See solution above
% 158.48/28.84  % Parsed axioms                        : 14
% 158.48/28.84  % Removed by relevancy pruning/SinE    : 0
% 158.48/28.84  % Initial clauses                      : 14
% 158.48/28.84  % Removed in clause preprocessing      : 0
% 158.48/28.84  % Initial clauses in saturation        : 14
% 158.48/28.84  % Processed clauses                    : 32141
% 158.48/28.84  % ...of these trivial                  : 15629
% 158.48/28.84  % ...subsumed                          : 14802
% 158.48/28.84  % ...remaining for further processing  : 1710
% 158.48/28.84  % Other redundant clauses eliminated   : 0
% 158.48/28.84  % Clauses deleted for lack of memory   : 0
% 158.48/28.84  % Backward-subsumed                    : 15
% 158.48/28.84  % Backward-rewritten                   : 255
% 158.48/28.84  % Generated clauses                    : 1040398
% 158.48/28.84  % ...of the previous two non-redundant : 456199
% 158.48/28.84  % ...aggressively subsumed             : 0
% 158.48/28.84  % Contextual simplify-reflections      : 0
% 158.48/28.84  % Paramodulations                      : 1040380
% 158.48/28.84  % Factorizations                       : 0
% 158.48/28.84  % NegExts                              : 0
% 158.48/28.84  % Equation resolutions                 : 18
% 158.48/28.84  % Disequality decompositions           : 0
% 158.48/28.84  % Total rewrite steps                  : 3116331
% 158.48/28.84  % ...of those cached                   : 2761940
% 158.48/28.84  % Propositional unsat checks           : 0
% 158.48/28.84  %    Propositional check models        : 0
% 158.48/28.84  %    Propositional check unsatisfiable : 0
% 158.48/28.84  %    Propositional clauses             : 0
% 158.48/28.84  %    Propositional clauses after purity: 0
% 158.48/28.84  %    Propositional unsat core size     : 0
% 158.48/28.84  %    Propositional preprocessing time  : 0.000
% 158.48/28.84  %    Propositional encoding time       : 0.000
% 158.48/28.84  %    Propositional solver time         : 0.000
% 158.48/28.84  %    Success case prop preproc time    : 0.000
% 158.48/28.84  %    Success case prop encoding time   : 0.000
% 158.48/28.84  %    Success case prop solver time     : 0.000
% 158.48/28.84  % Current number of processed clauses  : 1426
% 158.48/28.84  %    Positive orientable unit clauses  : 1281
% 158.48/28.84  %    Positive unorientable unit clauses: 10
% 158.48/28.84  %    Negative unit clauses             : 1
% 158.48/28.84  %    Non-unit-clauses                  : 134
% 158.48/28.84  % Current number of unprocessed clauses: 423067
% 158.48/28.84  % ...number of literals in the above   : 453503
% 158.48/28.84  % Current number of archived formulas  : 0
% 158.48/28.84  % Current number of archived clauses   : 284
% 158.48/28.84  % Clause-clause subsumption calls (NU) : 18446
% 158.48/28.84  % Rec. Clause-clause subsumption calls : 18446
% 158.48/28.84  % Non-unit clause-clause subsumptions  : 6396
% 158.48/28.84  % Unit Clause-clause subsumption calls : 893
% 158.48/28.84  % Rewrite failures with RHS unbound    : 0
% 158.48/28.84  % BW rewrite match attempts            : 27568
% 158.48/28.84  % BW rewrite match successes           : 2602
% 158.48/28.84  % Condensation attempts                : 0
% 158.48/28.84  % Condensation successes               : 0
% 158.48/28.84  % Termbank termtop insertions          : 18862683
% 158.48/28.84  % Search garbage collected termcells   : 8
% 158.48/28.84  
% 158.48/28.84  % -------------------------------------------------
% 158.48/28.84  % User time                : 21.750 s
% 158.48/28.84  % System time              : 0.705 s
% 158.48/28.84  % Total time               : 22.454 s
% 158.48/28.84  % Maximum resident set size: 3332 pages
% 158.48/28.84  
% 158.48/28.84  % -------------------------------------------------
% 158.48/28.84  % User time                : 108.252 s
% 158.48/28.84  % System time              : 3.606 s
% 158.48/28.84  % Total time               : 111.857 s
% 158.48/28.84  % Maximum resident set size: 4608 pages
% 158.48/28.84  % E exiting
%------------------------------------------------------------------------------