TSTP Solution File: LAT089-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT089-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:56 EDT 2022
% Result : Unsatisfiable 1.96s 2.18s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 6
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 2 RR)
% Number of literals : 62 ( 61 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 115 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(b,a) != meet(a,b),
file('LAT089-1.p',unknown),
[] ).
cnf(3,axiom,
join(meet(A,B),meet(A,join(A,B))) = A,
file('LAT089-1.p',unknown),
[] ).
cnf(5,axiom,
join(meet(A,A),meet(B,join(A,A))) = A,
file('LAT089-1.p',unknown),
[] ).
cnf(7,axiom,
join(meet(A,B),meet(B,join(A,B))) = B,
file('LAT089-1.p',unknown),
[] ).
cnf(10,axiom,
meet(meet(join(A,B),join(C,A)),A) = A,
file('LAT089-1.p',unknown),
[] ).
cnf(11,axiom,
join(join(meet(A,B),meet(C,A)),A) = A,
file('LAT089-1.p',unknown),
[] ).
cnf(13,plain,
join(meet(meet(A,B),meet(A,join(A,B))),meet(meet(A,B),A)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.2,3.1.1')] ).
cnf(15,plain,
join(meet(meet(A,A),meet(B,join(A,A))),meet(meet(A,A),A)) = meet(A,A),
inference(para_from,[status(thm),theory(equality)],[5,3]),
[iquote('para_from,5.1.1,3.1.1.2.2')] ).
cnf(19,plain,
join(meet(meet(A,A),meet(B,join(A,A))),meet(meet(B,join(A,A)),A)) = meet(B,join(A,A)),
inference(para_into,[status(thm),theory(equality)],[7,5]),
[iquote('para_into,7.1.1.2.2,5.1.1')] ).
cnf(21,plain,
join(meet(meet(A,B),meet(A,join(A,B))),meet(meet(A,join(A,B)),A)) = meet(A,join(A,B)),
inference(para_into,[status(thm),theory(equality)],[7,3]),
[iquote('para_into,7.1.1.2.2,3.1.1')] ).
cnf(25,plain,
meet(meet(A,join(B,meet(C,A))),meet(C,A)) = meet(C,A),
inference(para_into,[status(thm),theory(equality)],[10,7]),
[iquote('para_into,9.1.1.1.1,7.1.1')] ).
cnf(43,plain,
join(join(meet(A,B),A),A) = A,
inference(para_into,[status(thm),theory(equality)],[11,10]),
[iquote('para_into,11.1.1.1.2,9.1.1')] ).
cnf(46,plain,
meet(meet(join(A,B),A),A) = A,
inference(para_from,[status(thm),theory(equality)],[11,10]),
[iquote('para_from,11.1.1,9.1.1.1.2')] ).
cnf(63,plain,
join(meet(join(meet(A,B),A),A),meet(A,A)) = A,
inference(para_from,[status(thm),theory(equality)],[43,7]),
[iquote('para_from,43.1.1,7.1.1.2.2')] ).
cnf(65,plain,
join(meet(join(meet(A,B),A),A),meet(join(meet(A,B),A),A)) = join(meet(A,B),A),
inference(para_from,[status(thm),theory(equality)],[43,3]),
[iquote('para_from,43.1.1,3.1.1.2.2')] ).
cnf(67,plain,
meet(meet(A,join(meet(A,B),A)),join(meet(A,B),A)) = join(meet(A,B),A),
inference(para_into,[status(thm),theory(equality)],[46,43]),
[iquote('para_into,45.1.1.1.1,43.1.1')] ).
cnf(74,plain,
meet(meet(A,meet(B,A)),meet(B,A)) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[46,7]),
[iquote('para_into,45.1.1.1.1,7.1.1')] ).
cnf(75,plain,
meet(meet(A,meet(A,B)),meet(A,B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[46,3]),
[iquote('para_into,45.1.1.1.1,3.1.1')] ).
cnf(122,plain,
meet(meet(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[74,46]),46,46]),
[iquote('para_into,73.1.1.1.2,45.1.1,demod,46,46')] ).
cnf(132,plain,
join(meet(meet(A,A),meet(B,join(A,A))),A) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),122]),
[iquote('back_demod,15,demod,122')] ).
cnf(149,plain,
join(meet(A,meet(meet(A,A),join(meet(A,A),A))),meet(A,meet(A,A))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[122,13]),122,122]),
[iquote('para_from,121.1.1,13.1.1.2.1,demod,122,122')] ).
cnf(153,plain,
join(A,meet(A,join(meet(A,A),A))) = A,
inference(para_from,[status(thm),theory(equality)],[122,7]),
[iquote('para_from,121.1.1,7.1.1.1')] ).
cnf(158,plain,
meet(meet(A,join(B,A)),A) = A,
inference(para_from,[status(thm),theory(equality)],[153,10]),
[iquote('para_from,153.1.1,9.1.1.1.1')] ).
cnf(170,plain,
meet(A,meet(A,A)) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[158,63]),122]),
[iquote('para_into,157.1.1.1.2,63.1.1,demod,122')] ).
cnf(178,plain,
meet(meet(meet(A,join(B,B)),B),meet(A,join(B,B))) = meet(A,join(B,B)),
inference(para_into,[status(thm),theory(equality)],[158,5]),
[iquote('para_into,157.1.1.1.2,5.1.1')] ).
cnf(187,plain,
join(meet(A,meet(meet(A,A),join(meet(A,A),A))),meet(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[149]),170]),
[iquote('back_demod,149,demod,170')] ).
cnf(204,plain,
meet(A,join(A,A)) = meet(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,158]),132])]),
[iquote('para_into,19.1.1.2,157.1.1,demod,132,flip.1')] ).
cnf(205,plain,
meet(join(A,B),join(A,A)) = meet(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,10]),132])]),
[iquote('para_into,19.1.1.2,9.1.1,demod,132,flip.1')] ).
cnf(211,plain,
join(meet(meet(meet(A,A),meet(B,join(A,A))),meet(meet(B,join(A,A)),A)),meet(B,join(A,A))) = meet(meet(B,join(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[19,7]),178]),
[iquote('para_from,19.1.1,7.1.1.2.2,demod,178')] ).
cnf(215,plain,
join(meet(meet(meet(A,A),meet(B,join(A,A))),meet(meet(B,join(A,A)),A)),meet(meet(meet(A,A),meet(B,join(A,A))),meet(B,join(A,A)))) = meet(meet(A,A),meet(B,join(A,A))),
inference(para_from,[status(thm),theory(equality)],[19,3]),
[iquote('para_from,19.1.1,3.1.1.2.2')] ).
cnf(218,plain,
meet(meet(A,A),meet(A,A)) = meet(A,A),
inference(para_from,[status(thm),theory(equality)],[170,74]),
[iquote('para_from,169.1.1,73.1.1.1')] ).
cnf(234,plain,
join(meet(A,A),A) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,19]),204,218,122,204]),
[iquote('para_from,203.1.1,19.1.1.2.1,demod,204,218,122,204')] ).
cnf(238,plain,
meet(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[204,43]),234,234]),
[iquote('para_from,203.1.1,43.1.1.1.1,demod,234,234')] ).
cnf(248,plain,
join(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[187]),238,238,204,238,238,238]),
[iquote('back_demod,187,demod,238,238,204,238,238,238')] ).
cnf(250,plain,
join(meet(meet(A,meet(B,A)),meet(meet(B,A),A)),meet(B,A)) = meet(A,meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[215]),238,248,248,238,248,248,74,238,248]),
[iquote('back_demod,215,demod,238,248,248,238,248,248,74,238,248')] ).
cnf(254,plain,
meet(meet(A,B),B) = meet(B,meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[211]),238,248,248,248,250,248])]),
[iquote('back_demod,211,demod,238,248,248,248,250,248,flip.1')] ).
cnf(256,plain,
meet(join(A,B),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[205]),248,238]),
[iquote('back_demod,205,demod,248,238')] ).
cnf(280,plain,
meet(A,meet(B,A)) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),238,248,248,254,248,248]),
[iquote('back_demod,19,demod,238,248,248,254,248,248')] ).
cnf(281,plain,
join(A,meet(B,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[5]),238,248]),
[iquote('back_demod,5,demod,238,248')] ).
cnf(284,plain,
meet(join(meet(A,B),A),A) = join(meet(A,B),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[65]),248]),
[iquote('back_demod,65,demod,248')] ).
cnf(292,plain,
meet(A,meet(A,B)) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[75]),254,280]),
[iquote('back_demod,75,demod,254,280')] ).
cnf(295,plain,
meet(A,join(meet(A,B),A)) = join(meet(A,B),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[67]),254,280]),
[iquote('back_demod,67,demod,254,280')] ).
cnf(305,plain,
join(meet(A,meet(meet(A,join(B,A)),join(meet(A,join(B,A)),A))),meet(meet(meet(A,join(B,A)),join(meet(A,join(B,A)),A)),meet(A,join(B,A)))) = meet(meet(A,join(B,A)),join(meet(A,join(B,A)),A)),
inference(para_into,[status(thm),theory(equality)],[21,158]),
[iquote('para_into,21.1.1.1.1,157.1.1')] ).
cnf(319,plain,
join(meet(A,meet(join(A,B),join(join(A,B),A))),meet(A,join(A,B))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[256,13]),256,256]),
[iquote('para_from,255.1.1,13.1.1.2.1,demod,256,256')] ).
cnf(325,plain,
join(A,meet(A,join(join(A,B),A))) = A,
inference(para_from,[status(thm),theory(equality)],[256,7]),
[iquote('para_from,255.1.1,7.1.1.1')] ).
cnf(327,plain,
join(A,meet(join(A,B),join(join(A,B),A))) = join(A,B),
inference(para_from,[status(thm),theory(equality)],[256,3]),
[iquote('para_from,255.1.1,3.1.1.1')] ).
cnf(345,plain,
join(meet(meet(A,B),meet(A,join(A,meet(A,B)))),meet(meet(A,B),A)) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[292,13]),292,292]),
[iquote('para_from,291.1.1,13.1.1.2.1,demod,292,292')] ).
cnf(370,plain,
meet(A,join(join(A,B),A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[325,13]),292,238,158,292,158,248,292])]),
[iquote('para_from,325.1.1,13.1.1.1.2.2,demod,292,238,158,292,158,248,292,flip.1')] ).
cnf(401,plain,
meet(join(join(A,B),A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[370,280]),370]),
[iquote('para_from,369.1.1,279.1.1.2,demod,370')] ).
cnf(416,plain,
meet(join(A,meet(A,B)),meet(A,B)) = meet(A,B),
inference(para_into,[status(thm),theory(equality)],[401,3]),
[iquote('para_into,401.1.1.1.1,3.1.1')] ).
cnf(436,plain,
join(A,meet(A,join(B,A))) = meet(A,join(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[284,158]),416,158])]),
[iquote('para_into,283.1.1.1.1,157.1.1,demod,416,158,flip.1')] ).
cnf(497,plain,
meet(meet(join(A,B),join(C,A)),join(A,meet(join(A,B),join(C,A)))) = join(A,meet(join(A,B),join(C,A))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[295,10]),10]),
[iquote('para_into,295.1.1.2.1,9.1.1,demod,10')] ).
cnf(500,plain,
join(meet(A,B),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[295,158]),284]),
[iquote('para_from,295.1.1,157.1.1.1,demod,284')] ).
cnf(502,plain,
meet(A,join(B,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[305]),500,158,238,500,158,292,436,500,158]),
[iquote('back_demod,305,demod,500,158,238,500,158,292,436,500,158')] ).
cnf(504,plain,
join(A,meet(join(A,B),join(C,A))) = meet(join(A,B),join(C,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[497]),502])]),
[iquote('back_demod,497,demod,502,flip.1')] ).
cnf(514,plain,
meet(join(A,B),join(join(A,B),A)) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[327]),504]),
[iquote('back_demod,327,demod,504')] ).
cnf(518,plain,
meet(A,join(A,B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[319]),514,248]),
[iquote('back_demod,319,demod,514,248')] ).
cnf(519,plain,
meet(meet(A,B),A) = meet(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[345]),518,248]),
[iquote('back_demod,345,demod,518,248')] ).
cnf(561,plain,
join(A,meet(A,B)) = A,
inference(para_from,[status(thm),theory(equality)],[519,281]),
[iquote('para_from,519.1.1,281.1.1.2')] ).
cnf(600,plain,
meet(meet(A,B),meet(B,A)) = meet(B,A),
inference(para_from,[status(thm),theory(equality)],[561,25]),
[iquote('para_from,561.1.1,25.1.1.1.2')] ).
cnf(757,plain,
meet(A,B) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[600,519]),600,600]),
[iquote('para_from,599.1.1,519.1.1.1,demod,600,600')] ).
cnf(758,plain,
$false,
inference(binary,[status(thm)],[757,1]),
[iquote('binary,757.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT089-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 08:40:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.96/2.18 ----- Otter 3.3f, August 2004 -----
% 1.96/2.18 The process was started by sandbox2 on n015.cluster.edu,
% 1.96/2.18 Wed Jul 27 08:40:27 2022
% 1.96/2.18 The command was "./otter". The process ID is 27756.
% 1.96/2.18
% 1.96/2.18 set(prolog_style_variables).
% 1.96/2.18 set(auto).
% 1.96/2.18 dependent: set(auto1).
% 1.96/2.18 dependent: set(process_input).
% 1.96/2.18 dependent: clear(print_kept).
% 1.96/2.18 dependent: clear(print_new_demod).
% 1.96/2.18 dependent: clear(print_back_demod).
% 1.96/2.18 dependent: clear(print_back_sub).
% 1.96/2.18 dependent: set(control_memory).
% 1.96/2.18 dependent: assign(max_mem, 12000).
% 1.96/2.18 dependent: assign(pick_given_ratio, 4).
% 1.96/2.18 dependent: assign(stats_level, 1).
% 1.96/2.18 dependent: assign(max_seconds, 10800).
% 1.96/2.18 clear(print_given).
% 1.96/2.18
% 1.96/2.18 list(usable).
% 1.96/2.18 0 [] A=A.
% 1.96/2.18 0 [] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.96/2.18 0 [] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.96/2.18 0 [] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.96/2.18 0 [] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.96/2.18 0 [] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.96/2.18 0 [] meet(b,a)!=meet(a,b).
% 1.96/2.18 end_of_list.
% 1.96/2.18
% 1.96/2.18 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.96/2.18
% 1.96/2.18 All clauses are units, and equality is present; the
% 1.96/2.18 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.96/2.18
% 1.96/2.18 dependent: set(knuth_bendix).
% 1.96/2.18 dependent: set(anl_eq).
% 1.96/2.18 dependent: set(para_from).
% 1.96/2.18 dependent: set(para_into).
% 1.96/2.18 dependent: clear(para_from_right).
% 1.96/2.18 dependent: clear(para_into_right).
% 1.96/2.18 dependent: set(para_from_vars).
% 1.96/2.18 dependent: set(eq_units_both_ways).
% 1.96/2.18 dependent: set(dynamic_demod_all).
% 1.96/2.18 dependent: set(dynamic_demod).
% 1.96/2.18 dependent: set(order_eq).
% 1.96/2.18 dependent: set(back_demod).
% 1.96/2.18 dependent: set(lrpo).
% 1.96/2.18
% 1.96/2.18 ------------> process usable:
% 1.96/2.18 ** KEPT (pick-wt=7): 1 [] meet(b,a)!=meet(a,b).
% 1.96/2.18
% 1.96/2.18 ------------> process sos:
% 1.96/2.18 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.96/2.18 ** KEPT (pick-wt=11): 3 [] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.96/2.18 ---> New Demodulator: 4 [new_demod,3] join(meet(A,B),meet(A,join(A,B)))=A.
% 1.96/2.18 ** KEPT (pick-wt=11): 5 [] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.96/2.18 ---> New Demodulator: 6 [new_demod,5] join(meet(A,A),meet(B,join(A,A)))=A.
% 1.96/2.18 ** KEPT (pick-wt=11): 7 [] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.96/2.18 ---> New Demodulator: 8 [new_demod,7] join(meet(A,B),meet(B,join(A,B)))=B.
% 1.96/2.18 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.96/2.18 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(C,A)),A)=A.
% 1.96/2.18 ** KEPT (pick-wt=11): 11 [] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.96/2.18 ---> New Demodulator: 12 [new_demod,11] join(join(meet(A,B),meet(C,A)),A)=A.
% 1.96/2.18 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.96/2.18 >>>> Starting back demodulation with 4.
% 1.96/2.18 >>>> Starting back demodulation with 6.
% 1.96/2.18 >>>> Starting back demodulation with 8.
% 1.96/2.18 >>>> Starting back demodulation with 10.
% 1.96/2.18 >>>> Starting back demodulation with 12.
% 1.96/2.18
% 1.96/2.18 ======= end of input processing =======
% 1.96/2.18
% 1.96/2.18 =========== start of search ===========
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Resetting weight limit to 11.
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Resetting weight limit to 11.
% 1.96/2.18
% 1.96/2.18 sos_size=121
% 1.96/2.18
% 1.96/2.18 -------- PROOF --------
% 1.96/2.18
% 1.96/2.18 ----> UNIT CONFLICT at 0.04 sec ----> 758 [binary,757.1,1.1] $F.
% 1.96/2.18
% 1.96/2.18 Length of proof is 55. Level of proof is 26.
% 1.96/2.18
% 1.96/2.18 ---------------- PROOF ----------------
% 1.96/2.18 % SZS status Unsatisfiable
% 1.96/2.18 % SZS output start Refutation
% See solution above
% 1.96/2.18 ------------ end of proof -------------
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Search stopped by max_proofs option.
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Search stopped by max_proofs option.
% 1.96/2.18
% 1.96/2.18 ============ end of search ============
% 1.96/2.18
% 1.96/2.18 -------------- statistics -------------
% 1.96/2.18 clauses given 57
% 1.96/2.18 clauses generated 1599
% 1.96/2.18 clauses kept 380
% 1.96/2.18 clauses forward subsumed 1438
% 1.96/2.18 clauses back subsumed 0
% 1.96/2.18 Kbytes malloced 4882
% 1.96/2.18
% 1.96/2.18 ----------- times (seconds) -----------
% 1.96/2.18 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.96/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.96/2.18
% 1.96/2.18 That finishes the proof of the theorem.
% 1.96/2.18
% 1.96/2.18 Process 27756 finished Wed Jul 27 08:40:28 2022
% 1.96/2.18 Otter interrupted
% 1.96/2.18 PROOF FOUND
%------------------------------------------------------------------------------