TSTP Solution File: SWV904-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV904-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:36 EDT 2022
% Result : Unsatisfiable 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV904-1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n004.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 17:06:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36
% 0.12/0.36 -------- PROOF --------
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n004.cluster.edu,
% 0.12/0.36 Wed Jun 15 17:06:53 2022
% 0.12/0.36 The command was "./sos". The process ID is 13908.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 1 during input processing: 0 [] {-} c_Option_Ooption_ONone(A)!=c_Option_Ooption_OSome(B,A).
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [] {-} c_Option_Ooption_OSome(A,B)!=c_Option_Ooption_ONone(B).
% 0.12/0.36 Following clause subsumed by 3 during input processing: 0 [flip.1] {-} c_Com_Ocom_OBODY(A)!=c_Com_Ocom_OSKIP.
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [flip.1] {-} c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSKIP.
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [copy,1,flip.1] {-} c_Option_Ooption_OSome(A,B)!=c_Option_Ooption_ONone(B).
% 0.12/0.36 Following clause subsumed by 1 during input processing: 0 [copy,2,flip.1] {-} c_Option_Ooption_ONone(A)!=c_Option_Ooption_OSome(B,A).
% 0.12/0.36 Following clause subsumed by 5 during input processing: 0 [copy,4,flip.1] {-} c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OBODY(C).
% 0.12/0.36 Following clause subsumed by 4 during input processing: 0 [copy,5,flip.1] {-} c_Com_Ocom_OBODY(A)!=c_Com_Ocom_OSemi(B,C).
% 0.12/0.36 22 back subsumes 21.
% 0.12/0.36 22 back subsumes 19.
% 0.12/0.36 22 back subsumes 18.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ----> UNIT CONFLICT at 0.00 sec ----> 27 [binary,26.1,12.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 Length of proof is 1. Level of proof is 1.
% 0.12/0.36
% 0.12/0.36 ---------------- PROOF ----------------
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36
% 0.12/0.36 12 [] {-} c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSKIP.
% 0.12/0.36 22 [] {-} -c_Hoare__Mirabelle_Ostate__not__singleton.
% 0.12/0.36 25 [] {-} c_Hoare__Mirabelle_Ostate__not__singleton|A=B.
% 0.12/0.36 26 [copy,25,unit_del,22] {-} A=B.
% 0.12/0.36 27 [binary,26.1,12.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 % SZS output end Refutation
% 0.12/0.36 ------------ end of proof -------------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36 ============ end of search ============
% 0.12/0.36
% 0.12/0.36 That finishes the proof of the theorem.
% 0.12/0.36
% 0.12/0.36 Process 13908 finished Wed Jun 15 17:06:53 2022
%------------------------------------------------------------------------------