TSTP Solution File: KRS068+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS068+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:03 EDT 2022
% Result : Unsatisfiable 1.54s 1.78s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 1 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 6 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)
| cc(A) ),
file('KRS068+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cUnsatisfiable(A)
| ~ cd(A) ),
file('KRS068+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ cc(A)
| ~ rr(A,B)
| cc(B) ),
file('KRS068+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cc(dollar_f1(A))
| cd(A) ),
file('KRS068+1.p',unknown),
[] ).
cnf(9,axiom,
cUnsatisfiable(i2003_11_14_17_18_23845),
file('KRS068+1.p',unknown),
[] ).
cnf(10,axiom,
( rr(A,dollar_f1(A))
| cd(A) ),
file('KRS068+1.p',unknown),
[] ).
cnf(11,plain,
cc(i2003_11_14_17_18_23845),
inference(hyper,[status(thm)],[9,3]),
[iquote('hyper,9,3')] ).
cnf(12,plain,
rr(i2003_11_14_17_18_23845,dollar_f1(i2003_11_14_17_18_23845)),
inference(hyper,[status(thm)],[10,4,9]),
[iquote('hyper,10,4,9')] ).
cnf(13,plain,
cc(dollar_f1(i2003_11_14_17_18_23845)),
inference(hyper,[status(thm)],[12,5,11]),
[iquote('hyper,12,5,11')] ).
cnf(14,plain,
cd(i2003_11_14_17_18_23845),
inference(hyper,[status(thm)],[13,6]),
[iquote('hyper,13,6')] ).
cnf(15,plain,
$false,
inference(hyper,[status(thm)],[14,4,9]),
[iquote('hyper,14,4,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS068+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:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.54/1.78 ----- Otter 3.3f, August 2004 -----
% 1.54/1.78 The process was started by sandbox2 on n019.cluster.edu,
% 1.54/1.78 Wed Jul 27 03:32:07 2022
% 1.54/1.78 The command was "./otter". The process ID is 6927.
% 1.54/1.78
% 1.54/1.78 set(prolog_style_variables).
% 1.54/1.78 set(auto).
% 1.54/1.78 dependent: set(auto1).
% 1.54/1.78 dependent: set(process_input).
% 1.54/1.78 dependent: clear(print_kept).
% 1.54/1.78 dependent: clear(print_new_demod).
% 1.54/1.78 dependent: clear(print_back_demod).
% 1.54/1.78 dependent: clear(print_back_sub).
% 1.54/1.78 dependent: set(control_memory).
% 1.54/1.78 dependent: assign(max_mem, 12000).
% 1.54/1.78 dependent: assign(pick_given_ratio, 4).
% 1.54/1.78 dependent: assign(stats_level, 1).
% 1.54/1.78 dependent: assign(max_seconds, 10800).
% 1.54/1.78 clear(print_given).
% 1.54/1.78
% 1.54/1.78 formula_list(usable).
% 1.54/1.78 all X (cowlThing(X)& -cowlNothing(X)).
% 1.54/1.78 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.54/1.78 all X (cUnsatisfiable(X)->cc(X)).
% 1.54/1.78 all X (cUnsatisfiable(X)-> -cd(X)).
% 1.54/1.78 all X (cc(X)-> (all Y (rr(X,Y)->cc(Y)))).
% 1.54/1.78 cUnsatisfiable(i2003_11_14_17_18_23845).
% 1.54/1.78 all X ((all Y (rr(X,Y)->cc(Y)))->cd(X)).
% 1.54/1.78 end_of_list.
% 1.54/1.78
% 1.54/1.78 -------> usable clausifies to:
% 1.54/1.78
% 1.54/1.78 list(usable).
% 1.54/1.78 0 [] cowlThing(X).
% 1.54/1.78 0 [] -cowlNothing(X).
% 1.54/1.78 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.54/1.78 0 [] xsd_string(X)|xsd_integer(X).
% 1.54/1.78 0 [] -cUnsatisfiable(X)|cc(X).
% 1.54/1.78 0 [] -cUnsatisfiable(X)| -cd(X).
% 1.54/1.78 0 [] -cc(X)| -rr(X,Y)|cc(Y).
% 1.54/1.78 0 [] cUnsatisfiable(i2003_11_14_17_18_23845).
% 1.54/1.78 0 [] rr(X,$f1(X))|cd(X).
% 1.54/1.78 0 [] -cc($f1(X))|cd(X).
% 1.54/1.78 end_of_list.
% 1.54/1.78
% 1.54/1.78 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.54/1.78
% 1.54/1.78 This is a non-Horn set without equality. The strategy will
% 1.54/1.78 be ordered hyper_res, unit deletion, and factoring, with
% 1.54/1.78 satellites in sos and with nuclei in usable.
% 1.54/1.78
% 1.54/1.78 dependent: set(hyper_res).
% 1.54/1.78 dependent: set(factor).
% 1.54/1.78 dependent: set(unit_deletion).
% 1.54/1.78
% 1.54/1.78 ------------> process usable:
% 1.54/1.78 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.54/1.78 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.54/1.78 ** KEPT (pick-wt=4): 3 [] -cUnsatisfiable(A)|cc(A).
% 1.54/1.78 ** KEPT (pick-wt=4): 4 [] -cUnsatisfiable(A)| -cd(A).
% 1.54/1.78 ** KEPT (pick-wt=7): 5 [] -cc(A)| -rr(A,B)|cc(B).
% 1.54/1.78 ** KEPT (pick-wt=5): 6 [] -cc($f1(A))|cd(A).
% 1.54/1.78
% 1.54/1.78 ------------> process sos:
% 1.54/1.78 ** KEPT (pick-wt=2): 7 [] cowlThing(A).
% 1.54/1.78 ** KEPT (pick-wt=4): 8 [] xsd_string(A)|xsd_integer(A).
% 1.54/1.78 ** KEPT (pick-wt=2): 9 [] cUnsatisfiable(i2003_11_14_17_18_23845).
% 1.54/1.78 ** KEPT (pick-wt=6): 10 [] rr(A,$f1(A))|cd(A).
% 1.54/1.78
% 1.54/1.78 ======= end of input processing =======
% 1.54/1.78
% 1.54/1.78 =========== start of search ===========
% 1.54/1.78
% 1.54/1.78 -------- PROOF --------
% 1.54/1.78
% 1.54/1.78 -----> EMPTY CLAUSE at 0.00 sec ----> 15 [hyper,14,4,9] $F.
% 1.54/1.78
% 1.54/1.78 Length of proof is 4. Level of proof is 3.
% 1.54/1.78
% 1.54/1.78 ---------------- PROOF ----------------
% 1.54/1.78 % SZS status Theorem
% 1.54/1.78 % SZS output start Refutation
% See solution above
% 1.54/1.78 ------------ end of proof -------------
% 1.54/1.78
% 1.54/1.78
% 1.54/1.78 Search stopped by max_proofs option.
% 1.54/1.78
% 1.54/1.78
% 1.54/1.78 Search stopped by max_proofs option.
% 1.54/1.78
% 1.54/1.78 ============ end of search ============
% 1.54/1.78
% 1.54/1.78 -------------- statistics -------------
% 1.54/1.78 clauses given 8
% 1.54/1.78 clauses generated 5
% 1.54/1.78 clauses kept 14
% 1.54/1.78 clauses forward subsumed 0
% 1.54/1.78 clauses back subsumed 0
% 1.54/1.78 Kbytes malloced 976
% 1.54/1.78
% 1.54/1.78 ----------- times (seconds) -----------
% 1.54/1.78 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.54/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.54/1.78 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.54/1.78
% 1.54/1.78 That finishes the proof of the theorem.
% 1.54/1.78
% 1.54/1.78 Process 6927 finished Wed Jul 27 03:32:08 2022
% 1.54/1.78 Otter interrupted
% 1.54/1.78 PROOF FOUND
%------------------------------------------------------------------------------