%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:08 EDT 2022
% Result : Unsatisfiable 1.83s 2.04s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 28 ( 3 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(28,axiom,
( ~ cUnsatisfiable(A)
| rr(A,dollar_f1(A)) ),
file('KRS097+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ cUnsatisfiable(A)
| rr(A,dollar_f2(A)) ),
file('KRS097+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ cUnsatisfiable(A)
| cd(dollar_f2(A)) ),
file('KRS097+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cUnsatisfiable(A)
| ~ rr(A,B)
| ~ rr(A,C)
| B = C ),
file('KRS097+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ cUnsatisfiable(A)
| rr(A,dollar_f3(A)) ),
file('KRS097+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ cUnsatisfiable(A)
| cc(dollar_f3(A)) ),
file('KRS097+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ cd(A)
| ~ cc(A) ),
file('KRS097+1.p',unknown),
[] ).
cnf(56,axiom,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('KRS097+1.p',unknown),
[] ).
cnf(57,plain,
cc(dollar_f3(i2003_11_14_17_20_21603)),
inference(hyper,[status(thm)],[56,33]),
[iquote('hyper,56,33')] ).
cnf(58,plain,
rr(i2003_11_14_17_20_21603,dollar_f3(i2003_11_14_17_20_21603)),
inference(hyper,[status(thm)],[56,32]),
[iquote('hyper,56,32')] ).
cnf(59,plain,
cd(dollar_f2(i2003_11_14_17_20_21603)),
inference(hyper,[status(thm)],[56,30]),
[iquote('hyper,56,30')] ).
cnf(60,plain,
rr(i2003_11_14_17_20_21603,dollar_f2(i2003_11_14_17_20_21603)),
inference(hyper,[status(thm)],[56,29]),
[iquote('hyper,56,29')] ).
cnf(61,plain,
rr(i2003_11_14_17_20_21603,dollar_f1(i2003_11_14_17_20_21603)),
inference(hyper,[status(thm)],[56,28]),
[iquote('hyper,56,28')] ).
cnf(77,plain,
dollar_f3(i2003_11_14_17_20_21603) = dollar_f2(i2003_11_14_17_20_21603),
inference(hyper,[status(thm)],[60,31,56,58]),
[iquote('hyper,60,31,56,58')] ).
cnf(81,plain,
cc(dollar_f2(i2003_11_14_17_20_21603)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[57]),77]),
[iquote('back_demod,57,demod,77')] ).
cnf(84,plain,
dollar_f2(i2003_11_14_17_20_21603) = dollar_f1(i2003_11_14_17_20_21603),
inference(hyper,[status(thm)],[61,31,56,60]),
[iquote('hyper,61,31,56,60')] ).
cnf(85,plain,
cc(dollar_f1(i2003_11_14_17_20_21603)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[81]),84]),
[iquote('back_demod,81,demod,84')] ).
cnf(94,plain,
cd(dollar_f1(i2003_11_14_17_20_21603)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[59]),84]),
[iquote('back_demod,59,demod,84')] ).
cnf(98,plain,
$false,
inference(hyper,[status(thm)],[94,44,85]),
[iquote('hyper,94,44,85')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jul 27 03:48:21 EDT 2022
% 0.11/0.32 % CPUTime :
% 1.83/2.04 ----- Otter 3.3f, August 2004 -----
% 1.83/2.04 The process was started by sandbox on n027.cluster.edu,
% 1.83/2.04 Wed Jul 27 03:48:21 2022
% 1.83/2.04 The command was "./otter". The process ID is 10885.
% 1.83/2.04
% 1.83/2.04 set(prolog_style_variables).
% 1.83/2.04 set(auto).
% 1.83/2.04 dependent: set(auto1).
% 1.83/2.04 dependent: set(process_input).
% 1.83/2.04 dependent: clear(print_kept).
% 1.83/2.04 dependent: clear(print_new_demod).
% 1.83/2.04 dependent: clear(print_back_demod).
% 1.83/2.04 dependent: clear(print_back_sub).
% 1.83/2.04 dependent: set(control_memory).
% 1.83/2.04 dependent: assign(max_mem, 12000).
% 1.83/2.04 dependent: assign(pick_given_ratio, 4).
% 1.83/2.04 dependent: assign(stats_level, 1).
% 1.83/2.04 dependent: assign(max_seconds, 10800).
% 1.83/2.04 clear(print_given).
% 1.83/2.04
% 1.83/2.04 formula_list(usable).
% 1.83/2.04 all A (A=A).
% 1.83/2.04 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.83/2.04 all A B (A=B&ca(A)->ca(B)).
% 1.83/2.04 all A B (A=B&cc(A)->cc(B)).
% 1.83/2.04 all A B (A=B&cd(A)->cd(B)).
% 1.83/2.04 all A B (A=B&ce(A)->ce(B)).
% 1.83/2.04 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.83/2.04 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.83/2.04 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.83/2.04 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.83/2.04 all A B C (A=B&rr1(A,C)->rr1(B,C)).
% 1.83/2.04 all A B C (A=B&rr1(C,A)->rr1(C,B)).
% 1.83/2.04 all A B C (A=B&rr2(A,C)->rr2(B,C)).
% 1.83/2.04 all A B C (A=B&rr2(C,A)->rr2(C,B)).
% 1.83/2.04 all A B C (A=B&rr3(A,C)->rr3(B,C)).
% 1.83/2.04 all A B C (A=B&rr3(C,A)->rr3(C,B)).
% 1.83/2.04 all A B C (A=B&rt1(A,C)->rt1(B,C)).
% 1.83/2.04 all A B C (A=B&rt1(C,A)->rt1(C,B)).
% 1.83/2.04 all A B C (A=B&rt2(A,C)->rt2(B,C)).
% 1.83/2.04 all A B C (A=B&rt2(C,A)->rt2(C,B)).
% 1.83/2.04 all A B C (A=B&rt3(A,C)->rt3(B,C)).
% 1.83/2.04 all A B C (A=B&rt3(C,A)->rt3(C,B)).
% 1.83/2.04 all A B C (A=B&rtt(A,C)->rtt(B,C)).
% 1.83/2.04 all A B C (A=B&rtt(C,A)->rtt(C,B)).
% 1.83/2.04 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.83/2.04 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.83/2.04 all X (cowlThing(X)& -cowlNothing(X)).
% 1.83/2.04 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.83/2.04 all X (cUnsatisfiable(X)<-> (exists Y0 rr(X,Y0))& (exists Y (rr(X,Y)&cd(Y)))& -(exists Y0 Y1 (rr(X,Y0)&rr(X,Y1)&Y0!=Y1))& (exists Y (rr(X,Y)&cc(Y)))).
% 1.83/2.04 all X (ca(X)<->cd(X)|cc(X)).
% 1.83/2.04 cUnsatisfiable(i2003_11_14_17_20_21603).
% 1.83/2.04 all X (-(cd(X)&ce(X))).
% 1.83/2.04 all X (-(cd(X)&cc(X))).
% 1.83/2.04 all X (-(ce(X)&cc(X))).
% 1.83/2.04 all X Y (rt3(X,Y)->rtt(X,Y)).
% 1.83/2.04 all X Y (rr1(X,Y)->rr(X,Y)).
% 1.83/2.04 all X Y (rr3(X,Y)->rr(X,Y)).
% 1.83/2.04 all X Y (rt1(X,Y)->rtt(X,Y)).
% 1.83/2.04 all X Y (rr2(X,Y)->rr(X,Y)).
% 1.83/2.04 all X Y (rt2(X,Y)->rtt(X,Y)).
% 1.83/2.04 end_of_list.
% 1.83/2.04
% 1.83/2.04 -------> usable clausifies to:
% 1.83/2.04
% 1.83/2.04 list(usable).
% 1.83/2.04 0 [] A=A.
% 1.83/2.04 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.83/2.04 0 [] A!=B| -ca(A)|ca(B).
% 1.83/2.04 0 [] A!=B| -cc(A)|cc(B).
% 1.83/2.04 0 [] A!=B| -cd(A)|cd(B).
% 1.83/2.04 0 [] A!=B| -ce(A)|ce(B).
% 1.83/2.04 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.83/2.04 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.83/2.04 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.83/2.04 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.83/2.04 0 [] A!=B| -rr1(A,C)|rr1(B,C).
% 1.83/2.04 0 [] A!=B| -rr1(C,A)|rr1(C,B).
% 1.83/2.04 0 [] A!=B| -rr2(A,C)|rr2(B,C).
% 1.83/2.04 0 [] A!=B| -rr2(C,A)|rr2(C,B).
% 1.83/2.04 0 [] A!=B| -rr3(A,C)|rr3(B,C).
% 1.83/2.04 0 [] A!=B| -rr3(C,A)|rr3(C,B).
% 1.83/2.04 0 [] A!=B| -rt1(A,C)|rt1(B,C).
% 1.83/2.04 0 [] A!=B| -rt1(C,A)|rt1(C,B).
% 1.83/2.04 0 [] A!=B| -rt2(A,C)|rt2(B,C).
% 1.83/2.04 0 [] A!=B| -rt2(C,A)|rt2(C,B).
% 1.83/2.04 0 [] A!=B| -rt3(A,C)|rt3(B,C).
% 1.83/2.04 0 [] A!=B| -rt3(C,A)|rt3(C,B).
% 1.83/2.04 0 [] A!=B| -rtt(A,C)|rtt(B,C).
% 1.83/2.04 0 [] A!=B| -rtt(C,A)|rtt(C,B).
% 1.83/2.04 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.83/2.04 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.83/2.04 0 [] cowlThing(X).
% 1.83/2.04 0 [] -cowlNothing(X).
% 1.83/2.04 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.83/2.04 0 [] xsd_string(X)|xsd_integer(X).
% 1.83/2.04 0 [] -cUnsatisfiable(X)|rr(X,$f1(X)).
% 1.83/2.04 0 [] -cUnsatisfiable(X)|rr(X,$f2(X)).
% 1.83/2.04 0 [] -cUnsatisfiable(X)|cd($f2(X)).
% 1.83/2.04 0 [] -cUnsatisfiable(X)| -rr(X,Y0)| -rr(X,Y1)|Y0=Y1.
% 1.83/2.04 0 [] -cUnsatisfiable(X)|rr(X,$f3(X)).
% 1.83/2.04 0 [] -cUnsatisfiable(X)|cc($f3(X)).
% 1.83/2.04 0 [] cUnsatisfiable(X)| -rr(X,X1)| -rr(X,Y)| -cd(Y)|rr(X,$f5(X))| -rr(X,X2)| -cc(X2).
% 1.83/2.04 0 [] cUnsatisfiable(X)| -rr(X,X1)| -rr(X,Y)| -cd(Y)|rr(X,$f4(X))| -rr(X,X2)| -cc(X2).
% 1.83/2.04 0 [] cUnsatisfiable(X)| -rr(X,X1)| -rr(X,Y)| -cd(Y)|$f5(X)!=$f4(X)| -rr(X,X2)| -cc(X2).
% 1.83/2.04 0 [] -ca(X)|cd(X)|cc(X).
% 1.83/2.04 0 [] ca(X)| -cd(X).
% 1.83/2.04 0 [] ca(X)| -cc(X).
% 1.83/2.04 0 [] cUnsatisfiable(i2003_11_14_17_20_21603).
% 1.83/2.04 0 [] -cd(X)| -ce(X).
% 1.83/2.04 0 [] -cd(X)| -cc(X).
% 1.83/2.04 0 [] -ce(X)| -cc(X).
% 1.83/2.04 0 [] -rt3(X,Y)|rtt(X,Y).
% 1.83/2.04 0 [] -rr1(X,Y)|rr(X,Y).
% 1.83/2.04 0 [] -rr3(X,Y)|rr(X,Y).
% 1.83/2.04 0 [] -rt1(X,Y)|rtt(X,Y).
% 1.83/2.04 0 [] -rr2(X,Y)|rr(X,Y).
% 1.83/2.04 0 [] -rt2(X,Y)|rtt(X,Y).
% 1.83/2.04 end_of_list.
% 1.83/2.04
% 1.83/2.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.83/2.04
% 1.83/2.04 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.04 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.04 deletion, with positive clauses in sos and nonpositive
% 1.83/2.04 clauses in usable.
% 1.83/2.04
% 1.83/2.04 dependent: set(knuth_bendix).
% 1.83/2.04 dependent: set(anl_eq).
% 1.83/2.04 dependent: set(para_from).
% 1.83/2.04 dependent: set(para_into).
% 1.83/2.04 dependent: clear(para_from_right).
% 1.83/2.04 dependent: clear(para_into_right).
% 1.83/2.04 dependent: set(para_from_vars).
% 1.83/2.04 dependent: set(eq_units_both_ways).
% 1.83/2.04 dependent: set(dynamic_demod_all).
% 1.83/2.04 dependent: set(dynamic_demod).
% 1.83/2.04 dependent: set(order_eq).
% 1.83/2.04 dependent: set(back_demod).
% 1.83/2.04 dependent: set(lrpo).
% 1.83/2.04 dependent: set(hyper_res).
% 1.83/2.04 dependent: set(unit_deletion).
% 1.83/2.04 dependent: set(factor).
% 1.83/2.04
% 1.83/2.04 ------------> process usable:
% 1.83/2.04 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 2 [] A!=B| -ca(A)|ca(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 3 [] A!=B| -cc(A)|cc(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 4 [] A!=B| -cd(A)|cd(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 5 [] A!=B| -ce(A)|ce(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 6 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 7 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.83/2.04 ** KEPT (pick-wt=9): 8 [] A!=B| -rr(A,C)|rr(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 9 [] A!=B| -rr(C,A)|rr(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 10 [] A!=B| -rr1(A,C)|rr1(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 11 [] A!=B| -rr1(C,A)|rr1(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 12 [] A!=B| -rr2(A,C)|rr2(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 13 [] A!=B| -rr2(C,A)|rr2(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 14 [] A!=B| -rr3(A,C)|rr3(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 15 [] A!=B| -rr3(C,A)|rr3(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 16 [] A!=B| -rt1(A,C)|rt1(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 17 [] A!=B| -rt1(C,A)|rt1(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 18 [] A!=B| -rt2(A,C)|rt2(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 19 [] A!=B| -rt2(C,A)|rt2(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 20 [] A!=B| -rt3(A,C)|rt3(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 21 [] A!=B| -rt3(C,A)|rt3(C,B).
% 1.83/2.04 ** KEPT (pick-wt=9): 22 [] A!=B| -rtt(A,C)|rtt(B,C).
% 1.83/2.04 ** KEPT (pick-wt=9): 23 [] A!=B| -rtt(C,A)|rtt(C,B).
% 1.83/2.04 ** KEPT (pick-wt=7): 24 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.83/2.04 ** KEPT (pick-wt=7): 25 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.83/2.04 ** KEPT (pick-wt=2): 26 [] -cowlNothing(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 27 [] -xsd_string(A)| -xsd_integer(A).
% 1.83/2.04 ** KEPT (pick-wt=6): 28 [] -cUnsatisfiable(A)|rr(A,$f1(A)).
% 1.83/2.04 ** KEPT (pick-wt=6): 29 [] -cUnsatisfiable(A)|rr(A,$f2(A)).
% 1.83/2.04 ** KEPT (pick-wt=5): 30 [] -cUnsatisfiable(A)|cd($f2(A)).
% 1.83/2.04 ** KEPT (pick-wt=11): 31 [] -cUnsatisfiable(A)| -rr(A,B)| -rr(A,C)|B=C.
% 1.83/2.04 ** KEPT (pick-wt=6): 32 [] -cUnsatisfiable(A)|rr(A,$f3(A)).
% 1.83/2.04 ** KEPT (pick-wt=5): 33 [] -cUnsatisfiable(A)|cc($f3(A)).
% 1.83/2.04 ** KEPT (pick-wt=16): 35 [copy,34,factor_simp] cUnsatisfiable(A)| -rr(A,B)| -cd(B)|rr(A,$f5(A))| -rr(A,C)| -cc(C).
% 1.83/2.04 ** KEPT (pick-wt=16): 37 [copy,36,factor_simp] cUnsatisfiable(A)| -rr(A,B)| -cd(B)|rr(A,$f4(A))| -rr(A,C)| -cc(C).
% 1.83/2.04 ** KEPT (pick-wt=17): 39 [copy,38,factor_simp] cUnsatisfiable(A)| -rr(A,B)| -cd(B)|$f5(A)!=$f4(A)| -rr(A,C)| -cc(C).
% 1.83/2.04 ** KEPT (pick-wt=6): 40 [] -ca(A)|cd(A)|cc(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 41 [] ca(A)| -cd(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 42 [] ca(A)| -cc(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 43 [] -cd(A)| -ce(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 44 [] -cd(A)| -cc(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 45 [] -ce(A)| -cc(A).
% 1.83/2.04 ** KEPT (pick-wt=6): 46 [] -rt3(A,B)|rtt(A,B).
% 1.83/2.04 ** KEPT (pick-wt=6): 47 [] -rr1(A,B)|rr(A,B).
% 1.83/2.04 ** KEPT (pick-wt=6): 48 [] -rr3(A,B)|rr(A,B).
% 1.83/2.04 ** KEPT (pick-wt=6): 49 [] -rt1(A,B)|rtt(A,B).
% 1.83/2.04 ** KEPT (pick-wt=6): 50 [] -rr2(A,B)|rr(A,B).
% 1.83/2.04 ** KEPT (pick-wt=6): 51 [] -rt2(A,B)|rtt(A,B).
% 1.83/2.04 26 back subsumes 6.
% 1.83/2.04
% 1.83/2.04 ------------> process sos:
% 1.83/2.04 ** KEPT (pick-wt=3): 53 [] A=A.
% 1.83/2.04 ** KEPT (pick-wt=2): 54 [] cowlThing(A).
% 1.83/2.04 ** KEPT (pick-wt=4): 55 [] xsd_string(A)|xsd_integer(A).
% 1.83/2.04 ** KEPT (pick-wt=2): 56 [] cUnsatisfiable(i2003_11_14_17_20_21603).
% 1.83/2.04 Following clause subsumed by 53 during input processing: 0 [copy,53,flip.1] A=A.
% 1.83/2.04 53 back subsumes 52.
% 1.83/2.04 54 back subsumes 7.
% 1.83/2.04
% 1.83/2.04 ======= end of input processing =======
% 1.83/2.04
% 1.83/2.04 =========== start of search ===========
% 1.83/2.04
% 1.83/2.04 -------- PROOF --------
% 1.83/2.04
% 1.83/2.04 -----> EMPTY CLAUSE at 0.00 sec ----> 98 [hyper,94,44,85] $F.
% 1.83/2.04
% 1.83/2.04 Length of proof is 10. Level of proof is 4.
% 1.83/2.04
% 1.83/2.04 ---------------- PROOF ----------------
% 1.83/2.04 % SZS status Theorem
% 1.83/2.04 % SZS output start Refutation
% See solution above
% 1.89/2.04 ------------ end of proof -------------
% 1.89/2.04
% 1.89/2.04
% 1.89/2.04 Search stopped by max_proofs option.
% 1.89/2.04
% 1.89/2.04
% 1.89/2.04 Search stopped by max_proofs option.
% 1.89/2.04
% 1.89/2.04 ============ end of search ============
% 1.89/2.04
% 1.89/2.04 -------------- statistics -------------
% 1.89/2.04 clauses given 14
% 1.89/2.04 clauses generated 88
% 1.89/2.04 clauses kept 91
% 1.89/2.04 clauses forward subsumed 66
% 1.89/2.04 clauses back subsumed 3
% 1.89/2.04 Kbytes malloced 976
% 1.89/2.04
% 1.89/2.04 ----------- times (seconds) -----------
% 1.89/2.04 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.04 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.04 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.04
% 1.89/2.04 That finishes the proof of the theorem.
% 1.89/2.04
% 1.89/2.04 Process 10885 finished Wed Jul 27 03:48:23 2022
% 1.89/2.04 Otter interrupted
% 1.89/2.04 PROOF FOUND
%------------------------------------------------------------------------------