%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:03 EDT 2022
% Result : Unsatisfiable 1.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 4 unt; 6 nHn; 13 RR)
% Number of literals : 25 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ cUnsatisfiable(A)
| cc(A)
| cb(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cUnsatisfiable(A)
| cc(A)
| ca(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ cUnsatisfiable(A)
| cb(A)
| ca(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ ca(A)
| ~ cc(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ ca(A)
| ~ cb(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cb(A)
| ~ cc(A) ),
file('KRS067+1.p',unknown),
[] ).
cnf(14,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('KRS067+1.p',unknown),
[] ).
cnf(15,plain,
( cb(i2003_11_14_17_18_1956)
| ca(i2003_11_14_17_18_1956) ),
inference(hyper,[status(thm)],[14,5]),
[iquote('hyper,14,5')] ).
cnf(16,plain,
( cc(i2003_11_14_17_18_1956)
| ca(i2003_11_14_17_18_1956) ),
inference(hyper,[status(thm)],[14,4]),
[iquote('hyper,14,4')] ).
cnf(17,plain,
( cc(i2003_11_14_17_18_1956)
| cb(i2003_11_14_17_18_1956) ),
inference(hyper,[status(thm)],[14,3]),
[iquote('hyper,14,3')] ).
cnf(18,plain,
ca(i2003_11_14_17_18_1956),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[16,11,15])]),
[iquote('hyper,16,11,15,factor_simp')] ).
cnf(19,plain,
cb(i2003_11_14_17_18_1956),
inference(hyper,[status(thm)],[18,9,17]),
[iquote('hyper,18,9,17')] ).
cnf(20,plain,
$false,
inference(hyper,[status(thm)],[19,10,18]),
[iquote('hyper,19,10,18')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:33:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox on n022.cluster.edu,
% 1.68/1.89 Wed Jul 27 03:33:50 2022
% 1.68/1.89 The command was "./otter". The process ID is 30523.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 formula_list(usable).
% 1.68/1.89 all X (cowlThing(X)& -cowlNothing(X)).
% 1.68/1.89 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.68/1.89 all X (cUnsatisfiable(X)<->cc(X)&cb(X)|cb(X)&ca(X)|cc(X)&ca(X)).
% 1.68/1.89 all X (ca(X)-> -(cc(X)|cb(X))).
% 1.68/1.89 all X (cb(X)-> -cc(X)).
% 1.68/1.89 cUnsatisfiable(i2003_11_14_17_18_1956).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 -------> usable clausifies to:
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] cowlThing(X).
% 1.68/1.89 0 [] -cowlNothing(X).
% 1.68/1.89 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.68/1.89 0 [] xsd_string(X)|xsd_integer(X).
% 1.68/1.89 0 [] -cUnsatisfiable(X)|cc(X)|cb(X).
% 1.68/1.89 0 [] -cUnsatisfiable(X)|cc(X)|ca(X).
% 1.68/1.89 0 [] -cUnsatisfiable(X)|cb(X)|ca(X).
% 1.68/1.89 0 [] cUnsatisfiable(X)| -cc(X)| -cb(X).
% 1.68/1.89 0 [] cUnsatisfiable(X)| -cb(X)| -ca(X).
% 1.68/1.89 0 [] cUnsatisfiable(X)| -cc(X)| -ca(X).
% 1.68/1.89 0 [] -ca(X)| -cc(X).
% 1.68/1.89 0 [] -ca(X)| -cb(X).
% 1.68/1.89 0 [] -cb(X)| -cc(X).
% 1.68/1.89 0 [] cUnsatisfiable(i2003_11_14_17_18_1956).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.68/1.89
% 1.68/1.89 This is a non-Horn set without equality. The strategy will
% 1.68/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/1.89 satellites in sos and with nuclei in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: set(factor).
% 1.68/1.89 dependent: set(unit_deletion).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.68/1.89 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 3 [] -cUnsatisfiable(A)|cc(A)|cb(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 4 [] -cUnsatisfiable(A)|cc(A)|ca(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 5 [] -cUnsatisfiable(A)|cb(A)|ca(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 6 [] cUnsatisfiable(A)| -cc(A)| -cb(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 7 [] cUnsatisfiable(A)| -cb(A)| -ca(A).
% 1.68/1.89 ** KEPT (pick-wt=6): 8 [] cUnsatisfiable(A)| -cc(A)| -ca(A).
% 1.68/1.89 ** KEPT (pick-wt=4): 9 [] -ca(A)| -cc(A).
% 1.68/1.89 ** KEPT (pick-wt=4): 10 [] -ca(A)| -cb(A).
% 1.68/1.89 ** KEPT (pick-wt=4): 11 [] -cb(A)| -cc(A).
% 1.68/1.89 9 back subsumes 8.
% 1.68/1.89 10 back subsumes 7.
% 1.68/1.89 11 back subsumes 6.
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=2): 12 [] cowlThing(A).
% 1.68/1.89 ** KEPT (pick-wt=4): 13 [] xsd_string(A)|xsd_integer(A).
% 1.68/1.89 ** KEPT (pick-wt=2): 14 [] cUnsatisfiable(i2003_11_14_17_18_1956).
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 -----> EMPTY CLAUSE at 0.00 sec ----> 20 [hyper,19,10,18] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 5. Level of proof is 3.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Theorem
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 8
% 1.68/1.89 clauses generated 6
% 1.68/1.89 clauses kept 19
% 1.68/1.89 clauses forward subsumed 0
% 1.68/1.89 clauses back subsumed 6
% 1.68/1.89 Kbytes malloced 976
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 30523 finished Wed Jul 27 03:33:52 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------