TSTP Solution File: GEO042-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO042-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 12:54:13 EDT 2022
% Result : Unsatisfiable 4.65s 4.86s
% Output : Refutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 5 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-5 aty)
% Number of variables : 23 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ between(A,B,A)
| A = B ),
file('GEO042-3.p',unknown),
[] ).
cnf(5,axiom,
( ~ between(A,B,C)
| ~ between(D,E,C)
| between(B,inner_pasch(A,B,C,E,D),D) ),
file('GEO042-3.p',unknown),
[] ).
cnf(6,axiom,
( ~ between(A,B,C)
| ~ between(D,E,C)
| between(E,inner_pasch(A,B,C,E,D),A) ),
file('GEO042-3.p',unknown),
[] ).
cnf(35,axiom,
( ~ between(A,B,C)
| between(C,B,A) ),
file('GEO042-3.p',unknown),
[] ).
cnf(38,axiom,
~ between(u,v,w),
file('GEO042-3.p',unknown),
[] ).
cnf(66,axiom,
A = extension(B,A,C,C),
file('GEO042-3.p',unknown),
[] ).
cnf(68,plain,
extension(A,B,C,C) = B,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[66])]),
[iquote('copy,66,flip.1')] ).
cnf(78,axiom,
between(u,v,x),
file('GEO042-3.p',unknown),
[] ).
cnf(79,axiom,
between(v,w,x),
file('GEO042-3.p',unknown),
[] ).
cnf(190,plain,
between(v,inner_pasch(v,w,x,v,u),v),
inference(hyper,[status(thm)],[79,6,78]),
[iquote('hyper,79,6,78')] ).
cnf(196,plain,
between(w,inner_pasch(v,w,x,v,u),u),
inference(hyper,[status(thm)],[79,5,78]),
[iquote('hyper,79,5,78')] ).
cnf(521,plain,
( A = B
| ~ between(B,A,B) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[68,4]),68,68]),
[iquote('para_into,67.1.1,4.2.1,demod,68,68')] ).
cnf(2269,plain,
inner_pasch(v,w,x,v,u) = v,
inference(hyper,[status(thm)],[190,521]),
[iquote('hyper,190,521')] ).
cnf(2270,plain,
between(w,v,u),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[196]),2269]),
[iquote('back_demod,196,demod,2269')] ).
cnf(2272,plain,
between(u,v,w),
inference(hyper,[status(thm)],[2270,35]),
[iquote('hyper,2270,35')] ).
cnf(2273,plain,
$false,
inference(binary,[status(thm)],[2272,38]),
[iquote('binary,2272.1,38.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO042-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n012.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 07:18:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.66/1.88 ----- Otter 3.3f, August 2004 -----
% 1.66/1.88 The process was started by sandbox on n012.cluster.edu,
% 1.66/1.88 Wed Jul 27 07:18:35 2022
% 1.66/1.88 The command was "./otter". The process ID is 11618.
% 1.66/1.88
% 1.66/1.88 set(prolog_style_variables).
% 1.66/1.88 set(auto).
% 1.66/1.88 dependent: set(auto1).
% 1.66/1.88 dependent: set(process_input).
% 1.66/1.88 dependent: clear(print_kept).
% 1.66/1.88 dependent: clear(print_new_demod).
% 1.66/1.88 dependent: clear(print_back_demod).
% 1.66/1.88 dependent: clear(print_back_sub).
% 1.66/1.88 dependent: set(control_memory).
% 1.66/1.88 dependent: assign(max_mem, 12000).
% 1.66/1.88 dependent: assign(pick_given_ratio, 4).
% 1.66/1.88 dependent: assign(stats_level, 1).
% 1.66/1.88 dependent: assign(max_seconds, 10800).
% 1.66/1.88 clear(print_given).
% 1.66/1.88
% 1.66/1.88 list(usable).
% 1.66/1.88 0 [] A=A.
% 1.66/1.88 0 [] e_quidistant(X,Y,Y,X).
% 1.66/1.88 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.66/1.88 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.66/1.88 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.66/1.88 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.66/1.88 0 [] -e_quidistant(X,Y,X1,Y1)| -e_quidistant(Y,Z,Y1,Z1)| -e_quidistant(X,V,X1,V1)| -e_quidistant(Y,V,Y1,V1)| -between(X,Y,Z)| -between(X1,Y1,Z1)|X=Y|e_quidistant(Z,V,Z1,V1).
% 1.66/1.88 0 [] -between(X,Y,X)|X=Y.
% 1.66/1.88 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.66/1.88 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.66/1.88 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.66/1.88 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.66/1.88 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.66/1.88 0 [] -e_quidistant(X,W,X,V)| -e_quidistant(Y,W,Y,V)| -e_quidistant(Z,W,Z,V)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y)|W=V.
% 1.66/1.88 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.66/1.88 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.66/1.88 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(euclid1(U,V,W,X,Y),Y,euclid2(U,V,W,X,Y)).
% 1.66/1.88 0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|between(V1,continuous(U,V,V1,W,X,X1),X1).
% 1.66/1.88 0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|e_quidistant(U,W,U,continuous(U,V,V1,W,X,X1)).
% 1.66/1.88 0 [] reflection(U,V)=extension(U,V,U,V).
% 1.66/1.88 0 [] e_quidistant(U,V,U,V).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,U,V).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,W,X).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(U,V,X,W).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,X,W).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,V,U).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,U,V).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,V,U).
% 1.66/1.88 0 [] -e_quidistant(U,V,W,X)| -e_quidistant(W,X,Y,Z)|e_quidistant(U,V,Y,Z).
% 1.66/1.88 0 [] V=extension(U,V,W,W).
% 1.66/1.88 0 [] Y!=extension(U,V,W,X)|between(U,V,Y).
% 1.66/1.88 0 [] between(U,V,reflection(U,V)).
% 1.66/1.88 0 [] e_quidistant(V,reflection(U,V),U,V).
% 1.66/1.88 0 [] U!=V|V=reflection(U,V).
% 1.66/1.88 0 [] U=reflection(U,U).
% 1.66/1.88 0 [] V!=reflection(U,V)|U=V.
% 1.66/1.88 0 [] e_quidistant(U,U,V,V).
% 1.66/1.88 0 [] -e_quidistant(U,V,U1,V1)| -e_quidistant(V,W,V1,W1)| -between(U,V,W)| -between(U1,V1,W1)|e_quidistant(U,W,U1,W1).
% 1.66/1.88 0 [] -between(U,V,W)| -between(U,V,X)| -e_quidistant(V,W,V,X)|U=V|W=X.
% 1.66/1.88 0 [] -between(U,V,W)|U=V|W=extension(U,V,V,W).
% 1.66/1.88 0 [] -e_quidistant(W,X,Y,Z)|extension(U,V,W,X)=extension(U,V,Y,Z)|U=V.
% 1.66/1.88 0 [] extension(U,V,U,V)=extension(U,V,V,U)|U=V.
% 1.66/1.88 0 [] e_quidistant(V,U,V,reflection(reflection(U,V),V)).
% 1.66/1.88 0 [] U=reflection(reflection(U,V),V).
% 1.66/1.88 0 [] between(U,V,V).
% 1.66/1.88 0 [] -between(U,W,X)|U!=X|between(V,W,X).
% 1.66/1.88 0 [] -between(U,V,W)|between(W,V,U).
% 1.66/1.88 0 [] between(U,U,V).
% 1.66/1.88 0 [] -between(U,V,W)| -between(V,U,W)|U=V.
% 1.66/1.88 0 [] -between(U,V,W)| -between(U,W,V)|V=W.
% 1.66/1.88 0 [] -between(U,V,W)| -between(V,U,W)|U=V|V=W.
% 1.66/1.88 0 [] -between(U,V,W)| -between(U,W,V)|U=V|V=W.
% 1.66/1.88 0 [] between(u,v,x).
% 1.66/1.88 0 [] between(v,w,x).
% 1.66/1.88 0 [] -between(u,v,w).
% 1.66/1.88 end_of_list.
% 1.66/1.88
% 1.66/1.88 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.66/1.88
% 1.66/1.88 This ia a non-Horn set with equality. The strategy will be
% 1.66/1.88 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.66/1.88 deletion, with positive clauses in sos and nonpositive
% 1.66/1.88 clauses in usable.
% 1.66/1.88
% 1.66/1.88 dependent: set(knuth_bendix).
% 1.66/1.88 dependent: set(anl_eq).
% 1.66/1.88 dependent: set(para_from).
% 1.66/1.88 dependent: set(para_into).
% 1.66/1.88 dependent: clear(para_from_right).
% 1.66/1.88 dependent: clear(para_into_right).
% 1.66/1.88 dependent: set(para_from_vars).
% 1.66/1.88 dependent: set(eq_units_both_ways).
% 1.66/1.88 dependent: set(dynamic_demod_all).
% 1.66/1.88 dependent: set(dynamic_demod).
% 1.66/1.88 dependent: set(order_eq).
% 1.66/1.88 dependent: set(back_demod).
% 1.66/1.88 dependent: set(lrpo).
% 1.66/1.88 dependent: set(hyper_res).
% 1.66/1.88 dependent: set(unit_deletion).
% 1.66/1.88 dependent: set(factor).
% 1.66/1.88
% 1.66/1.88 ------------> process usable:
% 1.66/1.88 ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.66/1.88 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.66/1.88 ** KEPT (pick-wt=36): 3 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -e_quidistant(A,G,C,H)| -e_quidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|e_quidistant(E,G,F,H).
% 1.66/1.88 ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.66/1.88 ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.66/1.88 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.66/1.88 ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.66/1.88 ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.66/1.88 ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.66/1.88 ** KEPT (pick-wt=30): 10 [] -e_quidistant(A,B,A,C)| -e_quidistant(D,B,D,C)| -e_quidistant(E,B,E,C)|between(A,D,E)|between(D,E,A)|between(E,A,D)|B=C.
% 1.66/1.88 ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 1.66/1.88 ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 1.66/1.88 ** KEPT (pick-wt=25): 13 [] -between(A,B,C)| -between(D,B,E)|A=B|between(euclid1(A,D,B,E,C),C,euclid2(A,D,B,E,C)).
% 1.66/1.88 ** KEPT (pick-wt=28): 14 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|between(C,continuous(A,B,C,F,D,E),E).
% 1.66/1.88 ** KEPT (pick-wt=29): 15 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|e_quidistant(A,F,A,continuous(A,B,C,F,D,E)).
% 1.66/1.88 ** KEPT (pick-wt=10): 16 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,A,B).
% 1.66/1.88 ** KEPT (pick-wt=10): 17 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,C,D).
% 1.66/1.88 ** KEPT (pick-wt=10): 18 [] -e_quidistant(A,B,C,D)|e_quidistant(A,B,D,C).
% 1.66/1.88 ** KEPT (pick-wt=10): 19 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,D,C).
% 1.66/1.88 ** KEPT (pick-wt=10): 20 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,B,A).
% 1.66/1.88 ** KEPT (pick-wt=10): 21 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,A,B).
% 1.66/1.88 ** KEPT (pick-wt=10): 22 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,B,A).
% 1.66/1.88 ** KEPT (pick-wt=15): 23 [] -e_quidistant(A,B,C,D)| -e_quidistant(C,D,E,F)|e_quidistant(A,B,E,F).
% 1.66/1.88 ** KEPT (pick-wt=11): 24 [] A!=extension(B,C,D,E)|between(B,C,A).
% 1.66/1.88 ** KEPT (pick-wt=8): 26 [copy,25,flip.2] A!=B|reflection(A,B)=B.
% 1.66/1.88 ** KEPT (pick-wt=8): 28 [copy,27,flip.1] reflection(A,B)!=B|A=B.
% 1.66/1.88 ** KEPT (pick-wt=23): 29 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -between(A,B,E)| -between(C,D,F)|e_quidistant(A,E,C,F).
% 1.66/1.88 ** KEPT (pick-wt=19): 30 [] -between(A,B,C)| -between(A,B,D)| -e_quidistant(B,C,B,D)|A=B|C=D.
% 1.66/1.88 ** KEPT (pick-wt=14): 32 [copy,31,flip.3] -between(A,B,C)|A=B|extension(A,B,B,C)=C.
% 1.66/1.88 ** KEPT (pick-wt=19): 33 [] -e_quidistant(A,B,C,D)|extension(E,F,A,B)=extension(E,F,C,D)|E=F.
% 1.66/1.88 ** KEPT (pick-wt=11): 34 [] -between(A,B,C)|A!=C|between(D,B,C).
% 1.66/1.88 ** KEPT (pick-wt=8): 35 [] -between(A,B,C)|between(C,B,A).
% 1.66/1.88 ** KEPT (pick-wt=11): 36 [] -between(A,B,C)| -between(B,A,C)|A=B.
% 1.66/1.88 ** KEPT (pick-wt=11): 37 [] -between(A,B,C)| -between(A,C,B)|B=C.
% 1.66/1.88 Following clause subsumed by 36 during input processing: 0 [] -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 1.66/1.88 Following clause subsumed by 37 during input processing: 0 [] -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 1.66/1.88 ** KEPT (pick-wt=4): 38 [] -between(u,v,w).
% 1.66/1.88
% 1.66/1.88 ------------> process sos:
% 1.66/1.88 ** KEPT (pick-wt=3): 59 [] A=A.
% 1.66/1.88 ** KEPT (pick-wt=5): 60 [] e_quidistant(A,B,B,A).
% 1.66/1.88 ** KEPT (pick-wt=8): 61 [] between(A,B,extension(A,B,C,D)).
% 1.66/1.88 ** KEPT (pick-wt=9): 62 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 1.66/1.88 ** KEPT (pick-wt=9): 63 [] reflection(A,B)=extension(A,B,A,B).
% 4.65/4.86 ---> New Demodulator: 64 [new_demod,63] reflection(A,B)=extension(A,B,A,B).
% 4.65/4.86 ** KEPT (pick-wt=5): 65 [] e_quidistant(A,B,A,B).
% 4.65/4.86 ** KEPT (pick-wt=7): 67 [copy,66,flip.1] extension(A,B,C,C)=B.
% 4.65/4.86 ---> New Demodulator: 68 [new_demod,67] extension(A,B,C,C)=B.
% 4.65/4.86 Following clause subsumed by 61 during input processing: 0 [demod,64] between(A,B,extension(A,B,A,B)).
% 4.65/4.86 Following clause subsumed by 62 during input processing: 0 [demod,64] e_quidistant(A,extension(B,A,B,A),B,A).
% 4.65/4.86 Following clause subsumed by 59 during input processing: 0 [demod,64,68] A=A.
% 4.65/4.86 ** KEPT (pick-wt=5): 69 [] e_quidistant(A,A,B,B).
% 4.65/4.86 ** KEPT (pick-wt=14): 70 [] extension(A,B,A,B)=extension(A,B,B,A)|A=B.
% 4.65/4.86 ** KEPT (pick-wt=17): 72 [copy,71,demod,64,64] e_quidistant(A,B,A,extension(extension(B,A,B,A),A,extension(B,A,B,A),A)).
% 4.65/4.86 ** KEPT (pick-wt=15): 74 [copy,73,demod,64,64,flip.1] extension(extension(A,B,A,B),B,extension(A,B,A,B),B)=A.
% 4.65/4.86 ---> New Demodulator: 75 [new_demod,74] extension(extension(A,B,A,B),B,extension(A,B,A,B),B)=A.
% 4.65/4.86 ** KEPT (pick-wt=4): 76 [] between(A,B,B).
% 4.65/4.86 ** KEPT (pick-wt=4): 77 [] between(A,A,B).
% 4.65/4.86 ** KEPT (pick-wt=4): 78 [] between(u,v,x).
% 4.65/4.86 ** KEPT (pick-wt=4): 79 [] between(v,w,x).
% 4.65/4.86 Following clause subsumed by 59 during input processing: 0 [copy,59,flip.1] A=A.
% 4.65/4.86 59 back subsumes 55.
% 4.65/4.86 59 back subsumes 54.
% 4.65/4.86 59 back subsumes 53.
% 4.65/4.86 60 back subsumes 56.
% 4.65/4.86 >>>> Starting back demodulation with 64.
% 4.65/4.86 >> back demodulating 28 with 64.
% 4.65/4.86 >> back demodulating 26 with 64.
% 4.65/4.86 65 back subsumes 52.
% 4.65/4.86 65 back subsumes 39.
% 4.65/4.86 >>>> Starting back demodulation with 68.
% 4.65/4.86 69 back subsumes 40.
% 4.65/4.86 >>>> Starting back demodulation with 75.
% 4.65/4.86 >> back demodulating 72 with 75.
% 4.65/4.86 76 back subsumes 44.
% 4.65/4.86 76 back subsumes 43.
% 4.65/4.86 77 back subsumes 45.
% 4.65/4.86
% 4.65/4.86 ======= end of input processing =======
% 4.65/4.86
% 4.65/4.86 =========== start of search ===========
% 4.65/4.86
% 4.65/4.86
% 4.65/4.86 Resetting weight limit to 9.
% 4.65/4.86
% 4.65/4.86
% 4.65/4.86 Resetting weight limit to 9.
% 4.65/4.86
% 4.65/4.86 sos_size=1990
% 4.65/4.86
% 4.65/4.86 -------- PROOF --------
% 4.65/4.86
% 4.65/4.86 ----> UNIT CONFLICT at 2.99 sec ----> 2273 [binary,2272.1,38.1] $F.
% 4.65/4.86
% 4.65/4.86 Length of proof is 7. Level of proof is 5.
% 4.65/4.86
% 4.65/4.86 ---------------- PROOF ----------------
% 4.65/4.86 % SZS status Unsatisfiable
% 4.65/4.86 % SZS output start Refutation
% See solution above
% 4.65/4.86 ------------ end of proof -------------
% 4.65/4.86
% 4.65/4.86
% 4.65/4.86 Search stopped by max_proofs option.
% 4.65/4.86
% 4.65/4.86
% 4.65/4.86 Search stopped by max_proofs option.
% 4.65/4.86
% 4.65/4.86 ============ end of search ============
% 4.65/4.86
% 4.65/4.86 -------------- statistics -------------
% 4.65/4.86 clauses given 153
% 4.65/4.86 clauses generated 29276
% 4.65/4.86 clauses kept 2248
% 4.65/4.86 clauses forward subsumed 6470
% 4.65/4.86 clauses back subsumed 70
% 4.65/4.86 Kbytes malloced 4882
% 4.65/4.86
% 4.65/4.86 ----------- times (seconds) -----------
% 4.65/4.86 user CPU time 2.99 (0 hr, 0 min, 2 sec)
% 4.65/4.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 4.65/4.86 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 4.65/4.86
% 4.65/4.86 That finishes the proof of the theorem.
% 4.65/4.86
% 4.65/4.86 Process 11618 finished Wed Jul 27 07:18:40 2022
% 4.65/4.86 Otter interrupted
% 4.65/4.86 PROOF FOUND
%------------------------------------------------------------------------------