TSTP Solution File: SWV249-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV249-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:17 EDT 2022
% Result : Unknown 2.34s 2.55s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV249-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 05:45:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n003.cluster.edu,
% 1.69/1.90 Wed Jul 27 05:45:26 2022
% 1.69/1.90 The command was "./otter". The process ID is 31988.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] A=A.
% 1.69/1.90 0 [] c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 1.69/1.90 0 [] -c_lesse_quals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)).
% 1.69/1.90 0 [] c_Message_Oanalz(c_union(c_Message_Oanalz(V_G),V_H,tc_Message_Omsg))=c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)).
% 1.69/1.90 0 [] -c_lesse_quals(V_G,V_H,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)).
% 1.69/1.90 0 [] c_Message_Oanalz(c_union(c_Message_Osynth(V_G),V_H,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Osynth(V_G),tc_Message_Omsg).
% 1.69/1.90 0 [] -class_Orderings_Oorder(T_a)|c_lesse_quals(V_x,V_x,T_a).
% 1.69/1.90 0 [] c_union(c_minus(V_B,V_A,tc_set(T_a)),V_A,T_a)=c_union(V_B,V_A,T_a).
% 1.69/1.90 0 [] c_union(V_A,c_minus(V_B,V_A,tc_set(T_a)),T_a)=c_union(V_A,V_B,T_a).
% 1.69/1.90 0 [] c_union(c_insert(V_a,V_B,T_a),V_C,T_a)=c_insert(V_a,c_union(V_B,V_C,T_a),T_a).
% 1.69/1.90 0 [] c_union(V_A,c_insert(V_a,V_B,T_a),T_a)=c_insert(V_a,c_union(V_A,V_B,T_a),T_a).
% 1.69/1.90 0 [] -c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a))|c_lesse_quals(V_A,V_C,tc_set(T_a)).
% 1.69/1.90 0 [] -c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a))|c_lesse_quals(V_B,V_C,tc_set(T_a)).
% 1.69/1.90 0 [] -c_lesse_quals(V_B,V_C,tc_set(T_a))| -c_lesse_quals(V_A,V_C,tc_set(T_a))|c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a)).
% 1.69/1.90 0 [] -c_lesse_quals(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a))|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.69/1.90 0 [] -c_in(V_x,V_B,T_a)| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_lesse_quals(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a)).
% 1.69/1.90 0 [] -c_lesse_quals(V_B,V_A,tc_set(T_a))| -c_lesse_quals(V_A,V_B,tc_set(T_a))|V_A=V_B.
% 1.69/1.90 0 [] class_Orderings_Oorder(tc_set(T_1)).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.69/1.90
% 1.69/1.90 This is a Horn set with equality. The strategy will be
% 1.69/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.69/1.90 sos and nonpositive clauses in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(knuth_bendix).
% 1.69/1.90 dependent: set(anl_eq).
% 1.69/1.90 dependent: set(para_from).
% 1.69/1.90 dependent: set(para_into).
% 1.69/1.90 dependent: clear(para_from_right).
% 1.69/1.90 dependent: clear(para_into_right).
% 1.69/1.90 dependent: set(para_from_vars).
% 1.69/1.90 dependent: set(eq_units_both_ways).
% 1.69/1.90 dependent: set(dynamic_demod_all).
% 1.69/1.90 dependent: set(dynamic_demod).
% 1.69/1.90 dependent: set(order_eq).
% 1.69/1.90 dependent: set(back_demod).
% 1.69/1.90 dependent: set(lrpo).
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: clear(order_hyper).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=18): 1 [] -c_lesse_quals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)).
% 1.69/1.90 ** KEPT (pick-wt=12): 2 [] -c_lesse_quals(A,B,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)).
% 1.69/1.90 ** KEPT (pick-wt=6): 3 [] -class_Orderings_Oorder(A)|c_lesse_quals(B,B,A).
% 1.69/1.90 ** KEPT (pick-wt=13): 4 [] -c_lesse_quals(c_union(A,B,C),D,tc_set(C))|c_lesse_quals(A,D,tc_set(C)).
% 1.69/1.90 ** KEPT (pick-wt=13): 5 [] -c_lesse_quals(c_union(A,B,C),D,tc_set(C))|c_lesse_quals(B,D,tc_set(C)).
% 1.69/1.90 ** KEPT (pick-wt=18): 6 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(D,B,tc_set(C))|c_lesse_quals(c_union(D,A,C),B,tc_set(C)).
% 1.69/1.90 ** KEPT (pick-wt=13): 7 [] -c_lesse_quals(c_insert(A,B,C),D,tc_set(C))|c_lesse_quals(B,D,tc_set(C)).
% 1.69/1.90 ** KEPT (pick-wt=17): 8 [] -c_in(A,B,C)| -c_lesse_quals(D,B,tc_set(C))|c_lesse_quals(c_insert(A,D,C),B,tc_set(C)).
% 2.34/2.55 ** KEPT (pick-wt=13): 9 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(B,A,tc_set(C))|B=A.
% 2.34/2.55
% 2.34/2.55 ------------> process sos:
% 2.34/2.55 ** KEPT (pick-wt=3): 10 [] A=A.
% 2.34/2.55 ** KEPT (pick-wt=6): 11 [] c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 2.34/2.55 ** KEPT (pick-wt=12): 12 [] c_Message_Oanalz(c_union(c_Message_Oanalz(A),B,tc_Message_Omsg))=c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)).
% 2.34/2.55 ---> New Demodulator: 13 [new_demod,12] c_Message_Oanalz(c_union(c_Message_Oanalz(A),B,tc_Message_Omsg))=c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)).
% 2.34/2.55 ** KEPT (pick-wt=16): 14 [] c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg).
% 2.34/2.55 ---> New Demodulator: 15 [new_demod,14] c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg).
% 2.34/2.55 ** KEPT (pick-wt=13): 16 [] c_union(c_minus(A,B,tc_set(C)),B,C)=c_union(A,B,C).
% 2.34/2.55 ---> New Demodulator: 17 [new_demod,16] c_union(c_minus(A,B,tc_set(C)),B,C)=c_union(A,B,C).
% 2.34/2.55 ** KEPT (pick-wt=13): 18 [] c_union(A,c_minus(B,A,tc_set(C)),C)=c_union(A,B,C).
% 2.34/2.55 ---> New Demodulator: 19 [new_demod,18] c_union(A,c_minus(B,A,tc_set(C)),C)=c_union(A,B,C).
% 2.34/2.55 ** KEPT (pick-wt=15): 20 [] c_union(c_insert(A,B,C),D,C)=c_insert(A,c_union(B,D,C),C).
% 2.34/2.55 ---> New Demodulator: 21 [new_demod,20] c_union(c_insert(A,B,C),D,C)=c_insert(A,c_union(B,D,C),C).
% 2.34/2.55 ** KEPT (pick-wt=15): 22 [] c_union(A,c_insert(B,C,D),D)=c_insert(B,c_union(A,C,D),D).
% 2.34/2.55 ---> New Demodulator: 23 [new_demod,22] c_union(A,c_insert(B,C,D),D)=c_insert(B,c_union(A,C,D),D).
% 2.34/2.55 ** KEPT (pick-wt=3): 24 [] class_Orderings_Oorder(tc_set(A)).
% 2.34/2.55 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 2.34/2.55 >>>> Starting back demodulation with 13.
% 2.34/2.55 >>>> Starting back demodulation with 15.
% 2.34/2.55 >>>> Starting back demodulation with 17.
% 2.34/2.55 >>>> Starting back demodulation with 19.
% 2.34/2.55 >>>> Starting back demodulation with 21.
% 2.34/2.55 >>>> Starting back demodulation with 23.
% 2.34/2.55
% 2.34/2.55 ======= end of input processing =======
% 2.34/2.55
% 2.34/2.55 =========== start of search ===========
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Resetting weight limit to 14.
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Resetting weight limit to 14.
% 2.34/2.55
% 2.34/2.55 sos_size=426
% 2.34/2.55
% 2.34/2.55 Search stopped because sos empty.
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Search stopped because sos empty.
% 2.34/2.55
% 2.34/2.55 ============ end of search ============
% 2.34/2.55
% 2.34/2.55 -------------- statistics -------------
% 2.34/2.55 clauses given 509
% 2.34/2.55 clauses generated 86135
% 2.34/2.55 clauses kept 638
% 2.34/2.55 clauses forward subsumed 8027
% 2.34/2.55 clauses back subsumed 19
% 2.34/2.55 Kbytes malloced 6835
% 2.34/2.55
% 2.34/2.55 ----------- times (seconds) -----------
% 2.34/2.55 user CPU time 0.64 (0 hr, 0 min, 0 sec)
% 2.34/2.55 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.34/2.55 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.34/2.55
% 2.34/2.55 Process 31988 finished Wed Jul 27 05:45:28 2022
% 2.34/2.55 Otter interrupted
% 2.34/2.55 PROOF NOT FOUND
%------------------------------------------------------------------------------