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