TSTP Solution File: MSC013+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC013+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:06:19 EDT 2022
% Result : Unknown 1.92s 2.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MSC013+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 09:20:03 EDT 2022
% 0.19/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox on n023.cluster.edu,
% 1.92/2.11 Wed Jul 27 09:20:03 2022
% 1.92/2.11 The command was "./otter". The process ID is 742.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 formula_list(usable).
% 1.92/2.11 e_qualish(n0,n0).
% 1.92/2.11 e_qualish(n1,n1).
% 1.92/2.11 e_qualish(n0,n1)->goal.
% 1.92/2.11 e_qualish(n1,n0)->goal.
% 1.92/2.11 all A B C D E (e_qualish(A,A)&e_qualish(B,B)&e_qualish(C,C)&e_qualish(D,D)&e_qualish(E,E)-> (exists F f(A,B,C,D,E,F))).
% 1.92/2.11 all A B C D E F G H I J K (f(A,B,C,D,E,K)&f(F,G,H,I,J,K)->e_qualish(A,F)&e_qualish(B,G)&e_qualish(C,H)&e_qualish(D,I)&e_qualish(E,J)).
% 1.92/2.11 -goal.
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 -------> usable clausifies to:
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] e_qualish(n0,n0).
% 1.92/2.11 0 [] e_qualish(n1,n1).
% 1.92/2.11 0 [] -e_qualish(n0,n1)|goal.
% 1.92/2.11 0 [] -e_qualish(n1,n0)|goal.
% 1.92/2.11 0 [] -e_qualish(A,A)| -e_qualish(B,B)| -e_qualish(C,C)| -e_qualish(D,D)| -e_qualish(E,E)|f(A,B,C,D,E,$f1(A,B,C,D,E)).
% 1.92/2.11 0 [] -f(A,B,C,D,E,K)| -f(F,G,H,I,J,K)|e_qualish(A,F).
% 1.92/2.11 0 [] -f(A,B,C,D,E,K)| -f(F,G,H,I,J,K)|e_qualish(B,G).
% 1.92/2.11 0 [] -f(A,B,C,D,E,K)| -f(F,G,H,I,J,K)|e_qualish(C,H).
% 1.92/2.11 0 [] -f(A,B,C,D,E,K)| -f(F,G,H,I,J,K)|e_qualish(D,I).
% 1.92/2.11 0 [] -f(A,B,C,D,E,K)| -f(F,G,H,I,J,K)|e_qualish(E,J).
% 1.92/2.11 0 [] -goal.
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=6.
% 1.92/2.11
% 1.92/2.11 This is a Horn set without equality. The strategy will
% 1.92/2.11 be hyperresolution, with satellites in sos and nuclei
% 1.92/2.11 in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: clear(order_hyper).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=4): 1 [] -e_qualish(n0,n1)|goal.
% 1.92/2.11 ** KEPT (pick-wt=4): 2 [] -e_qualish(n1,n0)|goal.
% 1.92/2.11 ** KEPT (pick-wt=27): 3 [] -e_qualish(A,A)| -e_qualish(B,B)| -e_qualish(C,C)| -e_qualish(D,D)| -e_qualish(E,E)|f(A,B,C,D,E,$f1(A,B,C,D,E)).
% 1.92/2.11 ** KEPT (pick-wt=17): 4 [] -f(A,B,C,D,E,F)| -f(G,H,I,J,K,F)|e_qualish(A,G).
% 1.92/2.11 ** KEPT (pick-wt=17): 5 [] -f(A,B,C,D,E,F)| -f(G,H,I,J,K,F)|e_qualish(B,H).
% 1.92/2.11 ** KEPT (pick-wt=17): 6 [] -f(A,B,C,D,E,F)| -f(G,H,I,J,K,F)|e_qualish(C,I).
% 1.92/2.11 ** KEPT (pick-wt=17): 7 [] -f(A,B,C,D,E,F)| -f(G,H,I,J,K,F)|e_qualish(D,J).
% 1.92/2.11 ** KEPT (pick-wt=17): 8 [] -f(A,B,C,D,E,F)| -f(G,H,I,J,K,F)|e_qualish(E,K).
% 1.92/2.11 ** KEPT (pick-wt=1): 9 [] -goal.
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=3): 10 [] e_qualish(n0,n0).
% 1.92/2.11 ** KEPT (pick-wt=3): 11 [] e_qualish(n1,n1).
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 Search stopped because sos empty.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped because sos empty.
% 1.92/2.11
% 1.92/2.11 ============ end of search ============
% 1.92/2.11
% 1.92/2.11 -------------- statistics -------------
% 1.92/2.11 clauses given 34
% 1.92/2.11 clauses generated 405
% 1.92/2.11 clauses kept 43
% 1.92/2.11 clauses forward subsumed 373
% 1.92/2.11 clauses back subsumed 0
% 1.92/2.11 Kbytes malloced 976
% 1.92/2.11
% 1.92/2.11 ----------- times (seconds) -----------
% 1.92/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.11
% 1.92/2.11 Process 742 finished Wed Jul 27 09:20:05 2022
% 1.92/2.11 Otter interrupted
% 1.92/2.11 PROOF NOT FOUND
%------------------------------------------------------------------------------