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