TSTP Solution File: LAT021-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT021-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:48 EDT 2022
% Result : Unsatisfiable 1.80s 2.03s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 74 ( 74 unt; 0 nHn; 4 RR)
% Number of literals : 74 ( 73 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 186 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('LAT021-1.p',unknown),
[] ).
cnf(4,axiom,
meet(A,A) = A,
file('LAT021-1.p',unknown),
[] ).
cnf(6,axiom,
join(A,A) = A,
file('LAT021-1.p',unknown),
[] ).
cnf(7,axiom,
meet(A,B) = meet(B,A),
file('LAT021-1.p',unknown),
[] ).
cnf(8,axiom,
join(A,B) = join(B,A),
file('LAT021-1.p',unknown),
[] ).
cnf(10,axiom,
meet(meet(A,B),C) = meet(A,meet(B,C)),
file('LAT021-1.p',unknown),
[] ).
cnf(12,axiom,
join(join(A,B),C) = join(A,join(B,C)),
file('LAT021-1.p',unknown),
[] ).
cnf(13,axiom,
join(meet(A,join(B,C)),meet(A,B)) = meet(A,join(B,C)),
file('LAT021-1.p',unknown),
[] ).
cnf(15,axiom,
meet(join(A,meet(B,C)),join(A,B)) = join(A,meet(B,C)),
file('LAT021-1.p',unknown),
[] ).
cnf(17,axiom,
join(join(A,meet(B,C)),meet(join(A,B),C)) = join(A,meet(B,C)),
file('LAT021-1.p',unknown),
[] ).
cnf(18,plain,
join(A,join(meet(B,C),meet(join(A,B),C))) = join(A,meet(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[17]),12]),
[iquote('copy,17,demod,12')] ).
cnf(20,plain,
meet(join(b,c),a) != join(meet(a,b),meet(a,c)),
inference(para_from,[status(thm),theory(equality)],[7,1]),
[iquote('para_from,7.1.1,1.1.1')] ).
cnf(22,plain,
meet(A,meet(B,C)) = meet(B,meet(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,7]),10]),
[iquote('para_into,9.1.1.1,7.1.1,demod,10')] ).
cnf(23,plain,
meet(A,meet(A,B)) = meet(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,4])]),
[iquote('para_into,9.1.1.1,3.1.1,flip.1')] ).
cnf(25,plain,
meet(A,meet(B,C)) = meet(B,meet(C,A)),
inference(para_into,[status(thm),theory(equality)],[10,7]),
[iquote('para_into,9.1.1,7.1.1')] ).
cnf(31,plain,
meet(A,meet(B,A)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[23,7]),
[iquote('para_into,23.1.1.2,7.1.1')] ).
cnf(40,plain,
join(A,join(B,C)) = join(B,join(C,A)),
inference(para_into,[status(thm),theory(equality)],[12,8]),
[iquote('para_into,11.1.1,8.1.1')] ).
cnf(48,plain,
join(meet(A,join(B,join(C,D))),meet(A,join(B,C))) = meet(A,join(B,join(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,12]),12]),
[iquote('para_into,13.1.1.1.2,11.1.1,demod,12')] ).
cnf(53,plain,
join(meet(join(A,B),C),meet(C,A)) = meet(C,join(A,B)),
inference(para_into,[status(thm),theory(equality)],[13,7]),
[iquote('para_into,13.1.1.1,7.1.1')] ).
cnf(54,plain,
join(A,join(B,meet(join(A,B),A))) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,4]),12,4]),
[iquote('para_into,13.1.1.1,3.1.1,demod,12,4')] ).
cnf(56,plain,
join(meet(A,join(meet(B,A),C)),meet(A,B)) = meet(A,join(meet(B,A),C)),
inference(para_into,[status(thm),theory(equality)],[13,31]),
[iquote('para_into,13.1.1.2,31.1.1')] ).
cnf(58,plain,
join(meet(A,join(meet(A,B),C)),meet(A,B)) = meet(A,join(meet(A,B),C)),
inference(para_into,[status(thm),theory(equality)],[13,23]),
[iquote('para_into,13.1.1.2,23.1.1')] ).
cnf(60,plain,
join(meet(A,join(B,C)),meet(B,A)) = meet(A,join(B,C)),
inference(para_into,[status(thm),theory(equality)],[13,7]),
[iquote('para_into,13.1.1.2,7.1.1')] ).
cnf(62,plain,
join(meet(A,join(A,B)),A) = meet(A,join(A,B)),
inference(para_into,[status(thm),theory(equality)],[13,4]),
[iquote('para_into,13.1.1.2,3.1.1')] ).
cnf(65,plain,
join(meet(A,B),meet(A,join(B,C))) = meet(A,join(B,C)),
inference(para_into,[status(thm),theory(equality)],[13,8]),
[iquote('para_into,13.1.1,8.1.1')] ).
cnf(82,plain,
meet(A,meet(B,C)) = meet(C,meet(B,A)),
inference(para_into,[status(thm),theory(equality)],[25,7]),
[iquote('para_into,25.1.1.2,7.1.1')] ).
cnf(102,plain,
meet(join(A,meet(B,C)),join(A,C)) = join(A,meet(C,B)),
inference(para_into,[status(thm),theory(equality)],[15,7]),
[iquote('para_into,15.1.1.1.2,7.1.1')] ).
cnf(110,plain,
meet(A,meet(B,join(meet(A,B),A))) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,6]),10,6]),
[iquote('para_into,15.1.1.1,5.1.1,demod,10,6')] ).
cnf(144,plain,
join(A,join(B,C)) = join(C,join(B,A)),
inference(para_into,[status(thm),theory(equality)],[40,8]),
[iquote('para_into,40.1.1.2,8.1.1')] ).
cnf(280,plain,
meet(join(c,b),a) != join(meet(a,b),meet(a,c)),
inference(para_into,[status(thm),theory(equality)],[20,8]),
[iquote('para_into,20.1.1.1,8.1.1')] ).
cnf(333,plain,
join(A,join(meet(join(B,A),B),B)) = join(B,A),
inference(para_into,[status(thm),theory(equality)],[54,40]),
[iquote('para_into,54.1.1,40.1.1')] ).
cnf(360,plain,
join(meet(join(A,B),A),A) = meet(A,join(A,B)),
inference(para_into,[status(thm),theory(equality)],[62,7]),
[iquote('para_into,62.1.1.1,7.1.1')] ).
cnf(371,plain,
join(A,meet(A,join(A,B))) = meet(A,join(A,B)),
inference(para_into,[status(thm),theory(equality)],[62,8]),
[iquote('para_into,62.1.1,8.1.1')] ).
cnf(379,plain,
join(A,meet(B,join(B,A))) = join(B,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[333]),360]),
[iquote('back_demod,333,demod,360')] ).
cnf(472,plain,
join(A,meet(B,join(A,B))) = join(B,A),
inference(para_into,[status(thm),theory(equality)],[379,8]),
[iquote('para_into,378.1.1.2.2,8.1.1')] ).
cnf(486,plain,
meet(join(A,B),join(B,A)) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[379,15]),379]),
[iquote('para_from,378.1.1,15.1.1.1,demod,379')] ).
cnf(507,plain,
join(meet(A,join(B,A)),B) = join(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[472,472]),10,486,472])]),
[iquote('para_into,471.1.1.2.2,471.1.1,demod,10,486,472,flip.1')] ).
cnf(526,plain,
join(A,meet(join(A,B),B)) = join(B,A),
inference(para_into,[status(thm),theory(equality)],[472,7]),
[iquote('para_into,471.1.1.2,7.1.1')] ).
cnf(737,plain,
meet(A,join(B,C)) = meet(join(C,B),meet(join(B,C),A)),
inference(para_from,[status(thm),theory(equality)],[486,82]),
[iquote('para_from,485.1.1,82.1.1.2')] ).
cnf(745,plain,
meet(join(A,B),meet(join(B,A),C)) = meet(join(A,B),C),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[486,10])]),
[iquote('para_from,485.1.1,9.1.1.1,flip.1')] ).
cnf(746,plain,
meet(join(A,B),C) = meet(C,join(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[737])]),745]),
[iquote('copy,737,flip.1,demod,745')] ).
cnf(870,plain,
join(meet(A,B),meet(B,A)) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[53,6]),6]),
[iquote('para_into,53.1.1.1.1,5.1.1,demod,6')] ).
cnf(1054,plain,
join(A,join(meet(B,C),meet(C,join(B,A)))) = join(A,meet(B,C)),
inference(para_from,[status(thm),theory(equality)],[746,18]),
[iquote('para_from,746.1.1,18.1.1.2.2')] ).
cnf(1233,plain,
join(A,meet(B,C)) = join(meet(B,C),join(meet(C,B),A)),
inference(para_from,[status(thm),theory(equality)],[870,144]),
[iquote('para_from,870.1.1,144.1.1.2')] ).
cnf(1242,plain,
join(meet(A,B),join(meet(B,A),C)) = join(meet(B,A),C),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[870,12])]),
[iquote('para_from,870.1.1,11.1.1.1,flip.1')] ).
cnf(1246,plain,
join(A,meet(B,C)) = join(meet(C,B),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1233]),1242]),
[iquote('back_demod,1233,demod,1242')] ).
cnf(1405,plain,
join(meet(A,join(B,meet(A,C))),meet(A,C)) = meet(A,join(B,meet(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,526]),526]),
[iquote('para_into,58.1.1.1.2,525.1.1,demod,526')] ).
cnf(1439,plain,
meet(A,join(meet(A,B),A)) = join(A,meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,507])]),
[iquote('para_into,58.1.1,507.1.1,flip.1')] ).
cnf(1491,plain,
join(meet(A,B),meet(B,join(meet(A,B),C))) = meet(B,join(meet(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1246,56])]),
[iquote('para_into,1246.1.1,56.1.1,flip.1')] ).
cnf(1498,plain,
join(meet(A,B),meet(B,join(A,C))) = meet(B,join(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1246,13])]),
[iquote('para_into,1246.1.1,13.1.1,flip.1')] ).
cnf(1500,plain,
join(A,meet(B,join(C,A))) = join(A,meet(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1054]),1498]),
[iquote('back_demod,1054,demod,1498')] ).
cnf(1506,plain,
join(A,join(meet(B,join(A,C)),meet(C,B))) = join(A,meet(C,B)),
inference(para_from,[status(thm),theory(equality)],[1246,18]),
[iquote('para_from,1246.1.1,18.1.1.2')] ).
cnf(1605,plain,
join(meet(A,join(B,C)),meet(C,A)) = meet(A,join(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[60,526]),526]),
[iquote('para_into,60.1.1.1.2,525.1.1,demod,526')] ).
cnf(1627,plain,
join(A,meet(B,join(A,C))) = join(A,meet(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1506]),1605]),
[iquote('back_demod,1506,demod,1605')] ).
cnf(1712,plain,
meet(A,join(B,meet(B,A))) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[110,22]),1439]),
[iquote('para_into,109.1.1,22.1.1,demod,1439')] ).
cnf(1746,plain,
meet(A,join(meet(B,A),B)) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1712,110]),10,486,110]),
[iquote('para_into,1712.1.1.2.2,109.1.1,demod,10,486,110')] ).
cnf(1788,plain,
join(meet(join(A,meet(A,B)),join(B,C)),meet(A,B)) = meet(join(A,meet(A,B)),join(B,C)),
inference(para_from,[status(thm),theory(equality)],[1712,60]),
[iquote('para_from,1712.1.1,60.1.1.2')] ).
cnf(1815,plain,
meet(A,join(meet(join(B,C),A),B)) = meet(join(B,C),A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1746,48]),1491,1746]),
[iquote('para_from,1745.1.1,48.1.1.1,demod,1491,1746')] ).
cnf(1908,plain,
join(A,meet(A,join(B,A))) = meet(A,join(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[371,526]),526]),
[iquote('para_into,371.1.1.2.2,525.1.1,demod,526')] ).
cnf(1921,plain,
join(meet(join(A,B),C),B) = join(B,meet(A,C)),
inference(para_into,[status(thm),theory(equality)],[1500,1246]),
[iquote('para_into,1500.1.1,1246.1.1')] ).
cnf(1922,plain,
join(meet(A,join(B,C)),C) = join(C,meet(B,A)),
inference(para_into,[status(thm),theory(equality)],[1500,8]),
[iquote('para_into,1500.1.1,8.1.1')] ).
cnf(1927,plain,
meet(join(A,meet(A,B)),join(B,C)) = meet(A,join(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1788]),1921,65])]),
[iquote('back_demod,1788,demod,1921,65,flip.1')] ).
cnf(1929,plain,
join(A,meet(B,C)) = join(meet(C,join(B,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1922])]),
[iquote('copy,1922,flip.1')] ).
cnf(1934,plain,
join(A,meet(B,join(C,A))) = join(A,meet(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1500,15]),102])]),
[iquote('para_from,1500.1.1,15.1.1.1,demod,102,flip.1')] ).
cnf(1936,plain,
meet(A,join(B,A)) = join(A,meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1908]),1934])]),
[iquote('back_demod,1908,demod,1934,flip.1')] ).
cnf(1987,plain,
meet(join(A,meet(A,B)),C) = meet(A,meet(join(B,A),C)),
inference(para_from,[status(thm),theory(equality)],[1936,10]),
[iquote('para_from,1936.1.1,9.1.1.1')] ).
cnf(1993,plain,
meet(A,meet(join(B,A),join(B,C))) = meet(A,join(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1927]),1987]),
[iquote('back_demod,1927,demod,1987')] ).
cnf(2095,plain,
join(meet(join(A,B),C),A) = join(A,meet(B,C)),
inference(para_into,[status(thm),theory(equality)],[1627,1246]),
[iquote('para_into,1627.1.1,1246.1.1')] ).
cnf(2097,plain,
meet(A,join(B,meet(C,A))) = meet(join(B,C),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1815]),2095]),
[iquote('back_demod,1815,demod,2095')] ).
cnf(2133,plain,
join(meet(A,join(B,C)),C) = join(C,meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1929,1712]),1987,1993])]),
[iquote('para_into,1929.1.1.2,1712.1.1,demod,1987,1993,flip.1')] ).
cnf(2136,plain,
meet(A,join(B,meet(A,C))) = join(meet(A,C),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1405]),2133])]),
[iquote('back_demod,1405,demod,2133,flip.1')] ).
cnf(2146,plain,
join(meet(A,B),meet(A,C)) = meet(join(C,B),A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[2097,7]),2136]),
[iquote('para_into,2097.1.1.2.2,7.1.1,demod,2136')] ).
cnf(2152,plain,
meet(join(A,B),C) = join(meet(C,B),meet(C,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2146])]),
[iquote('copy,2146,flip.1')] ).
cnf(2153,plain,
$false,
inference(binary,[status(thm)],[2152,280]),
[iquote('binary,2152.1,280.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LAT021-1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:38:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.80/2.03 ----- Otter 3.3f, August 2004 -----
% 1.80/2.03 The process was started by sandbox on n028.cluster.edu,
% 1.80/2.03 Wed Jul 27 08:38:19 2022
% 1.80/2.03 The command was "./otter". The process ID is 23843.
% 1.80/2.03
% 1.80/2.03 set(prolog_style_variables).
% 1.80/2.03 set(auto).
% 1.80/2.03 dependent: set(auto1).
% 1.80/2.03 dependent: set(process_input).
% 1.80/2.03 dependent: clear(print_kept).
% 1.80/2.03 dependent: clear(print_new_demod).
% 1.80/2.03 dependent: clear(print_back_demod).
% 1.80/2.03 dependent: clear(print_back_sub).
% 1.80/2.03 dependent: set(control_memory).
% 1.80/2.03 dependent: assign(max_mem, 12000).
% 1.80/2.03 dependent: assign(pick_given_ratio, 4).
% 1.80/2.03 dependent: assign(stats_level, 1).
% 1.80/2.03 dependent: assign(max_seconds, 10800).
% 1.80/2.03 clear(print_given).
% 1.80/2.03
% 1.80/2.03 list(usable).
% 1.80/2.03 0 [] A=A.
% 1.80/2.03 0 [] meet(X,X)=X.
% 1.80/2.03 0 [] join(X,X)=X.
% 1.80/2.03 0 [] meet(X,Y)=meet(Y,X).
% 1.80/2.03 0 [] join(X,Y)=join(Y,X).
% 1.80/2.03 0 [] meet(meet(X,Y),Z)=meet(X,meet(Y,Z)).
% 1.80/2.03 0 [] join(join(X,Y),Z)=join(X,join(Y,Z)).
% 1.80/2.03 0 [] join(meet(X,join(Y,Z)),meet(X,Y))=meet(X,join(Y,Z)).
% 1.80/2.03 0 [] meet(join(X,meet(Y,Z)),join(X,Y))=join(X,meet(Y,Z)).
% 1.80/2.03 0 [] join(join(X,meet(Y,Z)),meet(join(X,Y),Z))=join(X,meet(Y,Z)).
% 1.80/2.03 0 [] meet(a,join(b,c))!=join(meet(a,b),meet(a,c)).
% 1.80/2.03 end_of_list.
% 1.80/2.03
% 1.80/2.03 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.80/2.03
% 1.80/2.03 All clauses are units, and equality is present; the
% 1.80/2.03 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.80/2.03
% 1.80/2.03 dependent: set(knuth_bendix).
% 1.80/2.03 dependent: set(anl_eq).
% 1.80/2.03 dependent: set(para_from).
% 1.80/2.03 dependent: set(para_into).
% 1.80/2.03 dependent: clear(para_from_right).
% 1.80/2.03 dependent: clear(para_into_right).
% 1.80/2.03 dependent: set(para_from_vars).
% 1.80/2.03 dependent: set(eq_units_both_ways).
% 1.80/2.03 dependent: set(dynamic_demod_all).
% 1.80/2.03 dependent: set(dynamic_demod).
% 1.80/2.03 dependent: set(order_eq).
% 1.80/2.03 dependent: set(back_demod).
% 1.80/2.03 dependent: set(lrpo).
% 1.80/2.03
% 1.80/2.03 ------------> process usable:
% 1.80/2.03 ** KEPT (pick-wt=13): 1 [] meet(a,join(b,c))!=join(meet(a,b),meet(a,c)).
% 1.80/2.03
% 1.80/2.03 ------------> process sos:
% 1.80/2.03 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.80/2.03 ** KEPT (pick-wt=5): 3 [] meet(A,A)=A.
% 1.80/2.03 ---> New Demodulator: 4 [new_demod,3] meet(A,A)=A.
% 1.80/2.03 ** KEPT (pick-wt=5): 5 [] join(A,A)=A.
% 1.80/2.03 ---> New Demodulator: 6 [new_demod,5] join(A,A)=A.
% 1.80/2.03 ** KEPT (pick-wt=7): 7 [] meet(A,B)=meet(B,A).
% 1.80/2.03 ** KEPT (pick-wt=7): 8 [] join(A,B)=join(B,A).
% 1.80/2.03 ** KEPT (pick-wt=11): 9 [] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.80/2.03 ---> New Demodulator: 10 [new_demod,9] meet(meet(A,B),C)=meet(A,meet(B,C)).
% 1.80/2.03 ** KEPT (pick-wt=11): 11 [] join(join(A,B),C)=join(A,join(B,C)).
% 1.80/2.03 ---> New Demodulator: 12 [new_demod,11] join(join(A,B),C)=join(A,join(B,C)).
% 1.80/2.03 ** KEPT (pick-wt=15): 13 [] join(meet(A,join(B,C)),meet(A,B))=meet(A,join(B,C)).
% 1.80/2.03 ---> New Demodulator: 14 [new_demod,13] join(meet(A,join(B,C)),meet(A,B))=meet(A,join(B,C)).
% 1.80/2.03 ** KEPT (pick-wt=15): 15 [] meet(join(A,meet(B,C)),join(A,B))=join(A,meet(B,C)).
% 1.80/2.03 ---> New Demodulator: 16 [new_demod,15] meet(join(A,meet(B,C)),join(A,B))=join(A,meet(B,C)).
% 1.80/2.03 ** KEPT (pick-wt=17): 18 [copy,17,demod,12] join(A,join(meet(B,C),meet(join(A,B),C)))=join(A,meet(B,C)).
% 1.80/2.03 ---> New Demodulator: 19 [new_demod,18] join(A,join(meet(B,C),meet(join(A,B),C)))=join(A,meet(B,C)).
% 1.80/2.03 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.80/2.03 >>>> Starting back demodulation with 4.
% 1.80/2.03 >>>> Starting back demodulation with 6.
% 1.80/2.03 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] meet(A,B)=meet(B,A).
% 1.80/2.03 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] join(A,B)=join(B,A).
% 1.80/2.03 >>>> Starting back demodulation with 10.
% 1.80/2.03 >>>> Starting back demodulation with 12.
% 1.80/2.03 >>>> Starting back demodulation with 14.
% 1.80/2.03 >>>> Starting back demodulation with 16.
% 1.80/2.03 >>>> Starting back demodulation with 19.
% 1.80/2.03
% 1.80/2.03 ======= end of input processing =======
% 1.80/2.03
% 1.80/2.03 =========== start of search ===========
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Resetting weight limit to 15.
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Resetting weight limit to 15.
% 1.80/2.03
% 1.80/2.03 sos_size=949
% 1.80/2.03
% 1.80/2.03 -------- PROOF --------
% 1.80/2.03
% 1.80/2.03 ----> UNIT CONFLICT at 0.17 sec ----> 2153 [binary,2152.1,280.1] $F.
% 1.80/2.03
% 1.80/2.03 Length of proof is 63. Level of proof is 16.
% 1.80/2.03
% 1.80/2.03 ---------------- PROOF ----------------
% 1.80/2.03 % SZS status Unsatisfiable
% 1.80/2.03 % SZS output start Refutation
% See solution above
% 1.80/2.03 ------------ end of proof -------------
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Search stopped by max_proofs option.
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Search stopped by max_proofs option.
% 1.80/2.03
% 1.80/2.03 ============ end of search ============
% 1.80/2.03
% 1.80/2.03 -------------- statistics -------------
% 1.80/2.03 clauses given 115
% 1.80/2.03 clauses generated 9858
% 1.80/2.03 clauses kept 1405
% 1.80/2.03 clauses forward subsumed 6154
% 1.80/2.03 clauses back subsumed 5
% 1.80/2.03 Kbytes malloced 4882
% 1.80/2.03
% 1.80/2.03 ----------- times (seconds) -----------
% 1.80/2.03 user CPU time 0.17 (0 hr, 0 min, 0 sec)
% 1.80/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/2.03 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.80/2.03
% 1.80/2.03 That finishes the proof of the theorem.
% 1.80/2.03
% 1.80/2.03 Process 23843 finished Wed Jul 27 08:38:20 2022
% 1.80/2.03 Otter interrupted
% 1.80/2.03 PROOF FOUND
%------------------------------------------------------------------------------