TSTP Solution File: MSC014-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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.83s 2.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:56:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.95 ----- Otter 3.3f, August 2004 -----
% 1.74/1.95 The process was started by sandbox on n004.cluster.edu,
% 1.74/1.95 Wed Jul 27 08:56:06 2022
% 1.74/1.95 The command was "./otter". The process ID is 7112.
% 1.74/1.95
% 1.74/1.95 set(prolog_style_variables).
% 1.74/1.95 set(auto).
% 1.74/1.95 dependent: set(auto1).
% 1.74/1.95 dependent: set(process_input).
% 1.74/1.95 dependent: clear(print_kept).
% 1.74/1.95 dependent: clear(print_new_demod).
% 1.74/1.95 dependent: clear(print_back_demod).
% 1.74/1.95 dependent: clear(print_back_sub).
% 1.74/1.95 dependent: set(control_memory).
% 1.74/1.95 dependent: assign(max_mem, 12000).
% 1.74/1.95 dependent: assign(pick_given_ratio, 4).
% 1.74/1.95 dependent: assign(stats_level, 1).
% 1.74/1.95 dependent: assign(max_seconds, 10800).
% 1.74/1.95 clear(print_given).
% 1.74/1.95
% 1.74/1.95 list(usable).
% 1.74/1.95 0 [] A=A.
% 1.74/1.95 0 [] ife_q2(A,A,B,C)=B.
% 1.74/1.95 0 [] ife_q(A,A,B,C)=B.
% 1.74/1.95 0 [] e_qualish(n0,n0)=true.
% 1.74/1.95 0 [] e_qualish(n1,n1)=true.
% 1.74/1.95 0 [] ife_q2(e_qualish(X4,X4),true,ife_q2(e_qualish(X3,X3),true,ife_q2(e_qualish(X2,X2),true,ife_q2(e_qualish(X1,X1),true,f(X1,X2,X3,X4,sK1_exists_f_Z(X1,X2,X3,X4)),true),true),true),true)=true.
% 1.74/1.95 0 [] ife_q2(f(Y1,Y2,Y3,Y4,Z),true,ife_q2(f(X1,X2,X3,X4,Z),true,e_qualish(X4,Y4),true),true)=true.
% 1.74/1.95 0 [] ife_q2(f(Y1,Y2,Y3,Y4,Z),true,ife_q2(f(X1,X2,X3,X4,Z),true,e_qualish(X3,Y3),true),true)=true.
% 1.74/1.95 0 [] ife_q2(f(Y1,Y2,Y3,Y4,Z),true,ife_q2(f(X1,X2,X3,X4,Z),true,e_qualish(X2,Y2),true),true)=true.
% 1.74/1.95 0 [] ife_q2(f(Y1,Y2,Y3,Y4,Z),true,ife_q2(f(X1,X2,X3,X4,Z),true,e_qualish(X1,Y1),true),true)=true.
% 1.74/1.95 0 [] ife_q(e_qualish(n0,n1),true,a,b)=b.
% 1.74/1.95 0 [] ife_q(e_qualish(n1,n0),true,a,b)=b.
% 1.74/1.95 0 [] a!=b.
% 1.74/1.95 end_of_list.
% 1.74/1.95
% 1.74/1.95 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.74/1.95
% 1.74/1.95 All clauses are units, and equality is present; the
% 1.74/1.95 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.74/1.95
% 1.74/1.95 dependent: set(knuth_bendix).
% 1.74/1.95 dependent: set(anl_eq).
% 1.74/1.95 dependent: set(para_from).
% 1.74/1.95 dependent: set(para_into).
% 1.74/1.95 dependent: clear(para_from_right).
% 1.74/1.95 dependent: clear(para_into_right).
% 1.74/1.95 dependent: set(para_from_vars).
% 1.74/1.95 dependent: set(eq_units_both_ways).
% 1.74/1.95 dependent: set(dynamic_demod_all).
% 1.74/1.95 dependent: set(dynamic_demod).
% 1.74/1.95 dependent: set(order_eq).
% 1.74/1.95 dependent: set(back_demod).
% 1.74/1.95 dependent: set(lrpo).
% 1.74/1.95
% 1.74/1.95 ------------> process usable:
% 1.74/1.95 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.74/1.95
% 1.74/1.95 ------------> process sos:
% 1.74/1.95 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.74/1.95 ** KEPT (pick-wt=7): 4 [] ife_q2(A,A,B,C)=B.
% 1.74/1.95 ---> New Demodulator: 5 [new_demod,4] ife_q2(A,A,B,C)=B.
% 1.74/1.95 ** KEPT (pick-wt=7): 6 [] ife_q(A,A,B,C)=B.
% 1.74/1.95 ---> New Demodulator: 7 [new_demod,6] ife_q(A,A,B,C)=B.
% 1.74/1.95 ** KEPT (pick-wt=5): 8 [] e_qualish(n0,n0)=true.
% 1.74/1.95 ---> New Demodulator: 9 [new_demod,8] e_qualish(n0,n0)=true.
% 1.74/1.95 ** KEPT (pick-wt=5): 10 [] e_qualish(n1,n1)=true.
% 1.74/1.95 ---> New Demodulator: 11 [new_demod,10] e_qualish(n1,n1)=true.
% 1.74/1.95 ** KEPT (pick-wt=36): 12 [] ife_q2(e_qualish(A,A),true,ife_q2(e_qualish(B,B),true,ife_q2(e_qualish(C,C),true,ife_q2(e_qualish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true)=true.
% 1.74/1.95 ---> New Demodulator: 13 [new_demod,12] ife_q2(e_qualish(A,A),true,ife_q2(e_qualish(B,B),true,ife_q2(e_qualish(C,C),true,ife_q2(e_qualish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true)=true.
% 1.74/1.95 ** KEPT (pick-wt=23): 14 [] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(I,D),true),true)=true.
% 1.74/1.95 ---> New Demodulator: 15 [new_demod,14] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(I,D),true),true)=true.
% 1.74/1.95 ** KEPT (pick-wt=23): 16 [] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(H,C),true),true)=true.
% 1.74/1.95 ---> New Demodulator: 17 [new_demod,16] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(H,C),true),true)=true.
% 1.74/1.95 ** KEPT (pick-wt=23): 18 [] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(G,B),true),true)=true.
% 1.74/1.95 ---> New Demodulator: 19 [new_demod,18] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(G,B),true),true)=true.
% 1.74/1.95 ** KEPT (pick-wt=23): 20 [] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(F,A),true),true)=true.
% 1.74/1.95 ---> New Demodulator: 21 [new_demod,20] ife_q2(f(A,B,C,D,E),true,ife_q2(f(F,G,H,I,E),true,e_qualish(F,A),true),true)=true.
% 1.74/1.95 ** KEPT (pick-wt=9): 22 [] ife_q(e_qualish(n0,n1),true,a,b)=b.
% 1.74/1.95 ---> New Demodulator: 23 [new_demod,22] ife_q(e_qualish(n0,n1),true,a,b)=b.
% 1.83/2.01 ** KEPT (pick-wt=9): 24 [] ife_q(e_qualish(n1,n0),true,a,b)=b.
% 1.83/2.01 ---> New Demodulator: 25 [new_demod,24] ife_q(e_qualish(n1,n0),true,a,b)=b.
% 1.83/2.01 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.83/2.01 >>>> Starting back demodulation with 5.
% 1.83/2.01 >>>> Starting back demodulation with 7.
% 1.83/2.01 >>>> Starting back demodulation with 9.
% 1.83/2.01 >>>> Starting back demodulation with 11.
% 1.83/2.01 >>>> Starting back demodulation with 13.
% 1.83/2.01 >>>> Starting back demodulation with 15.
% 1.83/2.01 >>>> Starting back demodulation with 17.
% 1.83/2.01 >>>> Starting back demodulation with 19.
% 1.83/2.01 >>>> Starting back demodulation with 21.
% 1.83/2.01 >>>> Starting back demodulation with 23.
% 1.83/2.01 >>>> Starting back demodulation with 25.
% 1.83/2.01
% 1.83/2.01 ======= end of input processing =======
% 1.83/2.01
% 1.83/2.01 =========== start of search ===========
% 1.83/2.01
% 1.83/2.01 Search stopped because sos empty.
% 1.83/2.01
% 1.83/2.01
% 1.83/2.01 Search stopped because sos empty.
% 1.83/2.01
% 1.83/2.01 ============ end of search ============
% 1.83/2.01
% 1.83/2.01 -------------- statistics -------------
% 1.83/2.01 clauses given 372
% 1.83/2.01 clauses generated 5586
% 1.83/2.01 clauses kept 373
% 1.83/2.01 clauses forward subsumed 5355
% 1.83/2.01 clauses back subsumed 0
% 1.83/2.01 Kbytes malloced 2929
% 1.83/2.01
% 1.83/2.01 ----------- times (seconds) -----------
% 1.83/2.01 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 1.83/2.01 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.83/2.01 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.83/2.01
% 1.83/2.01 Process 7112 finished Wed Jul 27 08:56:07 2022
% 1.83/2.01 Otter interrupted
% 1.83/2.01 PROOF NOT FOUND
%------------------------------------------------------------------------------