%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : MSC007-2.005 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n013.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:06:18 EDT 2022 % Result : Unknown 1.96s 2.11s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MSC007-2.005 : TPTP v8.1.0. Released v1.0.0. % 0.12/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n013.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Jul 27 08:55:00 EDT 2022 % 0.12/0.33 % CPUTime : % 1.96/2.10 ----- Otter 3.3f, August 2004 ----- % 1.96/2.10 The process was started by sandbox on n013.cluster.edu, % 1.96/2.10 Wed Jul 27 08:55:00 2022 % 1.96/2.10 The command was "./otter". The process ID is 25338. % 1.96/2.10 % 1.96/2.10 set(prolog_style_variables). % 1.96/2.10 set(auto). % 1.96/2.10 dependent: set(auto1). % 1.96/2.10 dependent: set(process_input). % 1.96/2.10 dependent: clear(print_kept). % 1.96/2.10 dependent: clear(print_new_demod). % 1.96/2.10 dependent: clear(print_back_demod). % 1.96/2.10 dependent: clear(print_back_sub). % 1.96/2.10 dependent: set(control_memory). % 1.96/2.10 dependent: assign(max_mem, 12000). % 1.96/2.10 dependent: assign(pick_given_ratio, 4). % 1.96/2.10 dependent: assign(stats_level, 1). % 1.96/2.10 dependent: assign(max_seconds, 10800). % 1.96/2.10 clear(print_given). % 1.96/2.10 % 1.96/2.10 list(usable). % 1.96/2.10 0 [] X=X. % 1.96/2.10 0 [] X!=Y|Y=X. % 1.96/2.10 0 [] X!=Y|Y!=Z|X=Z. % 1.96/2.10 0 [] pigeon(pigeon_1). % 1.96/2.10 0 [] pigeon(pigeon_2). % 1.96/2.10 0 [] pigeon(pigeon_3). % 1.96/2.10 0 [] pigeon(pigeon_4). % 1.96/2.10 0 [] pigeon(pigeon_5). % 1.96/2.10 0 [] pigeon_1!=pigeon_2. % 1.96/2.10 0 [] pigeon_1!=pigeon_3. % 1.96/2.10 0 [] pigeon_1!=pigeon_4. % 1.96/2.10 0 [] pigeon_1!=pigeon_5. % 1.96/2.10 0 [] pigeon_2!=pigeon_3. % 1.96/2.10 0 [] pigeon_2!=pigeon_4. % 1.96/2.10 0 [] pigeon_2!=pigeon_5. % 1.96/2.10 0 [] pigeon_3!=pigeon_4. % 1.96/2.10 0 [] pigeon_3!=pigeon_5. % 1.96/2.10 0 [] pigeon_4!=pigeon_5. % 1.96/2.10 0 [] hole(hole_1). % 1.96/2.10 0 [] hole(hole_2). % 1.96/2.10 0 [] hole(hole_3). % 1.96/2.10 0 [] hole(hole_4). % 1.96/2.10 0 [] hole_1!=hole_2. % 1.96/2.10 0 [] hole_1!=hole_3. % 1.96/2.10 0 [] hole_1!=hole_4. % 1.96/2.10 0 [] hole_2!=hole_3. % 1.96/2.10 0 [] hole_2!=hole_4. % 1.96/2.10 0 [] hole_3!=hole_4. % 1.96/2.10 0 [] -hole(Hole)|Hole=hole_1|Hole=hole_2|Hole=hole_3|Hole=hole_4. % 1.96/2.10 0 [] -pigeon(X)|hole(hole_of(X)). % 1.96/2.10 0 [] -pigeon(X)|in(X,hole_of(X)). % 1.96/2.10 0 [] -hole(Hole)| -pigeon(Pigeon1)| -pigeon(Pigeon2)| -in(Pigeon1,Hole)| -in(Pigeon2,Hole)|Pigeon1=Pigeon2. % 1.96/2.10 end_of_list. % 1.96/2.10 % 1.96/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=6. % 1.96/2.10 % 1.96/2.10 This ia a non-Horn set with equality. The strategy will be % 1.96/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.96/2.10 deletion, with positive clauses in sos and nonpositive % 1.96/2.10 clauses in usable. % 1.96/2.10 % 1.96/2.10 dependent: set(knuth_bendix). % 1.96/2.10 dependent: set(anl_eq). % 1.96/2.10 dependent: set(para_from). % 1.96/2.10 dependent: set(para_into). % 1.96/2.10 dependent: clear(para_from_right). % 1.96/2.10 dependent: clear(para_into_right). % 1.96/2.10 dependent: set(para_from_vars). % 1.96/2.10 dependent: set(eq_units_both_ways). % 1.96/2.10 dependent: set(dynamic_demod_all). % 1.96/2.10 dependent: set(dynamic_demod). % 1.96/2.10 dependent: set(order_eq). % 1.96/2.10 dependent: set(back_demod). % 1.96/2.10 dependent: set(lrpo). % 1.96/2.10 dependent: set(hyper_res). % 1.96/2.10 dependent: set(unit_deletion). % 1.96/2.10 dependent: set(factor). % 1.96/2.10 % 1.96/2.10 There is a clause for symmetry of equality, so it is % 1.96/2.10 assumed that equality is fully axiomatized; therefore, % 1.96/2.10 paramodulation is disabled. % 1.96/2.10 % 1.96/2.10 dependent: clear(para_from). % 1.96/2.10 dependent: clear(para_into). % 1.96/2.10 % 1.96/2.10 ------------> process usable: % 1.96/2.10 ** KEPT (pick-wt=6): 1 [] A!=B|B=A. % 1.96/2.10 ** KEPT (pick-wt=9): 2 [] A!=B|B!=C|A=C. % 1.96/2.10 ** KEPT (pick-wt=3): 4 [copy,3,flip.1] pigeon_2!=pigeon_1. % 1.96/2.10 ** KEPT (pick-wt=3): 6 [copy,5,flip.1] pigeon_3!=pigeon_1. % 1.96/2.10 ** KEPT (pick-wt=3): 8 [copy,7,flip.1] pigeon_4!=pigeon_1. % 1.96/2.10 ** KEPT (pick-wt=3): 10 [copy,9,flip.1] pigeon_5!=pigeon_1. % 1.96/2.10 ** KEPT (pick-wt=3): 12 [copy,11,flip.1] pigeon_3!=pigeon_2. % 1.96/2.10 ** KEPT (pick-wt=3): 14 [copy,13,flip.1] pigeon_4!=pigeon_2. % 1.96/2.10 ** KEPT (pick-wt=3): 16 [copy,15,flip.1] pigeon_5!=pigeon_2. % 1.96/2.10 ** KEPT (pick-wt=3): 18 [copy,17,flip.1] pigeon_4!=pigeon_3. % 1.96/2.10 ** KEPT (pick-wt=3): 20 [copy,19,flip.1] pigeon_5!=pigeon_3. % 1.96/2.10 ** KEPT (pick-wt=3): 22 [copy,21,flip.1] pigeon_5!=pigeon_4. % 1.96/2.10 ** KEPT (pick-wt=3): 24 [copy,23,flip.1] hole_2!=hole_1. % 1.96/2.10 ** KEPT (pick-wt=3): 26 [copy,25,flip.1] hole_3!=hole_1. % 1.96/2.10 ** KEPT (pick-wt=3): 28 [copy,27,flip.1] hole_4!=hole_1. % 1.96/2.10 ** KEPT (pick-wt=3): 30 [copy,29,flip.1] hole_3!=hole_2. % 1.96/2.10 ** KEPT (pick-wt=3): 32 [copy,31,flip.1] hole_4!=hole_2. % 1.96/2.10 ** KEPT (pick-wt=3): 34 [copy,33,flip.1] hole_4!=hole_3. % 1.96/2.10 ** KEPT (pick-wt=14): 35 [] -hole(A)|A=hole_1|A=hole_2|A=hole_3|A=hole_4. % 1.96/2.10 ** KEPT (pick-wt=5): 36 [] -pigeon(A)|hole(hole_of(A)). % 1.96/2.10 ** KEPT (pick-wt=6): 37 [] -pigeon(A)|in(A,hole_of(A)). % 1.96/2.10 ** KEPT (pick-wt=15): 38 [] -hole(A)| -pigeon(B)| -pigeon(C)| -in(B,A)| -in(C,A)|B=C. % 1.96/2.10 % 1.96/2.10 ------------> process sos: % 1.96/2.10 ** KEPT (pick-wt=3): 40 [] A=A. % 1.96/2.10 ** KEPT (pick-wt=2): 41 [] pigeon(pigeon_1). % 1.96/2.10 ** KEPT (pick-wt=2): 42 [] pigeon(pigeon_2). % 1.96/2.10 ** KEPT (pick-wt=2): 43 [] pigeon(pigeon_3). % 1.96/2.10 ** KEPT (pick-wt=2): 44 [] pigeon(pigeon_4). % 1.96/2.10 ** KEPT (pick-wt=2): 45 [] pigeon(pigeon_5). % 1.96/2.10 ** KEPT (pick-wt=2): 46 [] hole(hole_1). % 1.96/2.10 ** KEPT (pick-wt=2): 47 [] hole(hole_2). % 1.96/2.10 ** KEPT (pick-wt=2): 48 [] hole(hole_3). % 1.96/2.10 ** KEPT (pick-wt=2): 49 [] hole(hole_4). % 1.96/2.10 Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] A=A. % 1.96/2.10 40 back subsumes 39. % 1.96/2.10 % 1.96/2.10 ======= end of input processing ======= % 1.96/2.10 % 1.96/2.10 =========== start of search =========== % 1.96/2.10 % 1.96/2.10 Search stopped because sos empty. % 1.96/2.10 % 1.96/2.10 % 1.96/2.10 Search stopped because sos empty. % 1.96/2.10 % 1.96/2.10 ============ end of search ============ % 1.96/2.10 % 1.96/2.10 -------------- statistics ------------- % 1.96/2.10 clauses given 25 % 1.96/2.10 clauses generated 94 % 1.96/2.10 clauses kept 48 % 1.96/2.10 clauses forward subsumed 78 % 1.96/2.10 clauses back subsumed 1 % 1.96/2.10 Kbytes malloced 976 % 1.96/2.10 % 1.96/2.10 ----------- times (seconds) ----------- % 1.96/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec) % 1.96/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec) % 1.96/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec) % 1.96/2.10 % 1.96/2.10 Process 25338 finished Wed Jul 27 08:55:01 2022 % 1.96/2.10 Otter interrupted % 1.96/2.10 PROOF NOT FOUND %------------------------------------------------------------------------------