TSTP Solution File: LAT009-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LAT009-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n016.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 : Wed Jul 27 13:01:46 EDT 2022

% Result   : Unsatisfiable 2.17s 2.35s
% Output   : Refutation 2.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   81 (  81 unt;   0 nHn;   6 RR)
%            Number of literals    :   81 (  80 equ;   5 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  212 (  44 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    join(a,meet(b,c)) != meet(join(a,b),join(a,c)),
    file('LAT009-1.p',unknown),
    [] ).

cnf(2,plain,
    meet(join(a,b),join(a,c)) != join(a,meet(b,c)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
    [iquote('copy,1,flip.1')] ).

cnf(5,axiom,
    meet(A,A) = A,
    file('LAT009-1.p',unknown),
    [] ).

cnf(7,axiom,
    join(A,A) = A,
    file('LAT009-1.p',unknown),
    [] ).

cnf(9,axiom,
    meet(A,join(A,B)) = A,
    file('LAT009-1.p',unknown),
    [] ).

cnf(10,axiom,
    join(A,meet(A,B)) = A,
    file('LAT009-1.p',unknown),
    [] ).

cnf(12,axiom,
    meet(A,B) = meet(B,A),
    file('LAT009-1.p',unknown),
    [] ).

cnf(13,axiom,
    join(A,B) = join(B,A),
    file('LAT009-1.p',unknown),
    [] ).

cnf(15,axiom,
    meet(meet(A,B),C) = meet(A,meet(B,C)),
    file('LAT009-1.p',unknown),
    [] ).

cnf(17,axiom,
    join(join(A,B),C) = join(A,join(B,C)),
    file('LAT009-1.p',unknown),
    [] ).

cnf(18,axiom,
    join(meet(join(meet(A,B),C),B),meet(C,A)) = meet(join(meet(join(A,B),C),B),join(C,A)),
    file('LAT009-1.p',unknown),
    [] ).

cnf(19,plain,
    meet(join(meet(join(A,B),C),B),join(C,A)) = join(meet(join(meet(A,B),C),B),meet(C,A)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
    [iquote('copy,18,flip.1')] ).

cnf(21,plain,
    meet(join(A,B),A) = A,
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,9])]),
    [iquote('para_into,12.1.1,8.1.1,flip.1')] ).

cnf(23,plain,
    join(A,meet(B,A)) = A,
    inference(para_from,[status(thm),theory(equality)],[12,10]),
    [iquote('para_from,12.1.1,10.1.1.2')] ).

cnf(27,plain,
    join(meet(A,B),A) = A,
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,10])]),
    [iquote('para_into,13.1.1,10.1.1,flip.1')] ).

cnf(29,plain,
    meet(A,join(B,A)) = A,
    inference(para_from,[status(thm),theory(equality)],[13,9]),
    [iquote('para_from,13.1.1,8.1.1.2')] ).

cnf(31,plain,
    meet(join(b,a),join(a,c)) != join(a,meet(b,c)),
    inference(para_from,[status(thm),theory(equality)],[13,2]),
    [iquote('para_from,13.1.1,2.1.1.1')] ).

cnf(33,plain,
    meet(join(A,B),B) = B,
    inference(para_into,[status(thm),theory(equality)],[21,13]),
    [iquote('para_into,21.1.1.1,13.1.1')] ).

cnf(34,plain,
    join(A,join(B,A)) = join(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[21,10]),17]),
    [iquote('para_from,21.1.1,10.1.1.2,demod,17')] ).

cnf(37,plain,
    join(meet(A,B),B) = B,
    inference(para_into,[status(thm),theory(equality)],[23,13]),
    [iquote('para_into,23.1.1,13.1.1')] ).

cnf(43,plain,
    meet(A,meet(B,A)) = meet(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[27,9]),15]),
    [iquote('para_from,26.1.1,8.1.1.2,demod,15')] ).

cnf(44,plain,
    meet(join(A,B),meet(A,C)) = meet(A,C),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,21])]),
    [iquote('para_into,14.1.1.1,21.1.1,flip.1')] ).

cnf(46,plain,
    meet(A,meet(B,C)) = meet(B,meet(A,C)),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,12]),15]),
    [iquote('para_into,14.1.1.1,12.1.1,demod,15')] ).

