%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWX199+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n005.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 : Tue May 5 07:05:24 PM UTC 2026 % Result : Timeout 299.87s 300.02s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX199+1 : TPTP v9.3.0. Released v9.3.0. % 0.13/0.13 % Command : otter-tptp-script %s % 0.16/0.34 % Computer : n005.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue May 5 11:12:15 EDT 2026 % 0.16/0.34 % CPUTime : % 1.88/2.09 ----- Otter 3.3f, August 2004 ----- % 1.88/2.09 The process was started by sandbox2 on n005.cluster.edu, % 1.88/2.09 Tue May 5 11:12:15 2026 % 1.88/2.09 The command was "./otter". The process ID is 26565. % 1.88/2.09 % 1.88/2.09 set(prolog_style_variables). % 1.88/2.09 set(auto). % 1.88/2.09 dependent: set(auto1). % 1.88/2.09 dependent: set(process_input). % 1.88/2.09 dependent: clear(print_kept). % 1.88/2.09 dependent: clear(print_new_demod). % 1.88/2.09 dependent: clear(print_back_demod). % 1.88/2.09 dependent: clear(print_back_sub). % 1.88/2.09 dependent: set(control_memory). % 1.88/2.09 dependent: assign(max_mem, 12000). % 1.88/2.09 dependent: assign(pick_given_ratio, 4). % 1.88/2.09 dependent: assign(stats_level, 1). % 1.88/2.09 dependent: assign(max_seconds, 10800). % 1.88/2.09 clear(print_given). % 1.88/2.09 % 1.88/2.09 formula_list(usable). % 1.88/2.09 all A (A=A). % 1.88/2.09 all X X2 (head(cons(X,X2))=X). % 1.88/2.09 all X X2 (tail(cons(X,X2))=X2). % 1.88/2.09 all X X2 (nil!=cons(X,X2)). % 1.88/2.09 all X (proj1S(s(X))=X). % 1.88/2.09 all X (z!=s(X)). % 1.88/2.09 all Y le_qNat(z,Y). % 1.88/2.09 all Z (-le_qNat(s(Z),z)). % 1.88/2.09 all Z M (le_qNat(s(Z),s(M))<->le_qNat(Z,M)). % 1.88/2.09 all Y (merge(nil,Y)=Y). % 1.88/2.09 all Z Xs (merge(cons(Z,Xs),nil)=cons(Z,Xs)). % 1.88/2.09 all Z Xs Y2 Ys (le_qNat(Z,Y2)->merge(cons(Z,Xs),cons(Y2,Ys))=cons(Z,merge(Xs,cons(Y2,Ys)))). % 1.88/2.09 all Z Xs Y2 Ys (-le_qNat(Z,Y2)->merge(cons(Z,Xs),cons(Y2,Ys))=cons(Y2,merge(cons(Z,Xs),Ys))). % 1.88/2.09 -(exists Xs Ys Zs (-(merge(Xs,Ys)=merge(Ys,Xs)-> (merge(Xs,Zs)=merge(Zs,Xs)->merge(Ys,Zs)=merge(Zs,Ys))))). % 1.88/2.09 end_of_list. % 1.88/2.09 % 1.88/2.09 -------> usable clausifies to: % 1.88/2.09 % 1.88/2.09 list(usable). % 1.88/2.09 0 [] A=A. % 1.88/2.09 0 [] head(cons(X,X2))=X. % 1.88/2.09 0 [] tail(cons(X,X2))=X2. % 1.88/2.09 0 [] nil!=cons(X,X2). % 1.88/2.09 0 [] proj1S(s(X))=X. % 1.88/2.09 0 [] z!=s(X). % 1.88/2.09 0 [] le_qNat(z,Y). % 1.88/2.09 0 [] -le_qNat(s(Z),z). % 1.88/2.09 0 [] -le_qNat(s(Z),s(M))|le_qNat(Z,M). % 1.88/2.09 0 [] le_qNat(s(Z),s(M))| -le_qNat(Z,M). % 1.88/2.09 0 [] merge(nil,Y)=Y. % 1.88/2.09 0 [] merge(cons(Z,Xs),nil)=cons(Z,Xs). % 1.88/2.09 0 [] -le_qNat(Z,Y2)|merge(cons(Z,Xs),cons(Y2,Ys))=cons(Z,merge(Xs,cons(Y2,Ys))). % 1.88/2.09 0 [] le_qNat(Z,Y2)|merge(cons(Z,Xs),cons(Y2,Ys))=cons(Y2,merge(cons(Z,Xs),Ys)). % 1.88/2.09 0 [] merge(Xs,Ys)!=merge(Ys,Xs)|merge(Xs,Zs)!=merge(Zs,Xs)|merge(Ys,Zs)=merge(Zs,Ys). % 1.88/2.09 end_of_list. % 1.88/2.09 % 1.88/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.88/2.09 % 1.88/2.09 This ia a non-Horn set with equality. The strategy will be % 1.88/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.88/2.09 deletion, with positive clauses in sos and nonpositive % 1.88/2.09 clauses in usable. % 1.88/2.09 % 1.88/2.09 dependent: set(knuth_bendix). % 1.88/2.09 dependent: set(anl_eq). % 1.88/2.09 dependent: set(para_from). % 1.88/2.09 dependent: set(para_into). % 1.88/2.09 dependent: clear(para_from_right). % 1.88/2.09 dependent: clear(para_into_right). % 1.88/2.09 dependent: set(para_from_vars). % 1.88/2.09 dependent: set(eq_units_both_ways). % 1.88/2.09 dependent: set(dynamic_demod_all). % 1.88/2.09 dependent: set(dynamic_demod). % 1.88/2.09 dependent: set(order_eq). % 1.88/2.09 dependent: set(back_demod). % 1.88/2.09 dependent: set(lrpo). % 1.88/2.09 dependent: set(hyper_res). % 1.88/2.09 dependent: set(unit_deletion). % 1.88/2.09 dependent: set(factor). % 1.88/2.09 % 1.88/2.09 ------------> process usable: % 1.88/2.09 ** KEPT (pick-wt=5): 2 [copy,1,flip.1] cons(A,B)!=nil. % 1.88/2.09 ** KEPT (pick-wt=4): 4 [copy,3,flip.1] s(A)!=z. % 1.88/2.09 ** KEPT (pick-wt=4): 5 [] -le_qNat(s(A),z). % 1.88/2.09 ** KEPT (pick-wt=8): 6 [] -le_qNat(s(A),s(B))|le_qNat(A,B). % 1.88/2.09 ** KEPT (pick-wt=8): 7 [] le_qNat(s(A),s(B))| -le_qNat(A,B). % 1.88/2.09 ** KEPT (pick-wt=18): 8 [] -le_qNat(A,B)|merge(cons(A,C),cons(B,D))=cons(A,merge(C,cons(B,D))). % 1.88/2.09 ** KEPT (pick-wt=21): 9 [] merge(A,B)!=merge(B,A)|merge(A,C)!=merge(C,A)|merge(B,C)=merge(C,B). % 1.88/2.09 % 1.88/2.09 ------------> process sos: % 1.88/2.09 ** KEPT (pick-wt=3): 11 [] A=A. % 1.88/2.09 ** KEPT (pick-wt=6): 12 [] head(cons(A,B))=A. % 1.88/2.09 ---> New Demodulator: 13 [new_demod,12] head(cons(A,B))=A. % 1.88/2.09 ** KEPT (pick-wt=6): 14 [] tail(cons(A,B))=B. % 1.88/2.09 ---> New Demodulator: 15 [new_demod,14] tail(cons(A,B))=B. % 1.88/2.09 ** KEPT (pick-wt=5): 16 [] proj1S(s(A))=A. % 1.88/2.09 ---> New Demodulator: 17 [new_demod,16] proj1S(s(A))=A. % 1.88/2.09 ** KEPT (pick-wt=3): 18 [] le_qNat(z,A). % 1.88/2.09 ** KEPT (pick-wt=5): 19 [] merge(nil,A)=A. % 1.88/2.09 ---> New Demodulator: 20 [new_demod,19] merge(nil,A)=A. % 1.88/2.09 ** KEPT (pick-wt=9): 21 [] merge(cons(A,B),nil)=cons(A,B). % 1.88/2.09 ---> New Demodulator: 22 [new_demod,21] merge(cons(A,B),nil)=cons(A,B). % 1.88/2.09 ** KEPT (pick-wt=18): 23 [] le_qNat(A,B)|merge(cons(A,C),cons(B,D))=cons(B,merge(cons(A,C),D)). % 1.88/2.09 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] A=A. % 1.88/2.09 11 back subsumes 10. % 1.88/2.09 >>>> Starting back demodulation with 13. % 1.88/2.09 >>>> Starting back demodulation with 15. % 1.88/2.09 >>>> Starting back demodulation wiTerminated % 299.87/300.02 Otter interrupted % 299.87/300.03 PROOF NOT FOUND %------------------------------------------------------------------------------