TSTP Solution File: KRS090+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS090+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:07 EDT 2022
% Result : Unsatisfiable 2.03s 2.21s
% Output : Refutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 9 unt; 2 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(35,axiom,
( ~ cC2(A)
| ~ cB(A)
| cA(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ cC2(A)
| cB(A)
| cA(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ cC3(A)
| ~ cB(A)
| ~ cA(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ cC3(A)
| cB(A)
| ~ cA(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ cC4(A)
| rR(A,dollar_f1(A)) ),
file('KRS090+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ cC4(A)
| cC2(dollar_f1(A)) ),
file('KRS090+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ cC5(A)
| ~ rR(A,B)
| cC3(B) ),
file('KRS090+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ cTEST(A)
| cC4(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ cTEST(A)
| cC5(A) ),
file('KRS090+1.p',unknown),
[] ).
cnf(47,axiom,
cTEST(i2003_11_14_17_19_57994),
file('KRS090+1.p',unknown),
[] ).
cnf(48,plain,
cC5(i2003_11_14_17_19_57994),
inference(hyper,[status(thm)],[47,44]),
[iquote('hyper,47,44')] ).
cnf(50,plain,
cC4(i2003_11_14_17_19_57994),
inference(hyper,[status(thm)],[47,42]),
[iquote('hyper,47,42')] ).
cnf(83,plain,
cC2(dollar_f1(i2003_11_14_17_19_57994)),
inference(hyper,[status(thm)],[50,40]),
[iquote('hyper,50,40')] ).
cnf(84,plain,
rR(i2003_11_14_17_19_57994,dollar_f1(i2003_11_14_17_19_57994)),
inference(hyper,[status(thm)],[50,39]),
[iquote('hyper,50,39')] ).
cnf(85,plain,
( cB(dollar_f1(i2003_11_14_17_19_57994))
| cA(dollar_f1(i2003_11_14_17_19_57994)) ),
inference(hyper,[status(thm)],[83,36]),
[iquote('hyper,83,36')] ).
cnf(86,plain,
cC3(dollar_f1(i2003_11_14_17_19_57994)),
inference(hyper,[status(thm)],[84,41,48]),
[iquote('hyper,84,41,48')] ).
cnf(87,plain,
cA(dollar_f1(i2003_11_14_17_19_57994)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[85,35,83])]),
[iquote('hyper,85,35,83,factor_simp')] ).
cnf(88,plain,
cB(dollar_f1(i2003_11_14_17_19_57994)),
inference(hyper,[status(thm)],[87,38,86]),
[iquote('hyper,87,38,86')] ).
cnf(89,plain,
$false,
inference(hyper,[status(thm)],[88,37,86,87]),
[iquote('hyper,88,37,86,87')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS090+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.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.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:27:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.03/2.21 ----- Otter 3.3f, August 2004 -----
% 2.03/2.21 The process was started by sandbox on n020.cluster.edu,
% 2.03/2.21 Wed Jul 27 03:27:23 2022
% 2.03/2.21 The command was "./otter". The process ID is 27210.
% 2.03/2.21
% 2.03/2.21 set(prolog_style_variables).
% 2.03/2.21 set(auto).
% 2.03/2.21 dependent: set(auto1).
% 2.03/2.21 dependent: set(process_input).
% 2.03/2.21 dependent: clear(print_kept).
% 2.03/2.21 dependent: clear(print_new_demod).
% 2.03/2.21 dependent: clear(print_back_demod).
% 2.03/2.21 dependent: clear(print_back_sub).
% 2.03/2.21 dependent: set(control_memory).
% 2.03/2.21 dependent: assign(max_mem, 12000).
% 2.03/2.21 dependent: assign(pick_given_ratio, 4).
% 2.03/2.21 dependent: assign(stats_level, 1).
% 2.03/2.21 dependent: assign(max_seconds, 10800).
% 2.03/2.21 clear(print_given).
% 2.03/2.21
% 2.03/2.21 formula_list(usable).
% 2.03/2.21 all X (cowlThing(X)& -cowlNothing(X)).
% 2.03/2.21 all X (xsd_string(X)<-> -xsd_integer(X)).
% 2.03/2.21 all X (cC1(X)-> (cB5(X)|cA5(X))& (cB13(X)|cA13(X))& (cA1(X)|cB1(X))& (cA27(X)|cB27(X))& (cA4(X)|cB4(X))& (cB12(X)|cA12(X))& (cB30(X)|cA30(X))& (cA20(X)|cB20(X))& (cB14(X)|cA14(X))& (cB28(X)|cA28(X))& (cA3(X)|cB3(X))& (cB7(X)|cA7(X))& (cB21(X)|cA21(X))& (cB22(X)|cA22(X))& (cB17(X)|cA17(X))& (cB11(X)|cA11(X))& (cB19(X)|cA19(X))& (cA8(X)|cB8(X))& (cA26(X)|cB26(X))& (cA25(X)|cB25(X))& (cA29(X)|cB29(X))& (cB23(X)|cA23(X))& (cB18(X)|cA18(X))& (cB10(X)|cA10(X))& (cB2(X)|cA2(X))& (cA16(X)|cB16(X))& (cB0(X)|cA0(X))& (cB31(X)|cA31(X))& (cB9(X)|cA9(X))& (cB6(X)|cA6(X))& (cB24(X)|cA24(X))& (cB15(X)|cA15(X))).
% 2.03/2.21 all X (cC2(X)-> (-cB(X)|cA(X))& (cB(X)|cA(X))).
% 2.03/2.21 all X (cC3(X)-> (-cB(X)| -cA(X))& (cB(X)| -cA(X))).
% 2.03/2.21 all X (cC4(X)-> (exists Y (rR(X,Y)&cC2(Y)))).
% 2.03/2.21 all X (cC5(X)-> (all Y (rR(X,Y)->cC3(Y)))).
% 2.03/2.21 all X (cTEST(X)->cC4(X)&cC1(X)&cC5(X)).
% 2.03/2.21 cTEST(i2003_11_14_17_19_57994).
% 2.03/2.21 end_of_list.
% 2.03/2.21
% 2.03/2.21 -------> usable clausifies to:
% 2.03/2.21
% 2.03/2.21 list(usable).
% 2.03/2.21 0 [] cowlThing(X).
% 2.03/2.21 0 [] -cowlNothing(X).
% 2.03/2.21 0 [] -xsd_string(X)| -xsd_integer(X).
% 2.03/2.21 0 [] xsd_string(X)|xsd_integer(X).
% 2.03/2.21 0 [] -cC1(X)|cB5(X)|cA5(X).
% 2.03/2.21 0 [] -cC1(X)|cB13(X)|cA13(X).
% 2.03/2.21 0 [] -cC1(X)|cA1(X)|cB1(X).
% 2.03/2.21 0 [] -cC1(X)|cA27(X)|cB27(X).
% 2.03/2.21 0 [] -cC1(X)|cA4(X)|cB4(X).
% 2.03/2.21 0 [] -cC1(X)|cB12(X)|cA12(X).
% 2.03/2.21 0 [] -cC1(X)|cB30(X)|cA30(X).
% 2.03/2.21 0 [] -cC1(X)|cA20(X)|cB20(X).
% 2.03/2.21 0 [] -cC1(X)|cB14(X)|cA14(X).
% 2.03/2.21 0 [] -cC1(X)|cB28(X)|cA28(X).
% 2.03/2.21 0 [] -cC1(X)|cA3(X)|cB3(X).
% 2.03/2.21 0 [] -cC1(X)|cB7(X)|cA7(X).
% 2.03/2.21 0 [] -cC1(X)|cB21(X)|cA21(X).
% 2.03/2.21 0 [] -cC1(X)|cB22(X)|cA22(X).
% 2.03/2.21 0 [] -cC1(X)|cB17(X)|cA17(X).
% 2.03/2.21 0 [] -cC1(X)|cB11(X)|cA11(X).
% 2.03/2.21 0 [] -cC1(X)|cB19(X)|cA19(X).
% 2.03/2.21 0 [] -cC1(X)|cA8(X)|cB8(X).
% 2.03/2.21 0 [] -cC1(X)|cA26(X)|cB26(X).
% 2.03/2.21 0 [] -cC1(X)|cA25(X)|cB25(X).
% 2.03/2.21 0 [] -cC1(X)|cA29(X)|cB29(X).
% 2.03/2.21 0 [] -cC1(X)|cB23(X)|cA23(X).
% 2.03/2.21 0 [] -cC1(X)|cB18(X)|cA18(X).
% 2.03/2.21 0 [] -cC1(X)|cB10(X)|cA10(X).
% 2.03/2.21 0 [] -cC1(X)|cB2(X)|cA2(X).
% 2.03/2.21 0 [] -cC1(X)|cA16(X)|cB16(X).
% 2.03/2.21 0 [] -cC1(X)|cB0(X)|cA0(X).
% 2.03/2.21 0 [] -cC1(X)|cB31(X)|cA31(X).
% 2.03/2.21 0 [] -cC1(X)|cB9(X)|cA9(X).
% 2.03/2.21 0 [] -cC1(X)|cB6(X)|cA6(X).
% 2.03/2.21 0 [] -cC1(X)|cB24(X)|cA24(X).
% 2.03/2.21 0 [] -cC1(X)|cB15(X)|cA15(X).
% 2.03/2.21 0 [] -cC2(X)| -cB(X)|cA(X).
% 2.03/2.21 0 [] -cC2(X)|cB(X)|cA(X).
% 2.03/2.21 0 [] -cC3(X)| -cB(X)| -cA(X).
% 2.03/2.21 0 [] -cC3(X)|cB(X)| -cA(X).
% 2.03/2.21 0 [] -cC4(X)|rR(X,$f1(X)).
% 2.03/2.21 0 [] -cC4(X)|cC2($f1(X)).
% 2.03/2.21 0 [] -cC5(X)| -rR(X,Y)|cC3(Y).
% 2.03/2.21 0 [] -cTEST(X)|cC4(X).
% 2.03/2.21 0 [] -cTEST(X)|cC1(X).
% 2.03/2.21 0 [] -cTEST(X)|cC5(X).
% 2.03/2.21 0 [] cTEST(i2003_11_14_17_19_57994).
% 2.03/2.21 end_of_list.
% 2.03/2.21
% 2.03/2.21 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 2.03/2.21
% 2.03/2.21 This is a non-Horn set without equality. The strategy will
% 2.03/2.21 be ordered hyper_res, unit deletion, and factoring, with
% 2.03/2.21 satellites in sos and with nuclei in usable.
% 2.03/2.21
% 2.03/2.21 dependent: set(hyper_res).
% 2.03/2.21 dependent: set(factor).
% 2.03/2.21 dependent: set(unit_deletion).
% 2.03/2.21
% 2.03/2.21 ------------> process usable:
% 2.03/2.21 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 2.03/2.21 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 3 [] -cC1(A)|cB5(A)|cA5(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 4 [] -cC1(A)|cB13(A)|cA13(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 5 [] -cC1(A)|cA1(A)|cB1(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 6 [] -cC1(A)|cA27(A)|cB27(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 7 [] -cC1(A)|cA4(A)|cB4(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 8 [] -cC1(A)|cB12(A)|cA12(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 9 [] -cC1(A)|cB30(A)|cA30(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 10 [] -cC1(A)|cA20(A)|cB20(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 11 [] -cC1(A)|cB14(A)|cA14(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 12 [] -cC1(A)|cB28(A)|cA28(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 13 [] -cC1(A)|cA3(A)|cB3(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 14 [] -cC1(A)|cB7(A)|cA7(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 15 [] -cC1(A)|cB21(A)|cA21(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 16 [] -cC1(A)|cB22(A)|cA22(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 17 [] -cC1(A)|cB17(A)|cA17(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 18 [] -cC1(A)|cB11(A)|cA11(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 19 [] -cC1(A)|cB19(A)|cA19(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 20 [] -cC1(A)|cA8(A)|cB8(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 21 [] -cC1(A)|cA26(A)|cB26(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 22 [] -cC1(A)|cA25(A)|cB25(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 23 [] -cC1(A)|cA29(A)|cB29(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 24 [] -cC1(A)|cB23(A)|cA23(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 25 [] -cC1(A)|cB18(A)|cA18(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 26 [] -cC1(A)|cB10(A)|cA10(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 27 [] -cC1(A)|cB2(A)|cA2(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 28 [] -cC1(A)|cA16(A)|cB16(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 29 [] -cC1(A)|cB0(A)|cA0(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 30 [] -cC1(A)|cB31(A)|cA31(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 31 [] -cC1(A)|cB9(A)|cA9(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 32 [] -cC1(A)|cB6(A)|cA6(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 33 [] -cC1(A)|cB24(A)|cA24(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 34 [] -cC1(A)|cB15(A)|cA15(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 35 [] -cC2(A)| -cB(A)|cA(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 36 [] -cC2(A)|cB(A)|cA(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 37 [] -cC3(A)| -cB(A)| -cA(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 38 [] -cC3(A)|cB(A)| -cA(A).
% 2.03/2.21 ** KEPT (pick-wt=6): 39 [] -cC4(A)|rR(A,$f1(A)).
% 2.03/2.21 ** KEPT (pick-wt=5): 40 [] -cC4(A)|cC2($f1(A)).
% 2.03/2.21 ** KEPT (pick-wt=7): 41 [] -cC5(A)| -rR(A,B)|cC3(B).
% 2.03/2.21 ** KEPT (pick-wt=4): 42 [] -cTEST(A)|cC4(A).
% 2.03/2.21 ** KEPT (pick-wt=4): 43 [] -cTEST(A)|cC1(A).
% 2.03/2.21 ** KEPT (pick-wt=4): 44 [] -cTEST(A)|cC5(A).
% 2.03/2.21
% 2.03/2.21 ------------> process sos:
% 2.03/2.21 ** KEPT (pick-wt=2): 45 [] cowlThing(A).
% 2.03/2.21 ** KEPT (pick-wt=4): 46 [] xsd_string(A)|xsd_integer(A).
% 2.03/2.21 ** KEPT (pick-wt=2): 47 [] cTEST(i2003_11_14_17_19_57994).
% 2.03/2.21
% 2.03/2.21 ======= end of input processing =======
% 2.03/2.21
% 2.03/2.21 =========== start of search ===========
% 2.03/2.21
% 2.03/2.21 -------- PROOF --------
% 2.03/2.21
% 2.03/2.21 -----> EMPTY CLAUSE at 0.00 sec ----> 89 [hyper,88,37,86,87] $F.
% 2.03/2.21
% 2.03/2.21 Length of proof is 8. Level of proof is 5.
% 2.03/2.21
% 2.03/2.21 ---------------- PROOF ----------------
% 2.03/2.21 % SZS status Theorem
% 2.03/2.21 % SZS output start Refutation
% See solution above
% 2.03/2.21 ------------ end of proof -------------
% 2.03/2.21
% 2.03/2.21
% 2.03/2.21 Search stopped by max_proofs option.
% 2.03/2.21
% 2.03/2.21
% 2.03/2.21 Search stopped by max_proofs option.
% 2.03/2.21
% 2.03/2.21 ============ end of search ============
% 2.03/2.21
% 2.03/2.21 -------------- statistics -------------
% 2.03/2.21 clauses given 44
% 2.03/2.21 clauses generated 42
% 2.03/2.21 clauses kept 88
% 2.03/2.21 clauses forward subsumed 0
% 2.03/2.21 clauses back subsumed 1
% 2.03/2.21 Kbytes malloced 1953
% 2.03/2.21
% 2.03/2.21 ----------- times (seconds) -----------
% 2.03/2.21 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.03/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.03/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.03/2.21
% 2.03/2.21 That finishes the proof of the theorem.
% 2.03/2.21
% 2.03/2.21 Process 27210 finished Wed Jul 27 03:27:25 2022
% 2.03/2.21 Otter interrupted
% 2.03/2.21 PROOF FOUND
%------------------------------------------------------------------------------