cnf(49,plain,
    meet(A,meet(B,C)) = meet(B,meet(C,A)),
    inference(para_into,[status(thm),theory(equality)],[15,12]),
    [iquote('para_into,14.1.1,12.1.1')] ).

cnf(52,plain,
    meet(A,meet(B,C)) = meet(C,meet(A,B)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[49])]),
    [iquote('copy,49,flip.1')] ).

cnf(53,plain,
    join(A,meet(B,meet(C,A))) = A,
    inference(para_from,[status(thm),theory(equality)],[15,23]),
    [iquote('para_from,14.1.1,23.1.1.2')] ).

cnf(56,plain,
    join(meet(A,meet(B,C)),meet(A,B)) = meet(A,B),
    inference(para_from,[status(thm),theory(equality)],[15,27]),
    [iquote('para_from,14.1.1,26.1.1.1')] ).

cnf(61,plain,
    meet(A,meet(join(B,A),C)) = meet(A,C),
    inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[29,15])]),
    [iquote('para_from,28.1.1,14.1.1.1,flip.1')] ).

cnf(65,plain,
    join(meet(A,meet(B,C)),C) = C,
    inference(para_into,[status(thm),theory(equality)],[37,15]),
    [iquote('para_into,36.1.1.1,14.1.1')] ).

cnf(67,plain,
    meet(join(A,B),join(B,A)) = join(A,B),
    inference(para_from,[status(thm),theory(equality)],[34,29]),
    [iquote('para_from,34.1.1,28.1.1.2')] ).

cnf(69,plain,
    join(meet(A,B),join(B,C)) = join(B,C),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,37])]),
    [iquote('para_into,16.1.1.1,36.1.1,flip.1')] ).

cnf(72,plain,
    join(A,join(B,join(A,C))) = join(A,join(B,C)),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,34]),17,17])]),
    [iquote('para_into,16.1.1.1,34.1.1,demod,17,17,flip.1')] ).

cnf(74,plain,
    join(meet(A,B),join(A,C)) = join(A,C),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,27])]),
    [iquote('para_into,16.1.1.1,26.1.1,flip.1')] ).

cnf(77,plain,
    join(A,join(B,C)) = join(B,join(A,C)),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,13]),17]),
    [iquote('para_into,16.1.1.1,13.1.1,demod,17')] ).

cnf(78,plain,
    join(A,join(meet(A,B),C)) = join(A,C),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,10])]),
    [iquote('para_into,16.1.1.1,10.1.1,flip.1')] ).

cnf(84,plain,
    join(A,join(B,C)) = join(B,join(C,A)),
    inference(para_into,[status(thm),theory(equality)],[17,13]),
    [iquote('para_into,16.1.1,13.1.1')] ).

cnf(90,plain,
    meet(A,join(B,join(C,A))) = A,
    inference(para_from,[status(thm),theory(equality)],[17,29]),
    [iquote('para_from,16.1.1,28.1.1.2')] ).

cnf(97,plain,
    meet(join(A,B),join(A,join(B,C))) = join(A,B),
    inference(para_from,[status(thm),theory(equality)],[17,9]),
    [iquote('para_from,16.1.1,8.1.1.2')] ).

cnf(101,plain,
    meet(A,meet(B,meet(C,A))) = meet(A,meet(B,C)),
    inference(para_into,[status(thm),theory(equality)],[43,15]),
    [iquote('para_into,42.1.1.2,14.1.1')] ).

cnf(102,plain,
    join(meet(A,B),meet(B,A)) = meet(A,B),
    inference(para_from,[status(thm),theory(equality)],[43,23]),
    [iquote('para_from,42.1.1,23.1.1.2')] ).

cnf(113,plain,
    join(A,join(B,meet(C,A))) = join(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[53,9]),17]),
    [iquote('para_into,53.1.1.2.2,8.1.1,demod,17')] ).

cnf(127,plain,
    meet(join(meet(join(A,join(B,C)),D),C),join(D,join(A,B))) = join(meet(join(meet(join(A,B),C),D),C),meet(D,join(A,B))),
    inference(para_into,[status(thm),theory(equality)],[19,17]),
    [iquote('para_into,19.1.1.1.1.1,16.1.1')] ).

cnf(140,plain,
    meet(join(meet(A,join(B,C)),C),join(A,B)) = join(meet(join(meet(B,C),A),C),meet(A,B)),
    inference(para_into,[status(thm),theory(equality)],[19,12]),
    [iquote('para_into,19.1.1.1.1,12.1.1')] ).

