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