%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n015.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:19:40 EDT 2022 % Result : Timeout 299.86s 300.04s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.13 % Command : otter-tptp-script %s % 0.13/0.34 % Computer : n015.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 06:10:41 EDT 2022 % 0.13/0.34 % CPUTime : % 1.87/2.09 ----- Otter 3.3f, August 2004 ----- % 1.87/2.09 The process was started by sandbox2 on n015.cluster.edu, % 1.87/2.09 Wed Jul 27 06:10:42 2022 % 1.87/2.09 The command was "./otter". The process ID is 12703. % 1.87/2.09 % 1.87/2.09 set(prolog_style_variables). % 1.87/2.09 set(auto). % 1.87/2.09 dependent: set(auto1). % 1.87/2.09 dependent: set(process_input). % 1.87/2.09 dependent: clear(print_kept). % 1.87/2.09 dependent: clear(print_new_demod). % 1.87/2.09 dependent: clear(print_back_demod). % 1.87/2.09 dependent: clear(print_back_sub). % 1.87/2.09 dependent: set(control_memory). % 1.87/2.09 dependent: assign(max_mem, 12000). % 1.87/2.09 dependent: assign(pick_given_ratio, 4). % 1.87/2.09 dependent: assign(stats_level, 1). % 1.87/2.09 dependent: assign(max_seconds, 10800). % 1.87/2.09 clear(print_given). % 1.87/2.09 % 1.87/2.09 list(usable). % 1.87/2.09 0 [] A=A. % 1.87/2.09 0 [] predecessor(successor(X))=X. % 1.87/2.09 0 [] successor(predecessor(X))=X. % 1.87/2.09 0 [] X=Y|predecessor(X)!=predecessor(Y). % 1.87/2.09 0 [] X=Y|successor(X)!=successor(Y). % 1.87/2.09 0 [] less_than(predecessor(X),X). % 1.87/2.09 0 [] less_than(X,successor(X)). % 1.87/2.09 0 [] less_than(X,Z)| -less_than(X,Y)| -less_than(Y,Z). % 1.87/2.09 0 [] less_than(X,Y)|less_than(Y,X)|X=Y. % 1.87/2.09 0 [] -less_than(X,X). % 1.87/2.09 0 [] -less_than(X,Y)| -less_than(Y,X). % 1.87/2.09 0 [] less_than(Y,Z)|X!=Y| -less_than(X,Z). % 1.87/2.09 0 [] less_than(Z,Y)|X!=Y| -less_than(Z,X). % 1.87/2.09 0 [] -less_than(n,k). % 1.87/2.09 0 [] -less_than(k,i). % 1.87/2.09 0 [] less_than(i,n). % 1.87/2.09 0 [] -less_than(n,m). % 1.87/2.09 0 [] less_than(i,m). % 1.87/2.09 0 [] -less_than(i,one). % 1.87/2.09 0 [] k!=m. % 1.87/2.09 0 [] less_than(a(m),a(k)). % 1.87/2.09 0 [] -less_than(one,X)| -less_than(X,i)| -less_than(a(X),a(predecessor(X))). % 1.87/2.09 0 [] less_than(X,i)|less_than(n,X)| -less_than(one,X)| -less_than(a(X),a(predecessor(i))). % 1.87/2.09 0 [] less_than(X,i)| -less_than(X,successor(n))| -less_than(a(X),a(k)). % 1.87/2.09 end_of_list. % 1.87/2.09 % 1.87/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4. % 1.87/2.09 % 1.87/2.09 This ia a non-Horn set with equality. The strategy will be % 1.87/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.87/2.09 deletion, with positive clauses in sos and nonpositive % 1.87/2.09 clauses in usable. % 1.87/2.09 % 1.87/2.09 dependent: set(knuth_bendix). % 1.87/2.09 dependent: set(anl_eq). % 1.87/2.09 dependent: set(para_from). % 1.87/2.09 dependent: set(para_into). % 1.87/2.09 dependent: clear(para_from_right). % 1.87/2.09 dependent: clear(para_into_right). % 1.87/2.09 dependent: set(para_from_vars). % 1.87/2.09 dependent: set(eq_units_both_ways). % 1.87/2.09 dependent: set(dynamic_demod_all). % 1.87/2.09 dependent: set(dynamic_demod). % 1.87/2.09 dependent: set(order_eq). % 1.87/2.09 dependent: set(back_demod). % 1.87/2.09 dependent: set(lrpo). % 1.87/2.09 dependent: set(hyper_res). % 1.87/2.09 dependent: set(unit_deletion). % 1.87/2.09 dependent: set(factor). % 1.87/2.09 % 1.87/2.09 ------------> process usable: % 1.87/2.09 ** KEPT (pick-wt=8): 1 [] A=B|predecessor(A)!=predecessor(B). % 1.87/2.09 ** KEPT (pick-wt=8): 2 [] A=B|successor(A)!=successor(B). % 1.87/2.09 ** KEPT (pick-wt=9): 3 [] less_than(A,B)| -less_than(A,C)| -less_than(C,B). % 1.87/2.09 ** KEPT (pick-wt=3): 4 [] -less_than(A,A). % 1.87/2.09 ** KEPT (pick-wt=6): 5 [] -less_than(A,B)| -less_than(B,A). % 1.87/2.09 ** KEPT (pick-wt=9): 6 [] less_than(A,B)|C!=A| -less_than(C,B). % 1.87/2.09 ** KEPT (pick-wt=9): 7 [] less_than(A,B)|C!=B| -less_than(A,C). % 1.87/2.09 ** KEPT (pick-wt=3): 8 [] -less_than(n,k). % 1.87/2.09 ** KEPT (pick-wt=3): 9 [] -less_than(k,i). % 1.87/2.09 ** KEPT (pick-wt=3): 10 [] -less_than(n,m). % 1.87/2.09 ** KEPT (pick-wt=3): 11 [] -less_than(i,one). % 1.87/2.09 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] m!=k. % 1.87/2.09 ** KEPT (pick-wt=12): 14 [] -less_than(one,A)| -less_than(A,i)| -less_than(a(A),a(predecessor(A))). % 1.87/2.09 ** KEPT (pick-wt=15): 15 [] less_than(A,i)|less_than(n,A)| -less_than(one,A)| -less_than(a(A),a(predecessor(i))). % 1.87/2.09 ** KEPT (pick-wt=12): 16 [] less_than(A,i)| -less_than(A,successor(n))| -less_than(a(A),a(k)). % 1.87/2.09 % 1.87/2.09 ------------> process sos: % 1.87/2.09 ** KEPT (pick-wt=3): 17 [] A=A. % 1.87/2.09 ** KEPT (pick-wt=5): 18 [] predecessor(successor(A))=A. % 1.87/2.09 ---> New Demodulator: 19 [new_demod,18] predecessor(successor(A))=A. % 1.87/2.09 ** KEPT (pick-wt=5): 20 [] successor(predecessor(A))=A. % 1.87/2.09 ---> New Demodulator: 21 [new_demod,20] successor(predecessor(A))=A. % 1.87/2.09 ** KEPT (pick-wt=4): 22 [] less_than(predecessor(A),A). % 1.87/2.09 ** KEPT (pick-wt=4): 23 [] less_than(A,successor(A)). % 1.87/2.09 ** KEPT (pick-wt=9): 24 [] less_than(A,B)|less_than(B,A)|A=B. % 1.87/2.09 ** KEPT (pick-wt=3): 25 [] less_than(i,n). % 1.87/2.09 ** KEPT (pick-wt=3): 26 [] less_than(i,m). % 1.87/2.09 ** KEPT (pick-wt=5): 27 [] less_than(a(m),a(k)). % 1.87/2.09 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A. % 1.87/2.09 >>>> Starting back demodulation with 19. % 1.87/2.09 >>>> Starting back demodulation with 21. % 1.87/2.09 % 1.87/2.09 ======= end ofAlarm clock % 299.86/300.04 Otter interrupted % 299.86/300.04 PROOF NOT FOUND %------------------------------------------------------------------------------