TSTP Solution File: KRS070+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 1.78s 1.97s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 11 unt; 0 nHn; 19 RR)
% Number of literals : 30 ( 2 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(30,axiom,
( ~ cUnsatisfiable(A)
| rrx4(A,dollar_f1(A)) ),
file('KRS070+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cUnsatisfiable(A)
| cc2(dollar_f1(A)) ),
file('KRS070+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ cUnsatisfiable(A)
| ~ rrx3(A,B)
| ~ cc2(B)
| ~ cc1(B) ),
file('KRS070+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ cUnsatisfiable(A)
| rrx3(A,dollar_f2(A)) ),
file('KRS070+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ cUnsatisfiable(A)
| cc1(dollar_f2(A)) ),
file('KRS070+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ rrx(A,B)
| ~ rrx(A,C)
| B = C ),
file('KRS070+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ rrx3(A,B)
| rrx(A,B) ),
file('KRS070+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ rrx4(A,B)
| rrx(A,B) ),
file('KRS070+1.p',unknown),
[] ).
cnf(59,axiom,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('KRS070+1.p',unknown),
[] ).
cnf(60,plain,
cc1(dollar_f2(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[59,34]),
[iquote('hyper,59,34')] ).
cnf(61,plain,
rrx3(i2003_11_14_17_18_32242,dollar_f2(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[59,33]),
[iquote('hyper,59,33')] ).
cnf(62,plain,
cc2(dollar_f1(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[59,31]),
[iquote('hyper,59,31')] ).
cnf(63,plain,
rrx4(i2003_11_14_17_18_32242,dollar_f1(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[59,30]),
[iquote('hyper,59,30')] ).
cnf(90,plain,
rrx(i2003_11_14_17_18_32242,dollar_f2(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[61,43]),
[iquote('hyper,61,43')] ).
cnf(106,plain,
rrx(i2003_11_14_17_18_32242,dollar_f1(i2003_11_14_17_18_32242)),
inference(hyper,[status(thm)],[63,50]),
[iquote('hyper,63,50')] ).
cnf(159,plain,
dollar_f2(i2003_11_14_17_18_32242) = dollar_f1(i2003_11_14_17_18_32242),
inference(hyper,[status(thm)],[106,38,90]),
[iquote('hyper,106,38,90')] ).
cnf(196,plain,
rrx3(i2003_11_14_17_18_32242,dollar_f1(i2003_11_14_17_18_32242)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[61]),159]),
[iquote('back_demod,61,demod,159')] ).
cnf(197,plain,
cc1(dollar_f1(i2003_11_14_17_18_32242)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[60]),159]),
[iquote('back_demod,60,demod,159')] ).
cnf(233,plain,
$false,
inference(hyper,[status(thm)],[196,32,59,62,197]),
[iquote('hyper,196,32,59,62,197')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.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.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Wed Jul 27 03:11:01 EDT 2022
% 0.20/0.34 % CPUTime :
% 1.78/1.96 ----- Otter 3.3f, August 2004 -----
% 1.78/1.96 The process was started by sandbox on n007.cluster.edu,
% 1.78/1.96 Wed Jul 27 03:11:01 2022
% 1.78/1.96 The command was "./otter". The process ID is 11889.
% 1.78/1.96
% 1.78/1.96 set(prolog_style_variables).
% 1.78/1.96 set(auto).
% 1.78/1.96 dependent: set(auto1).
% 1.78/1.96 dependent: set(process_input).
% 1.78/1.96 dependent: clear(print_kept).
% 1.78/1.96 dependent: clear(print_new_demod).
% 1.78/1.96 dependent: clear(print_back_demod).
% 1.78/1.96 dependent: clear(print_back_sub).
% 1.78/1.96 dependent: set(control_memory).
% 1.78/1.96 dependent: assign(max_mem, 12000).
% 1.78/1.96 dependent: assign(pick_given_ratio, 4).
% 1.78/1.96 dependent: assign(stats_level, 1).
% 1.78/1.96 dependent: assign(max_seconds, 10800).
% 1.78/1.96 clear(print_given).
% 1.78/1.96
% 1.78/1.96 formula_list(usable).
% 1.78/1.96 all A (A=A).
% 1.78/1.96 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.78/1.96 all A B (A=B&cc1(A)->cc1(B)).
% 1.78/1.96 all A B (A=B&cc2(A)->cc2(B)).
% 1.78/1.96 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.78/1.96 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.78/1.96 all A B C (A=B&rrx(A,C)->rrx(B,C)).
% 1.78/1.96 all A B C (A=B&rrx(C,A)->rrx(C,B)).
% 1.78/1.96 all A B C (A=B&rrx1(A,C)->rrx1(B,C)).
% 1.78/1.96 all A B C (A=B&rrx1(C,A)->rrx1(C,B)).
% 1.78/1.96 all A B C (A=B&rrx1a(A,C)->rrx1a(B,C)).
% 1.78/1.96 all A B C (A=B&rrx1a(C,A)->rrx1a(C,B)).
% 1.78/1.96 all A B C (A=B&rrx2(A,C)->rrx2(B,C)).
% 1.78/1.96 all A B C (A=B&rrx2(C,A)->rrx2(C,B)).
% 1.78/1.96 all A B C (A=B&rrx2a(A,C)->rrx2a(B,C)).
% 1.78/1.96 all A B C (A=B&rrx2a(C,A)->rrx2a(C,B)).
% 1.78/1.96 all A B C (A=B&rrx3(A,C)->rrx3(B,C)).
% 1.78/1.96 all A B C (A=B&rrx3(C,A)->rrx3(C,B)).
% 1.78/1.96 all A B C (A=B&rrx3a(A,C)->rrx3a(B,C)).
% 1.78/1.96 all A B C (A=B&rrx3a(C,A)->rrx3a(C,B)).
% 1.78/1.96 all A B C (A=B&rrx4(A,C)->rrx4(B,C)).
% 1.78/1.96 all A B C (A=B&rrx4(C,A)->rrx4(C,B)).
% 1.78/1.96 all A B C (A=B&rrx4a(A,C)->rrx4a(B,C)).
% 1.78/1.96 all A B C (A=B&rrx4a(C,A)->rrx4a(C,B)).
% 1.78/1.96 all A B C (A=B&rrxa(A,C)->rrxa(B,C)).
% 1.78/1.96 all A B C (A=B&rrxa(C,A)->rrxa(C,B)).
% 1.78/1.96 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.78/1.96 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.78/1.96 all X (cowlThing(X)& -cowlNothing(X)).
% 1.78/1.96 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.78/1.96 all X (cUnsatisfiable(X)<-> (exists Y (rrx4(X,Y)&cc2(Y)))& -(exists Y (rrx3(X,Y)&cc2(Y)&cc1(Y)))& (exists Y (rrx3(X,Y)&cc1(Y)))).
% 1.78/1.96 all X Y Z (rrx(X,Y)&rrx(X,Z)->Y=Z).
% 1.78/1.96 all X Y Z (rrx3(X,Y)&rrx3(X,Z)->Y=Z).
% 1.78/1.96 all X Y Z (rrx3a(X,Y)&rrx3a(X,Z)->Y=Z).
% 1.78/1.96 all X Y Z (rrx4(X,Y)&rrx4(X,Z)->Y=Z).
% 1.78/1.96 all X Y Z (rrx4a(X,Y)&rrx4a(X,Z)->Y=Z).
% 1.78/1.96 cUnsatisfiable(i2003_11_14_17_18_32242).
% 1.78/1.96 all X Y (rrx3(X,Y)->rrx(X,Y)).
% 1.78/1.96 all X Y (rrx3a(X,Y)->rrxa(X,Y)).
% 1.78/1.96 all X Y (rrx4a(X,Y)->rrxa(X,Y)).
% 1.78/1.96 all X Y (rrx4(X,Y)->rrx2(X,Y)).
% 1.78/1.96 all X Y (rrx3a(X,Y)->rrx1a(X,Y)).
% 1.78/1.96 all X Y (rrx4a(X,Y)->rrx2a(X,Y)).
% 1.78/1.96 all X Y (rrx3(X,Y)->rrx1(X,Y)).
% 1.78/1.96 all X Y (rrx4(X,Y)->rrx(X,Y)).
% 1.78/1.96 end_of_list.
% 1.78/1.96
% 1.78/1.96 -------> usable clausifies to:
% 1.78/1.96
% 1.78/1.96 list(usable).
% 1.78/1.96 0 [] A=A.
% 1.78/1.96 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.78/1.96 0 [] A!=B| -cc1(A)|cc1(B).
% 1.78/1.96 0 [] A!=B| -cc2(A)|cc2(B).
% 1.78/1.96 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.78/1.96 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.78/1.96 0 [] A!=B| -rrx(A,C)|rrx(B,C).
% 1.78/1.96 0 [] A!=B| -rrx(C,A)|rrx(C,B).
% 1.78/1.96 0 [] A!=B| -rrx1(A,C)|rrx1(B,C).
% 1.78/1.96 0 [] A!=B| -rrx1(C,A)|rrx1(C,B).
% 1.78/1.96 0 [] A!=B| -rrx1a(A,C)|rrx1a(B,C).
% 1.78/1.96 0 [] A!=B| -rrx1a(C,A)|rrx1a(C,B).
% 1.78/1.96 0 [] A!=B| -rrx2(A,C)|rrx2(B,C).
% 1.78/1.96 0 [] A!=B| -rrx2(C,A)|rrx2(C,B).
% 1.78/1.96 0 [] A!=B| -rrx2a(A,C)|rrx2a(B,C).
% 1.78/1.96 0 [] A!=B| -rrx2a(C,A)|rrx2a(C,B).
% 1.78/1.96 0 [] A!=B| -rrx3(A,C)|rrx3(B,C).
% 1.78/1.96 0 [] A!=B| -rrx3(C,A)|rrx3(C,B).
% 1.78/1.96 0 [] A!=B| -rrx3a(A,C)|rrx3a(B,C).
% 1.78/1.96 0 [] A!=B| -rrx3a(C,A)|rrx3a(C,B).
% 1.78/1.96 0 [] A!=B| -rrx4(A,C)|rrx4(B,C).
% 1.78/1.96 0 [] A!=B| -rrx4(C,A)|rrx4(C,B).
% 1.78/1.96 0 [] A!=B| -rrx4a(A,C)|rrx4a(B,C).
% 1.78/1.96 0 [] A!=B| -rrx4a(C,A)|rrx4a(C,B).
% 1.78/1.96 0 [] A!=B| -rrxa(A,C)|rrxa(B,C).
% 1.78/1.96 0 [] A!=B| -rrxa(C,A)|rrxa(C,B).
% 1.78/1.96 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.78/1.96 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.78/1.96 0 [] cowlThing(X).
% 1.78/1.96 0 [] -cowlNothing(X).
% 1.78/1.96 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.78/1.96 0 [] xsd_string(X)|xsd_integer(X).
% 1.78/1.96 0 [] -cUnsatisfiable(X)|rrx4(X,$f1(X)).
% 1.78/1.96 0 [] -cUnsatisfiable(X)|cc2($f1(X)).
% 1.78/1.96 0 [] -cUnsatisfiable(X)| -rrx3(X,Y)| -cc2(Y)| -cc1(Y).
% 1.78/1.96 0 [] -cUnsatisfiable(X)|rrx3(X,$f2(X)).
% 1.78/1.96 0 [] -cUnsatisfiable(X)|cc1($f2(X)).
% 1.78/1.96 0 [] cUnsatisfiable(X)| -rrx4(X,X1)| -cc2(X1)|rrx3(X,$f3(X))| -rrx3(X,X2)| -cc1(X2).
% 1.78/1.96 0 [] cUnsatisfiable(X)| -rrx4(X,X1)| -cc2(X1)|cc2($f3(X))| -rrx3(X,X2)| -cc1(X2).
% 1.78/1.96 0 [] cUnsatisfiable(X)| -rrx4(X,X1)| -cc2(X1)|cc1($f3(X))| -rrx3(X,X2)| -cc1(X2).
% 1.78/1.96 0 [] -rrx(X,Y)| -rrx(X,Z)|Y=Z.
% 1.78/1.96 0 [] -rrx3(X,Y)| -rrx3(X,Z)|Y=Z.
% 1.78/1.96 0 [] -rrx3a(X,Y)| -rrx3a(X,Z)|Y=Z.
% 1.78/1.97 0 [] -rrx4(X,Y)| -rrx4(X,Z)|Y=Z.
% 1.78/1.97 0 [] -rrx4a(X,Y)| -rrx4a(X,Z)|Y=Z.
% 1.78/1.97 0 [] cUnsatisfiable(i2003_11_14_17_18_32242).
% 1.78/1.97 0 [] -rrx3(X,Y)|rrx(X,Y).
% 1.78/1.97 0 [] -rrx3a(X,Y)|rrxa(X,Y).
% 1.78/1.97 0 [] -rrx4a(X,Y)|rrxa(X,Y).
% 1.78/1.97 0 [] -rrx4(X,Y)|rrx2(X,Y).
% 1.78/1.97 0 [] -rrx3a(X,Y)|rrx1a(X,Y).
% 1.78/1.97 0 [] -rrx4a(X,Y)|rrx2a(X,Y).
% 1.78/1.97 0 [] -rrx3(X,Y)|rrx1(X,Y).
% 1.78/1.97 0 [] -rrx4(X,Y)|rrx(X,Y).
% 1.78/1.97 end_of_list.
% 1.78/1.97
% 1.78/1.97 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.78/1.97
% 1.78/1.97 This ia a non-Horn set with equality. The strategy will be
% 1.78/1.97 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/1.97 deletion, with positive clauses in sos and nonpositive
% 1.78/1.97 clauses in usable.
% 1.78/1.97
% 1.78/1.97 dependent: set(knuth_bendix).
% 1.78/1.97 dependent: set(anl_eq).
% 1.78/1.97 dependent: set(para_from).
% 1.78/1.97 dependent: set(para_into).
% 1.78/1.97 dependent: clear(para_from_right).
% 1.78/1.97 dependent: clear(para_into_right).
% 1.78/1.97 dependent: set(para_from_vars).
% 1.78/1.97 dependent: set(eq_units_both_ways).
% 1.78/1.97 dependent: set(dynamic_demod_all).
% 1.78/1.97 dependent: set(dynamic_demod).
% 1.78/1.97 dependent: set(order_eq).
% 1.78/1.97 dependent: set(back_demod).
% 1.78/1.97 dependent: set(lrpo).
% 1.78/1.97 dependent: set(hyper_res).
% 1.78/1.97 dependent: set(unit_deletion).
% 1.78/1.97 dependent: set(factor).
% 1.78/1.97
% 1.78/1.97 ------------> process usable:
% 1.78/1.97 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.78/1.97 ** KEPT (pick-wt=7): 2 [] A!=B| -cc1(A)|cc1(B).
% 1.78/1.97 ** KEPT (pick-wt=7): 3 [] A!=B| -cc2(A)|cc2(B).
% 1.78/1.97 ** KEPT (pick-wt=7): 4 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.78/1.97 ** KEPT (pick-wt=7): 5 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.78/1.97 ** KEPT (pick-wt=9): 6 [] A!=B| -rrx(A,C)|rrx(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 7 [] A!=B| -rrx(C,A)|rrx(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 8 [] A!=B| -rrx1(A,C)|rrx1(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 9 [] A!=B| -rrx1(C,A)|rrx1(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 10 [] A!=B| -rrx1a(A,C)|rrx1a(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 11 [] A!=B| -rrx1a(C,A)|rrx1a(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 12 [] A!=B| -rrx2(A,C)|rrx2(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 13 [] A!=B| -rrx2(C,A)|rrx2(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 14 [] A!=B| -rrx2a(A,C)|rrx2a(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 15 [] A!=B| -rrx2a(C,A)|rrx2a(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 16 [] A!=B| -rrx3(A,C)|rrx3(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 17 [] A!=B| -rrx3(C,A)|rrx3(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 18 [] A!=B| -rrx3a(A,C)|rrx3a(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 19 [] A!=B| -rrx3a(C,A)|rrx3a(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 20 [] A!=B| -rrx4(A,C)|rrx4(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 21 [] A!=B| -rrx4(C,A)|rrx4(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 22 [] A!=B| -rrx4a(A,C)|rrx4a(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 23 [] A!=B| -rrx4a(C,A)|rrx4a(C,B).
% 1.78/1.97 ** KEPT (pick-wt=9): 24 [] A!=B| -rrxa(A,C)|rrxa(B,C).
% 1.78/1.97 ** KEPT (pick-wt=9): 25 [] A!=B| -rrxa(C,A)|rrxa(C,B).
% 1.78/1.97 ** KEPT (pick-wt=7): 26 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.78/1.97 ** KEPT (pick-wt=7): 27 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.78/1.97 ** KEPT (pick-wt=2): 28 [] -cowlNothing(A).
% 1.78/1.97 ** KEPT (pick-wt=4): 29 [] -xsd_string(A)| -xsd_integer(A).
% 1.78/1.97 ** KEPT (pick-wt=6): 30 [] -cUnsatisfiable(A)|rrx4(A,$f1(A)).
% 1.78/1.97 ** KEPT (pick-wt=5): 31 [] -cUnsatisfiable(A)|cc2($f1(A)).
% 1.78/1.97 ** KEPT (pick-wt=9): 32 [] -cUnsatisfiable(A)| -rrx3(A,B)| -cc2(B)| -cc1(B).
% 1.78/1.97 ** KEPT (pick-wt=6): 33 [] -cUnsatisfiable(A)|rrx3(A,$f2(A)).
% 1.78/1.97 ** KEPT (pick-wt=5): 34 [] -cUnsatisfiable(A)|cc1($f2(A)).
% 1.78/1.97 ** KEPT (pick-wt=16): 35 [] cUnsatisfiable(A)| -rrx4(A,B)| -cc2(B)|rrx3(A,$f3(A))| -rrx3(A,C)| -cc1(C).
% 1.78/1.97 ** KEPT (pick-wt=15): 36 [] cUnsatisfiable(A)| -rrx4(A,B)| -cc2(B)|cc2($f3(A))| -rrx3(A,C)| -cc1(C).
% 1.78/1.97 ** KEPT (pick-wt=15): 37 [] cUnsatisfiable(A)| -rrx4(A,B)| -cc2(B)|cc1($f3(A))| -rrx3(A,C)| -cc1(C).
% 1.78/1.97 ** KEPT (pick-wt=9): 38 [] -rrx(A,B)| -rrx(A,C)|B=C.
% 1.78/1.97 ** KEPT (pick-wt=9): 39 [] -rrx3(A,B)| -rrx3(A,C)|B=C.
% 1.78/1.97 ** KEPT (pick-wt=9): 40 [] -rrx3a(A,B)| -rrx3a(A,C)|B=C.
% 1.78/1.97 ** KEPT (pick-wt=9): 41 [] -rrx4(A,B)| -rrx4(A,C)|B=C.
% 1.78/1.97 ** KEPT (pick-wt=9): 42 [] -rrx4a(A,B)| -rrx4a(A,C)|B=C.
% 1.78/1.97 ** KEPT (pick-wt=6): 43 [] -rrx3(A,B)|rrx(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 44 [] -rrx3a(A,B)|rrxa(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 45 [] -rrx4a(A,B)|rrxa(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 46 [] -rrx4(A,B)|rrx2(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 47 [] -rrx3a(A,B)|rrx1a(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 48 [] -rrx4a(A,B)|rrx2a(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 49 [] -rrx3(A,B)|rrx1(A,B).
% 1.78/1.97 ** KEPT (pick-wt=6): 50 [] -rrx4(A,B)|rrx(A,B).
% 1.78/1.97 28 back subsumes 4.
% 1.78/1.97
% 1.78/1.97 ------------> process sos:
% 1.78/1.97 ** KEPT (pick-wt=3): 56 [] A=A.
% 1.78/1.97 ** KEPT (pick-wt=2): 57 [] cowlThing(A).
% 1.78/1.97 ** KEPT (pick-wt=4): 58 [] xsd_string(A)|xsd_integer(A).
% 1.78/1.97 ** KEPT (pick-wt=2): 59 [] cUnsatisfiable(i2003_11_14_17_18_32242).
% 1.78/1.97 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] A=A.
% 1.78/1.97 56 back subsumes 55.
% 1.78/1.97 56 back subsumes 54.
% 1.78/1.97 56 back subsumes 53.
% 1.78/1.97 56 back subsumes 52.
% 1.78/1.97 56 back subsumes 51.
% 1.78/1.97 57 back subsumes 5.
% 1.78/1.97
% 1.78/1.97 ======= end of input processing =======
% 1.78/1.97
% 1.78/1.97 =========== start of search ===========
% 1.78/1.97
% 1.78/1.97 -------- PROOF --------
% 1.78/1.97
% 1.78/1.97 -----> EMPTY CLAUSE at 0.01 sec ----> 233 [hyper,196,32,59,62,197] $F.
% 1.78/1.97
% 1.78/1.97 Length of proof is 9. Level of proof is 4.
% 1.78/1.97
% 1.78/1.97 ---------------- PROOF ----------------
% 1.78/1.97 % SZS status Theorem
% 1.78/1.97 % SZS output start Refutation
% See solution above
% 1.78/1.97 ------------ end of proof -------------
% 1.78/1.97
% 1.78/1.97
% 1.78/1.97 Search stopped by max_proofs option.
% 1.78/1.97
% 1.78/1.97
% 1.78/1.97 Search stopped by max_proofs option.
% 1.78/1.97
% 1.78/1.97 ============ end of search ============
% 1.78/1.97
% 1.78/1.97 -------------- statistics -------------
% 1.78/1.97 clauses given 17
% 1.78/1.97 clauses generated 381
% 1.78/1.97 clauses kept 231
% 1.78/1.97 clauses forward subsumed 243
% 1.78/1.97 clauses back subsumed 7
% 1.78/1.97 Kbytes malloced 976
% 1.78/1.97
% 1.78/1.97 ----------- times (seconds) -----------
% 1.78/1.97 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.78/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.97 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.78/1.97
% 1.78/1.97 That finishes the proof of the theorem.
% 1.78/1.97
% 1.78/1.97 Process 11889 finished Wed Jul 27 03:11:02 2022
% 1.78/1.97 Otter interrupted
% 1.78/1.97 PROOF FOUND
%------------------------------------------------------------------------------