cnf(162,plain,
    meet(join(A,B),join(meet(join(B,C),A),C)) = join(meet(join(meet(B,C),A),C),meet(A,B)),
    inference(para_into,[status(thm),theory(equality)],[19,12]),
    [iquote('para_into,19.1.1,12.1.1')] ).

cnf(167,plain,
    join(meet(join(meet(A,B),C),B),meet(C,A)) = meet(join(meet(C,join(A,B)),B),join(C,A)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[140])]),
    [iquote('copy,140,flip.1')] ).

cnf(169,plain,
    join(meet(join(meet(A,B),C),B),meet(C,A)) = meet(join(C,A),join(meet(join(A,B),C),B)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[162])]),
    [iquote('copy,162,flip.1')] ).

cnf(172,plain,
    join(A,join(B,meet(join(meet(B,C),A),C))) = join(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[19,23]),17,113]),
    [iquote('para_from,19.1.1,23.1.1.2,demod,17,113')] ).

cnf(189,plain,
    join(meet(A,B),join(C,B)) = join(C,B),
    inference(para_into,[status(thm),theory(equality)],[65,29]),
    [iquote('para_into,65.1.1.1.2,28.1.1')] ).

cnf(194,plain,
    join(meet(A,meet(B,C)),B) = B,
    inference(para_into,[status(thm),theory(equality)],[65,12]),
    [iquote('para_into,65.1.1.1.2,12.1.1')] ).

cnf(212,plain,
    meet(A,join(B,join(A,C))) = A,
    inference(para_into,[status(thm),theory(equality)],[90,13]),
    [iquote('para_into,90.1.1.2.2,13.1.1')] ).

cnf(214,plain,
    meet(A,meet(B,join(C,A))) = meet(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[90,10]),15]),
    [iquote('para_into,90.1.1.2.2,10.1.1,demod,15')] ).

cnf(269,plain,
    join(meet(A,meet(B,meet(C,D))),C) = C,
    inference(para_into,[status(thm),theory(equality)],[194,15]),
    [iquote('para_into,194.1.1.1,14.1.1')] ).

cnf(315,plain,
    meet(A,meet(B,join(A,C))) = meet(A,B),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[44,12]),15]),
    [iquote('para_into,44.1.1,12.1.1,demod,15')] ).

cnf(330,plain,
    meet(A,meet(B,join(C,join(A,D)))) = meet(B,A),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[46,212])]),
    [iquote('para_into,46.1.1.2,212.1.1,flip.1')] ).

cnf(360,plain,
    join(meet(A,meet(B,C)),meet(A,C)) = meet(A,C),
    inference(para_from,[status(thm),theory(equality)],[46,37]),
    [iquote('para_from,46.1.1,36.1.1.1')] ).

cnf(417,plain,
    join(meet(A,meet(B,C)),meet(C,A)) = meet(C,A),
    inference(para_from,[status(thm),theory(equality)],[52,37]),
    [iquote('para_from,52.1.1,36.1.1.1')] ).

cnf(433,plain,
    join(meet(A,B),join(C,A)) = join(C,A),
    inference(para_from,[status(thm),theory(equality)],[61,194]),
    [iquote('para_from,61.1.1,194.1.1.1')] ).

cnf(460,plain,
    meet(join(A,B),meet(C,join(B,A))) = meet(C,join(B,A)),
    inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[67,52])]),
    [iquote('para_from,67.1.1,52.1.1.2,flip.1')] ).

cnf(475,plain,
    join(meet(A,B),join(meet(B,A),C)) = join(meet(B,A),C),
    inference(para_into,[status(thm),theory(equality)],[69,43]),
    [iquote('para_into,69.1.1.1,42.1.1')] ).

cnf(564,plain,
    join(A,join(B,meet(C,meet(D,A)))) = join(B,A),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[77,53])]),
    [iquote('para_into,77.1.1.2,53.1.1,flip.1')] ).

cnf(594,plain,
    meet(join(A,join(B,C)),join(A,C)) = join(A,C),
    inference(para_from,[status(thm),theory(equality)],[77,33]),
    [iquote('para_from,77.1.1,32.1.1.1')] ).

cnf(617,plain,
    meet(join(A,B),join(meet(A,C),B)) = join(meet(A,C),B),
    inference(para_from,[status(thm),theory(equality)],[78,33]),
    [iquote('para_from,78.1.1,32.1.1.1')] ).

