TSTP Solution File: KRS012-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS012-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:57 EDT 2022
% Result : Unsatisfiable 1.98s 2.16s
% Output : Refutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 7 unt; 1 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 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(1,axiom,
~ f(exists),
file('KRS012-1.p',unknown),
[] ).
cnf(2,axiom,
( e(A)
| ~ c(B)
| ~ r(B,A)
| ~ d(A) ),
file('KRS012-1.p',unknown),
[] ).
cnf(3,axiom,
( d(A)
| ~ c(B)
| ~ r(B,A) ),
file('KRS012-1.p',unknown),
[] ).
cnf(9,axiom,
( f(A)
| ~ e(u1r1(A)) ),
file('KRS012-1.p',unknown),
[] ).
cnf(10,axiom,
c(exists),
file('KRS012-1.p',unknown),
[] ).
cnf(13,axiom,
( f(A)
| r(A,u1r1(A)) ),
file('KRS012-1.p',unknown),
[] ).
cnf(14,plain,
r(exists,u1r1(exists)),
inference(hyper,[status(thm)],[13,1]),
[iquote('hyper,13,1')] ).
cnf(15,plain,
d(u1r1(exists)),
inference(hyper,[status(thm)],[14,3,10]),
[iquote('hyper,14,3,10')] ).
cnf(16,plain,
e(u1r1(exists)),
inference(hyper,[status(thm)],[15,2,10,14]),
[iquote('hyper,15,2,10,14')] ).
cnf(17,plain,
f(exists),
inference(hyper,[status(thm)],[16,9]),
[iquote('hyper,16,9')] ).
cnf(18,plain,
$false,
inference(binary,[status(thm)],[17,1]),
[iquote('binary,17.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:27:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.98/2.16 ----- Otter 3.3f, August 2004 -----
% 1.98/2.16 The process was started by sandbox2 on n020.cluster.edu,
% 1.98/2.16 Wed Jul 27 03:27:38 2022
% 1.98/2.16 The command was "./otter". The process ID is 29181.
% 1.98/2.16
% 1.98/2.16 set(prolog_style_variables).
% 1.98/2.16 set(auto).
% 1.98/2.16 dependent: set(auto1).
% 1.98/2.16 dependent: set(process_input).
% 1.98/2.16 dependent: clear(print_kept).
% 1.98/2.16 dependent: clear(print_new_demod).
% 1.98/2.16 dependent: clear(print_back_demod).
% 1.98/2.16 dependent: clear(print_back_sub).
% 1.98/2.16 dependent: set(control_memory).
% 1.98/2.16 dependent: assign(max_mem, 12000).
% 1.98/2.16 dependent: assign(pick_given_ratio, 4).
% 1.98/2.16 dependent: assign(stats_level, 1).
% 1.98/2.16 dependent: assign(max_seconds, 10800).
% 1.98/2.16 clear(print_given).
% 1.98/2.16
% 1.98/2.16 list(usable).
% 1.98/2.16 0 [] c(exists).
% 1.98/2.16 0 [] -f(exists).
% 1.98/2.16 0 [] e(X3)| -c(X1)| -r(X1,X3)| -d(X3).
% 1.98/2.16 0 [] d(X2)| -c(X1)| -r(X1,X2).
% 1.98/2.16 0 [] c(X1)| -d(u0r1(X1))| -e(u0r2(X1)).
% 1.98/2.16 0 [] c(X1)|d(u0r2(X1))| -d(u0r1(X1)).
% 1.98/2.16 0 [] c(X1)|r(X1,u0r2(X1))| -d(u0r1(X1)).
% 1.98/2.16 0 [] c(X1)|r(X1,u0r1(X1))| -e(u0r2(X1)).
% 1.98/2.16 0 [] c(X1)|r(X1,u0r1(X1))|d(u0r2(X1)).
% 1.98/2.16 0 [] c(X1)|r(X1,u0r1(X1))|r(X1,u0r2(X1)).
% 1.98/2.16 0 [] e(X2)| -f(X1)| -r(X1,X2).
% 1.98/2.16 0 [] f(X1)| -e(u1r1(X1)).
% 1.98/2.16 0 [] f(X1)|r(X1,u1r1(X1)).
% 1.98/2.16 end_of_list.
% 1.98/2.16
% 1.98/2.16 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.98/2.16
% 1.98/2.16 This is a non-Horn set without equality. The strategy will
% 1.98/2.16 be ordered hyper_res, unit deletion, and factoring, with
% 1.98/2.16 satellites in sos and with nuclei in usable.
% 1.98/2.16
% 1.98/2.16 dependent: set(hyper_res).
% 1.98/2.16 dependent: set(factor).
% 1.98/2.16 dependent: set(unit_deletion).
% 1.98/2.16
% 1.98/2.16 ------------> process usable:
% 1.98/2.16 ** KEPT (pick-wt=2): 1 [] -f(exists).
% 1.98/2.16 ** KEPT (pick-wt=9): 2 [] e(A)| -c(B)| -r(B,A)| -d(A).
% 1.98/2.16 ** KEPT (pick-wt=7): 3 [] d(A)| -c(B)| -r(B,A).
% 1.98/2.16 ** KEPT (pick-wt=8): 4 [] c(A)| -d(u0r1(A))| -e(u0r2(A)).
% 1.98/2.16 ** KEPT (pick-wt=8): 5 [] c(A)|d(u0r2(A))| -d(u0r1(A)).
% 1.98/2.16 ** KEPT (pick-wt=9): 6 [] c(A)|r(A,u0r2(A))| -d(u0r1(A)).
% 1.98/2.16 ** KEPT (pick-wt=9): 7 [] c(A)|r(A,u0r1(A))| -e(u0r2(A)).
% 1.98/2.16 ** KEPT (pick-wt=7): 8 [] e(A)| -f(B)| -r(B,A).
% 1.98/2.16 ** KEPT (pick-wt=5): 9 [] f(A)| -e(u1r1(A)).
% 1.98/2.16
% 1.98/2.16 ------------> process sos:
% 1.98/2.16 ** KEPT (pick-wt=2): 10 [] c(exists).
% 1.98/2.16 ** KEPT (pick-wt=9): 11 [] c(A)|r(A,u0r1(A))|d(u0r2(A)).
% 1.98/2.16 ** KEPT (pick-wt=10): 12 [] c(A)|r(A,u0r1(A))|r(A,u0r2(A)).
% 1.98/2.16 ** KEPT (pick-wt=6): 13 [] f(A)|r(A,u1r1(A)).
% 1.98/2.16
% 1.98/2.16 ======= end of input processing =======
% 1.98/2.16
% 1.98/2.16 =========== start of search ===========
% 1.98/2.16
% 1.98/2.16 -------- PROOF --------
% 1.98/2.16
% 1.98/2.16 ----> UNIT CONFLICT at 0.00 sec ----> 18 [binary,17.1,1.1] $F.
% 1.98/2.16
% 1.98/2.16 Length of proof is 4. Level of proof is 4.
% 1.98/2.16
% 1.98/2.16 ---------------- PROOF ----------------
% 1.98/2.16 % SZS status Unsatisfiable
% 1.98/2.16 % SZS output start Refutation
% See solution above
% 1.98/2.16 ------------ end of proof -------------
% 1.98/2.16
% 1.98/2.16
% 1.98/2.16 Search stopped by max_proofs option.
% 1.98/2.16
% 1.98/2.16
% 1.98/2.16 Search stopped by max_proofs option.
% 1.98/2.16
% 1.98/2.16 ============ end of search ============
% 1.98/2.16
% 1.98/2.16 -------------- statistics -------------
% 1.98/2.16 clauses given 5
% 1.98/2.16 clauses generated 5
% 1.98/2.16 clauses kept 17
% 1.98/2.16 clauses forward subsumed 1
% 1.98/2.16 clauses back subsumed 0
% 1.98/2.16 Kbytes malloced 976
% 1.98/2.16
% 1.98/2.16 ----------- times (seconds) -----------
% 1.98/2.16 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.98/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.98/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.98/2.16
% 1.98/2.16 That finishes the proof of the theorem.
% 1.98/2.16
% 1.98/2.16 Process 29181 finished Wed Jul 27 03:27:40 2022
% 1.98/2.16 Otter interrupted
% 1.98/2.16 PROOF FOUND
%------------------------------------------------------------------------------