TSTP Solution File: SWV486+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV486+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:53 EDT 2022
% Result : Unknown 242.79s 243.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV486+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 05:27:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.79/2.00 ----- Otter 3.3f, August 2004 -----
% 1.79/2.00 The process was started by sandbox on n007.cluster.edu,
% 1.79/2.00 Wed Jul 27 05:27:31 2022
% 1.79/2.00 The command was "./otter". The process ID is 29391.
% 1.79/2.00
% 1.79/2.00 set(prolog_style_variables).
% 1.79/2.00 set(auto).
% 1.79/2.00 dependent: set(auto1).
% 1.79/2.00 dependent: set(process_input).
% 1.79/2.00 dependent: clear(print_kept).
% 1.79/2.00 dependent: clear(print_new_demod).
% 1.79/2.00 dependent: clear(print_back_demod).
% 1.79/2.00 dependent: clear(print_back_sub).
% 1.79/2.00 dependent: set(control_memory).
% 1.79/2.00 dependent: assign(max_mem, 12000).
% 1.79/2.00 dependent: assign(pick_given_ratio, 4).
% 1.79/2.00 dependent: assign(stats_level, 1).
% 1.79/2.00 dependent: assign(max_seconds, 10800).
% 1.79/2.00 clear(print_given).
% 1.79/2.00
% 1.79/2.00 formula_list(usable).
% 1.79/2.00 all A (A=A).
% 1.79/2.00 all I J (int_le_q(I,J)<->int_less(I,J)|I=J).
% 1.79/2.00 all I J K (int_less(I,J)&int_less(J,K)->int_less(I,K)).
% 1.79/2.00 all I J (int_less(I,J)->I!=J).
% 1.79/2.00 all I J (int_less(I,J)|int_le_q(J,I)).
% 1.79/2.00 int_less(int_zero,int_one).
% 1.79/2.00 all I J (plus(I,J)=plus(J,I)).
% 1.79/2.00 all I (plus(I,int_zero)=I).
% 1.79/2.00 all I1 J1 I2 J2 (int_less(I1,J1)&int_le_q(I2,J2)->int_le_q(plus(I1,I2),plus(J1,J2))).
% 1.79/2.00 all I J (int_less(I,J)<-> (exists K (plus(I,K)=J&int_less(int_zero,K)))).
% 1.79/2.00 all I (int_less(int_zero,I)<->int_le_q(int_one,I)).
% 1.79/2.00 real_zero!=real_one.
% 1.79/2.00 all I J (int_le_q(int_one,I)&int_le_q(I,n)&int_le_q(int_one,J)&int_le_q(J,n)-> (all C (int_less(int_zero,C)&I=plus(J,C)-> (all K (int_le_q(int_one,K)&int_le_q(K,J)->a(plus(K,C),K)=qr(plus(K,C),K)))))& (all C (int_less(int_zero,C)&J=plus(I,C)-> (all K (int_le_q(int_one,K)&int_le_q(K,I)->a(K,plus(K,C))=real_zero))))).
% 1.79/2.00 -(all I J (int_le_q(int_one,I)&int_less(I,J)&int_le_q(J,n)->a(I,J)=real_zero)).
% 1.79/2.00 end_of_list.
% 1.79/2.00
% 1.79/2.00 -------> usable clausifies to:
% 1.79/2.00
% 1.79/2.00 list(usable).
% 1.79/2.00 0 [] A=A.
% 1.79/2.00 0 [] -int_le_q(I,J)|int_less(I,J)|I=J.
% 1.79/2.00 0 [] int_le_q(I,J)| -int_less(I,J).
% 1.79/2.00 0 [] int_le_q(I,J)|I!=J.
% 1.79/2.00 0 [] -int_less(I,J)| -int_less(J,K)|int_less(I,K).
% 1.79/2.00 0 [] -int_less(I,J)|I!=J.
% 1.79/2.00 0 [] int_less(I,J)|int_le_q(J,I).
% 1.79/2.00 0 [] int_less(int_zero,int_one).
% 1.79/2.00 0 [] plus(I,J)=plus(J,I).
% 1.79/2.00 0 [] plus(I,int_zero)=I.
% 1.79/2.00 0 [] -int_less(I1,J1)| -int_le_q(I2,J2)|int_le_q(plus(I1,I2),plus(J1,J2)).
% 1.79/2.00 0 [] -int_less(I,J)|plus(I,$f1(I,J))=J.
% 1.79/2.00 0 [] -int_less(I,J)|int_less(int_zero,$f1(I,J)).
% 1.79/2.00 0 [] int_less(I,J)|plus(I,K)!=J| -int_less(int_zero,K).
% 1.79/2.00 0 [] -int_less(int_zero,I)|int_le_q(int_one,I).
% 1.79/2.00 0 [] int_less(int_zero,I)| -int_le_q(int_one,I).
% 1.79/2.00 0 [] real_zero!=real_one.
% 1.79/2.00 0 [] -int_le_q(int_one,I)| -int_le_q(I,n)| -int_le_q(int_one,J)| -int_le_q(J,n)| -int_less(int_zero,C)|I!=plus(J,C)| -int_le_q(int_one,K)| -int_le_q(K,J)|a(plus(K,C),K)=qr(plus(K,C),K).
% 1.79/2.00 0 [] -int_le_q(int_one,I)| -int_le_q(I,n)| -int_le_q(int_one,J)| -int_le_q(J,n)| -int_less(int_zero,X1)|J!=plus(I,X1)| -int_le_q(int_one,X2)| -int_le_q(X2,I)|a(X2,plus(X2,X1))=real_zero.
% 1.79/2.00 0 [] int_le_q(int_one,$c2).
% 1.79/2.00 0 [] int_less($c2,$c1).
% 1.79/2.00 0 [] int_le_q($c1,n).
% 1.79/2.00 0 [] a($c2,$c1)!=real_zero.
% 1.79/2.00 end_of_list.
% 1.79/2.00
% 1.79/2.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.79/2.00
% 1.79/2.00 This ia a non-Horn set with equality. The strategy will be
% 1.79/2.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/2.00 deletion, with positive clauses in sos and nonpositive
% 1.79/2.00 clauses in usable.
% 1.79/2.00
% 1.79/2.00 dependent: set(knuth_bendix).
% 1.79/2.00 dependent: set(anl_eq).
% 1.79/2.00 dependent: set(para_from).
% 1.79/2.00 dependent: set(para_into).
% 1.79/2.00 dependent: clear(para_from_right).
% 1.79/2.00 dependent: clear(para_into_right).
% 1.79/2.00 dependent: set(para_from_vars).
% 1.79/2.00 dependent: set(eq_units_both_ways).
% 1.79/2.00 dependent: set(dynamic_demod_all).
% 1.79/2.00 dependent: set(dynamic_demod).
% 1.79/2.00 dependent: set(order_eq).
% 1.79/2.00 dependent: set(back_demod).
% 1.79/2.00 dependent: set(lrpo).
% 1.79/2.00 dependent: set(hyper_res).
% 1.79/2.00 dependent: set(unit_deletion).
% 1.79/2.00 dependent: set(factor).
% 1.79/2.00
% 1.79/2.00 ------------> process usable:
% 1.79/2.00 ** KEPT (pick-wt=9): 1 [] -int_le_q(A,B)|int_less(A,B)|A=B.
% 1.79/2.00 ** KEPT (pick-wt=6): 2 [] int_le_q(A,B)| -int_less(A,B).
% 1.79/2.00 ** KEPT (pick-wt=6): 3 [] int_le_q(A,B)|A!=B.
% 1.79/2.00 ** KEPT (pick-wt=9): 4 [] -int_less(A,B)| -int_less(B,C)|int_less(A,C).
% 1.79/2.00 ** KEPT (pick-wt=6): 5 [] -int_less(A,B)|A!=B.
% 1.79/2.00 ** KEPT (pick-wt=13): 6 [] -int_less(A,B)| -int_le_q(C,D)|int_le_q(plus(A,C),plus(B,D)).
% 1.79/2.00 ** KEPT (pick-wt=10): 7 [] -int_less(A,B)|plus(A,$f1(A,B))=B.
% 1.79/2.00 ** KEPT (pick-wt=8): 8 [] -int_less(A,B)|int_less(int_zero,$f1(A,B)).
% 1.79/2.00 ** KEPT (pick-wt=11): 9 [] int_less(A,B)|plus(A,C)!=B| -int_less(int_zero,C).
% 242.79/243.07 ** KEPT (pick-wt=6): 10 [] -int_less(int_zero,A)|int_le_q(int_one,A).
% 242.79/243.07 ** KEPT (pick-wt=6): 11 [] int_less(int_zero,A)| -int_le_q(int_one,A).
% 242.79/243.07 ** KEPT (pick-wt=3): 12 [] real_zero!=real_one.
% 242.79/243.07 ** KEPT (pick-wt=37): 14 [copy,13,flip.9] -int_le_q(int_one,A)| -int_le_q(A,n)| -int_le_q(int_one,B)| -int_le_q(B,n)| -int_less(int_zero,C)|A!=plus(B,C)| -int_le_q(int_one,D)| -int_le_q(D,B)|qr(plus(D,C),D)=a(plus(D,C),D).
% 242.79/243.07 ** KEPT (pick-wt=33): 15 [] -int_le_q(int_one,A)| -int_le_q(A,n)| -int_le_q(int_one,B)| -int_le_q(B,n)| -int_less(int_zero,C)|B!=plus(A,C)| -int_le_q(int_one,D)| -int_le_q(D,A)|a(D,plus(D,C))=real_zero.
% 242.79/243.07 ** KEPT (pick-wt=5): 16 [] a($c2,$c1)!=real_zero.
% 242.79/243.07
% 242.79/243.07 ------------> process sos:
% 242.79/243.07 ** KEPT (pick-wt=3): 59 [] A=A.
% 242.79/243.07 ** KEPT (pick-wt=6): 60 [] int_less(A,B)|int_le_q(B,A).
% 242.79/243.07 ** KEPT (pick-wt=3): 61 [] int_less(int_zero,int_one).
% 242.79/243.07 ** KEPT (pick-wt=7): 62 [] plus(A,B)=plus(B,A).
% 242.79/243.07 ** KEPT (pick-wt=5): 63 [] plus(A,int_zero)=A.
% 242.79/243.07 ---> New Demodulator: 64 [new_demod,63] plus(A,int_zero)=A.
% 242.79/243.07 ** KEPT (pick-wt=3): 65 [] int_le_q(int_one,$c2).
% 242.79/243.07 ** KEPT (pick-wt=3): 66 [] int_less($c2,$c1).
% 242.79/243.07 ** KEPT (pick-wt=3): 67 [] int_le_q($c1,n).
% 242.79/243.07 Following clause subsumed by 59 during input processing: 0 [copy,59,flip.1] A=A.
% 242.79/243.07 Following clause subsumed by 62 during input processing: 0 [copy,62,flip.1] plus(A,B)=plus(B,A).
% 242.79/243.07 >>>> Starting back demodulation with 64.
% 242.79/243.07
% 242.79/243.07 ======= end of input processing =======
% 242.79/243.07
% 242.79/243.07 =========== start of search ===========
% 242.79/243.07
% 242.79/243.07 Search stopped in tp_alloc by max_mem option.
% 242.79/243.07
% 242.79/243.07 Search stopped in tp_alloc by max_mem option.
% 242.79/243.07
% 242.79/243.07 ============ end of search ============
% 242.79/243.07
% 242.79/243.07 -------------- statistics -------------
% 242.79/243.07 clauses given 90
% 242.79/243.07 clauses generated 1193343
% 242.79/243.07 clauses kept 13229
% 242.79/243.07 clauses forward subsumed 1180169
% 242.79/243.07 clauses back subsumed 98
% 242.79/243.07 Kbytes malloced 11718
% 242.79/243.07
% 242.79/243.07 ----------- times (seconds) -----------
% 242.79/243.07 user CPU time 241.01 (0 hr, 4 min, 1 sec)
% 242.79/243.07 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 242.79/243.07 wall-clock time 242 (0 hr, 4 min, 2 sec)
% 242.79/243.07
% 242.79/243.07 Process 29391 finished Wed Jul 27 05:31:33 2022
% 242.79/243.07 Otter interrupted
% 242.79/243.07 PROOF NOT FOUND
%------------------------------------------------------------------------------