cnf(738,plain,
    join(A,meet(B,C)) = join(meet(C,B),A),
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[102,84]),475]),
    [iquote('para_from,102.1.1,84.1.1.2,demod,475')] ).

cnf(742,plain,
    join(meet(A,B),C) = join(C,meet(B,A)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[738])]),
    [iquote('copy,738,flip.1')] ).

cnf(861,plain,
    join(meet(A,B),join(C,meet(join(D,A),B))) = join(C,meet(join(D,A),B)),
    inference(para_into,[status(thm),theory(equality)],[189,61]),
    [iquote('para_into,188.1.1.1,61.1.1')] ).

cnf(1020,plain,
    meet(A,join(B,C)) = meet(join(C,B),A),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[214,34]),460]),
    [iquote('para_into,214.1.1.2.2,34.1.1,demod,460')] ).

cnf(1023,plain,
    meet(join(A,B),C) = meet(C,join(B,A)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1020])]),
    [iquote('copy,1020,flip.1')] ).

cnf(1301,plain,
    meet(join(c,a),join(b,a)) != join(a,meet(b,c)),
    inference(para_from,[status(thm),theory(equality)],[1020,31]),
    [iquote('para_from,1020.1.1,31.1.1')] ).

cnf(1310,plain,
    join(A,meet(join(B,A),join(B,C))) = join(B,A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[594,127]),17,7,17,72,97,189,33])]),
    [iquote('para_from,594.1.1,127.1.1.1.1,demod,17,7,17,72,97,189,33,flip.1')] ).

cnf(1394,plain,
    meet(join(meet(A,B),meet(C,A)),B) = meet(A,B),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[167,417]),15,101,15,5,56,15,9,37])]),
    [iquote('para_into,167.1.1.1.1,417.1.1,demod,15,101,15,5,56,15,9,37,flip.1')] ).

cnf(1396,plain,
    meet(join(meet(A,B),meet(C,B)),A) = meet(A,B),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[167,360]),15,43,15,43,56,15,315,27])]),
    [iquote('para_into,167.1.1.1.1,360.1.1,demod,15,43,15,43,56,15,315,27,flip.1')] ).

cnf(1426,plain,
    join(A,meet(join(A,B),C)) = join(meet(B,C),A),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[172,169]),15,33,17,861,74,433]),
    [iquote('para_into,172.1.1.2.2.1,169.1.1,demod,15,33,17,861,74,433')] ).

cnf(1433,plain,
    meet(join(meet(A,B),C),B) = meet(join(C,A),B),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1394,1310]),1426]),
    [iquote('para_into,1394.1.1.1,1310.1.1,demod,1426')] ).

cnf(1437,plain,
    meet(A,join(meet(B,C),meet(A,C))) = meet(A,C),
    inference(para_into,[status(thm),theory(equality)],[1396,1023]),
    [iquote('para_into,1396.1.1,1023.1.1')] ).

cnf(1445,plain,
    join(meet(join(A,B),C),B) = join(meet(A,C),B),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1426,34]),1426])]),
    [iquote('para_into,1425.1.1.2.1,34.1.1,demod,1426,flip.1')] ).

cnf(1447,plain,
    join(A,meet(join(B,A),C)) = join(meet(B,C),A),
    inference(para_into,[status(thm),theory(equality)],[1426,13]),
    [iquote('para_into,1425.1.1.2.1,13.1.1')] ).

cnf(1463,plain,
    meet(join(A,meet(B,C)),C) = meet(join(A,B),C),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1433,564]),17,269]),
    [iquote('para_into,1433.1.1.1,564.1.1,demod,17,269')] ).

cnf(1478,plain,
    join(meet(A,join(B,C)),C) = join(meet(A,B),C),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1445,330]),17,330]),
    [iquote('para_into,1445.1.1.1,329.1.1,demod,17,330')] ).

cnf(1484,plain,
    meet(join(A,B),C) = join(meet(A,C),meet(B,C)),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1447,1437]),617,1463])]),
    [iquote('para_from,1447.1.1,1437.1.1.2,demod,617,1463,flip.1')] ).

cnf(1492,plain,
    join(meet(c,b),a) != join(a,meet(b,c)),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1301]),1484,29,1478]),
    [iquote('back_demod,1301,demod,1484,29,1478')] ).

