TSTP Solution File: CAT019-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT019-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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 12:47:50 EDT 2022
% Result : Unknown 2.22s 2.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CAT019-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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 02:05:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.88 ----- Otter 3.3f, August 2004 -----
% 1.68/1.88 The process was started by sandbox2 on n019.cluster.edu,
% 1.68/1.88 Wed Jul 27 02:05:37 2022
% 1.68/1.88 The command was "./otter". The process ID is 3737.
% 1.68/1.88
% 1.68/1.88 set(prolog_style_variables).
% 1.68/1.88 set(auto).
% 1.68/1.88 dependent: set(auto1).
% 1.68/1.88 dependent: set(process_input).
% 1.68/1.88 dependent: clear(print_kept).
% 1.68/1.88 dependent: clear(print_new_demod).
% 1.68/1.88 dependent: clear(print_back_demod).
% 1.68/1.88 dependent: clear(print_back_sub).
% 1.68/1.88 dependent: set(control_memory).
% 1.68/1.88 dependent: assign(max_mem, 12000).
% 1.68/1.88 dependent: assign(pick_given_ratio, 4).
% 1.68/1.88 dependent: assign(stats_level, 1).
% 1.68/1.88 dependent: assign(max_seconds, 10800).
% 1.68/1.88 clear(print_given).
% 1.68/1.88
% 1.68/1.88 list(usable).
% 1.68/1.88 0 [] A=A.
% 1.68/1.88 0 [] ife_q4(A,A,B,C)=B.
% 1.68/1.88 0 [] ife_q3(A,A,B,C)=B.
% 1.68/1.88 0 [] ife_q2(A,A,B,C)=B.
% 1.68/1.88 0 [] ife_q(A,A,B,C)=B.
% 1.68/1.88 0 [] ife_q(e_quivalent(X,Y),true,there_exists(X),true)=true.
% 1.68/1.88 0 [] ife_q2(e_quivalent(X,Y),true,X,Y)=Y.
% 1.68/1.88 0 [] ife_q(there_exists(Y),true,e_quivalent(Y,Y),true)=true.
% 1.68/1.88 0 [] ife_q(there_exists(domain(X)),true,there_exists(X),true)=true.
% 1.68/1.88 0 [] ife_q(there_exists(codomain(X)),true,there_exists(X),true)=true.
% 1.68/1.88 0 [] ife_q(there_exists(compose(X,Y)),true,there_exists(domain(X)),true)=true.
% 1.68/1.88 0 [] ife_q2(there_exists(compose(X,Y)),true,domain(X),codomain(Y))=codomain(Y).
% 1.68/1.88 0 [] ife_q(there_exists(domain(X)),true,ife_q3(domain(X),codomain(Y),there_exists(compose(X,Y)),true),true)=true.
% 1.68/1.88 0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.68/1.88 0 [] compose(X,domain(X))=X.
% 1.68/1.88 0 [] compose(codomain(X),X)=X.
% 1.68/1.88 0 [] ife_q2(there_exists(Z),true,ife_q4(a,Z,b,Z),Z)=Z.
% 1.68/1.88 0 [] ife_q2(there_exists(Z),true,ife_q4(b,Z,a,Z),Z)=Z.
% 1.68/1.88 0 [] a!=b.
% 1.68/1.88 end_of_list.
% 1.68/1.88
% 1.68/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.68/1.88
% 1.68/1.88 All clauses are units, and equality is present; the
% 1.68/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.68/1.88
% 1.68/1.88 dependent: set(knuth_bendix).
% 1.68/1.88 dependent: set(anl_eq).
% 1.68/1.88 dependent: set(para_from).
% 1.68/1.88 dependent: set(para_into).
% 1.68/1.88 dependent: clear(para_from_right).
% 1.68/1.88 dependent: clear(para_into_right).
% 1.68/1.88 dependent: set(para_from_vars).
% 1.68/1.88 dependent: set(eq_units_both_ways).
% 1.68/1.88 dependent: set(dynamic_demod_all).
% 1.68/1.88 dependent: set(dynamic_demod).
% 1.68/1.88 dependent: set(order_eq).
% 1.68/1.88 dependent: set(back_demod).
% 1.68/1.88 dependent: set(lrpo).
% 1.68/1.88
% 1.68/1.88 ------------> process usable:
% 1.68/1.88 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.68/1.88
% 1.68/1.88 ------------> process sos:
% 1.68/1.88 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.68/1.88 ** KEPT (pick-wt=7): 4 [] ife_q4(A,A,B,C)=B.
% 1.68/1.88 ---> New Demodulator: 5 [new_demod,4] ife_q4(A,A,B,C)=B.
% 1.68/1.88 ** KEPT (pick-wt=7): 6 [] ife_q3(A,A,B,C)=B.
% 1.68/1.88 ---> New Demodulator: 7 [new_demod,6] ife_q3(A,A,B,C)=B.
% 1.68/1.88 ** KEPT (pick-wt=7): 8 [] ife_q2(A,A,B,C)=B.
% 1.68/1.88 ---> New Demodulator: 9 [new_demod,8] ife_q2(A,A,B,C)=B.
% 1.68/1.88 ** KEPT (pick-wt=7): 10 [] ife_q(A,A,B,C)=B.
% 1.68/1.88 ---> New Demodulator: 11 [new_demod,10] ife_q(A,A,B,C)=B.
% 1.68/1.88 ** KEPT (pick-wt=10): 12 [] ife_q(e_quivalent(A,B),true,there_exists(A),true)=true.
% 1.68/1.88 ---> New Demodulator: 13 [new_demod,12] ife_q(e_quivalent(A,B),true,there_exists(A),true)=true.
% 1.68/1.88 ** KEPT (pick-wt=9): 14 [] ife_q2(e_quivalent(A,B),true,A,B)=B.
% 1.68/1.88 ---> New Demodulator: 15 [new_demod,14] ife_q2(e_quivalent(A,B),true,A,B)=B.
% 1.68/1.88 ** KEPT (pick-wt=10): 16 [] ife_q(there_exists(A),true,e_quivalent(A,A),true)=true.
% 1.68/1.88 ---> New Demodulator: 17 [new_demod,16] ife_q(there_exists(A),true,e_quivalent(A,A),true)=true.
% 1.68/1.88 ** KEPT (pick-wt=10): 18 [] ife_q(there_exists(domain(A)),true,there_exists(A),true)=true.
% 1.68/1.88 ---> New Demodulator: 19 [new_demod,18] ife_q(there_exists(domain(A)),true,there_exists(A),true)=true.
% 1.68/1.88 ** KEPT (pick-wt=10): 20 [] ife_q(there_exists(codomain(A)),true,there_exists(A),true)=true.
% 1.68/1.88 ---> New Demodulator: 21 [new_demod,20] ife_q(there_exists(codomain(A)),true,there_exists(A),true)=true.
% 1.68/1.88 ** KEPT (pick-wt=12): 22 [] ife_q(there_exists(compose(A,B)),true,there_exists(domain(A)),true)=true.
% 1.68/1.88 ---> New Demodulator: 23 [new_demod,22] ife_q(there_exists(compose(A,B)),true,there_exists(domain(A)),true)=true.
% 1.68/1.88 ** KEPT (pick-wt=13): 24 [] ife_q2(there_exists(compose(A,B)),true,domain(A),codomain(B))=codomain(B).
% 1.68/1.88 ---> New Demodulator: 25 [new_demod,24] ife_q2(there_exists(compose(A,B)),true,domain(A),codomain(B))=codomain(B).
% 1.68/1.88 ** KEPT (pick-wt=18): 26 [] ife_q(there_exists(domain(A)),true,ife_q3(domain(A),codomain(B),there_exists(compose(A,B)),true),true)=true.
% 2.22/2.39 ---> New Demodulator: 27 [new_demod,26] ife_q(there_exists(domain(A)),true,ife_q3(domain(A),codomain(B),there_exists(compose(A,B)),true),true)=true.
% 2.22/2.39 ** KEPT (pick-wt=11): 29 [copy,28,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 2.22/2.39 ---> New Demodulator: 30 [new_demod,29] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 2.22/2.39 ** KEPT (pick-wt=6): 31 [] compose(A,domain(A))=A.
% 2.22/2.39 ---> New Demodulator: 32 [new_demod,31] compose(A,domain(A))=A.
% 2.22/2.39 ** KEPT (pick-wt=6): 33 [] compose(codomain(A),A)=A.
% 2.22/2.39 ---> New Demodulator: 34 [new_demod,33] compose(codomain(A),A)=A.
% 2.22/2.39 ** KEPT (pick-wt=12): 35 [] ife_q2(there_exists(A),true,ife_q4(a,A,b,A),A)=A.
% 2.22/2.39 ---> New Demodulator: 36 [new_demod,35] ife_q2(there_exists(A),true,ife_q4(a,A,b,A),A)=A.
% 2.22/2.39 ** KEPT (pick-wt=12): 37 [] ife_q2(there_exists(A),true,ife_q4(b,A,a,A),A)=A.
% 2.22/2.39 ---> New Demodulator: 38 [new_demod,37] ife_q2(there_exists(A),true,ife_q4(b,A,a,A),A)=A.
% 2.22/2.39 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.22/2.39 >>>> Starting back demodulation with 5.
% 2.22/2.39 >>>> Starting back demodulation with 7.
% 2.22/2.39 >>>> Starting back demodulation with 9.
% 2.22/2.39 >>>> Starting back demodulation with 11.
% 2.22/2.39 >>>> Starting back demodulation with 13.
% 2.22/2.39 >>>> Starting back demodulation with 15.
% 2.22/2.39 >>>> Starting back demodulation with 17.
% 2.22/2.39 >>>> Starting back demodulation with 19.
% 2.22/2.39 >>>> Starting back demodulation with 21.
% 2.22/2.39 >>>> Starting back demodulation with 23.
% 2.22/2.39 >>>> Starting back demodulation with 25.
% 2.22/2.39 >>>> Starting back demodulation with 27.
% 2.22/2.39 >>>> Starting back demodulation with 30.
% 2.22/2.39 >>>> Starting back demodulation with 32.
% 2.22/2.39 >>>> Starting back demodulation with 34.
% 2.22/2.39 >>>> Starting back demodulation with 36.
% 2.22/2.39 >>>> Starting back demodulation with 38.
% 2.22/2.39
% 2.22/2.39 ======= end of input processing =======
% 2.22/2.39
% 2.22/2.39 =========== start of search ===========
% 2.22/2.39
% 2.22/2.39
% 2.22/2.39 Resetting weight limit to 14.
% 2.22/2.39
% 2.22/2.39
% 2.22/2.39 Resetting weight limit to 14.
% 2.22/2.39
% 2.22/2.39 sos_size=175
% 2.22/2.39
% 2.22/2.39 Search stopped because sos empty.
% 2.22/2.39
% 2.22/2.39
% 2.22/2.39 Search stopped because sos empty.
% 2.22/2.39
% 2.22/2.39 ============ end of search ============
% 2.22/2.39
% 2.22/2.39 -------------- statistics -------------
% 2.22/2.39 clauses given 371
% 2.22/2.39 clauses generated 65385
% 2.22/2.39 clauses kept 376
% 2.22/2.39 clauses forward subsumed 22082
% 2.22/2.39 clauses back subsumed 0
% 2.22/2.39 Kbytes malloced 10742
% 2.22/2.39
% 2.22/2.39 ----------- times (seconds) -----------
% 2.22/2.39 user CPU time 0.51 (0 hr, 0 min, 0 sec)
% 2.22/2.39 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.22/2.39 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.22/2.39
% 2.22/2.39 Process 3737 finished Wed Jul 27 02:05:39 2022
% 2.22/2.39 Otter interrupted
% 2.22/2.39 PROOF NOT FOUND
%------------------------------------------------------------------------------