TSTP Solution File: SWV490+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 : Timeout 299.86s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.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 06:19:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.62/1.82 ----- Otter 3.3f, August 2004 -----
% 1.62/1.82 The process was started by sandbox on n012.cluster.edu,
% 1.62/1.82 Wed Jul 27 06:19:05 2022
% 1.62/1.82 The command was "./otter". The process ID is 6190.
% 1.62/1.82
% 1.62/1.82 set(prolog_style_variables).
% 1.62/1.82 set(auto).
% 1.62/1.82 dependent: set(auto1).
% 1.62/1.82 dependent: set(process_input).
% 1.62/1.82 dependent: clear(print_kept).
% 1.62/1.82 dependent: clear(print_new_demod).
% 1.62/1.82 dependent: clear(print_back_demod).
% 1.62/1.82 dependent: clear(print_back_sub).
% 1.62/1.82 dependent: set(control_memory).
% 1.62/1.82 dependent: assign(max_mem, 12000).
% 1.62/1.82 dependent: assign(pick_given_ratio, 4).
% 1.62/1.82 dependent: assign(stats_level, 1).
% 1.62/1.82 dependent: assign(max_seconds, 10800).
% 1.62/1.82 clear(print_given).
% 1.62/1.82
% 1.62/1.82 formula_list(usable).
% 1.62/1.82 all A (A=A).
% 1.62/1.82 all I J (int_le_q(I,J)<->int_less(I,J)|I=J).
% 1.62/1.82 all I J K (int_less(I,J)&int_less(J,K)->int_less(I,K)).
% 1.62/1.82 all I J (int_less(I,J)->I!=J).
% 1.62/1.82 all I J (int_less(I,J)|int_le_q(J,I)).
% 1.62/1.82 int_less(int_zero,int_one).
% 1.62/1.82 all I J (plus(I,J)=plus(J,I)).
% 1.62/1.82 all I (plus(I,int_zero)=I).
% 1.62/1.82 all I1 J1 I2 J2 (int_less(I1,J1)&int_le_q(I2,J2)->int_le_q(plus(I1,I2),plus(J1,J2))).
% 1.62/1.82 all I J (int_less(I,J)<-> (exists K (plus(I,K)=J&int_less(int_zero,K)))).
% 1.62/1.82 all I (int_less(int_zero,I)<->int_le_q(int_one,I)).
% 1.62/1.82 real_zero!=real_one.
% 1.62/1.82 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)=real_zero))))& (all K (int_le_q(int_one,K)&int_le_q(K,J)->a(K,K)=real_one))& (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.62/1.82 -(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)-> (I!=J->a(I,J)=real_zero)& (I=J->a(I,J)!=real_zero))).
% 1.62/1.82 end_of_list.
% 1.62/1.82
% 1.62/1.82 -------> usable clausifies to:
% 1.62/1.82
% 1.62/1.82 list(usable).
% 1.62/1.82 0 [] A=A.
% 1.62/1.82 0 [] -int_le_q(I,J)|int_less(I,J)|I=J.
% 1.62/1.82 0 [] int_le_q(I,J)| -int_less(I,J).
% 1.62/1.82 0 [] int_le_q(I,J)|I!=J.
% 1.62/1.82 0 [] -int_less(I,J)| -int_less(J,K)|int_less(I,K).
% 1.62/1.82 0 [] -int_less(I,J)|I!=J.
% 1.62/1.82 0 [] int_less(I,J)|int_le_q(J,I).
% 1.62/1.82 0 [] int_less(int_zero,int_one).
% 1.62/1.82 0 [] plus(I,J)=plus(J,I).
% 1.62/1.82 0 [] plus(I,int_zero)=I.
% 1.62/1.82 0 [] -int_less(I1,J1)| -int_le_q(I2,J2)|int_le_q(plus(I1,I2),plus(J1,J2)).
% 1.62/1.82 0 [] -int_less(I,J)|plus(I,$f1(I,J))=J.
% 1.62/1.82 0 [] -int_less(I,J)|int_less(int_zero,$f1(I,J)).
% 1.62/1.82 0 [] int_less(I,J)|plus(I,K)!=J| -int_less(int_zero,K).
% 1.62/1.82 0 [] -int_less(int_zero,I)|int_le_q(int_one,I).
% 1.62/1.82 0 [] int_less(int_zero,I)| -int_le_q(int_one,I).
% 1.62/1.82 0 [] real_zero!=real_one.
% 1.62/1.82 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)=real_zero.
% 1.62/1.82 0 [] -int_le_q(int_one,I)| -int_le_q(I,n)| -int_le_q(int_one,J)| -int_le_q(J,n)| -int_le_q(int_one,X1)| -int_le_q(X1,J)|a(X1,X1)=real_one.
% 1.62/1.82 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,X2)|J!=plus(I,X2)| -int_le_q(int_one,X3)| -int_le_q(X3,I)|a(X3,plus(X3,X2))=real_zero.
% 1.62/1.82 0 [] int_le_q(int_one,$c2).
% 1.62/1.82 0 [] int_le_q($c2,n).
% 1.62/1.82 0 [] int_le_q(int_one,$c1).
% 1.62/1.82 0 [] int_le_q($c1,n).
% 1.62/1.82 0 [] $c2!=$c1|a($c2,$c1)=real_zero.
% 1.62/1.82 0 [] a($c2,$c1)!=real_zero|$c2=$c1.
% 1.62/1.82 end_of_list.
% 1.62/1.82
% 1.62/1.82 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.62/1.82
% 1.62/1.82 This ia a non-Horn set with equality. The strategy will be
% 1.62/1.82 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.62/1.82 deletion, with positive clauses in sos and nonpositive
% 1.62/1.82 clauses in usable.
% 1.62/1.82
% 1.62/1.82 dependent: set(knuth_bendix).
% 1.62/1.82 dependent: set(anl_eq).
% 1.62/1.82 dependent: set(para_from).
% 1.62/1.82 dependent: set(para_into).
% 1.62/1.82 dependent: clear(para_from_right).
% 1.62/1.82 dependent: clear(para_into_right).
% 1.62/1.82 dependent: set(para_from_vars).
% 1.62/1.82 dependent: set(eq_units_both_ways).
% 1.62/1.82 dependent: set(dynamic_demod_all).
% 1.62/1.82 dependent: set(dynamic_demod).
% 1.62/1.82 dependent: set(order_eq).
% 1.62/1.82 dependent: set(back_demod).
% 1.62/1.82 dependent: set(lrpo).
% 1.62/1.82 dependent: set(hyper_res).
% 1.62/1.82 dependent: set(unit_deletion).
% 1.62/1.82 dependent: set(factor).
% 1.62/1.82
% 1.62/1.82 ------------> process usable:
% 1.62/1.82 ** KEPT (pick-wt=9): 1 [] -int_le_q(A,B)|int_less(A,B)|A=B.
% 1.62/1.82 ** KEPT (pick-wt=6): 2 [] int_le_q(A,B)| -int_less(A,B).
% 1.62/1.82 ** KEPT (pick-wt=6): 3 [] int_le_q(A,B)|A!=B.
% 1.62/1.82 ** KEPT (pick-wt=9): 4 [] -int_less(A,B)| -int_less(B,C)|int_lAlarm clock
% 299.86/300.03 Otter interrupted
% 299.86/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------