%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:20:15 EDT 2022
% Result : Theorem 2.41s 2.59s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 1 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ p(A)
| ~ p(B)
| ~ p(C)
| p(enc(enc(i(tmk),B),enc(i(tc),A))) ),
file('SWV237+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ p(A)
| ~ p(B)
| ~ p(C)
| p(enc(tc,A)) ),
file('SWV237+1.p',unknown),
[] ).
cnf(14,axiom,
~ p(enc(pp,a)),
file('SWV237+1.p',unknown),
[] ).
cnf(17,axiom,
enc(i(A),enc(A,B)) = B,
file('SWV237+1.p',unknown),
[] ).
cnf(22,axiom,
p(enc(tmk,pp)),
file('SWV237+1.p',unknown),
[] ).
cnf(29,axiom,
p(a),
file('SWV237+1.p',unknown),
[] ).
cnf(64,plain,
p(enc(tc,a)),
inference(hyper,[status(thm)],[29,7,29,29]),
[iquote('hyper,29,7,29,29')] ).
cnf(8255,plain,
p(enc(pp,a)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[64,6,64,22]),17,17]),
[iquote('hyper,64,6,64,22,demod,17,17')] ).
cnf(8256,plain,
$false,
inference(binary,[status(thm)],[8255,14]),
[iquote('binary,8255.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 06:18:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 2.02/2.20 ----- Otter 3.3f, August 2004 -----
% 2.02/2.20 The process was started by sandbox2 on n006.cluster.edu,
% 2.02/2.20 Wed Jul 27 06:18:17 2022
% 2.02/2.20 The command was "./otter". The process ID is 2738.
% 2.02/2.20
% 2.02/2.20 set(prolog_style_variables).
% 2.02/2.20 set(auto).
% 2.02/2.20 dependent: set(auto1).
% 2.02/2.20 dependent: set(process_input).
% 2.02/2.20 dependent: clear(print_kept).
% 2.02/2.20 dependent: clear(print_new_demod).
% 2.02/2.20 dependent: clear(print_back_demod).
% 2.02/2.20 dependent: clear(print_back_sub).
% 2.02/2.20 dependent: set(control_memory).
% 2.02/2.20 dependent: assign(max_mem, 12000).
% 2.02/2.20 dependent: assign(pick_given_ratio, 4).
% 2.02/2.20 dependent: assign(stats_level, 1).
% 2.02/2.20 dependent: assign(max_seconds, 10800).
% 2.02/2.20 clear(print_given).
% 2.02/2.20
% 2.02/2.20 formula_list(usable).
% 2.02/2.20 all A (A=A).
% 2.02/2.20 all U V (enc(i(U),enc(U,V))=V).
% 2.02/2.20 all U V (enc(U,enc(i(U),V))=V).
% 2.02/2.20 all U (i(i(U))=U).
% 2.02/2.20 all U (p(U)->p(i(U))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(tmk,enc(i(enc(i(zcmk),V)),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(i(enc(i(zcmk),V)),enc(i(tmk),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(wk,enc(i(tmk),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tmk),V),enc(i(tmk),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tmk),V),enc(i(tc),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(tc,U))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tc),U),V))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(i(enc(i(tc),U)),V))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),W),enc(i(enc(i(tmk),V)),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),W),enc(i(enc(i(wk),V)),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),V),enc(i(lp),U)))).
% 2.02/2.20 all U V W (p(U)&p(V)&p(W)->p(enc(U,V))).
% 2.02/2.20 p(enc(tmk,pp)).
% 2.02/2.20 p(enc(wk,w)).
% 2.02/2.20 p(enc(w,t1)).
% 2.02/2.20 p(enc(lp,t2)).
% 2.02/2.20 p(enc(tc,k)).
% 2.02/2.20 p(kk).
% 2.02/2.20 p(i(kk)).
% 2.02/2.20 p(a).
% 2.02/2.20 -p(enc(pp,a)).
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 -------> usable clausifies to:
% 2.02/2.20
% 2.02/2.20 list(usable).
% 2.02/2.20 0 [] A=A.
% 2.02/2.20 0 [] enc(i(U),enc(U,V))=V.
% 2.02/2.20 0 [] enc(U,enc(i(U),V))=V.
% 2.02/2.20 0 [] i(i(U))=U.
% 2.02/2.20 0 [] -p(U)|p(i(U)).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(tmk,enc(i(enc(i(zcmk),V)),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(i(enc(i(zcmk),V)),enc(i(tmk),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(wk,enc(i(tmk),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tmk),V),enc(i(tmk),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tmk),V),enc(i(tc),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(tc,U)).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tc),U),V)).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(i(enc(i(tc),U)),V)).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),W),enc(i(enc(i(tmk),V)),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),W),enc(i(enc(i(wk),V)),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),V),enc(i(lp),U))).
% 2.02/2.20 0 [] -p(U)| -p(V)| -p(W)|p(enc(U,V)).
% 2.02/2.20 0 [] p(enc(tmk,pp)).
% 2.02/2.20 0 [] p(enc(wk,w)).
% 2.02/2.20 0 [] p(enc(w,t1)).
% 2.02/2.20 0 [] p(enc(lp,t2)).
% 2.02/2.20 0 [] p(enc(tc,k)).
% 2.02/2.20 0 [] p(kk).
% 2.02/2.20 0 [] p(i(kk)).
% 2.02/2.20 0 [] p(a).
% 2.02/2.20 0 [] -p(enc(pp,a)).
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 2.02/2.20
% 2.02/2.20 This is a Horn set with equality. The strategy will be
% 2.02/2.20 Knuth-Bendix and hyper_res, with positive clauses in
% 2.02/2.20 sos and nonpositive clauses in usable.
% 2.02/2.20
% 2.02/2.20 dependent: set(knuth_bendix).
% 2.02/2.20 dependent: set(anl_eq).
% 2.02/2.20 dependent: set(para_from).
% 2.02/2.20 dependent: set(para_into).
% 2.02/2.20 dependent: clear(para_from_right).
% 2.02/2.20 dependent: clear(para_into_right).
% 2.02/2.20 dependent: set(para_from_vars).
% 2.02/2.20 dependent: set(eq_units_both_ways).
% 2.02/2.20 dependent: set(dynamic_demod_all).
% 2.02/2.20 dependent: set(dynamic_demod).
% 2.02/2.20 dependent: set(order_eq).
% 2.02/2.20 dependent: set(back_demod).
% 2.02/2.20 dependent: set(lrpo).
% 2.02/2.20 dependent: set(hyper_res).
% 2.02/2.20 dependent: clear(order_hyper).
% 2.02/2.20
% 2.02/2.20 ------------> process usable:
% 2.02/2.20 ** KEPT (pick-wt=5): 1 [] -p(A)|p(i(A)).
% 2.02/2.20 ** KEPT (pick-wt=16): 2 [] -p(A)| -p(B)| -p(C)|p(enc(tmk,enc(i(enc(i(zcmk),B)),A))).
% 2.02/2.20 ** KEPT (pick-wt=17): 3 [] -p(A)| -p(B)| -p(C)|p(enc(i(enc(i(zcmk),B)),enc(i(tmk),A))).
% 2.02/2.20 ** KEPT (pick-wt=13): 4 [] -p(A)| -p(B)| -p(C)|p(enc(wk,enc(i(tmk),A))).
% 2.02/2.20 ** KEPT (pick-wt=16): 5 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tmk),B),enc(i(tmk),A))).
% 2.02/2.20 ** KEPT (pick-wt=16): 6 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tmk),B),enc(i(tc),A))).
% 2.02/2.20 ** KEPT (pick-wt=10): 7 [] -p(A)| -p(B)| -p(C)|p(enc(tc,A)).
% 2.02/2.20 ** KEPT (pick-wt=13): 8 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tc),A),B)).
% 2.02/2.20 ** KEPT (pick-wt=14): 9 [] -p(A)| -p(B)| -p(C)|p(enc(i(enc(i(tc),A)),B)).
% 2.02/2.20 ** KEPT (pick-wt=19): 10 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(wk),C),enc(i(enc(i(tmk),B)),A))).
% 2.41/2.59 ** KEPT (pick-wt=19): 11 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(wk),C),enc(i(enc(i(wk),B)),A))).
% 2.41/2.59 ** KEPT (pick-wt=16): 12 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(wk),B),enc(i(lp),A))).
% 2.41/2.59 ** KEPT (pick-wt=10): 13 [] -p(A)| -p(B)| -p(C)|p(enc(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=4): 14 [] -p(enc(pp,a)).
% 2.41/2.59
% 2.41/2.59 ------------> process sos:
% 2.41/2.59 ** KEPT (pick-wt=3): 15 [] A=A.
% 2.41/2.59 ** KEPT (pick-wt=8): 16 [] enc(i(A),enc(A,B))=B.
% 2.41/2.59 ---> New Demodulator: 17 [new_demod,16] enc(i(A),enc(A,B))=B.
% 2.41/2.59 ** KEPT (pick-wt=8): 18 [] enc(A,enc(i(A),B))=B.
% 2.41/2.59 ---> New Demodulator: 19 [new_demod,18] enc(A,enc(i(A),B))=B.
% 2.41/2.59 ** KEPT (pick-wt=5): 20 [] i(i(A))=A.
% 2.41/2.59 ---> New Demodulator: 21 [new_demod,20] i(i(A))=A.
% 2.41/2.59 ** KEPT (pick-wt=4): 22 [] p(enc(tmk,pp)).
% 2.41/2.59 ** KEPT (pick-wt=4): 23 [] p(enc(wk,w)).
% 2.41/2.59 ** KEPT (pick-wt=4): 24 [] p(enc(w,t1)).
% 2.41/2.59 ** KEPT (pick-wt=4): 25 [] p(enc(lp,t2)).
% 2.41/2.59 ** KEPT (pick-wt=4): 26 [] p(enc(tc,k)).
% 2.41/2.59 ** KEPT (pick-wt=2): 27 [] p(kk).
% 2.41/2.59 ** KEPT (pick-wt=3): 28 [] p(i(kk)).
% 2.41/2.59 ** KEPT (pick-wt=2): 29 [] p(a).
% 2.41/2.59 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 2.41/2.59 >>>> Starting back demodulation with 17.
% 2.41/2.59 >>>> Starting back demodulation with 19.
% 2.41/2.59 >>>> Starting back demodulation with 21.
% 2.41/2.59
% 2.41/2.59 ======= end of input processing =======
% 2.41/2.59
% 2.41/2.59 =========== start of search ===========
% 2.41/2.59
% 2.41/2.59 -------- PROOF --------
% 2.41/2.59
% 2.41/2.59 ----> UNIT CONFLICT at 0.39 sec ----> 8256 [binary,8255.1,14.1] $F.
% 2.41/2.59
% 2.41/2.59 Length of proof is 2. Level of proof is 2.
% 2.41/2.59
% 2.41/2.59 ---------------- PROOF ----------------
% 2.41/2.59 % SZS status Theorem
% 2.41/2.59 % SZS output start Refutation
% See solution above
% 2.41/2.59 ------------ end of proof -------------
% 2.41/2.59
% 2.41/2.59
% 2.41/2.59 Search stopped by max_proofs option.
% 2.41/2.59
% 2.41/2.59
% 2.41/2.59 Search stopped by max_proofs option.
% 2.41/2.59
% 2.41/2.59 ============ end of search ============
% 2.41/2.59
% 2.41/2.59 -------------- statistics -------------
% 2.41/2.59 clauses given 19
% 2.41/2.59 clauses generated 41371
% 2.41/2.59 clauses kept 8252
% 2.41/2.59 clauses forward subsumed 33145
% 2.41/2.59 clauses back subsumed 0
% 2.41/2.59 Kbytes malloced 4882
% 2.41/2.59
% 2.41/2.59 ----------- times (seconds) -----------
% 2.41/2.59 user CPU time 0.39 (0 hr, 0 min, 0 sec)
% 2.41/2.59 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.41/2.59 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.41/2.59
% 2.41/2.59 That finishes the proof of the theorem.
% 2.41/2.59
% 2.41/2.59 Process 2738 finished Wed Jul 27 06:18:19 2022
% 2.41/2.59 Otter interrupted
% 2.41/2.59 PROOF FOUND
%------------------------------------------------------------------------------