TSTP Solution File: SWV772-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV772-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:11 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV772-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 15:30:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.40 ----- Otter 3.2, August 2001 -----
% 0.20/0.40 The process was started by sandbox on n027.cluster.edu,
% 0.20/0.40 Wed Jun 15 15:30:49 2022
% 0.20/0.40 The command was "./sos". The process ID is 9447.
% 0.20/0.40
% 0.20/0.40 set(prolog_style_variables).
% 0.20/0.40 set(auto).
% 0.20/0.40 dependent: set(auto1).
% 0.20/0.40 dependent: set(process_input).
% 0.20/0.40 dependent: clear(print_kept).
% 0.20/0.40 dependent: clear(print_new_demod).
% 0.20/0.40 dependent: clear(print_back_demod).
% 0.20/0.40 dependent: clear(print_back_sub).
% 0.20/0.40 dependent: set(control_memory).
% 0.20/0.40 dependent: assign(max_mem, 12000).
% 0.20/0.40 dependent: assign(pick_given_ratio, 4).
% 0.20/0.40 dependent: assign(stats_level, 1).
% 0.20/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.40 dependent: assign(sos_limit, 5000).
% 0.20/0.40 dependent: assign(max_weight, 60).
% 0.20/0.40 clear(print_given).
% 0.20/0.40
% 0.20/0.40 list(usable).
% 0.20/0.40
% 0.20/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.40
% 0.20/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.40 clauses in usable.
% 0.20/0.40
% 0.20/0.40 dependent: set(knuth_bendix).
% 0.20/0.40 dependent: set(para_from).
% 0.20/0.40 dependent: set(para_into).
% 0.20/0.40 dependent: clear(para_from_right).
% 0.20/0.40 dependent: clear(para_into_right).
% 0.20/0.40 dependent: set(para_from_vars).
% 0.20/0.40 dependent: set(eq_units_both_ways).
% 0.20/0.40 dependent: set(dynamic_demod_all).
% 0.20/0.40 dependent: set(dynamic_demod).
% 0.20/0.40 dependent: set(order_eq).
% 0.20/0.40 dependent: set(back_demod).
% 0.20/0.40 dependent: set(lrpo).
% 0.20/0.40 dependent: set(hyper_res).
% 0.20/0.40 dependent: set(unit_deletion).
% 0.20/0.40 dependent: set(factor).
% 0.20/0.40
% 0.20/0.40 ------------> process usable:
% 0.20/0.40 Following clause subsumed by 10 during input processing: 0 [] {-} c_in(A,c_Message_Oparts(B),tc_Message_Omsg)| -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg).
% 0.20/0.40 Following clause subsumed by 10 during input processing: 0 [] {-} -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.20/0.40 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_lessequals(B,C,A)|c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.40 Following clause subsumed by 50 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(C,B,A).
% 0.20/0.40 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,B,A)|c_lessequals(B,B,A).
% 0.20/0.40 Following clause subsumed by 50 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)| -c_lessequals(B,B,A)| -c_HOL_Oord__class_Oless(B,B,A).
% 0.20/0.40 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_lessequals(C,B,A).
% 0.20/0.40 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A)|C=B.
% 0.20/0.40 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|C=B|c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.40 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.40 Following clause subsumed by 82 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A)|C=B.
% 0.20/0.40 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)|B=C| -c_lessequals(B,C,A).
% 0.20/0.40 Following clause subsumed by 83 during input processing: 0 [] {-} A=B|c_HOL_Oord__class_Oless(A,B,tc_fun(C,tc_bool))| -c_lessequals(A,B,tc_fun(C,tc_bool)).
% 0.20/0.40 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)|B=C| -c_lessequals(B,C,A).
% 0.20/0.40 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A)|B=C.
% 0.20/0.40 Following clause subsumed by 85 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A).
% 0.20/0.41 Following clause subsumed by 90 during input processing: 0 [] {-} -class_Orderings_Opreorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.41 Following clause subsumed by 97 during input processing: 0 [] {-} c_in(A,c_List_Oset(B,C),C)| -c_in(A,c_List_Oset(c_List_Oremove1(D,B,C),C),C)|A=D.
% 0.20/0.41 Following clause subsumed by 158 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(B,C,D),D)| -c_in(A,C,D).
% 0.20/0.41 Following clause subsumed by 161 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A)| -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A).
% 0.20/0.41 Following clause subsumed by 156 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.20/0.41 Following clause subsumed by 171 during input processing: 0 [] {-} c_lessequals(A,B,tc_fun(C,tc_bool))|c_in(D,A,C)| -c_lessequals(A,c_Set_Oinsert(D,B,C),tc_fun(C,tc_bool)).
% 0.20/0.41 Following clause subsumed by 156 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.20/0.41 Following clause subsumed by 192 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.41 Following clause subsumed by 193 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(C,B,A)| -c_lessequals(B,C,A).
% 0.20/0.41 Following clause subsumed by 193 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(B,C,A)| -c_lessequals(C,B,A).
% 0.20/0.41 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.20/0.41 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_lessequals(D,B,tc_fun(C,tc_bool))| -c_in(A,D,C).
% 0.20/0.41 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.20/0.41 Following clause subsumed by 212 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_lessequals(C,A,tc_fun(D,tc_bool))| -hBOOL(hAPP(C,B)).
% 0.20/0.41 Following clause subsumed by 246 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=B|A=c_List_Olist_ONil(C).
% 0.20/0.41 Following clause subsumed by 248 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=A|B=c_List_Olist_ONil(C).
% 0.20/0.41 Following clause subsumed by 261 during input processing: 0 [] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.41 Following clause subsumed by 262 during input processing: 0 [flip.1] {-} c_List_Olist_OCons(B,A,C)!=A.
% 0.20/0.41 Following clause subsumed by 120 during input processing: 0 [copy,118,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.20/0.41 Following clause subsumed by 121 during input processing: 0 [copy,119,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.20/0.41 Following clause subsumed by 118 during input processing: 0 [copy,120,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_OGets(D,E).
% 0.20/0.41 Following clause subsumed by 119 during input processing: 0 [copy,121,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_ONotes(D,E).
% 0.20/0.41 Following clause subsumed by 206 during input processing: 0 [copy,194,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OGets(C,D).
% 0.20/0.41 Following clause subsumed by 194 during input processing: 0 [copy,206,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_ONotes(C,D).
% 0.20/0.41 Following clause subsumed by 261 during input processing: 0 [copy,252,flip.1] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.41 Following clause subsumed by 252 during input processing: 0 [copy,261,flip.1] {-} c_List_Olist_ONil(A)!=c_List_Olist_OCons(B,C,A).
% 0.20/0.41
% 0.20/0.41 ------------> process sos:
% 0.20/0.41 Following clause subsumed by 306 during input processing: 0 [demod,314] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.41 Following clause subsumed by 306 during input processing: 0 [demod,314] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.41 Following clause subsumed by 306 during input processing: 0 [demod,344] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.41 Following clause subsumed by 341 during
% 0.20/0.41 -------- PROOF --------
% 0.20/0.41 % SZS status Unsatisfiable
% 0.20/0.41 % SZS output start Refutation
% 0.20/0.41 input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.20/0.41 Following clause subsumed by 341 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,391] {-} A=A.
% 0.20/0.41 Following clause subsumed by 404 during input processing: 0 [] {-} c_lessequals(A,A,tc_fun(B,tc_bool)).
% 0.20/0.41 Following clause subsumed by 367 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.41 Following clause subsumed by 366 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_ONotes(B,C),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,350] {-} c_List_Olist_OCons(A,B,C)=c_List_Olist_OCons(A,B,C).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,421] {-} 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.41 Following clause subsumed by 438 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(A,B),c_Event_Oknows(A,c_List_Olist_OCons(c_Event_Oevent_OSays(C,D,E),B,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.41 Following clause subsumed by 438 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_OSays(B,C,D),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} B=B.
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} A=A.
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,473] {-} A=A.
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} 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.41 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} c_List_Olist_OCons(A,B,C)=c_List_Olist_OCons(A,B,C).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [demod,473] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [] {-} A=A.
% 0.20/0.41 Following clause subsumed by 393 during input processing: 0 [copy,306,flip.1] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.41 362 back subsumes 361.
% 0.20/0.41 362 back subsumes 360.
% 0.20/0.41 Following clause subsumed by 363 during input processing: 0 [copy,363,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.41 Following clause subsumed by 393 during input processing: 0 [copy,393,flip.1] {-} A=A.
% 0.20/0.41 393 back subsumes 306.
% 0.20/0.41 393 back subsumes 279.
% 0.20/0.41 393 back subsumes 278.
% 0.20/0.41 393 back subsumes 273.
% 0.20/0.41 393 back subsumes 272.
% 0.20/0.41 393 back subsumes 270.
% 0.20/0.41 393 back subsumes 269.
% 0.20/0.41 393 back subsumes 268.
% 0.20/0.41 404 back subsumes 277.
% 0.20/0.41 438 back subsumes 367.
% 0.20/0.41 438 back subsumes 366.
% 0.20/0.41
% 0.20/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 494 [binary,493.1,393.1] {-} $F.
% 0.20/0.41
% 0.20/0.41 Length of proof is 4. Level of proof is 2.
% 0.20/0.41
% 0.20/0.41 ---------------- PROOF ----------------
% 0.20/0.41 % SZS status Unsatisfiable
% 0.20/0.41 % SZS output start Refutation
% 0.20/0.41
% 0.20/0.41 263 [] {-} c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Oappend(c_List_Olist_ONil(tc_Event_Oevent),c_List_Olist_OCons(c_Event_Oevent_OSays(v_A,v_B,v_X),c_List_Olist_ONil(tc_Event_Oevent),tc_Event_Oevent),tc_Event_Oevent))!=c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)),tc_Message_Omsg).
% 0.20/0.41 389 [] {-} A=c_List_Orev(c_List_Orev(A,B),B).
% 0.20/0.41 391,390 [copy,389,flip.1] {-} c_List_Orev(c_List_Orev(A,B),B)=A.
% 0.20/0.41 392 [] {-} c_List_Orev(c_List_Orev(A,B),B)=A.
% 0.20/0.41 393 [copy,392,demod,391] {-} A=A.
% 0.20/0.41 460,459 [] {-} c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_OCons(c_Event_Oevent_OSays(A,B,C),D,tc_Event_Oevent))=c_Set_Oinsert(C,c_Event_Oknows(c_Message_Oagent_OSpy,D),tc_Message_Omsg).
% 0.20/0.41 468 [] {-} A=c_List_Oappend(c_List_Olist_ONil(B),A,B).
% 0.20/0.41 470,469 [copy,468,flip.1] {-} c_List_Oappend(c_List_Olist_ONil(A),B,A)=B.
% 0.20/0.41 493 [back_demod,263,demod,470,460] {-} c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)),tc_Message_Omsg)!=c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)),tc_Message_Omsg).
% 0.20/0.41 494 [binary,493.1,393.1] {-} $F.
% 0.20/0.41
% 0.20/0.41 % SZS output end Refutation
% 0.20/0.41 ------------ end of proof -------------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Search stopped by max_proofs option.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Search stopped by max_proofs option.
% 0.20/0.41
% 0.20/0.41 ============ end of search ============
% 0.20/0.41
% 0.20/0.41 That finishes the proof of the theorem.
% 0.20/0.41
% 0.20/0.41 Process 9447 finished Wed Jun 15 15:30:49 2022
%------------------------------------------------------------------------------