cnf(1493,plain,
    $false,
    inference(binary,[status(thm)],[1492,742]),
    [iquote('binary,1492.1,742.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : LAT009-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n016.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 : Wed Jul 27 08:48:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.17/2.35  ----- Otter 3.3f, August 2004 -----
% 2.17/2.35  The process was started by sandbox on n016.cluster.edu,
% 2.17/2.35  Wed Jul 27 08:48:52 2022
% 2.17/2.35  The command was "./otter".  The process ID is 10434.
% 2.17/2.35  
% 2.17/2.35  set(prolog_style_variables).
% 2.17/2.35  set(auto).
% 2.17/2.35     dependent: set(auto1).
% 2.17/2.35     dependent: set(process_input).
% 2.17/2.35     dependent: clear(print_kept).
% 2.17/2.35     dependent: clear(print_new_demod).
% 2.17/2.35     dependent: clear(print_back_demod).
% 2.17/2.35     dependent: clear(print_back_sub).
% 2.17/2.35     dependent: set(control_memory).
% 2.17/2.35     dependent: assign(max_mem, 12000).
% 2.17/2.35     dependent: assign(pick_given_ratio, 4).
% 2.17/2.35     dependent: assign(stats_level, 1).
% 2.17/2.35     dependent: assign(max_seconds, 10800).
% 2.17/2.35  clear(print_given).
% 2.17/2.35  
% 2.17/2.35  list(usable).
% 2.17/2.35  0 [] A=A.
% 2.17/2.35  0 [] meet(X,X)=X.
% 2.17/2.35  0 [] join(X,X)=X.
% 2.17/2.35  0 [] meet(X,join(X,Y))=X.
% 2.17/2.35  0 [] join(X,meet(X,Y))=X.
% 2.17/2.35  0 [] meet(X,Y)=meet(Y,X).
% 2.17/2.35  0 [] join(X,Y)=join(Y,X).
% 2.17/2.35  0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 2.17/2.35  0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 2.17/2.35  0 [] join(meet(join(meet(X,Y),Z),Y),meet(Z,X))=meet(join(meet(join(X,Y),Z),Y),join(Z,X)).
% 2.17/2.35  0 [] join(a,meet(b,c))!=meet(join(a,b),join(a,c)).
% 2.17/2.35  end_of_list.
% 2.17/2.35  
% 2.17/2.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.17/2.35  
% 2.17/2.35  All clauses are units, and equality is present; the
% 2.17/2.35  strategy will be Knuth-Bendix with positive clauses in sos.
% 2.17/2.35  
% 2.17/2.35     dependent: set(knuth_bendix).
% 2.17/2.35     dependent: set(anl_eq).
% 2.17/2.35     dependent: set(para_from).
% 2.17/2.35     dependent: set(para_into).
% 2.17/2.35     dependent: clear(para_from_right).
% 2.17/2.35     dependent: clear(para_into_right).
% 2.17/2.35     dependent: set(para_from_vars).
% 2.17/2.35     dependent: set(eq_units_both_ways).
% 2.17/2.35     dependent: set(dynamic_demod_all).
% 2.17/2.35     dependent: set(dynamic_demod).
% 2.17/2.35     dependent: set(order_eq).
% 2.17/2.35     dependent: set(back_demod).
% 2.17/2.35     dependent: set(lrpo).
% 2.17/2.35  
% 2.17/2.35  ------------> process usable:
% 2.17/2.35  ** KEPT (pick-wt=13): 2 [copy,1,flip.1] meet(join(a,b),join(a,c))!=join(a,meet(b,c)).
% 2.17/2.35  
% 2.17/2.35  ------------> process sos:
% 2.17/2.35  ** KEPT (pick-wt=3): 3 [] A=A.
% 2.17/2.35  ** KEPT (pick-wt=5): 4 [] meet(A,A)=A.
% 2.17/2.35  ---> New Demodulator: 5 [new_demod,4] meet(A,A)=A.
% 2.17/2.35  ** KEPT (pick-wt=5): 6 [] join(A,A)=A.
% 2.17/2.35  ---> New Demodulator: 7 [new_demod,6] join(A,A)=A.
% 2.17/2.35  ** KEPT (pick-wt=7): 8 [] meet(A,join(A,B))=A.
% 2.17/2.35  ---> New Demodulator: 9 [new_demod,8] meet(A,join(A,B))=A.
% 2.17/2.35  ** KEPT (pick-wt=7): 10 [] join(A,meet(A,B))=A.
% 2.17/2.35  ---> New Demodulator: 11 [new_demod,10] join(A,meet(A,B))=A.
% 2.17/2.35  ** KEPT (pick-wt=7): 12 [] meet(A,B)=meet(B,A).
% 2.17/2.35  ** KEPT (pick-wt=7): 13 [] join(A,B)=join(B,A).
% 2.17/2.35  ** KEPT (pick-wt=11): 14 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 2.17/2.35  ---> New Demodulator: 15 [new_demod,14] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 2.17/2.35  ** KEPT (pick-wt=11): 16 [] join(join(A,B),C)=join(A,join(B,C)).
% 2.17/2.35  ---> New Demodulator: 17 [new_demod,16] join(join(A,B),C)=join(A,join(B,C)).
% 2.17/2.35  ** KEPT (pick-wt=23): 19 [copy,18,flip.1] meet(join(meet(join(A,B),C),B),join(C,A))=join(meet(join(meet(A,B),C),B),meet(C,A)).
% 2.17/2.35  ---> New Demodulator: 20 [new_demod,19] meet(join(meet(join(A,B),C),B),join(C,A))=join(meet(join(meet(A,B),C),B),meet(C,A)).
% 2.17/2.35    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.17/2.35  >>>> Starting back demodulation with 5.
% 2.17/2.35  >>>> Starting back demodulation with 7.
% 2.17/2.35  >>>> Starting back demodulation with 9.
% 2.17/2.35  >>>> Starting back demodulation with 11.
% 2.17/2.35    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] meet(A,B)=meet(B,A).
% 2.17/2.35    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] join(A,B)=join(B,A).
% 2.17/2.35  >>>> Starting back demodulation with 15.
% 2.17/2.35  >>>> Starting back demodulation with 17.
% 2.17/2.35  >>>> Starting back demodulation with 20.
% 2.17/2.35  
% 2.17/2.35  ======= end of input processing =======
% 2.17/2.35  
% 2.17/2.35  =========== start of search ===========
% 2.17/2.35  
% 2.17/2.35  
% 2.17/2.35  Resetting weight limit to 13.
% 2.17/2.35  
% 2.17/2.35  
% 2.17/2.35  Resetting weight limit to 13.
% 2.17/2.35  
% 2.17/2.35  sos_size=611
% 2.17/2.35  
% 2.17/2.35  -------- PROOF -------- 
% 2.17/2.35  
% 2.17/2.35  ----> UNIT CONFLICT at   0.56 sec ----> 1493 [binary,1492.1,742.1] $F.
% 2.17/2.35  
% 2.17/2.35  Length of proof is 70.  Level of proof is 10.
% 2.17/2.35  
% 2.17/2.35  ---------------- PROOF ----------------
% 2.17/2.35  % SZS status Unsatisfiable
% 2.17/2.35  % SZS output start Refutation
% See solution above
% 2.17/2.35  ------------ end of proof -------------
% 2.17/2.35  
% 2.17/2.35  
% 2.17/2.35  Search stopped by max_proofs option.
% 2.17/2.35  
% 2.17/2.35  
% 2.17/2.35  Search stopped by max_proofs option.
% 2.17/2.35  
% 2.17/2.35  ============ end of search ============
% 2.17/2.35  
% 2.17/2.35  -------------- statistics -------------
% 2.17/2.35  clauses given                248
% 2.17/2.35  clauses generated          72430
% 2.17/2.35  clauses kept                 832
% 2.17/2.35  clauses forward subsumed   40066
% 2.17/2.35  clauses back subsumed          0
% 2.17/2.35  Kbytes malloced             5859
% 2.17/2.35  
% 2.17/2.35  ----------- times (seconds) -----------
% 2.17/2.35  user CPU time          0.56          (0 hr, 0 min, 0 sec)
% 2.17/2.35  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.17/2.35  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.17/2.35  
% 2.17/2.35  That finishes the proof of the theorem.
% 2.17/2.35  
% 2.17/2.35  Process 10434 finished Wed Jul 27 08:48:54 2022
% 2.17/2.35  Otter interrupted
% 2.17/2.35  PROOF FOUND
%------------------------------------------------------------------------------