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