TSTP Solution File: KRS100+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS100+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:08 EDT 2022
% Result : Unsatisfiable 1.70s 1.91s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 5 unt; 0 nHn; 9 RR)
% Number of literals : 16 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 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,B)
| ce(B)
| ~ cd(B) ),
file('KRS100+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cUnsatisfiable(A)
| ~ rr(A,B)
| cd(B) ),
file('KRS100+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ cUnsatisfiable(A)
| rr(A,dollar_f1(A)) ),
file('KRS100+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cUnsatisfiable(A)
| ~ ce(dollar_f1(A)) ),
file('KRS100+1.p',unknown),
[] ).
cnf(16,axiom,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('KRS100+1.p',unknown),
[] ).
cnf(17,plain,
rr(i2003_11_14_17_20_32704,dollar_f1(i2003_11_14_17_20_32704)),
inference(hyper,[status(thm)],[16,5]),
[iquote('hyper,16,5')] ).
cnf(18,plain,
cd(dollar_f1(i2003_11_14_17_20_32704)),
inference(hyper,[status(thm)],[17,4,16]),
[iquote('hyper,17,4,16')] ).
cnf(19,plain,
ce(dollar_f1(i2003_11_14_17_20_32704)),
inference(hyper,[status(thm)],[18,3,16,17]),
[iquote('hyper,18,3,16,17')] ).
cnf(20,plain,
$false,
inference(hyper,[status(thm)],[19,6,16]),
[iquote('hyper,19,6,16')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS100+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 03:23:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.70/1.91 ----- Otter 3.3f, August 2004 -----
% 1.70/1.91 The process was started by sandbox2 on n010.cluster.edu,
% 1.70/1.91 Wed Jul 27 03:23:10 2022
% 1.70/1.91 The command was "./otter". The process ID is 12315.
% 1.70/1.91
% 1.70/1.91 set(prolog_style_variables).
% 1.70/1.91 set(auto).
% 1.70/1.91 dependent: set(auto1).
% 1.70/1.91 dependent: set(process_input).
% 1.70/1.91 dependent: clear(print_kept).
% 1.70/1.91 dependent: clear(print_new_demod).
% 1.70/1.91 dependent: clear(print_back_demod).
% 1.70/1.91 dependent: clear(print_back_sub).
% 1.70/1.91 dependent: set(control_memory).
% 1.70/1.91 dependent: assign(max_mem, 12000).
% 1.70/1.91 dependent: assign(pick_given_ratio, 4).
% 1.70/1.91 dependent: assign(stats_level, 1).
% 1.70/1.91 dependent: assign(max_seconds, 10800).
% 1.70/1.91 clear(print_given).
% 1.70/1.91
% 1.70/1.91 formula_list(usable).
% 1.70/1.91 all X (cowlThing(X)& -cowlNothing(X)).
% 1.70/1.91 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.70/1.91 all X (cUnsatisfiable(X)<-> (all Y (rr(X,Y)->ce(Y)| -cd(Y)))& (all Y (rr(X,Y)->cd(Y)))& (exists Y (rr(X,Y)& -ce(Y)))).
% 1.70/1.91 all X (cc(X)-> -cd(X)).
% 1.70/1.91 cUnsatisfiable(i2003_11_14_17_20_32704).
% 1.70/1.91 end_of_list.
% 1.70/1.91
% 1.70/1.91 -------> usable clausifies to:
% 1.70/1.91
% 1.70/1.91 list(usable).
% 1.70/1.91 0 [] cowlThing(X).
% 1.70/1.91 0 [] -cowlNothing(X).
% 1.70/1.91 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.70/1.91 0 [] xsd_string(X)|xsd_integer(X).
% 1.70/1.91 0 [] -cUnsatisfiable(X)| -rr(X,Y)|ce(Y)| -cd(Y).
% 1.70/1.91 0 [] -cUnsatisfiable(X)| -rr(X,X1)|cd(X1).
% 1.70/1.91 0 [] -cUnsatisfiable(X)|rr(X,$f1(X)).
% 1.70/1.91 0 [] -cUnsatisfiable(X)| -ce($f1(X)).
% 1.70/1.91 0 [] cUnsatisfiable(X)|rr(X,$f2(X))|rr(X,$f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] cUnsatisfiable(X)|rr(X,$f2(X))| -cd($f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] cUnsatisfiable(X)| -ce($f2(X))|rr(X,$f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] cUnsatisfiable(X)| -ce($f2(X))| -cd($f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] cUnsatisfiable(X)|cd($f2(X))|rr(X,$f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] cUnsatisfiable(X)|cd($f2(X))| -cd($f3(X))| -rr(X,X2)|ce(X2).
% 1.70/1.91 0 [] -cc(X)| -cd(X).
% 1.70/1.91 0 [] cUnsatisfiable(i2003_11_14_17_20_32704).
% 1.70/1.91 end_of_list.
% 1.70/1.91
% 1.70/1.91 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.70/1.91
% 1.70/1.91 This is a non-Horn set without equality. The strategy will
% 1.70/1.91 be ordered hyper_res, unit deletion, and factoring, with
% 1.70/1.91 satellites in sos and with nuclei in usable.
% 1.70/1.91
% 1.70/1.91 dependent: set(hyper_res).
% 1.70/1.91 dependent: set(factor).
% 1.70/1.91 dependent: set(unit_deletion).
% 1.70/1.91
% 1.70/1.91 ------------> process usable:
% 1.70/1.91 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.70/1.91 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.70/1.91 ** KEPT (pick-wt=9): 3 [] -cUnsatisfiable(A)| -rr(A,B)|ce(B)| -cd(B).
% 1.70/1.91 ** KEPT (pick-wt=7): 4 [] -cUnsatisfiable(A)| -rr(A,B)|cd(B).
% 1.70/1.91 ** KEPT (pick-wt=6): 5 [] -cUnsatisfiable(A)|rr(A,$f1(A)).
% 1.70/1.91 ** KEPT (pick-wt=5): 6 [] -cUnsatisfiable(A)| -ce($f1(A)).
% 1.70/1.91 ** KEPT (pick-wt=15): 7 [] cUnsatisfiable(A)|rr(A,$f2(A))|rr(A,$f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=14): 8 [] cUnsatisfiable(A)|rr(A,$f2(A))| -cd($f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=14): 9 [] cUnsatisfiable(A)| -ce($f2(A))|rr(A,$f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=13): 10 [] cUnsatisfiable(A)| -ce($f2(A))| -cd($f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=14): 11 [] cUnsatisfiable(A)|cd($f2(A))|rr(A,$f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=13): 12 [] cUnsatisfiable(A)|cd($f2(A))| -cd($f3(A))| -rr(A,B)|ce(B).
% 1.70/1.91 ** KEPT (pick-wt=4): 13 [] -cc(A)| -cd(A).
% 1.70/1.91
% 1.70/1.91 ------------> process sos:
% 1.70/1.91 ** KEPT (pick-wt=2): 14 [] cowlThing(A).
% 1.70/1.91 ** KEPT (pick-wt=4): 15 [] xsd_string(A)|xsd_integer(A).
% 1.70/1.91 ** KEPT (pick-wt=2): 16 [] cUnsatisfiable(i2003_11_14_17_20_32704).
% 1.70/1.91
% 1.70/1.91 ======= end of input processing =======
% 1.70/1.91
% 1.70/1.91 =========== start of search ===========
% 1.70/1.91
% 1.70/1.91 -------- PROOF --------
% 1.70/1.91
% 1.70/1.91 -----> EMPTY CLAUSE at 0.00 sec ----> 20 [hyper,19,6,16] $F.
% 1.70/1.91
% 1.70/1.91 Length of proof is 3. Level of proof is 3.
% 1.70/1.91
% 1.70/1.91 ---------------- PROOF ----------------
% 1.70/1.91 % SZS status Theorem
% 1.70/1.91 % SZS output start Refutation
% See solution above
% 1.70/1.91 ------------ end of proof -------------
% 1.70/1.91
% 1.70/1.91
% 1.70/1.91 Search stopped by max_proofs option.
% 1.70/1.91
% 1.70/1.91
% 1.70/1.91 Search stopped by max_proofs option.
% 1.70/1.91
% 1.70/1.91 ============ end of search ============
% 1.70/1.91
% 1.70/1.91 -------------- statistics -------------
% 1.70/1.91 clauses given 6
% 1.70/1.91 clauses generated 6
% 1.70/1.91 clauses kept 19
% 1.70/1.91 clauses forward subsumed 2
% 1.70/1.91 clauses back subsumed 0
% 1.70/1.91 Kbytes malloced 976
% 1.70/1.91
% 1.70/1.91 ----------- times (seconds) -----------
% 1.70/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.91
% 1.70/1.91 That finishes the proof of the theorem.
% 1.70/1.91
% 1.70/1.91 Process 12315 finished Wed Jul 27 03:23:11 2022
% 1.70/1.91 Otter interrupted
% 1.70/1.91 PROOF FOUND
%------------------------------------------------------------------------------