TSTP Solution File: KRS111+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:10 EDT 2022
% Result : Unsatisfiable 1.81s 2.01s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 38 ( 4 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(24,axiom,
( ~ cUnsatisfiable(A)
| rf1(A,dollar_f1(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ cUnsatisfiable(A)
| cpxcomp(dollar_f1(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cUnsatisfiable(A)
| rs(A,dollar_f2(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cUnsatisfiable(A)
| rf(A,dollar_f3(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ cUnsatisfiable(A)
| cp(dollar_f3(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cp(A)
| ~ ra_Px1(A,B) ),
file('KRS111+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ cpxcomp(A)
| ra_Px1(A,dollar_f5(A)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ rf(A,B)
| ~ rf(A,C)
| B = C ),
file('KRS111+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ rf1(A,B)
| ~ rf1(A,C)
| B = C ),
file('KRS111+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ rs(A,B)
| rf(A,B) ),
file('KRS111+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ rs(A,B)
| rf1(A,B) ),
file('KRS111+1.p',unknown),
[] ).
cnf(52,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('KRS111+1.p',unknown),
[] ).
cnf(53,plain,
cp(dollar_f3(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[52,29]),
[iquote('hyper,52,29')] ).
cnf(54,plain,
rf(i2003_11_14_17_21_15425,dollar_f3(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[52,28]),
[iquote('hyper,52,28')] ).
cnf(55,plain,
rs(i2003_11_14_17_21_15425,dollar_f2(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[52,26]),
[iquote('hyper,52,26')] ).
cnf(56,plain,
cpxcomp(dollar_f1(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[52,25]),
[iquote('hyper,52,25')] ).
cnf(57,plain,
rf1(i2003_11_14_17_21_15425,dollar_f1(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[52,24]),
[iquote('hyper,52,24')] ).
cnf(67,plain,
ra_Px1(dollar_f1(i2003_11_14_17_21_15425),dollar_f5(dollar_f1(i2003_11_14_17_21_15425))),
inference(hyper,[status(thm)],[56,32]),
[iquote('hyper,56,32')] ).
cnf(84,plain,
rf1(i2003_11_14_17_21_15425,dollar_f2(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[55,44]),
[iquote('hyper,55,44')] ).
cnf(85,plain,
rf(i2003_11_14_17_21_15425,dollar_f2(i2003_11_14_17_21_15425)),
inference(hyper,[status(thm)],[55,43]),
[iquote('hyper,55,43')] ).
cnf(120,plain,
dollar_f2(i2003_11_14_17_21_15425) = dollar_f1(i2003_11_14_17_21_15425),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[84,35,57])]),
[iquote('hyper,84,35,57,flip.1')] ).
cnf(128,plain,
rf(i2003_11_14_17_21_15425,dollar_f1(i2003_11_14_17_21_15425)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[85]),120]),
[iquote('back_demod,85,demod,120')] ).
cnf(150,plain,
dollar_f3(i2003_11_14_17_21_15425) = dollar_f1(i2003_11_14_17_21_15425),
inference(hyper,[status(thm)],[128,34,54]),
[iquote('hyper,128,34,54')] ).
cnf(166,plain,
cp(dollar_f1(i2003_11_14_17_21_15425)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[53]),150]),
[iquote('back_demod,53,demod,150')] ).
cnf(191,plain,
$false,
inference(hyper,[status(thm)],[67,31,166]),
[iquote('hyper,67,31,166')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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 03:32:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.81/2.00 ----- Otter 3.3f, August 2004 -----
% 1.81/2.00 The process was started by sandbox2 on n019.cluster.edu,
% 1.81/2.00 Wed Jul 27 03:32:37 2022
% 1.81/2.00 The command was "./otter". The process ID is 8713.
% 1.81/2.00
% 1.81/2.00 set(prolog_style_variables).
% 1.81/2.00 set(auto).
% 1.81/2.00 dependent: set(auto1).
% 1.81/2.00 dependent: set(process_input).
% 1.81/2.00 dependent: clear(print_kept).
% 1.81/2.00 dependent: clear(print_new_demod).
% 1.81/2.00 dependent: clear(print_back_demod).
% 1.81/2.00 dependent: clear(print_back_sub).
% 1.81/2.00 dependent: set(control_memory).
% 1.81/2.00 dependent: assign(max_mem, 12000).
% 1.81/2.00 dependent: assign(pick_given_ratio, 4).
% 1.81/2.00 dependent: assign(stats_level, 1).
% 1.81/2.00 dependent: assign(max_seconds, 10800).
% 1.81/2.00 clear(print_given).
% 1.81/2.00
% 1.81/2.00 formula_list(usable).
% 1.81/2.00 all A (A=A).
% 1.81/2.00 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.81/2.00 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.81/2.00 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.81/2.00 all A B (A=B&cp(A)->cp(B)).
% 1.81/2.00 all A B (A=B&cpxcomp(A)->cpxcomp(B)).
% 1.81/2.00 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 1.81/2.00 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 1.81/2.00 all A B C (A=B&rf(A,C)->rf(B,C)).
% 1.81/2.00 all A B C (A=B&rf(C,A)->rf(C,B)).
% 1.81/2.00 all A B C (A=B&rf1(A,C)->rf1(B,C)).
% 1.81/2.00 all A B C (A=B&rf1(C,A)->rf1(C,B)).
% 1.81/2.00 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 1.81/2.00 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 1.81/2.00 all A B C (A=B&rinvF1(A,C)->rinvF1(B,C)).
% 1.81/2.00 all A B C (A=B&rinvF1(C,A)->rinvF1(C,B)).
% 1.81/2.00 all A B C (A=B&rinvS(A,C)->rinvS(B,C)).
% 1.81/2.00 all A B C (A=B&rinvS(C,A)->rinvS(C,B)).
% 1.81/2.00 all A B C (A=B&rs(A,C)->rs(B,C)).
% 1.81/2.00 all A B C (A=B&rs(C,A)->rs(C,B)).
% 1.81/2.00 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.81/2.00 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.81/2.00 all X (cowlThing(X)& -cowlNothing(X)).
% 1.81/2.00 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.81/2.00 all X (cUnsatisfiable(X)<-> (exists Y (rf1(X,Y)&cpxcomp(Y)))& (exists Y (rs(X,Y)&cowlThing(Y)))& (exists Y (rf(X,Y)&cp(Y)))).
% 1.81/2.00 all X (cp(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.81/2.00 all X (cpxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.81/2.00 all X Y Z (rf(X,Y)&rf(X,Z)->Y=Z).
% 1.81/2.00 all X Y Z (rf1(X,Y)&rf1(X,Z)->Y=Z).
% 1.81/2.00 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 1.81/2.00 all X Y (rinvF1(X,Y)<->rf1(Y,X)).
% 1.81/2.00 all X Y (rinvS(X,Y)<->rs(Y,X)).
% 1.81/2.00 all X Y Z (rs(X,Y)&rs(X,Z)->Y=Z).
% 1.81/2.00 cUnsatisfiable(i2003_11_14_17_21_15425).
% 1.81/2.00 all X Y (rs(X,Y)->rf(X,Y)).
% 1.81/2.00 all X Y (rs(X,Y)->rf1(X,Y)).
% 1.81/2.00 end_of_list.
% 1.81/2.00
% 1.81/2.00 -------> usable clausifies to:
% 1.81/2.00
% 1.81/2.00 list(usable).
% 1.81/2.00 0 [] A=A.
% 1.81/2.00 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.81/2.00 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.81/2.00 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.81/2.00 0 [] A!=B| -cp(A)|cp(B).
% 1.81/2.00 0 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 1.81/2.00 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.81/2.00 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.81/2.00 0 [] A!=B| -rf(A,C)|rf(B,C).
% 1.81/2.00 0 [] A!=B| -rf(C,A)|rf(C,B).
% 1.81/2.00 0 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.81/2.00 0 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.81/2.00 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.81/2.00 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.81/2.00 0 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.81/2.00 0 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.81/2.00 0 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.81/2.00 0 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.81/2.00 0 [] A!=B| -rs(A,C)|rs(B,C).
% 1.81/2.00 0 [] A!=B| -rs(C,A)|rs(C,B).
% 1.81/2.00 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.81/2.00 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.81/2.00 0 [] cowlThing(X).
% 1.81/2.00 0 [] -cowlNothing(X).
% 1.81/2.00 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.81/2.00 0 [] xsd_string(X)|xsd_integer(X).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|rf1(X,$f1(X)).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|cpxcomp($f1(X)).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|rs(X,$f2(X)).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|cowlThing($f2(X)).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|rf(X,$f3(X)).
% 1.81/2.00 0 [] -cUnsatisfiable(X)|cp($f3(X)).
% 1.81/2.00 0 [] cUnsatisfiable(X)| -rf1(X,Y)| -cpxcomp(Y)| -rs(X,X1)| -cowlThing(X1)| -rf(X,X2)| -cp(X2).
% 1.81/2.00 0 [] -cp(X)| -ra_Px1(X,Y).
% 1.81/2.00 0 [] cp(X)|ra_Px1(X,$f4(X)).
% 1.81/2.00 0 [] -cpxcomp(X)|ra_Px1(X,$f5(X)).
% 1.81/2.00 0 [] cpxcomp(X)| -ra_Px1(X,Y0).
% 1.81/2.00 0 [] -rf(X,Y)| -rf(X,Z)|Y=Z.
% 1.81/2.00 0 [] -rf1(X,Y)| -rf1(X,Z)|Y=Z.
% 1.81/2.00 0 [] -rinvF(X,Y)|rf(Y,X).
% 1.81/2.00 0 [] rinvF(X,Y)| -rf(Y,X).
% 1.81/2.00 0 [] -rinvF1(X,Y)|rf1(Y,X).
% 1.81/2.00 0 [] rinvF1(X,Y)| -rf1(Y,X).
% 1.81/2.00 0 [] -rinvS(X,Y)|rs(Y,X).
% 1.81/2.00 0 [] rinvS(X,Y)| -rs(Y,X).
% 1.81/2.00 0 [] -rs(X,Y)| -rs(X,Z)|Y=Z.
% 1.81/2.00 0 [] cUnsatisfiable(i2003_11_14_17_21_15425).
% 1.81/2.00 0 [] -rs(X,Y)|rf(X,Y).
% 1.81/2.00 0 [] -rs(X,Y)|rf1(X,Y).
% 1.81/2.00 end_of_list.
% 1.81/2.00
% 1.81/2.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.81/2.00
% 1.81/2.00 This ia a non-Horn set with equality. The strategy will be
% 1.81/2.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.81/2.00 deletion, with positive clauses in sos and nonpositive
% 1.81/2.00 clauses in usable.
% 1.81/2.00
% 1.81/2.00 dependent: set(knuth_bendix).
% 1.81/2.01 dependent: set(anl_eq).
% 1.81/2.01 dependent: set(para_from).
% 1.81/2.01 dependent: set(para_into).
% 1.81/2.01 dependent: clear(para_from_right).
% 1.81/2.01 dependent: clear(para_into_right).
% 1.81/2.01 dependent: set(para_from_vars).
% 1.81/2.01 dependent: set(eq_units_both_ways).
% 1.81/2.01 dependent: set(dynamic_demod_all).
% 1.81/2.01 dependent: set(dynamic_demod).
% 1.81/2.01 dependent: set(order_eq).
% 1.81/2.01 dependent: set(back_demod).
% 1.81/2.01 dependent: set(lrpo).
% 1.81/2.01 dependent: set(hyper_res).
% 1.81/2.01 dependent: set(unit_deletion).
% 1.81/2.01 dependent: set(factor).
% 1.81/2.01
% 1.81/2.01 ------------> process usable:
% 1.81/2.01 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 2 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 3 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 4 [] A!=B| -cp(A)|cp(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 5 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 1.81/2.01 ** KEPT (pick-wt=9): 6 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 7 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 8 [] A!=B| -rf(A,C)|rf(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 9 [] A!=B| -rf(C,A)|rf(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 10 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 11 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 12 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 13 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 15 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 16 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 17 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 18 [] A!=B| -rs(A,C)|rs(B,C).
% 1.81/2.01 ** KEPT (pick-wt=9): 19 [] A!=B| -rs(C,A)|rs(C,B).
% 1.81/2.01 ** KEPT (pick-wt=7): 20 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 21 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.81/2.01 ** KEPT (pick-wt=2): 22 [] -cowlNothing(A).
% 1.81/2.01 ** KEPT (pick-wt=4): 23 [] -xsd_string(A)| -xsd_integer(A).
% 1.81/2.01 ** KEPT (pick-wt=6): 24 [] -cUnsatisfiable(A)|rf1(A,$f1(A)).
% 1.81/2.01 ** KEPT (pick-wt=5): 25 [] -cUnsatisfiable(A)|cpxcomp($f1(A)).
% 1.81/2.01 ** KEPT (pick-wt=6): 26 [] -cUnsatisfiable(A)|rs(A,$f2(A)).
% 1.81/2.01 ** KEPT (pick-wt=5): 27 [] -cUnsatisfiable(A)|cowlThing($f2(A)).
% 1.81/2.01 ** KEPT (pick-wt=6): 28 [] -cUnsatisfiable(A)|rf(A,$f3(A)).
% 1.81/2.01 ** KEPT (pick-wt=5): 29 [] -cUnsatisfiable(A)|cp($f3(A)).
% 1.81/2.01 ** KEPT (pick-wt=17): 30 [] cUnsatisfiable(A)| -rf1(A,B)| -cpxcomp(B)| -rs(A,C)| -cowlThing(C)| -rf(A,D)| -cp(D).
% 1.81/2.01 ** KEPT (pick-wt=5): 31 [] -cp(A)| -ra_Px1(A,B).
% 1.81/2.01 ** KEPT (pick-wt=6): 32 [] -cpxcomp(A)|ra_Px1(A,$f5(A)).
% 1.81/2.01 ** KEPT (pick-wt=5): 33 [] cpxcomp(A)| -ra_Px1(A,B).
% 1.81/2.01 ** KEPT (pick-wt=9): 34 [] -rf(A,B)| -rf(A,C)|B=C.
% 1.81/2.01 ** KEPT (pick-wt=9): 35 [] -rf1(A,B)| -rf1(A,C)|B=C.
% 1.81/2.01 ** KEPT (pick-wt=6): 36 [] -rinvF(A,B)|rf(B,A).
% 1.81/2.01 ** KEPT (pick-wt=6): 37 [] rinvF(A,B)| -rf(B,A).
% 1.81/2.01 ** KEPT (pick-wt=6): 38 [] -rinvF1(A,B)|rf1(B,A).
% 1.81/2.01 ** KEPT (pick-wt=6): 39 [] rinvF1(A,B)| -rf1(B,A).
% 1.81/2.01 ** KEPT (pick-wt=6): 40 [] -rinvS(A,B)|rs(B,A).
% 1.81/2.01 ** KEPT (pick-wt=6): 41 [] rinvS(A,B)| -rs(B,A).
% 1.81/2.01 ** KEPT (pick-wt=9): 42 [] -rs(A,B)| -rs(A,C)|B=C.
% 1.81/2.01 ** KEPT (pick-wt=6): 43 [] -rs(A,B)|rf(A,B).
% 1.81/2.01 ** KEPT (pick-wt=6): 44 [] -rs(A,B)|rf1(A,B).
% 1.81/2.01 22 back subsumes 2.
% 1.81/2.01
% 1.81/2.01 ------------> process sos:
% 1.81/2.01 ** KEPT (pick-wt=3): 48 [] A=A.
% 1.81/2.01 ** KEPT (pick-wt=2): 49 [] cowlThing(A).
% 1.81/2.01 ** KEPT (pick-wt=4): 50 [] xsd_string(A)|xsd_integer(A).
% 1.81/2.01 ** KEPT (pick-wt=6): 51 [] cp(A)|ra_Px1(A,$f4(A)).
% 1.81/2.01 ** KEPT (pick-wt=2): 52 [] cUnsatisfiable(i2003_11_14_17_21_15425).
% 1.81/2.01 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] A=A.
% 1.81/2.01 48 back subsumes 47.
% 1.81/2.01 48 back subsumes 46.
% 1.81/2.01 48 back subsumes 45.
% 1.81/2.01 49 back subsumes 27.
% 1.81/2.01 49 back subsumes 3.
% 1.81/2.01
% 1.81/2.01 ======= end of input processing =======
% 1.81/2.01
% 1.81/2.01 =========== start of search ===========
% 1.81/2.01
% 1.81/2.01 -------- PROOF --------
% 1.81/2.01
% 1.81/2.01 -----> EMPTY CLAUSE at 0.01 sec ----> 191 [hyper,67,31,166] $F.
% 1.81/2.01
% 1.81/2.01 Length of proof is 12. Level of proof is 6.
% 1.81/2.01
% 1.81/2.01 ---------------- PROOF ----------------
% 1.81/2.01 % SZS status Theorem
% 1.81/2.01 % SZS output start Refutation
% See solution above
% 1.81/2.01 ------------ end of proof -------------
% 1.81/2.01
% 1.81/2.01
% 1.81/2.01 Search stopped by max_proofs option.
% 1.81/2.01
% 1.81/2.01
% 1.81/2.01 Search stopped by max_proofs option.
% 1.81/2.01
% 1.81/2.01 ============ end of search ============
% 1.81/2.01
% 1.81/2.01 -------------- statistics -------------
% 1.81/2.01 clauses given 23
% 1.81/2.01 clauses generated 336
% 1.81/2.01 clauses kept 188
% 1.81/2.01 clauses forward subsumed 226
% 1.81/2.01 clauses back subsumed 6
% 1.81/2.01 Kbytes malloced 976
% 1.81/2.01
% 1.81/2.01 ----------- times (seconds) -----------
% 1.81/2.01 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.81/2.01 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.01 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.81/2.01
% 1.81/2.01 That finishes the proof of the theorem.
% 1.81/2.01
% 1.81/2.01 Process 8713 finished Wed Jul 27 03:32:38 2022
% 1.81/2.01 Otter interrupted
% 1.81/2.01 PROOF FOUND
%------------------------------------------------------------------------------