TSTP Solution File: LAT394-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.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:03:15 EDT 2022
% Result : Unsatisfiable 1.96s 2.23s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 3 RR)
% Number of literals : 59 ( 58 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 127 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('LAT394-1.p',unknown),
[] ).
cnf(2,plain,
f(x1,f(x1,x1)) != f(x0,f(x0,x0)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(5,axiom,
f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B,
file('LAT394-1.p',unknown),
[] ).
cnf(8,axiom,
and(A,B) = f(f(A,B),f(A,B)),
file('LAT394-1.p',unknown),
[] ).
cnf(10,plain,
f(f(A,B),f(A,B)) = and(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(14,plain,
f(and(A,B),and(A,B)) = and(f(A,B),f(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,10]),10]),
[iquote('para_into,9.1.1.1,9.1.1,demod,10')] ).
cnf(28,plain,
f(f(and(A,A),B),f(A,f(f(A,f(f(A,A),A)),A))) = A,
inference(para_into,[status(thm),theory(equality)],[5,10]),
[iquote('para_into,4.1.1.1.1,9.1.1')] ).
cnf(33,plain,
f(A,f(f(A,B),f(f(f(A,B),f(and(C,A),f(C,A))),D))) = f(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,5]),10]),
[iquote('para_into,4.1.1.1,4.1.1,demod,10')] ).
cnf(45,plain,
and(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = f(B,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,10]),5])]),
[iquote('para_from,4.1.1,9.1.1.2,demod,5,flip.1')] ).
cnf(57,plain,
and(f(and(A,A),B),f(A,f(f(A,f(f(A,A),A)),A))) = f(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[28,10]),28])]),
[iquote('para_from,27.1.1,9.1.1.2,demod,28,flip.1')] ).
cnf(127,plain,
f(f(A,B),f(f(f(A,B),f(B,C)),B)) = f(f(A,B),f(B,C)),
inference(para_into,[status(thm),theory(equality)],[33,5]),
[iquote('para_into,33.1.1.2.2,4.1.1')] ).
cnf(130,plain,
f(A,f(f(A,B),f(and(C,A),f(C,A)))) = f(A,B),
inference(para_into,[status(thm),theory(equality)],[33,33]),
[iquote('para_into,33.1.1.2,33.1.1')] ).
cnf(199,plain,
and(A,f(f(A,B),f(and(C,A),f(C,A)))) = and(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[130,10]),130,10])]),
[iquote('para_from,129.1.1,9.1.1.2,demod,130,10,flip.1')] ).
cnf(204,plain,
f(f(and(A,A),A),f(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[127,28]),28]),
[iquote('para_into,127.1.1.2.1,27.1.1,demod,28')] ).
cnf(205,plain,
f(f(A,A),f(and(A,A),A)) = and(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[127,10]),10]),
[iquote('para_into,127.1.1.2.1,9.1.1,demod,10')] ).
cnf(207,plain,
f(f(f(f(A,B),f(B,C)),B),f(B,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[127,5]),5]),
[iquote('para_into,127.1.1.2.1,4.1.1,demod,5')] ).
cnf(217,plain,
f(f(A,B),f(A,f(f(A,f(and(f(A,A),f(A,A)),and(A,A))),A))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,5]),14]),
[iquote('para_from,203.1.1,4.1.1.1.1,demod,14')] ).
cnf(219,plain,
f(A,f(f(A,f(f(A,A),B)),f(A,A))) = f(A,f(f(A,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,127]),204,204]),
[iquote('para_from,203.1.1,127.1.1.1,demod,204,204')] ).
cnf(235,plain,
f(f(f(f(A,f(B,B)),and(B,B)),f(B,B)),and(B,B)) = f(B,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[207,205]),10]),
[iquote('para_into,207.1.1.1.1.2,205.1.1,demod,10')] ).
cnf(240,plain,
and(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[207,207]),10]),
[iquote('para_into,207.1.1.1.1,207.1.1,demod,10')] ).
cnf(246,plain,
f(f(f(f(A,f(B,B)),B),f(B,B)),B) = f(B,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[235]),240,240]),
[iquote('back_demod,235,demod,240,240')] ).
cnf(249,plain,
f(f(A,B),f(A,f(f(A,f(f(A,A),A)),A))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[217]),240,240]),
[iquote('back_demod,217,demod,240,240')] ).
cnf(256,plain,
and(f(A,B),f(A,f(f(A,f(f(A,A),A)),A))) = f(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[57]),240]),
[iquote('back_demod,57,demod,240')] ).
cnf(258,plain,
f(and(A,B),and(A,B)) = f(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[14]),240]),
[iquote('back_demod,13,demod,240')] ).
cnf(263,plain,
and(A,f(f(A,B),f(A,f(A,A)))) = and(A,B),
inference(para_from,[status(thm),theory(equality)],[240,199]),
[iquote('para_from,239.1.1,199.1.1.2.2.1')] ).
cnf(265,plain,
f(A,f(f(A,B),f(A,f(A,A)))) = f(A,B),
inference(para_from,[status(thm),theory(equality)],[240,130]),
[iquote('para_from,239.1.1,129.1.1.2.2.1')] ).
cnf(307,plain,
f(f(f(f(A,B),f(B,f(B,f(B,B)))),C),f(B,f(f(A,A),A))) = B,
inference(para_from,[status(thm),theory(equality)],[265,5]),
[iquote('para_from,265.1.1,4.1.1.2')] ).
cnf(309,plain,
and(f(f(f(A,f(B,B)),B),f(B,B)),B) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[246,10]),246,10,240])]),
[iquote('para_from,245.1.1,9.1.1.2,demod,246,10,240,flip.1')] ).
cnf(318,plain,
and(A,f(f(A,f(f(A,A),A)),A)) = A,
inference(para_into,[status(thm),theory(equality)],[249,10]),
[iquote('para_into,249.1.1,9.1.1')] ).
cnf(320,plain,
f(A,f(f(A,f(f(A,A),A)),A)) = f(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[249,309]),10,318,256])]),
[iquote('para_from,249.1.1,309.1.1.1.1,demod,10,318,256,flip.1')] ).
cnf(339,plain,
and(f(A,B),f(A,A)) = f(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[256]),320]),
[iquote('back_demod,255,demod,320')] ).
cnf(342,plain,
f(f(A,B),f(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[249]),320]),
[iquote('back_demod,249,demod,320')] ).
cnf(343,plain,
f(A,f(f(A,A),B)) = f(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[219]),342])]),
[iquote('back_demod,219,demod,342,flip.1')] ).
cnf(361,plain,
f(f(f(A,B),C),and(A,B)) = f(A,B),
inference(para_into,[status(thm),theory(equality)],[342,10]),
[iquote('para_into,341.1.1.2,9.1.1')] ).
cnf(381,plain,
and(f(f(A,B),C),and(A,B)) = and(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[339,10]),10]),
[iquote('para_into,339.1.1.2,9.1.1,demod,10')] ).
cnf(386,plain,
f(f(A,A),f(A,B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[343,342]),342]),
[iquote('para_into,343.1.1.2.1,341.1.1,demod,342')] ).
cnf(387,plain,
f(and(A,B),f(f(A,B),C)) = f(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[343,258]),258]),
[iquote('para_into,343.1.1.2.1,257.1.1,demod,258')] ).
cnf(392,plain,
f(f(f(A,B),f(B,C)),B) = and(f(A,B),f(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[343,5]),10]),
[iquote('para_into,343.1.1.2,4.1.1,demod,10')] ).
cnf(403,plain,
f(and(f(A,B),f(B,C)),f(B,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[207]),392]),
[iquote('back_demod,207,demod,392')] ).
cnf(407,plain,
and(A,f(f(A,A),B)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[343,263]),386,240])]),
[iquote('para_from,343.1.1,263.1.1.2.1,demod,386,240,flip.1')] ).
cnf(409,plain,
f(and(A,B),A) = f(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[386,342]),10]),
[iquote('para_into,385.1.1.2,341.1.1,demod,10')] ).
cnf(418,plain,
and(f(f(A,B),f(B,C)),B) = f(f(A,B),f(B,C)),
inference(para_into,[status(thm),theory(equality)],[407,5]),
[iquote('para_into,407.1.1.2,4.1.1')] ).
cnf(419,plain,
f(f(f(A,f(B,B)),B),f(B,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[309]),418]),
[iquote('back_demod,309,demod,418')] ).
cnf(430,plain,
f(f(A,A),f(f(f(B,A),f(A,C)),D)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[409,45]),5]),
[iquote('para_into,409.1.1.1,45.1.1,demod,5')] ).
cnf(452,plain,
f(and(f(A,f(B,B)),B),B) = f(B,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[403,386]),386]),
[iquote('para_into,403.1.1.1.2,385.1.1,demod,386')] ).
cnf(453,plain,
and(f(A,B),f(B,B)) = f(B,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[419,386]),386,392]),
[iquote('para_into,419.1.1.1.1.2,385.1.1,demod,386,392')] ).
cnf(456,plain,
f(f(A,f(B,B)),B) = f(B,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[419,387]),452])]),
[iquote('para_from,419.1.1,387.1.1.2,demod,452,flip.1')] ).
cnf(459,plain,
and(f(A,f(B,B)),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[453,386]),386]),
[iquote('para_into,453.1.1.2,385.1.1,demod,386')] ).
cnf(468,plain,
f(f(A,B),f(B,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[453,387]),430])]),
[iquote('para_from,453.1.1,387.1.1.1,demod,430,flip.1')] ).
cnf(472,plain,
f(A,f(B,f(A,A))) = f(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[459,409]),456]),
[iquote('para_from,459.1.1,409.1.1.1,demod,456')] ).
cnf(473,plain,
f(f(A,B),f(A,f(f(C,C),C))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[307]),472,468]),
[iquote('back_demod,307,demod,472,468')] ).
cnf(483,plain,
and(A,and(B,A)) = and(B,A),
inference(para_from,[status(thm),theory(equality)],[468,381]),
[iquote('para_from,467.1.1,381.1.1.1')] ).
cnf(485,plain,
f(A,and(B,A)) = f(B,A),
inference(para_from,[status(thm),theory(equality)],[468,361]),
[iquote('para_from,467.1.1,361.1.1.1')] ).
cnf(491,plain,
f(f(A,A),f(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[485,386]),
[iquote('para_from,485.1.1,385.1.1.2')] ).
cnf(501,plain,
and(A,f(f(B,B),B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[473,456]),10]),
[iquote('para_into,473.1.1,455.1.1,demod,10')] ).
cnf(506,plain,
and(A,f(B,f(B,B))) = A,
inference(para_into,[status(thm),theory(equality)],[501,491]),
[iquote('para_into,501.1.1.2.1,491.1.1')] ).
cnf(515,plain,
and(f(A,f(A,A)),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[506,483]),506]),
[iquote('para_from,505.1.1,483.1.1.2,demod,506')] ).
cnf(530,plain,
f(A,f(A,A)) = f(B,f(B,B)),
inference(para_into,[status(thm),theory(equality)],[515,506]),
[iquote('para_into,515.1.1,505.1.1')] ).
cnf(531,plain,
$false,
inference(binary,[status(thm)],[530,2]),
[iquote('binary,530.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% 0.03/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:36:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.23 ----- Otter 3.3f, August 2004 -----
% 1.96/2.23 The process was started by sandbox on n016.cluster.edu,
% 1.96/2.23 Wed Jul 27 08:36:37 2022
% 1.96/2.23 The command was "./otter". The process ID is 25225.
% 1.96/2.23
% 1.96/2.23 set(prolog_style_variables).
% 1.96/2.23 set(auto).
% 1.96/2.23 dependent: set(auto1).
% 1.96/2.23 dependent: set(process_input).
% 1.96/2.23 dependent: clear(print_kept).
% 1.96/2.23 dependent: clear(print_new_demod).
% 1.96/2.23 dependent: clear(print_back_demod).
% 1.96/2.23 dependent: clear(print_back_sub).
% 1.96/2.23 dependent: set(control_memory).
% 1.96/2.23 dependent: assign(max_mem, 12000).
% 1.96/2.23 dependent: assign(pick_given_ratio, 4).
% 1.96/2.23 dependent: assign(stats_level, 1).
% 1.96/2.23 dependent: assign(max_seconds, 10800).
% 1.96/2.23 clear(print_given).
% 1.96/2.23
% 1.96/2.23 list(usable).
% 1.96/2.23 0 [] A=A.
% 1.96/2.23 0 [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C)))=B.
% 1.96/2.23 0 [] or(A,B)=f(f(A,A),f(B,B)).
% 1.96/2.23 0 [] and(A,B)=f(f(A,B),f(A,B)).
% 1.96/2.23 0 [] neg(A)=f(A,A).
% 1.96/2.23 0 [] f(x0,f(x0,x0))!=f(x1,f(x1,x1)).
% 1.96/2.23 end_of_list.
% 1.96/2.23
% 1.96/2.23 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.96/2.23
% 1.96/2.23 All clauses are units, and equality is present; the
% 1.96/2.23 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.96/2.23
% 1.96/2.23 dependent: set(knuth_bendix).
% 1.96/2.23 dependent: set(anl_eq).
% 1.96/2.23 dependent: set(para_from).
% 1.96/2.23 dependent: set(para_into).
% 1.96/2.23 dependent: clear(para_from_right).
% 1.96/2.23 dependent: clear(para_into_right).
% 1.96/2.23 dependent: set(para_from_vars).
% 1.96/2.23 dependent: set(eq_units_both_ways).
% 1.96/2.23 dependent: set(dynamic_demod_all).
% 1.96/2.23 dependent: set(dynamic_demod).
% 1.96/2.23 dependent: set(order_eq).
% 1.96/2.23 dependent: set(back_demod).
% 1.96/2.23 dependent: set(lrpo).
% 1.96/2.23
% 1.96/2.23 ------------> process usable:
% 1.96/2.23 ** KEPT (pick-wt=11): 2 [copy,1,flip.1] f(x1,f(x1,x1))!=f(x0,f(x0,x0)).
% 1.96/2.23
% 1.96/2.23 ------------> process sos:
% 1.96/2.23 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.96/2.23 ** KEPT (pick-wt=23): 4 [] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C)))=B.
% 1.96/2.23 ---> New Demodulator: 5 [new_demod,4] f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C)))=B.
% 1.96/2.23 ** KEPT (pick-wt=11): 6 [] or(A,B)=f(f(A,A),f(B,B)).
% 1.96/2.23 ---> New Demodulator: 7 [new_demod,6] or(A,B)=f(f(A,A),f(B,B)).
% 1.96/2.23 ** KEPT (pick-wt=11): 9 [copy,8,flip.1] f(f(A,B),f(A,B))=and(A,B).
% 1.96/2.23 ---> New Demodulator: 10 [new_demod,9] f(f(A,B),f(A,B))=and(A,B).
% 1.96/2.23 ** KEPT (pick-wt=6): 11 [] neg(A)=f(A,A).
% 1.96/2.23 ---> New Demodulator: 12 [new_demod,11] neg(A)=f(A,A).
% 1.96/2.23 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.96/2.23 >>>> Starting back demodulation with 5.
% 1.96/2.23 >>>> Starting back demodulation with 7.
% 1.96/2.23 >>>> Starting back demodulation with 10.
% 1.96/2.23 >>>> Starting back demodulation with 12.
% 1.96/2.23
% 1.96/2.23 ======= end of input processing =======
% 1.96/2.23
% 1.96/2.23 =========== start of search ===========
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 23.
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 23.
% 1.96/2.23
% 1.96/2.23 sos_size=79
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 19.
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 19.
% 1.96/2.23
% 1.96/2.23 sos_size=69
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 13.
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 13.
% 1.96/2.23
% 1.96/2.23 sos_size=68
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 11.
% 1.96/2.23
% 1.96/2.23
% 1.96/2.23 Resetting weight limit to 11.
% 1.96/2.23
% 1.96/2.23 sos_size=60
% 1.96/2.23
% 1.96/2.23 -------- PROOF --------
% 1.96/2.23
% 1.96/2.23 ----> UNIT CONFLICT at 0.34 sec ----> 531 [binary,530.1,2.1] $F.
% 1.96/2.23
% 1.96/2.23 Length of proof is 55. Level of proof is 22.
% 1.96/2.23
% 1.96/2.23 ---------------- PROOF ----------------
% 1.96/2.23 % SZS status Unsatisfiable
% 1.96/2.23 % SZS output start Refutation
% See solution above
% 2.04/2.23 ------------ end of proof -------------
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23 ============ end of search ============
% 2.04/2.23
% 2.04/2.23 -------------- statistics -------------
% 2.04/2.23 clauses given 94
% 2.04/2.23 clauses generated 10515
% 2.04/2.23 clauses kept 271
% 2.04/2.23 clauses forward subsumed 3898
% 2.04/2.23 clauses back subsumed 0
% 2.04/2.23 Kbytes malloced 7812
% 2.04/2.23
% 2.04/2.23 ----------- times (seconds) -----------
% 2.04/2.23 user CPU time 0.34 (0 hr, 0 min, 0 sec)
% 2.04/2.23 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.23 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.04/2.23
% 2.04/2.23 That finishes the proof of the theorem.
% 2.04/2.23
% 2.04/2.23 Process 25225 finished Wed Jul 27 08:36:39 2022
% 2.04/2.23 Otter interrupted
% 2.04/2.23 PROOF FOUND
%------------------------------------------------------------------------------