%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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.70s 1.89s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 6 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ a(exists),
file('KRS017-1.p',unknown),
[] ).
cnf(2,axiom,
( r(A,u0r3(A))
| ~ e(A) ),
file('KRS017-1.p',unknown),
[] ).
cnf(3,axiom,
( a(A)
| ~ e(B)
| ~ r(B,C)
| ~ r(A,C) ),
file('KRS017-1.p',unknown),
[] ).
cnf(7,plain,
( a(A)
| ~ e(A)
| ~ r(A,B) ),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.3.4')] ).
cnf(8,axiom,
e(exists),
file('KRS017-1.p',unknown),
[] ).
cnf(9,plain,
r(exists,u0r3(exists)),
inference(hyper,[status(thm)],[8,2]),
[iquote('hyper,8,2')] ).
cnf(10,plain,
a(exists),
inference(hyper,[status(thm)],[9,7,8]),
[iquote('hyper,9,7,8')] ).
cnf(11,plain,
$false,
inference(binary,[status(thm)],[10,1]),
[iquote('binary,10.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% 0.05/0.11 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n021.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:25:38 EDT 2022
% 0.11/0.32 % CPUTime :
% 1.70/1.89 ----- Otter 3.3f, August 2004 -----
% 1.70/1.89 The process was started by sandbox2 on n021.cluster.edu,
% 1.70/1.89 Wed Jul 27 03:25:38 2022
% 1.70/1.89 The command was "./otter". The process ID is 9840.
% 1.70/1.89
% 1.70/1.89 set(prolog_style_variables).
% 1.70/1.89 set(auto).
% 1.70/1.89 dependent: set(auto1).
% 1.70/1.89 dependent: set(process_input).
% 1.70/1.89 dependent: clear(print_kept).
% 1.70/1.89 dependent: clear(print_new_demod).
% 1.70/1.89 dependent: clear(print_back_demod).
% 1.70/1.89 dependent: clear(print_back_sub).
% 1.70/1.89 dependent: set(control_memory).
% 1.70/1.89 dependent: assign(max_mem, 12000).
% 1.70/1.89 dependent: assign(pick_given_ratio, 4).
% 1.70/1.89 dependent: assign(stats_level, 1).
% 1.70/1.89 dependent: assign(max_seconds, 10800).
% 1.70/1.89 clear(print_given).
% 1.70/1.89
% 1.70/1.89 list(usable).
% 1.70/1.89 0 [] e(exists).
% 1.70/1.89 0 [] -a(exists).
% 1.70/1.89 0 [] r(X1,u0r3(X1))| -e(X1).
% 1.70/1.89 0 [] a(X3)| -e(X1)| -r(X1,X2)| -r(X3,X2).
% 1.70/1.89 0 [] e(X1)| -a(u0r2(X1))| -r(X1,X4).
% 1.70/1.89 0 [] e(X1)|r(u0r2(X1),u0r1(X1))| -r(X1,X4).
% 1.70/1.89 0 [] e(X1)|r(X1,u0r1(X1))| -r(X1,X4).
% 1.70/1.89 end_of_list.
% 1.70/1.89
% 1.70/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.70/1.89
% 1.70/1.89 This is a non-Horn set without equality. The strategy will
% 1.70/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.70/1.89 satellites in sos and with nuclei in usable.
% 1.70/1.89
% 1.70/1.89 dependent: set(hyper_res).
% 1.70/1.89 dependent: set(factor).
% 1.70/1.89 dependent: set(unit_deletion).
% 1.70/1.89
% 1.70/1.89 ------------> process usable:
% 1.70/1.89 ** KEPT (pick-wt=2): 1 [] -a(exists).
% 1.70/1.89 ** KEPT (pick-wt=6): 2 [] r(A,u0r3(A))| -e(A).
% 1.70/1.89 ** KEPT (pick-wt=10): 3 [] a(A)| -e(B)| -r(B,C)| -r(A,C).
% 1.70/1.89 ** KEPT (pick-wt=8): 4 [] e(A)| -a(u0r2(A))| -r(A,B).
% 1.70/1.89 ** KEPT (pick-wt=10): 5 [] e(A)|r(u0r2(A),u0r1(A))| -r(A,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 6 [] e(A)|r(A,u0r1(A))| -r(A,B).
% 1.70/1.89
% 1.70/1.89 ------------> process sos:
% 1.70/1.89 ** KEPT (pick-wt=2): 8 [] e(exists).
% 1.70/1.89
% 1.70/1.89 ======= end of input processing =======
% 1.70/1.89
% 1.70/1.89 =========== start of search ===========
% 1.70/1.89
% 1.70/1.89 -------- PROOF --------
% 1.70/1.89
% 1.70/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 11 [binary,10.1,1.1] $F.
% 1.70/1.89
% 1.70/1.89 Length of proof is 3. Level of proof is 2.
% 1.70/1.89
% 1.70/1.89 ---------------- PROOF ----------------
% 1.70/1.89 % SZS status Unsatisfiable
% 1.70/1.89 % SZS output start Refutation
% See solution above
% 1.70/1.89 ------------ end of proof -------------
% 1.70/1.89
% 1.70/1.89
% 1.70/1.89 Search stopped by max_proofs option.
% 1.70/1.89
% 1.70/1.89
% 1.70/1.89 Search stopped by max_proofs option.
% 1.70/1.89
% 1.70/1.89 ============ end of search ============
% 1.70/1.89
% 1.70/1.89 -------------- statistics -------------
% 1.70/1.89 clauses given 2
% 1.70/1.89 clauses generated 3
% 1.70/1.89 clauses kept 10
% 1.70/1.89 clauses forward subsumed 0
% 1.70/1.89 clauses back subsumed 0
% 1.70/1.89 Kbytes malloced 976
% 1.70/1.89
% 1.70/1.89 ----------- times (seconds) -----------
% 1.70/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.89
% 1.70/1.89 That finishes the proof of the theorem.
% 1.70/1.89
% 1.70/1.89 Process 9840 finished Wed Jul 27 03:25:39 2022
% 1.70/1.89 Otter interrupted
% 1.70/1.89 PROOF FOUND
%------------------------------------------------------------------------------