TSTP Solution File: SWV779-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV779-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n009.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  : 600s
% DateTime : Wed Jul 20 21:40:12 EDT 2022

% Result   : Unsatisfiable 0.20s 0.42s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV779-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 11:54:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.42  ----- Otter 3.2, August 2001 -----
% 0.20/0.42  The process was started by sandbox2 on n009.cluster.edu,
% 0.20/0.42  Wed Jun 15 11:54:08 2022
% 0.20/0.42  The command was "./sos".  The process ID is 15689.
% 0.20/0.42  
% 0.20/0.42  set(prolog_style_variables).
% 0.20/0.42  set(auto).
% 0.20/0.42     dependent: set(auto1).
% 0.20/0.42     dependent: set(process_input).
% 0.20/0.42     dependent: clear(print_kept).
% 0.20/0.42     dependent: clear(print_new_demod).
% 0.20/0.42     dependent: clear(print_back_demod).
% 0.20/0.42     dependent: clear(print_back_sub).
% 0.20/0.42     dependent: set(control_memory).
% 0.20/0.42     dependent: assign(max_mem, 12000).
% 0.20/0.42     dependent: assign(pick_given_ratio, 4).
% 0.20/0.42     dependent: assign(stats_level, 1).
% 0.20/0.42     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.42     dependent: assign(sos_limit, 5000).
% 0.20/0.42     dependent: assign(max_weight, 60).
% 0.20/0.42  clear(print_given).
% 0.20/0.42  
% 0.20/0.42  list(usable).
% 0.20/0.42  
% 0.20/0.42  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.42  
% 0.20/0.42  This ia a non-Horn set with equality.  The strategy will be
% 0.20/0.42  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.42  unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.42  clauses in usable.
% 0.20/0.42  
% 0.20/0.42     dependent: set(knuth_bendix).
% 0.20/0.42     dependent: set(para_from).
% 0.20/0.42     dependent: set(para_into).
% 0.20/0.42     dependent: clear(para_from_right).
% 0.20/0.42     dependent: clear(para_into_right).
% 0.20/0.42     dependent: set(para_from_vars).
% 0.20/0.42     dependent: set(eq_units_both_ways).
% 0.20/0.42     dependent: set(dynamic_demod_all).
% 0.20/0.42     dependent: set(dynamic_demod).
% 0.20/0.42     dependent: set(order_eq).
% 0.20/0.42     dependent: set(back_demod).
% 0.20/0.42     dependent: set(lrpo).
% 0.20/0.42     dependent: set(hyper_res).
% 0.20/0.42     dependent: set(unit_deletion).
% 0.20/0.42     dependent: set(factor).
% 0.20/0.42  
% 0.20/0.42  ------------> process usable:
% 0.20/0.42    Following clause subsumed by 50 during input processing: 0 [] {-} A=B| -c_lessequals(B,A,tc_fun(C,tc_bool))| -c_lessequals(A,B,tc_fun(C,tc_bool)).
% 0.20/0.42    Following clause subsumed by 52 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(C,B,A)| -c_lessequals(B,C,A).
% 0.20/0.42    Following clause subsumed by 52 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(B,C,A)| -c_lessequals(C,B,A).
% 0.20/0.42    Following clause subsumed by 59 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_lessequals(C,A,tc_fun(D,tc_bool))| -hBOOL(hAPP(C,B)).
% 0.20/0.42    Following clause subsumed by 107 during input processing: 0 [] {-} c_Nat_Osize__class_Osize(A,tc_List_Olist(B))!=c_Nat_Osize__class_Osize(C,tc_List_Olist(D))|c_Nat_Osize__class_Osize(E,tc_List_Olist(B))!=c_Nat_Osize__class_Osize(F,tc_List_Olist(D))|c_List_Olist__all2(G,c_List_Oappend(E,A,B),c_List_Oappend(F,C,D),B,D)| -c_List_Olist__all2(G,A,C,B,D)| -c_List_Olist__all2(G,E,F,B,D).
% 0.20/0.42    Following clause subsumed by 107 during input processing: 0 [] {-} c_Nat_Osize__class_Osize(A,tc_List_Olist(B))!=c_Nat_Osize__class_Osize(C,tc_List_Olist(D))|c_Nat_Osize__class_Osize(E,tc_List_Olist(B))!=c_Nat_Osize__class_Osize(F,tc_List_Olist(D))|c_List_Olist__all2(G,c_List_Oappend(F,C,D),c_List_Oappend(E,A,B),D,B)| -c_List_Olist__all2(G,C,A,D,B)| -c_List_Olist__all2(G,F,E,D,B).
% 0.20/0.42    Following clause subsumed by 100 during input processing: 0 [] {-} c_Message_Oagent_OFriend(A)!=c_Message_Oagent_OServer.
% 0.20/0.42    Following clause subsumed by 107 during input processing: 0 [] {-} c_Nat_Osize__class_Osize(A,tc_List_Olist(B))!=c_Nat_Osize__class_Osize(C,tc_List_Olist(D))|c_List_Olist__all2(E,c_List_Oappend(A,F,B),c_List_Oappend(C,G,D),B,D)| -c_List_Olist__all2(E,F,G,B,D)| -c_List_Olist__all2(E,A,C,B,D).
% 0.20/0.42    Following clause subsumed by 120 during input processing: 0 [flip.1] {-} c_List_Olist_OCons(B,A,C)!=A.
% 0.20/0.42    Following clause subsumed by 129 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=B|A=c_List_Olist_ONil(C).
% 0.20/0.42    Following clause subsumed by 131 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=A|B=c_List_Olist_ONil(C).
% 0.20/0.42    Following clause subsumed by 158 during input processing: 0 [] {-} c_List_Olist__all2(A,c_List_Olist_OCons(B,C,D),c_List_Olist_OCons(E,F,G),D,G)| -c_List_Olist__all2(A,C,F,D,G)| -hBOOL(hAPP(hAPP(A,B),E)).
% 0.20/0.42    Following clause subsumed by 158 during input processing: 0 [] {-} c_List_Olist__all2(A,c_List_Olist_OCons(B,C,D),c_List_Olist_OCons(E,F,G),D,G)| -c_List_Olist__all2(A,C,F,D,G)| -hBOOL(hAPP(hAPP(A,B),E)).
% 0.20/0.42    Following clause subsumed by 182 during input processing: 0 [] {-} -hBOOL(hAPP(A,c_Message_Oagent_Oagent__case(B,C,D,c_Message_Oagent_OFriend(E),t_a)))|hBOOL(hAPP(A,hAPP(C,E))).
% 0.20/0.42    Following clause subsumed by 196 during input processing: 0 [] {-} -hBOOL(hAPP(A,c_List_Olist_Olist__case(B,C,c_List_Olist_OCons(D,E,t_b),t_a,t_b)))|hBOOL(hAPP(A,hAPP(hAPP(C,D),E))).
% 0.20/0.42    Following clause subsumed by 227 during input processing: 0 [] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.42    Following clause subsumed by 238 during input processing: 0 [flip.1] {-} c_Message_Oagent_OFriend(A)!=c_Message_Oagent_OSpy.
% 0.20/0.42    Following clause subsumed by 240 during input processing: 0 [] {-} c_Message_Oagent_OSpy!=c_Message_Oagent_OServer.
% 0.20/0.42    Following clause subsumed by 254 during input processing: 0 [] {-} hAPP(c_List_Orev(A),B)!=c_List_Olist_ONil(A)|B=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 2 during input processing: 0 [copy,1,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_OGets(D,E).
% 0.20/0.42    Following clause subsumed by 1 during input processing: 0 [copy,2,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.20/0.42  37 back subsumes 36.
% 0.20/0.42  114 back subsumes 106.
% 0.20/0.42    Following clause subsumed by 227 during input processing: 0 [copy,136,flip.1] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.42    Following clause subsumed by 136 during input processing: 0 [copy,227,flip.1] {-} c_List_Olist_ONil(A)!=c_List_Olist_OCons(B,C,A).
% 0.20/0.42  
% 0.20/0.42  ------------> process sos:
% 0.20/0.42    Following clause subsumed by 334 during input processing: 0 [] {-} c_lessequals(A,A,tc_nat).
% 0.20/0.42    Following clause subsumed by 335 during input processing: 0 [] {-} c_lessequals(A,A,tc_fun(B,tc_bool)).
% 0.20/0.42    Following clause subsumed by 365 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_OCons(c_Event_Oevent_OGets(B,C),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42    Following clause subsumed by 405 during input processing: 0 [demod,403] {-} c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E).
% 0.20/0.42    Following clause subsumed by 397 during input processing: 0 [demod,395] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.20/0.42    Following clause subsumed by 397 during input processing: 0 [demod,395] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.20/0.42    Following clause subsumed by 499 during input processing: 0 [demod,497] {-} c_List_Oappend(A,c_List_Oappend(B,D,C),C)=c_List_Oappend(A,c_List_Oappend(B,D,C),C).
% 0.20/0.42    Following clause subsumed by 499 during input processing: 0 [demod,497] {-} c_List_Oappend(A,c_List_Oappend(B,C,D),D)=c_List_Oappend(A,c_List_Oappend(B,C,D),D).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,514] {-} A=A.
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,519] {-} A=A.
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,538] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,538] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,519] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,554,580] {-} c_List_Olist_OCons(A,c_List_Olist_ONil(B),B)=c_List_Olist_OCons(A,c_List_Olist_ONil(B),B).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,586] {-} B=B.
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,586] {-} A=A.
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [demod,584] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [] {-} A=A.
% 0.20/0.42    Following clause subsumed by 318 during input processing: 0 [copy,318,flip.1] {-} c_HOL_Ominus__class_Ominus(c_HOL_Ominus__class_Ominus(A,B,tc_nat),C,tc_nat)=c_HOL_Ominus__class_Ominus(c_HOL_Ominus__class_Ominus(A,C,tc_nat),B,tc_nat).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,323,flip.1] {-
% 0.20/0.42  -------- PROOF -------- 
% 0.20/0.42  % SZS status Unsatisfiable
% 0.20/0.42  % SZS output start Refutation
% 0.20/0.42  } c_List_Odrop(A,c_List_Obutlast(B,C),C)=c_List_Odrop(A,c_List_Obutlast(B,C),C).
% 0.20/0.42    Following clause subsumed by 324 during input processing: 0 [copy,324,flip.1] {-} c_Set_Oinsert(A,c_Set_Oinsert(B,C,D),D)=c_Set_Oinsert(B,c_Set_Oinsert(A,C,D),D).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,326,flip.1] {-} c_List_Odrop(A,c_List_Otl(B,C),C)=c_List_Odrop(A,c_List_Otl(B,C),C).
% 0.20/0.42  329 back subsumes 295.
% 0.20/0.42  334 back subsumes 267.
% 0.20/0.42  365 back subsumes 302.
% 0.20/0.42  365 back subsumes 289.
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,397,flip.1] {-} c_List_Oappend(c_List_Olist_OCons(A,B,C),D,C)=c_List_Oappend(c_List_Olist_OCons(A,B,C),D,C).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,405,flip.1] {-} c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E).
% 0.20/0.42    Following clause subsumed by 453 during input processing: 0 [copy,453,flip.1] {-} c_List_Oappend(c_List_Oreplicate(A,B,C),c_List_Oreplicate(D,B,C),C)=c_List_Oappend(c_List_Oreplicate(D,B,C),c_List_Oreplicate(A,B,C),C).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,477,flip.1] {-} c_List_Olist_OCons(A,B,C)=c_List_Olist_OCons(A,B,C).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,499,flip.1] {-} c_List_Oappend(A,c_List_Oappend(B,C,D),D)=c_List_Oappend(A,c_List_Oappend(B,C,D),D).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,505,flip.1] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.42    Following clause subsumed by 516 during input processing: 0 [copy,516,flip.1] {-} A=A.
% 0.20/0.42  516 back subsumes 505.
% 0.20/0.42  516 back subsumes 499.
% 0.20/0.42  516 back subsumes 477.
% 0.20/0.42  516 back subsumes 405.
% 0.20/0.42  516 back subsumes 397.
% 0.20/0.42  516 back subsumes 326.
% 0.20/0.42  516 back subsumes 323.
% 0.20/0.42  516 back subsumes 282.
% 0.20/0.42  516 back subsumes 270.
% 0.20/0.42  516 back subsumes 269.
% 0.20/0.42  516 back subsumes 268.
% 0.20/0.42  516 back subsumes 266.
% 0.20/0.42    Following clause subsumed by 549 during input processing: 0 [copy,529,flip.1] {-} c_List_Olist_ONil(A)=c_List_Omap(B,c_List_Olist_ONil(C),C,A).
% 0.20/0.42    Following clause subsumed by 529 during input processing: 0 [copy,549,flip.1] {-} c_List_Omap(A,c_List_Olist_ONil(B),B,C)=c_List_Olist_ONil(C).
% 0.20/0.42  
% 0.20/0.42  ----> UNIT CONFLICT at   0.03 sec ----> 616 [binary,615.1,516.1] {-} $F.
% 0.20/0.42  
% 0.20/0.42  Length of proof is 5.  Level of proof is 2.
% 0.20/0.42  
% 0.20/0.42  ---------------- PROOF ----------------
% 0.20/0.42  % SZS status Unsatisfiable
% 0.20/0.42  % SZS output start Refutation
% 0.20/0.42  
% 0.20/0.42  256 [] {-} c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent))!=c_Event_Oknows(c_Message_Oagent_OSpy,hAPP(c_List_Orev(tc_Event_Oevent),c_List_Olist_ONil(tc_Event_Oevent))).
% 0.20/0.42  257 [copy,256,flip.1] {-} c_Event_Oknows(c_Message_Oagent_OSpy,hAPP(c_List_Orev(tc_Event_Oevent),c_List_Olist_ONil(tc_Event_Oevent)))!=c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)).
% 0.20/0.42  512 [] {-} A=c_List_Oappend(c_List_Olist_ONil(B),A,B).
% 0.20/0.42  514,513 [copy,512,flip.1] {-} c_List_Oappend(c_List_Olist_ONil(A),B,A)=B.
% 0.20/0.42  515 [] {-} c_List_Oappend(c_List_Olist_ONil(A),B,A)=B.
% 0.20/0.42  516 [copy,515,demod,514] {-} A=A.
% 0.20/0.42  582 [] {-} c_List_Olist_ONil(A)=hAPP(c_List_Orev(A),c_List_Olist_ONil(A)).
% 0.20/0.42  584,583 [copy,582,flip.1] {-} hAPP(c_List_Orev(A),c_List_Olist_ONil(A))=c_List_Olist_ONil(A).
% 0.20/0.42  615 [back_demod,257,demod,584] {-} c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent))!=c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)).
% 0.20/0.42  616 [binary,615.1,516.1] {-} $F.
% 0.20/0.42  
% 0.20/0.42  % SZS output end Refutation
% 0.20/0.42  ------------ end of proof -------------
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Search stopped by max_proofs option.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Search stopped by max_proofs option.
% 0.20/0.42  
% 0.20/0.42  ============ end of search ============
% 0.20/0.42  
% 0.20/0.42  That finishes the proof of the theorem.
% 0.20/0.42  
% 0.20/0.42  Process 15689 finished Wed Jun 15 11:54:08 2022
%------------------------------------------------------------------------------