TSTP Solution File: SCT101-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SCT101-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:12:30 EDT 2022
% Result : Unknown 1.90s 2.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SCT101-1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:17:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.90/2.09 ----- Otter 3.3f, August 2004 -----
% 1.90/2.09 The process was started by sandbox on n026.cluster.edu,
% 1.90/2.09 Wed Jul 27 09:17:39 2022
% 1.90/2.09 The command was "./otter". The process ID is 22647.
% 1.90/2.09
% 1.90/2.09 set(prolog_style_variables).
% 1.90/2.09 set(auto).
% 1.90/2.09 dependent: set(auto1).
% 1.90/2.09 dependent: set(process_input).
% 1.90/2.09 dependent: clear(print_kept).
% 1.90/2.09 dependent: clear(print_new_demod).
% 1.90/2.09 dependent: clear(print_back_demod).
% 1.90/2.09 dependent: clear(print_back_sub).
% 1.90/2.09 dependent: set(control_memory).
% 1.90/2.09 dependent: assign(max_mem, 12000).
% 1.90/2.09 dependent: assign(pick_given_ratio, 4).
% 1.90/2.09 dependent: assign(stats_level, 1).
% 1.90/2.09 dependent: assign(max_seconds, 10800).
% 1.90/2.09 clear(print_given).
% 1.90/2.09
% 1.90/2.09 list(usable).
% 1.90/2.09 0 [] A=A.
% 1.90/2.09 0 [] c_List_Odistinct(c_List_Olist_OCons(v_sko__CHAINED__1,c_List_Olist_OCons(v_sko__CHAINED__2,c_List_Olist_OCons(v_sko__CHAINED__3,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt).
% 1.90/2.09 0 [] V_x=v_a.
% 1.90/2.09 end_of_list.
% 1.90/2.09
% 1.90/2.09 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.90/2.09
% 1.90/2.09 All clauses are units, and equality is present; the
% 1.90/2.09 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.90/2.09
% 1.90/2.09 dependent: set(knuth_bendix).
% 1.90/2.09 dependent: set(anl_eq).
% 1.90/2.09 dependent: set(para_from).
% 1.90/2.09 dependent: set(para_into).
% 1.90/2.09 dependent: clear(para_from_right).
% 1.90/2.09 dependent: clear(para_into_right).
% 1.90/2.09 dependent: set(para_from_vars).
% 1.90/2.09 dependent: set(eq_units_both_ways).
% 1.90/2.09 dependent: set(dynamic_demod_all).
% 1.90/2.09 dependent: set(dynamic_demod).
% 1.90/2.09 dependent: set(order_eq).
% 1.90/2.09 dependent: set(back_demod).
% 1.90/2.09 dependent: set(lrpo).
% 1.90/2.09
% 1.90/2.09 There is no negative clause, so all clause lists will
% 1.90/2.09 be printed at the end of the search.
% 1.90/2.09
% 1.90/2.09 dependent: set(print_lists_at_end).
% 1.90/2.09
% 1.90/2.09 ------------> process usable:
% 1.90/2.09
% 1.90/2.09 ------------> process sos:
% 1.90/2.09 ** KEPT (pick-wt=3): 1 [] A=A.
% 1.90/2.09 ** KEPT (pick-wt=13): 2 [] c_List_Odistinct(c_List_Olist_OCons(v_sko__CHAINED__1,c_List_Olist_OCons(v_sko__CHAINED__2,c_List_Olist_OCons(v_sko__CHAINED__3,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt).
% 1.90/2.09 ** KEPT (pick-wt=3): 3 [] A=v_a.
% 1.90/2.09 Following clause subsumed by 1 during input processing: 0 [copy,1,flip.1] A=A.
% 1.90/2.09 ** KEPT (pick-wt=3): 4 [copy,3,flip.1] v_a=A.
% 1.90/2.09 Following clause subsumed by 3 during input processing: 0 [copy,4,flip.1] A=v_a.
% 1.90/2.09
% 1.90/2.09 ======= end of input processing =======
% 1.90/2.09
% 1.90/2.09 =========== start of search ===========
% 1.90/2.09
% 1.90/2.09 Search stopped because sos empty.
% 1.90/2.09
% 1.90/2.09
% 1.90/2.09 Search stopped because sos empty.
% 1.90/2.09
% 1.90/2.09 ============ end of search ============
% 1.90/2.09
% 1.90/2.09 list(usable).
% 1.90/2.09 5 [para_into,4.1.1,4.1.1] A=B.
% 1.90/2.09 18 [para_into,16.1.2,5.1.1] c_List_Odistinct(A,B).
% 1.90/2.09 end_of_list.
% 1.90/2.09
% 1.90/2.09 list(sos).
% 1.90/2.09 end_of_list.
% 1.90/2.09
% 1.90/2.09 list(demodulators).
% 1.90/2.09 end_of_list.
% 1.90/2.09
% 1.90/2.09
% 1.90/2.09 -------------- statistics -------------
% 1.90/2.09 clauses given 7
% 1.90/2.09 clauses generated 15
% 1.90/2.09 clauses kept 18
% 1.90/2.09 clauses forward subsumed 4
% 1.90/2.09 clauses back subsumed 16
% 1.90/2.09 Kbytes malloced 976
% 1.90/2.09
% 1.90/2.09 ----------- times (seconds) -----------
% 1.90/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.90/2.09
% 1.90/2.09 Process 22647 finished Wed Jul 27 09:17:41 2022
% 1.90/2.09 Otter interrupted
% 1.90/2.09 PROOF NOT FOUND
%------------------------------------------------------------------------------