TSTP Solution File: SWV238+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV238+1 : TPTP v8.1.0. Released v3.2.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:20:15 EDT 2022
% Result : Timeout 299.88s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV238+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 06:17:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.79/1.99 ----- Otter 3.3f, August 2004 -----
% 1.79/1.99 The process was started by sandbox on n003.cluster.edu,
% 1.79/1.99 Wed Jul 27 06:17:26 2022
% 1.79/1.99 The command was "./otter". The process ID is 30616.
% 1.79/1.99
% 1.79/1.99 set(prolog_style_variables).
% 1.79/1.99 set(auto).
% 1.79/1.99 dependent: set(auto1).
% 1.79/1.99 dependent: set(process_input).
% 1.79/1.99 dependent: clear(print_kept).
% 1.79/1.99 dependent: clear(print_new_demod).
% 1.79/1.99 dependent: clear(print_back_demod).
% 1.79/1.99 dependent: clear(print_back_sub).
% 1.79/1.99 dependent: set(control_memory).
% 1.79/1.99 dependent: assign(max_mem, 12000).
% 1.79/1.99 dependent: assign(pick_given_ratio, 4).
% 1.79/1.99 dependent: assign(stats_level, 1).
% 1.79/1.99 dependent: assign(max_seconds, 10800).
% 1.79/1.99 clear(print_given).
% 1.79/1.99
% 1.79/1.99 formula_list(usable).
% 1.79/1.99 all A (A=A).
% 1.79/1.99 all U V (enc(i(U),enc(U,V))=V).
% 1.79/1.99 all U V (enc(U,enc(i(U),V))=V).
% 1.79/1.99 all U (i(i(U))=U).
% 1.79/1.99 all U (p(U)->p(i(U))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(tmk,enc(i(enc(i(zcmk),V)),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(i(enc(i(zcmk),V)),enc(i(tmk),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(wk,enc(i(tmk),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tmk),V),enc(i(tmk),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tmk),V),enc(i(tc),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(tc),U),V))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(i(enc(i(tc),U)),V))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),W),enc(i(enc(i(tmk),V)),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),W),enc(i(enc(i(wk),V)),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(enc(i(wk),V),enc(i(lp),U)))).
% 1.79/1.99 all U V W (p(U)&p(V)&p(W)->p(enc(U,V))).
% 1.79/1.99 p(enc(tmk,pp)).
% 1.79/1.99 p(enc(wk,w)).
% 1.79/1.99 p(enc(w,t1)).
% 1.79/1.99 p(enc(lp,t2)).
% 1.79/1.99 p(enc(tc,k)).
% 1.79/1.99 p(kk).
% 1.79/1.99 p(i(kk)).
% 1.79/1.99 p(a).
% 1.79/1.99 -p(enc(pp,a)).
% 1.79/1.99 end_of_list.
% 1.79/1.99
% 1.79/1.99 -------> usable clausifies to:
% 1.79/1.99
% 1.79/1.99 list(usable).
% 1.79/1.99 0 [] A=A.
% 1.79/1.99 0 [] enc(i(U),enc(U,V))=V.
% 1.79/1.99 0 [] enc(U,enc(i(U),V))=V.
% 1.79/1.99 0 [] i(i(U))=U.
% 1.79/1.99 0 [] -p(U)|p(i(U)).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(tmk,enc(i(enc(i(zcmk),V)),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(i(enc(i(zcmk),V)),enc(i(tmk),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(wk,enc(i(tmk),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tmk),V),enc(i(tmk),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tmk),V),enc(i(tc),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(tc),U),V)).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(i(enc(i(tc),U)),V)).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),W),enc(i(enc(i(tmk),V)),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),W),enc(i(enc(i(wk),V)),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(enc(i(wk),V),enc(i(lp),U))).
% 1.79/1.99 0 [] -p(U)| -p(V)| -p(W)|p(enc(U,V)).
% 1.79/1.99 0 [] p(enc(tmk,pp)).
% 1.79/1.99 0 [] p(enc(wk,w)).
% 1.79/1.99 0 [] p(enc(w,t1)).
% 1.79/1.99 0 [] p(enc(lp,t2)).
% 1.79/1.99 0 [] p(enc(tc,k)).
% 1.79/1.99 0 [] p(kk).
% 1.79/1.99 0 [] p(i(kk)).
% 1.79/1.99 0 [] p(a).
% 1.79/1.99 0 [] -p(enc(pp,a)).
% 1.79/1.99 end_of_list.
% 1.79/1.99
% 1.79/1.99 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.79/1.99
% 1.79/1.99 This is a Horn set with equality. The strategy will be
% 1.79/1.99 Knuth-Bendix and hyper_res, with positive clauses in
% 1.79/1.99 sos and nonpositive clauses in usable.
% 1.79/1.99
% 1.79/1.99 dependent: set(knuth_bendix).
% 1.79/1.99 dependent: set(anl_eq).
% 1.79/1.99 dependent: set(para_from).
% 1.79/1.99 dependent: set(para_into).
% 1.79/1.99 dependent: clear(para_from_right).
% 1.79/1.99 dependent: clear(para_into_right).
% 1.79/1.99 dependent: set(para_from_vars).
% 1.79/1.99 dependent: set(eq_units_both_ways).
% 1.79/1.99 dependent: set(dynamic_demod_all).
% 1.79/1.99 dependent: set(dynamic_demod).
% 1.79/1.99 dependent: set(order_eq).
% 1.79/1.99 dependent: set(back_demod).
% 1.79/1.99 dependent: set(lrpo).
% 1.79/1.99 dependent: set(hyper_res).
% 1.79/1.99 dependent: clear(order_hyper).
% 1.79/1.99
% 1.79/1.99 ------------> process usable:
% 1.79/1.99 ** KEPT (pick-wt=5): 1 [] -p(A)|p(i(A)).
% 1.79/1.99 ** KEPT (pick-wt=16): 2 [] -p(A)| -p(B)| -p(C)|p(enc(tmk,enc(i(enc(i(zcmk),B)),A))).
% 1.79/1.99 ** KEPT (pick-wt=17): 3 [] -p(A)| -p(B)| -p(C)|p(enc(i(enc(i(zcmk),B)),enc(i(tmk),A))).
% 1.79/1.99 ** KEPT (pick-wt=13): 4 [] -p(A)| -p(B)| -p(C)|p(enc(wk,enc(i(tmk),A))).
% 1.79/1.99 ** KEPT (pick-wt=16): 5 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tmk),B),enc(i(tmk),A))).
% 1.79/1.99 ** KEPT (pick-wt=16): 6 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tmk),B),enc(i(tc),A))).
% 1.79/1.99 ** KEPT (pick-wt=13): 7 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(tc),A),B)).
% 1.79/1.99 ** KEPT (pick-wt=14): 8 [] -p(A)| -p(B)| -p(C)|p(enc(i(enc(i(tc),A)),B)).
% 1.79/1.99 ** KEPT (pick-wt=19): 9 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(wk),C),enc(i(enc(i(tmk),B)),A))).
% 1.79/1.99 ** KEPT (pick-wt=19): 10 [] -p(A)| -p(B)| -p(C)|p(enc(enc(i(wk),C),enc(i(enc(i(wk),B)),A))).
% 1.79/1.99 ** KEPT (pick-wt=16): 11 [] -p(A)| -p(BAlarm clock
% 299.88/300.02 Otter interrupted
% 299.88/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------