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