TSTP Solution File: KRS015-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:00:58 EDT 2022
% Result : Unsatisfiable 1.99s 2.13s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 36 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( t2least(A)
| ~ c(A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ t2least(A)
| ~ e_qualish(u1r2(A),u1r1(A)) ),
file('KRS015-1.p',unknown),
[] ).
cnf(4,axiom,
( t(A,u1r1(A))
| ~ t2least(A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(5,axiom,
( t(A,u1r2(A))
| ~ t2least(A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(7,axiom,
( t1most(A)
| ~ d(A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(9,axiom,
( e_qualish(A,B)
| ~ t1most(C)
| ~ t(C,A)
| ~ t(C,B) ),
file('KRS015-1.p',unknown),
[] ).
cnf(11,axiom,
( r(A,u4r4(A))
| ~ e(A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(12,axiom,
( s(A,B)
| ~ e(A)
| ~ r(A,B) ),
file('KRS015-1.p',unknown),
[] ).
cnf(14,axiom,
( d(A)
| ~ e(B)
| ~ s(B,A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(15,axiom,
( c(A)
| ~ e(B)
| ~ r(B,A) ),
file('KRS015-1.p',unknown),
[] ).
cnf(30,axiom,
e(exist),
file('KRS015-1.p',unknown),
[] ).
cnf(33,plain,
r(exist,u4r4(exist)),
inference(hyper,[status(thm)],[30,11]),
[iquote('hyper,30,11')] ).
cnf(34,plain,
c(u4r4(exist)),
inference(hyper,[status(thm)],[33,15,30]),
[iquote('hyper,33,15,30')] ).
cnf(35,plain,
s(exist,u4r4(exist)),
inference(hyper,[status(thm)],[33,12,30]),
[iquote('hyper,33,12,30')] ).
cnf(36,plain,
t2least(u4r4(exist)),
inference(hyper,[status(thm)],[34,1]),
[iquote('hyper,34,1')] ).
cnf(37,plain,
t(u4r4(exist),u1r2(u4r4(exist))),
inference(hyper,[status(thm)],[36,5]),
[iquote('hyper,36,5')] ).
cnf(38,plain,
t(u4r4(exist),u1r1(u4r4(exist))),
inference(hyper,[status(thm)],[36,4]),
[iquote('hyper,36,4')] ).
cnf(39,plain,
d(u4r4(exist)),
inference(hyper,[status(thm)],[35,14,30]),
[iquote('hyper,35,14,30')] ).
cnf(41,plain,
t1most(u4r4(exist)),
inference(hyper,[status(thm)],[39,7]),
[iquote('hyper,39,7')] ).
cnf(45,plain,
e_qualish(u1r2(u4r4(exist)),u1r1(u4r4(exist))),
inference(hyper,[status(thm)],[38,9,41,37]),
[iquote('hyper,38,9,41,37')] ).
cnf(47,plain,
$false,
inference(hyper,[status(thm)],[45,3,36]),
[iquote('hyper,45,3,36')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jul 27 03:27:08 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.99/2.13 ----- Otter 3.3f, August 2004 -----
% 1.99/2.13 The process was started by sandbox2 on n020.cluster.edu,
% 1.99/2.13 Wed Jul 27 03:27:08 2022
% 1.99/2.13 The command was "./otter". The process ID is 25627.
% 1.99/2.13
% 1.99/2.13 set(prolog_style_variables).
% 1.99/2.13 set(auto).
% 1.99/2.13 dependent: set(auto1).
% 1.99/2.13 dependent: set(process_input).
% 1.99/2.13 dependent: clear(print_kept).
% 1.99/2.13 dependent: clear(print_new_demod).
% 1.99/2.13 dependent: clear(print_back_demod).
% 1.99/2.13 dependent: clear(print_back_sub).
% 1.99/2.13 dependent: set(control_memory).
% 1.99/2.13 dependent: assign(max_mem, 12000).
% 1.99/2.13 dependent: assign(pick_given_ratio, 4).
% 1.99/2.13 dependent: assign(stats_level, 1).
% 1.99/2.13 dependent: assign(max_seconds, 10800).
% 1.99/2.13 clear(print_given).
% 1.99/2.13
% 1.99/2.13 list(usable).
% 1.99/2.13 0 [] e(exist).
% 1.99/2.13 0 [] t2least(X1)| -c(X1).
% 1.99/2.13 0 [] c(X1)| -t2least(X1).
% 1.99/2.13 0 [] -t2least(X1)| -e_qualish(u1r2(X1),u1r1(X1)).
% 1.99/2.13 0 [] t(X1,u1r1(X1))| -t2least(X1).
% 1.99/2.13 0 [] t(X1,u1r2(X1))| -t2least(X1).
% 1.99/2.13 0 [] t2least(X1)|e_qualish(X3,X2)| -t(X1,X3)| -t(X1,X2).
% 1.99/2.13 0 [] t1most(X1)| -d(X1).
% 1.99/2.13 0 [] d(X1)| -t1most(X1).
% 1.99/2.13 0 [] e_qualish(X3,X2)| -t1most(X1)| -t(X1,X3)| -t(X1,X2).
% 1.99/2.13 0 [] t1most(X1)| -e_qualish(u3r2(X1),u3r1(X1)).
% 1.99/2.13 0 [] t1most(X1)|t(X1,u3r1(X1)).
% 1.99/2.13 0 [] t1most(X1)|t(X1,u3r2(X1)).
% 1.99/2.13 0 [] r(X1,u4r4(X1))| -e(X1).
% 1.99/2.13 0 [] s(X1,X4)| -e(X1)| -r(X1,X4).
% 1.99/2.13 0 [] r(X1,X4)| -e(X1)| -s(X1,X4).
% 1.99/2.13 0 [] d(X3)| -e(X1)| -s(X1,X3).
% 1.99/2.13 0 [] c(X2)| -e(X1)| -r(X1,X2).
% 1.99/2.13 0 [] e(X1)|s(X1,u4r3(X1))|r(X1,u4r3(X1))| -c(u4r1(X1))| -d(u4r2(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)| -c(u4r1(X1))| -d(u4r2(X1))| -r(X1,u4r3(X1))| -s(X1,u4r3(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|s(X1,u4r2(X1))|s(X1,u4r3(X1))|r(X1,u4r3(X1))| -c(u4r1(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|s(X1,u4r2(X1))| -c(u4r1(X1))| -r(X1,u4r3(X1))| -s(X1,u4r3(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|r(X1,u4r1(X1))|s(X1,u4r3(X1))|r(X1,u4r3(X1))| -d(u4r2(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|r(X1,u4r1(X1))| -d(u4r2(X1))| -r(X1,u4r3(X1))| -s(X1,u4r3(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|r(X1,u4r1(X1))|s(X1,u4r2(X1))|s(X1,u4r3(X1))|r(X1,u4r3(X1))| -r(X1,X5).
% 1.99/2.13 0 [] e(X1)|r(X1,u4r1(X1))|s(X1,u4r2(X1))| -r(X1,u4r3(X1))| -s(X1,u4r3(X1))| -r(X1,X5).
% 1.99/2.13 end_of_list.
% 1.99/2.13
% 1.99/2.13 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.99/2.13
% 1.99/2.13 This is a non-Horn set without equality. The strategy will
% 1.99/2.13 be ordered hyper_res, unit deletion, and factoring, with
% 1.99/2.13 satellites in sos and with nuclei in usable.
% 1.99/2.13
% 1.99/2.13 dependent: set(hyper_res).
% 1.99/2.13 dependent: set(factor).
% 1.99/2.13 dependent: set(unit_deletion).
% 1.99/2.13
% 1.99/2.13 ------------> process usable:
% 1.99/2.13 ** KEPT (pick-wt=4): 1 [] t2least(A)| -c(A).
% 1.99/2.13 ** KEPT (pick-wt=4): 2 [] c(A)| -t2least(A).
% 1.99/2.13 ** KEPT (pick-wt=7): 3 [] -t2least(A)| -e_qualish(u1r2(A),u1r1(A)).
% 1.99/2.13 ** KEPT (pick-wt=6): 4 [] t(A,u1r1(A))| -t2least(A).
% 1.99/2.13 ** KEPT (pick-wt=6): 5 [] t(A,u1r2(A))| -t2least(A).
% 1.99/2.13 ** KEPT (pick-wt=11): 6 [] t2least(A)|e_qualish(B,C)| -t(A,B)| -t(A,C).
% 1.99/2.13 ** KEPT (pick-wt=4): 7 [] t1most(A)| -d(A).
% 1.99/2.13 ** KEPT (pick-wt=4): 8 [] d(A)| -t1most(A).
% 1.99/2.13 ** KEPT (pick-wt=11): 9 [] e_qualish(A,B)| -t1most(C)| -t(C,A)| -t(C,B).
% 1.99/2.13 ** KEPT (pick-wt=7): 10 [] t1most(A)| -e_qualish(u3r2(A),u3r1(A)).
% 1.99/2.13 ** KEPT (pick-wt=6): 11 [] r(A,u4r4(A))| -e(A).
% 1.99/2.13 ** KEPT (pick-wt=8): 12 [] s(A,B)| -e(A)| -r(A,B).
% 1.99/2.13 ** KEPT (pick-wt=8): 13 [] r(A,B)| -e(A)| -s(A,B).
% 1.99/2.13 ** KEPT (pick-wt=7): 14 [] d(A)| -e(B)| -s(B,A).
% 1.99/2.13 ** KEPT (pick-wt=7): 15 [] c(A)| -e(B)| -r(B,A).
% 1.99/2.13 ** KEPT (pick-wt=19): 16 [] e(A)|s(A,u4r3(A))|r(A,u4r3(A))| -c(u4r1(A))| -d(u4r2(A))| -r(A,B).
% 1.99/2.13 ** KEPT (pick-wt=16): 18 [copy,17,factor_simp] e(A)| -c(u4r1(A))| -d(u4r2(A))| -r(A,u4r3(A))| -s(A,u4r3(A)).
% 1.99/2.13 ** KEPT (pick-wt=20): 19 [] e(A)|s(A,u4r2(A))|s(A,u4r3(A))|r(A,u4r3(A))| -c(u4r1(A))| -r(A,B).
% 1.99/2.13 ** KEPT (pick-wt=17): 21 [copy,20,factor_simp] e(A)|s(A,u4r2(A))| -c(u4r1(A))| -r(A,u4r3(A))| -s(A,u4r3(A)).
% 1.99/2.13 ** KEPT (pick-wt=20): 22 [] e(A)|r(A,u4r1(A))|s(A,u4r3(A))|r(A,u4r3(A))| -d(u4r2(A))| -r(A,B).
% 1.99/2.13 ** KEPT (pick-wt=17): 24 [copy,23,factor_simp] e(A)|r(A,u4r1(A))| -d(u4r2(A))| -r(A,u4r3(A))| -s(A,u4r3(A)).
% 1.99/2.13 ** KEPT (pick-wt=21): 25 [] e(A)|r(A,u4r1(A))|s(A,u4r2(A))|s(A,u4r3(A))|r(A,u4r3(A))| -r(A,B).
% 1.99/2.13 ** KEPT (pick-wt=18): 27 [copy,26,factor_simp] e(A)|r(A,u4r1(A))|s(A,u4r2(A))| -r(A,u4r3(A))| -s(A,u4r3(A)).
% 1.99/2.13
% 1.99/2.13 ------------> process sos:
% 1.99/2.13 ** KEPT (pick-wt=2): 30 [] e(exist).
% 1.99/2.13 ** KEPT (pick-wt=6): 31 [] t1most(A)|t(A,u3r1(A)).
% 1.99/2.13 ** KEPT (pick-wt=6): 32 [] t1most(A)|t(A,u3r2(A)).
% 1.99/2.13
% 1.99/2.13 ======= end of input processing =======
% 1.99/2.13
% 1.99/2.13 =========== start of search ===========
% 1.99/2.13
% 1.99/2.13 -------- PROOF --------
% 1.99/2.13
% 1.99/2.13 -----> EMPTY CLAUSE at 0.00 sec ----> 47 [hyper,45,3,36] $F.
% 1.99/2.13
% 1.99/2.13 Length of proof is 9. Level of proof is 5.
% 1.99/2.13
% 1.99/2.13 ---------------- PROOF ----------------
% 1.99/2.13 % SZS status Unsatisfiable
% 1.99/2.13 % SZS output start Refutation
% See solution above
% 1.99/2.13 ------------ end of proof -------------
% 1.99/2.13
% 1.99/2.13
% 1.99/2.13 Search stopped by max_proofs option.
% 1.99/2.13
% 1.99/2.13
% 1.99/2.13 Search stopped by max_proofs option.
% 1.99/2.13
% 1.99/2.13 ============ end of search ============
% 1.99/2.13
% 1.99/2.13 -------------- statistics -------------
% 1.99/2.13 clauses given 16
% 1.99/2.13 clauses generated 53
% 1.99/2.13 clauses kept 42
% 1.99/2.13 clauses forward subsumed 36
% 1.99/2.13 clauses back subsumed 0
% 1.99/2.13 Kbytes malloced 976
% 1.99/2.13
% 1.99/2.13 ----------- times (seconds) -----------
% 1.99/2.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.99/2.13
% 1.99/2.13 That finishes the proof of the theorem.
% 1.99/2.13
% 1.99/2.13 Process 25627 finished Wed Jul 27 03:27:10 2022
% 1.99/2.13 Otter interrupted
% 1.99/2.13 PROOF FOUND
%------------------------------------------------------------------------------