TSTP Solution File: ANA004-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA004-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:46:41 EDT 2022
% Result : Unknown 1.90s 2.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA004-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:09:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.83/1.98 ----- Otter 3.3f, August 2004 -----
% 1.83/1.98 The process was started by sandbox on n029.cluster.edu,
% 1.83/1.98 Wed Jul 27 10:09:59 2022
% 1.83/1.98 The command was "./otter". The process ID is 19915.
% 1.83/1.98
% 1.83/1.98 set(prolog_style_variables).
% 1.83/1.98 set(auto).
% 1.83/1.98 dependent: set(auto1).
% 1.83/1.98 dependent: set(process_input).
% 1.83/1.98 dependent: clear(print_kept).
% 1.83/1.98 dependent: clear(print_new_demod).
% 1.83/1.98 dependent: clear(print_back_demod).
% 1.83/1.98 dependent: clear(print_back_sub).
% 1.83/1.98 dependent: set(control_memory).
% 1.83/1.98 dependent: assign(max_mem, 12000).
% 1.83/1.98 dependent: assign(pick_given_ratio, 4).
% 1.83/1.98 dependent: assign(stats_level, 1).
% 1.83/1.98 dependent: assign(max_seconds, 10800).
% 1.83/1.98 clear(print_given).
% 1.83/1.98
% 1.83/1.98 list(usable).
% 1.83/1.98 0 [] A=A.
% 1.83/1.98 0 [] ife_q3(A,A,B,C)=B.
% 1.83/1.98 0 [] ife_q2(A,A,B,C)=B.
% 1.83/1.98 0 [] ife_q(A,A,B,C)=B.
% 1.83/1.98 0 [] add(X,n0)=X.
% 1.83/1.98 0 [] add(n0,X)=X.
% 1.83/1.98 0 [] ife_q3(less_than(Y,Z),true,ife_q3(less_than(X,Y),true,less_than(X,Z),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,Y),true,ife_q3(less_than(n0,X),true,less_than(n0,minimum(X,Y)),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,Y),true,ife_q3(less_than(n0,X),true,less_than(minimum(X,Y),X),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,Y),true,ife_q3(less_than(n0,X),true,less_than(minimum(X,Y),Y),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(Y,half(Xa)),true,ife_q3(less_than(X,half(Xa)),true,less_than(add(X,Y),Xa),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(add(absolute(X),absolute(Y)),Xa),true,less_than(absolute(add(X,Y)),Xa),true)=true.
% 1.83/1.98 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.83/1.98 0 [] add(X,Y)=add(Y,X).
% 1.83/1.98 0 [] ife_q3(less_than(n0,Xa),true,less_than(n0,half(Xa)),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,Xa),true,less_than(n0,half(Xa)),true)=true.
% 1.83/1.98 0 [] minus(add(X,Y))=add(minus(X),minus(Y)).
% 1.83/1.98 0 [] ife_q3(less_than(n0,X),true,less_than(n0,fp31(X)),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(absolute(add(Y,minus(a))),fp31(X)),true,ife_q3(less_than(n0,X),true,less_than(absolute(add(f(Y),minus(l1))),X),true),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,X),true,less_than(n0,fp32(X)),true)=true.
% 1.83/1.98 0 [] ife_q3(less_than(absolute(add(Y,minus(a))),fp32(X)),true,ife_q3(less_than(n0,X),true,less_than(absolute(add(g(Y),minus(l2))),X),true),true)=true.
% 1.83/1.98 0 [] less_than(n0,b)=true.
% 1.83/1.98 0 [] ife_q3(less_than(n0,X),true,less_than(absolute(add(fp33(X),minus(a))),X),true)=true.
% 1.83/1.98 0 [] ife_q2(less_than(X,X),true,a2,b2)=b2.
% 1.83/1.98 0 [] ife_q(tuple(less_than(n0,X),less_than(absolute(add(add(f(fp33(X)),minus(l1)),add(g(fp33(X)),minus(l2)))),b)),tuple(true,true),a2,b2)=b2.
% 1.83/1.98 0 [] a2!=b2.
% 1.83/1.98 end_of_list.
% 1.83/1.98
% 1.83/1.98 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.83/1.98
% 1.83/1.98 All clauses are units, and equality is present; the
% 1.83/1.98 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.83/1.98
% 1.83/1.98 dependent: set(knuth_bendix).
% 1.83/1.98 dependent: set(anl_eq).
% 1.83/1.98 dependent: set(para_from).
% 1.83/1.98 dependent: set(para_into).
% 1.83/1.98 dependent: clear(para_from_right).
% 1.83/1.98 dependent: clear(para_into_right).
% 1.83/1.98 dependent: set(para_from_vars).
% 1.83/1.98 dependent: set(eq_units_both_ways).
% 1.83/1.98 dependent: set(dynamic_demod_all).
% 1.83/1.98 dependent: set(dynamic_demod).
% 1.83/1.98 dependent: set(order_eq).
% 1.83/1.98 dependent: set(back_demod).
% 1.83/1.98 dependent: set(lrpo).
% 1.83/1.98
% 1.83/1.98 ------------> process usable:
% 1.83/1.98 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b2!=a2.
% 1.83/1.98
% 1.83/1.98 ------------> process sos:
% 1.83/1.98 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.83/1.98 ** KEPT (pick-wt=7): 4 [] ife_q3(A,A,B,C)=B.
% 1.83/1.98 ---> New Demodulator: 5 [new_demod,4] ife_q3(A,A,B,C)=B.
% 1.83/1.98 ** KEPT (pick-wt=7): 6 [] ife_q2(A,A,B,C)=B.
% 1.83/1.98 ---> New Demodulator: 7 [new_demod,6] ife_q2(A,A,B,C)=B.
% 1.83/1.98 ** KEPT (pick-wt=7): 8 [] ife_q(A,A,B,C)=B.
% 1.83/1.98 ---> New Demodulator: 9 [new_demod,8] ife_q(A,A,B,C)=B.
% 1.83/1.98 ** KEPT (pick-wt=5): 10 [] add(A,n0)=A.
% 1.83/1.98 ---> New Demodulator: 11 [new_demod,10] add(A,n0)=A.
% 1.83/1.98 ** KEPT (pick-wt=5): 12 [] add(n0,A)=A.
% 1.83/1.98 ---> New Demodulator: 13 [new_demod,12] add(n0,A)=A.
% 1.83/1.98 ** KEPT (pick-wt=17): 14 [] ife_q3(less_than(A,B),true,ife_q3(less_than(C,A),true,less_than(C,B),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 15 [new_demod,14] ife_q3(less_than(A,B),true,ife_q3(less_than(C,A),true,less_than(C,B),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=19): 16 [] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 17 [new_demod,16] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=19): 18 [] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 19 [new_demod,18] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=19): 20 [] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 21 [new_demod,20] ife_q3(less_than(n0,A),true,ife_q3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=21): 22 [] ife_q3(less_than(A,half(B)),true,ife_q3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 23 [new_demod,22] ife_q3(less_than(A,half(B)),true,ife_q3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=18): 24 [] ife_q3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true)=true.
% 1.83/1.98 ---> New Demodulator: 25 [new_demod,24] ife_q3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=11): 26 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.83/1.98 ---> New Demodulator: 27 [new_demod,26] add(add(A,B),C)=add(A,add(B,C)).
% 1.83/1.98 ** KEPT (pick-wt=7): 28 [] add(A,B)=add(B,A).
% 1.83/1.98 ** KEPT (pick-wt=12): 29 [] ife_q3(less_than(n0,A),true,less_than(n0,half(A)),true)=true.
% 1.83/1.98 ---> New Demodulator: 30 [new_demod,29] ife_q3(less_than(n0,A),true,less_than(n0,half(A)),true)=true.
% 1.83/1.98 Following clause subsumed by 3 during input processing: 0 [demod,30] true=true.
% 1.83/1.98 ** KEPT (pick-wt=10): 31 [] minus(add(A,B))=add(minus(A),minus(B)).
% 1.83/1.98 ---> New Demodulator: 32 [new_demod,31] minus(add(A,B))=add(minus(A),minus(B)).
% 1.83/1.98 ** KEPT (pick-wt=12): 33 [] ife_q3(less_than(n0,A),true,less_than(n0,fp31(A)),true)=true.
% 1.83/1.98 ---> New Demodulator: 34 [new_demod,33] ife_q3(less_than(n0,A),true,less_than(n0,fp31(A)),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=27): 35 [] ife_q3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ife_q3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 36 [new_demod,35] ife_q3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ife_q3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=12): 37 [] ife_q3(less_than(n0,A),true,less_than(n0,fp32(A)),true)=true.
% 1.83/1.98 ---> New Demodulator: 38 [new_demod,37] ife_q3(less_than(n0,A),true,less_than(n0,fp32(A)),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=27): 39 [] ife_q3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ife_q3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true)=true.
% 1.83/1.98 ---> New Demodulator: 40 [new_demod,39] ife_q3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ife_q3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=5): 41 [] less_than(n0,b)=true.
% 1.83/1.98 ---> New Demodulator: 42 [new_demod,41] less_than(n0,b)=true.
% 1.83/1.98 ** KEPT (pick-wt=16): 43 [] ife_q3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true)=true.
% 1.83/1.98 ---> New Demodulator: 44 [new_demod,43] ife_q3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true)=true.
% 1.83/1.98 ** KEPT (pick-wt=9): 45 [] ife_q2(less_than(A,A),true,a2,b2)=b2.
% 1.83/1.98 ---> New Demodulator: 46 [new_demod,45] ife_q2(less_than(A,A),true,a2,b2)=b2.
% 1.83/1.98 ** KEPT (pick-wt=28): 48 [copy,47,demod,27] ife_q(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(minus(l1),add(g(fp33(A)),minus(l2))))),b)),tuple(true,true),a2,b2)=b2.
% 1.83/1.98 ---> New Demodulator: 49 [new_demod,48] ife_q(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(minus(l1),add(g(fp33(A)),minus(l2))))),b)),tuple(true,true),a2,b2)=b2.
% 1.83/1.98 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.83/1.98 >>>> Starting back demodulation with 5.
% 1.83/1.98 >>>> Starting back demodulation with 7.
% 1.83/1.98 >>>> Starting back demodulation with 9.
% 1.83/1.98 >>>> Starting back demodulation with 11.
% 1.83/1.98 >>>> Starting back demodulation with 13.
% 1.83/1.98 >>>> Starting back demodulation with 15.
% 1.83/1.98 >>>> Starting back demodulation with 17.
% 1.83/1.98 >>>> Starting back demodulation with 19.
% 1.83/1.98 >>>> Starting back demodulation with 21.
% 1.90/2.10 >>>> Starting back demodulation with 23.
% 1.90/2.10 >>>> Starting back demodulation with 25.
% 1.90/2.10 >>>> Starting back demodulation with 27.
% 1.90/2.10 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] add(A,B)=add(B,A).
% 1.90/2.10 >>>> Starting back demodulation with 30.
% 1.90/2.10 >>>> Starting back demodulation with 32.
% 1.90/2.10 >>>> Starting back demodulation with 34.
% 1.90/2.10 >>>> Starting back demodulation with 36.
% 1.90/2.10 >>>> Starting back demodulation with 38.
% 1.90/2.10 >>>> Starting back demodulation with 40.
% 1.90/2.10 >>>> Starting back demodulation with 42.
% 1.90/2.10 >>>> Starting back demodulation with 44.
% 1.90/2.10 >>>> Starting back demodulation with 46.
% 1.90/2.10 >>>> Starting back demodulation with 49.
% 1.90/2.10
% 1.90/2.10 ======= end of input processing =======
% 1.90/2.10
% 1.90/2.10 =========== start of search ===========
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Resetting weight limit to 8.
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Resetting weight limit to 8.
% 1.90/2.10
% 1.90/2.10 sos_size=239
% 1.90/2.10
% 1.90/2.10 Search stopped because sos empty.
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Search stopped because sos empty.
% 1.90/2.10
% 1.90/2.10 ============ end of search ============
% 1.90/2.10
% 1.90/2.10 -------------- statistics -------------
% 1.90/2.10 clauses given 317
% 1.90/2.10 clauses generated 15290
% 1.90/2.10 clauses kept 320
% 1.90/2.10 clauses forward subsumed 1953
% 1.90/2.10 clauses back subsumed 0
% 1.90/2.10 Kbytes malloced 7812
% 1.90/2.10
% 1.90/2.10 ----------- times (seconds) -----------
% 1.90/2.10 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.90/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.90/2.10
% 1.90/2.10 Process 19915 finished Wed Jul 27 10:10:01 2022
% 1.90/2.10 Otter interrupted
% 1.90/2.10 PROOF NOT FOUND
%------------------------------------------------------------------------------