TSTP Solution File: KRS160+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS160+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:28 EDT 2022
% Result : Theorem 1.93s 2.13s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 18 ( 10 unt; 3 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 30 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ cowlNothing(A),
file('KRS160+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ xsd_string(A)
| ~ xsd_integer(A) ),
file('KRS160+1.p',unknown),
[] ).
cnf(5,axiom,
( cC10(A)
| ~ cC4(A)
| ~ cC2(A) ),
file('KRS160+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ cTEST(A)
| cC12(A) ),
file('KRS160+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
file('KRS160+1.p',unknown),
[] ).
cnf(29,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[28]),1]),
[iquote('copy,28,unit_del,1')] ).
cnf(30,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
file('KRS160+1.p',unknown),
[] ).
cnf(31,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[30]),1]),
[iquote('copy,30,unit_del,1')] ).
cnf(32,axiom,
cowlThing(A),
file('KRS160+1.p',unknown),
[] ).
cnf(33,axiom,
( xsd_string(A)
| xsd_integer(A) ),
file('KRS160+1.p',unknown),
[] ).
cnf(37,axiom,
cTEST(iV21080),
file('KRS160+1.p',unknown),
[] ).
cnf(40,axiom,
cC4(iV21081),
file('KRS160+1.p',unknown),
[] ).
cnf(42,axiom,
cC2(iV21081),
file('KRS160+1.p',unknown),
[] ).
cnf(43,plain,
cC12(iV21080),
inference(hyper,[status(thm)],[37,25]),
[iquote('hyper,37,25')] ).
cnf(45,plain,
cC10(iV21081),
inference(hyper,[status(thm)],[42,5,40]),
[iquote('hyper,42,5,40')] ).
cnf(48,plain,
xsd_integer(dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[45,31,32,33,32,43,32])]),
[iquote('hyper,45,31,32,33,32,43,32,factor_simp')] ).
cnf(49,plain,
xsd_string(dollar_c2),
inference(hyper,[status(thm)],[48,29,32,32,43,45,32]),
[iquote('hyper,48,29,32,32,43,45,32')] ).
cnf(50,plain,
$false,
inference(hyper,[status(thm)],[49,2,48]),
[iquote('hyper,49,2,48')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS160+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n011.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:22:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.93/2.13 ----- Otter 3.3f, August 2004 -----
% 1.93/2.13 The process was started by sandbox on n011.cluster.edu,
% 1.93/2.13 Wed Jul 27 03:22:25 2022
% 1.93/2.13 The command was "./otter". The process ID is 22793.
% 1.93/2.13
% 1.93/2.13 set(prolog_style_variables).
% 1.93/2.13 set(auto).
% 1.93/2.13 dependent: set(auto1).
% 1.93/2.13 dependent: set(process_input).
% 1.93/2.13 dependent: clear(print_kept).
% 1.93/2.13 dependent: clear(print_new_demod).
% 1.93/2.13 dependent: clear(print_back_demod).
% 1.93/2.13 dependent: clear(print_back_sub).
% 1.93/2.13 dependent: set(control_memory).
% 1.93/2.13 dependent: assign(max_mem, 12000).
% 1.93/2.13 dependent: assign(pick_given_ratio, 4).
% 1.93/2.13 dependent: assign(stats_level, 1).
% 1.93/2.13 dependent: assign(max_seconds, 10800).
% 1.93/2.13 clear(print_given).
% 1.93/2.13
% 1.93/2.13 formula_list(usable).
% 1.93/2.13 all X (cowlThing(X)& -cowlNothing(X)).
% 1.93/2.13 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.93/2.13 all X (cC10(X)<->cC4(X)&cC2(X)).
% 1.93/2.13 all X (cC12(X)<-> (exists Y (rR1(X,Y)&cC10(Y)))).
% 1.93/2.13 all X (cC2(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.93/2.13 all X (cC2xcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.93/2.13 all X (cC6(X)<->cC2xcomp(X)&cC4(X)).
% 1.93/2.13 all X (cC6(X)<-> -(exists Y ra_Px4(X,Y))).
% 1.93/2.13 all X (cC6xcomp(X)<-> (exists Y0 ra_Px4(X,Y0))).
% 1.93/2.13 all X (cC8(X)<-> (exists Y0 ra_Px2(X,Y0))).
% 1.93/2.13 all X (cC8(X)<-> (exists Y (rR1(X,Y)&cC6(Y)))).
% 1.93/2.13 all X (cC8xcomp(X)<-> -(exists Y ra_Px2(X,Y))).
% 1.93/2.13 all X (cTEST(X)<->cC8xcomp(X)&cC12(X)).
% 1.93/2.13 cTEST(iV21080).
% 1.93/2.13 cC8xcomp(iV21080).
% 1.93/2.13 cowlThing(iV21080).
% 1.93/2.13 all X (rR1(iV21080,X)->cC6xcomp(X)).
% 1.93/2.13 rR1(iV21080,iV21081).
% 1.93/2.13 cC4(iV21081).
% 1.93/2.13 cC6xcomp(iV21081).
% 1.93/2.13 cC2(iV21081).
% 1.93/2.13 cowlThing(iV21081).
% 1.93/2.13 -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))&cowlThing(iV21080)&cC12(iV21080)&cC10(iV21081)&cowlThing(iV21081)).
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 -------> usable clausifies to:
% 1.93/2.13
% 1.93/2.13 list(usable).
% 1.93/2.13 0 [] cowlThing(X).
% 1.93/2.13 0 [] -cowlNothing(X).
% 1.93/2.13 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.93/2.13 0 [] xsd_string(X)|xsd_integer(X).
% 1.93/2.13 0 [] -cC10(X)|cC4(X).
% 1.93/2.13 0 [] -cC10(X)|cC2(X).
% 1.93/2.13 0 [] cC10(X)| -cC4(X)| -cC2(X).
% 1.93/2.13 0 [] -cC12(X)|rR1(X,$f1(X)).
% 1.93/2.13 0 [] -cC12(X)|cC10($f1(X)).
% 1.93/2.13 0 [] cC12(X)| -rR1(X,Y)| -cC10(Y).
% 1.93/2.13 0 [] -cC2(X)| -ra_Px1(X,Y).
% 1.93/2.13 0 [] cC2(X)|ra_Px1(X,$f2(X)).
% 1.93/2.13 0 [] -cC2xcomp(X)|ra_Px1(X,$f3(X)).
% 1.93/2.13 0 [] cC2xcomp(X)| -ra_Px1(X,Y0).
% 1.93/2.13 0 [] -cC6(X)|cC2xcomp(X).
% 1.93/2.13 0 [] -cC6(X)|cC4(X).
% 1.93/2.13 0 [] cC6(X)| -cC2xcomp(X)| -cC4(X).
% 1.93/2.13 0 [] -cC6(X)| -ra_Px4(X,Y).
% 1.93/2.13 0 [] cC6(X)|ra_Px4(X,$f4(X)).
% 1.93/2.13 0 [] -cC6xcomp(X)|ra_Px4(X,$f5(X)).
% 1.93/2.13 0 [] cC6xcomp(X)| -ra_Px4(X,Y0).
% 1.93/2.13 0 [] -cC8(X)|ra_Px2(X,$f6(X)).
% 1.93/2.13 0 [] cC8(X)| -ra_Px2(X,Y0).
% 1.93/2.13 0 [] -cC8(X)|rR1(X,$f7(X)).
% 1.93/2.13 0 [] -cC8(X)|cC6($f7(X)).
% 1.93/2.13 0 [] cC8(X)| -rR1(X,Y)| -cC6(Y).
% 1.93/2.13 0 [] -cC8xcomp(X)| -ra_Px2(X,Y).
% 1.93/2.13 0 [] cC8xcomp(X)|ra_Px2(X,$f8(X)).
% 1.93/2.13 0 [] -cTEST(X)|cC8xcomp(X).
% 1.93/2.13 0 [] -cTEST(X)|cC12(X).
% 1.93/2.13 0 [] cTEST(X)| -cC8xcomp(X)| -cC12(X).
% 1.93/2.13 0 [] cTEST(iV21080).
% 1.93/2.13 0 [] cC8xcomp(iV21080).
% 1.93/2.13 0 [] cowlThing(iV21080).
% 1.93/2.13 0 [] -rR1(iV21080,X)|cC6xcomp(X).
% 1.93/2.13 0 [] rR1(iV21080,iV21081).
% 1.93/2.13 0 [] cC4(iV21081).
% 1.93/2.13 0 [] cC6xcomp(iV21081).
% 1.93/2.13 0 [] cC2(iV21081).
% 1.93/2.13 0 [] cowlThing(iV21081).
% 1.93/2.13 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 1.93/2.13 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 1.93/2.13
% 1.93/2.13 This is a non-Horn set without equality. The strategy will
% 1.93/2.13 be ordered hyper_res, unit deletion, and factoring, with
% 1.93/2.13 satellites in sos and with nuclei in usable.
% 1.93/2.13
% 1.93/2.13 dependent: set(hyper_res).
% 1.93/2.13 dependent: set(factor).
% 1.93/2.13 dependent: set(unit_deletion).
% 1.93/2.13
% 1.93/2.13 ------------> process usable:
% 1.93/2.13 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 3 [] -cC10(A)|cC4(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 4 [] -cC10(A)|cC2(A).
% 1.93/2.13 ** KEPT (pick-wt=6): 5 [] cC10(A)| -cC4(A)| -cC2(A).
% 1.93/2.13 ** KEPT (pick-wt=6): 6 [] -cC12(A)|rR1(A,$f1(A)).
% 1.93/2.13 ** KEPT (pick-wt=5): 7 [] -cC12(A)|cC10($f1(A)).
% 1.93/2.13 ** KEPT (pick-wt=7): 8 [] cC12(A)| -rR1(A,B)| -cC10(B).
% 1.93/2.13 ** KEPT (pick-wt=5): 9 [] -cC2(A)| -ra_Px1(A,B).
% 1.93/2.13 ** KEPT (pick-wt=6): 10 [] -cC2xcomp(A)|ra_Px1(A,$f3(A)).
% 1.93/2.13 ** KEPT (pick-wt=5): 11 [] cC2xcomp(A)| -ra_Px1(A,B).
% 1.93/2.13 ** KEPT (pick-wt=4): 12 [] -cC6(A)|cC2xcomp(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 13 [] -cC6(A)|cC4(A).
% 1.93/2.13 ** KEPT (pick-wt=6): 14 [] cC6(A)| -cC2xcomp(A)| -cC4(A).
% 1.93/2.13 ** KEPT (pick-wt=5): 15 [] -cC6(A)| -ra_Px4(A,B).
% 1.93/2.13 ** KEPT (pick-wt=6): 16 [] -cC6xcomp(A)|ra_Px4(A,$f5(A)).
% 1.93/2.13 ** KEPT (pick-wt=5): 17 [] cC6xcomp(A)| -ra_Px4(A,B).
% 1.93/2.13 ** KEPT (pick-wt=6): 18 [] -cC8(A)|ra_Px2(A,$f6(A)).
% 1.93/2.13 ** KEPT (pick-wt=5): 19 [] cC8(A)| -ra_Px2(A,B).
% 1.93/2.13 ** KEPT (pick-wt=6): 20 [] -cC8(A)|rR1(A,$f7(A)).
% 1.93/2.13 ** KEPT (pick-wt=5): 21 [] -cC8(A)|cC6($f7(A)).
% 1.93/2.13 ** KEPT (pick-wt=7): 22 [] cC8(A)| -rR1(A,B)| -cC6(B).
% 1.93/2.13 ** KEPT (pick-wt=5): 23 [] -cC8xcomp(A)| -ra_Px2(A,B).
% 1.93/2.13 ** KEPT (pick-wt=4): 24 [] -cTEST(A)|cC8xcomp(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 25 [] -cTEST(A)|cC12(A).
% 1.93/2.13 ** KEPT (pick-wt=6): 26 [] cTEST(A)| -cC8xcomp(A)| -cC12(A).
% 1.93/2.13 ** KEPT (pick-wt=5): 27 [] -rR1(iV21080,A)|cC6xcomp(A).
% 1.93/2.13 ** KEPT (pick-wt=14): 29 [copy,28,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 1.93/2.13 ** KEPT (pick-wt=14): 31 [copy,30,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 1.93/2.13
% 1.93/2.13 ------------> process sos:
% 1.93/2.13 ** KEPT (pick-wt=2): 32 [] cowlThing(A).
% 1.93/2.13 ** KEPT (pick-wt=4): 33 [] xsd_string(A)|xsd_integer(A).
% 1.93/2.13 ** KEPT (pick-wt=6): 34 [] cC2(A)|ra_Px1(A,$f2(A)).
% 1.93/2.13 ** KEPT (pick-wt=6): 35 [] cC6(A)|ra_Px4(A,$f4(A)).
% 1.93/2.13 ** KEPT (pick-wt=6): 36 [] cC8xcomp(A)|ra_Px2(A,$f8(A)).
% 1.93/2.13 ** KEPT (pick-wt=2): 37 [] cTEST(iV21080).
% 1.93/2.13 ** KEPT (pick-wt=2): 38 [] cC8xcomp(iV21080).
% 1.93/2.13 Following clause subsumed by 32 during input processing: 0 [] cowlThing(iV21080).
% 1.93/2.13 ** KEPT (pick-wt=3): 39 [] rR1(iV21080,iV21081).
% 1.93/2.13 ** KEPT (pick-wt=2): 40 [] cC4(iV21081).
% 1.93/2.13 ** KEPT (pick-wt=2): 41 [] cC6xcomp(iV21081).
% 1.93/2.13 ** KEPT (pick-wt=2): 42 [] cC2(iV21081).
% 1.93/2.13 Following clause subsumed by 32 during input processing: 0 [] cowlThing(iV21081).
% 1.93/2.13
% 1.93/2.13 ======= end of input processing =======
% 1.93/2.13
% 1.93/2.13 =========== start of search ===========
% 1.93/2.13
% 1.93/2.13 -------- PROOF --------
% 1.93/2.13
% 1.93/2.13 -----> EMPTY CLAUSE at 0.00 sec ----> 50 [hyper,49,2,48] $F.
% 1.93/2.13
% 1.93/2.13 Length of proof is 6. Level of proof is 3.
% 1.93/2.13
% 1.93/2.13 ---------------- PROOF ----------------
% 1.93/2.13 % SZS status Theorem
% 1.93/2.13 % SZS output start Refutation
% See solution above
% 1.93/2.13 ------------ end of proof -------------
% 1.93/2.13
% 1.93/2.13
% 1.93/2.13 Search stopped by max_proofs option.
% 1.93/2.13
% 1.93/2.13
% 1.93/2.13 Search stopped by max_proofs option.
% 1.93/2.13
% 1.93/2.13 ============ end of search ============
% 1.93/2.13
% 1.93/2.13 -------------- statistics -------------
% 1.93/2.13 clauses given 12
% 1.93/2.13 clauses generated 14
% 1.93/2.13 clauses kept 47
% 1.93/2.13 clauses forward subsumed 8
% 1.93/2.13 clauses back subsumed 2
% 1.93/2.13 Kbytes malloced 976
% 1.93/2.13
% 1.93/2.13 ----------- times (seconds) -----------
% 1.93/2.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.13
% 1.93/2.13 That finishes the proof of the theorem.
% 1.93/2.13
% 1.93/2.13 Process 22793 finished Wed Jul 27 03:22:27 2022
% 1.93/2.13 Otter interrupted
% 1.93/2.13 PROOF FOUND
%------------------------------------------------------------------------------