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