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