TSTP Solution File: SWV276-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV276-2 : TPTP v8.1.0. Released v3.2.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:37:40 EDT 2022
% Result : Unsatisfiable 0.53s 0.75s
% Output : Refutation 0.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV276-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 01:26:20 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n027.cluster.edu,
% 0.14/0.38 Thu Jun 16 01:26:20 2022
% 0.14/0.38 The command was "./sos". The process ID is 6018.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38 clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.41
% 0.14/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41
% 0.14/0.41 Stopped by limit on number of solutions
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 -------------- Softie stats --------------
% 0.14/0.41
% 0.14/0.41 UPDATE_STOP: 300
% 0.14/0.41 SFINDER_TIME_LIMIT: 2
% 0.14/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41 number of clauses in intial UL: 11
% 0.14/0.41 number of clauses initially in problem: 26
% 0.14/0.41 percentage of clauses intially in UL: 42
% 0.14/0.41 percentage of distinct symbols occuring in initial UL: 89
% 0.14/0.41 percent of all initial clauses that are short: 96
% 0.14/0.41 absolute distinct symbol count: 19
% 0.14/0.41 distinct predicate count: 3
% 0.14/0.41 distinct function count: 10
% 0.14/0.41 distinct constant count: 6
% 0.14/0.41
% 0.14/0.41 ---------- no more Softie stats ----------
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 =========== start of search ===========
% 0.53/0.75
% 0.53/0.75 -------- PROOF --------
% 0.53/0.75 % SZS status Unsatisfiable
% 0.53/0.75 % SZS output start Refutation
% 0.53/0.75
% 0.53/0.75 Model 2 (0.00 seconds, 0 Inserts)
% 0.53/0.75
% 0.53/0.76 Stopped by limit on number of solutions
% 0.53/0.76
% 0.53/0.76 Modelling stopped after 300 given clauses and 0.00 seconds
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 ----> UNIT CONFLICT at 0.35 sec ----> 2226 [binary,2225.1,28.1] {-} $F.
% 0.53/0.76
% 0.53/0.76 Length of proof is 20. Level of proof is 13.
% 0.53/0.76
% 0.53/0.76 ---------------- PROOF ----------------
% 0.53/0.76 % SZS status Unsatisfiable
% 0.53/0.76 % SZS output start Refutation
% 0.53/0.76
% 0.53/0.76 1 [] {+} -c_in(A,c_Message_OkeysFor(c_Message_Osynth(B)),tc_nat)|c_in(A,c_Message_OkeysFor(B),tc_nat)|c_in(c_Message_Omsg_OKey(v_sko__uhi(B,A)),B,tc_Message_Omsg).
% 0.53/0.76 2 [] {-} -c_in(A,c_Message_OkeysFor(c_Message_Osynth(B)),tc_nat)|c_in(A,c_Message_OkeysFor(B),tc_nat)|A=c_Message_OinvKey(v_sko__uhi(B,A)).
% 0.53/0.76 3 [copy,2,flip.3] {+} -c_in(A,c_Message_OkeysFor(c_Message_Osynth(B)),tc_nat)|c_in(A,c_Message_OkeysFor(B),tc_nat)|c_Message_OinvKey(v_sko__uhi(B,A))=A.
% 0.53/0.76 5 [] {+} -c_lessequals(A,B,tc_set(tc_Message_Omsg))|c_lessequals(c_Message_OkeysFor(A),c_Message_OkeysFor(B),tc_set(tc_nat)).
% 0.53/0.76 6 [] {+} -c_in(A,B,tc_Message_Omsg)|c_lessequals(c_Message_Oparts(c_insert(A,C,tc_Message_Omsg)),c_union(c_Message_Oparts(B),c_Message_Oparts(C),tc_Message_Omsg),tc_set(tc_Message_Omsg)).
% 0.53/0.76 7 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 0.53/0.76 8 [] {+} -c_in(A,c_union(B,C,D),D)|c_in(A,C,D)|c_in(A,B,D).
% 0.53/0.76 9 [] {+} -c_in(A,B,C)|c_in(A,c_union(B,D,C),C).
% 0.53/0.76 10 [] {+} -c_in(A,B,C)|c_in(A,c_union(D,B,C),C).
% 0.53/0.76 11 [] {-} -c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat).
% 0.53/0.76 12 [] {+} -c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg).
% 0.53/0.76 14 [] {-} c_lessequals(c_Message_Oanalz(A),c_Message_Oparts(A),tc_set(tc_Message_Omsg)).
% 0.53/0.76 16,15 [] {+} c_Message_OinvKey(c_Message_OinvKey(A))=A.
% 0.53/0.76 18,17 [] {-} c_Message_OkeysFor(c_union(A,B,tc_Message_Omsg))=c_union(c_Message_OkeysFor(A),c_Message_OkeysFor(B),tc_nat).
% 0.53/0.76 20,19 [] {+} c_Message_Oparts(c_Message_Oanalz(A))=c_Message_Oparts(A).
% 0.53/0.76 22,21 [] {+} c_Message_Oparts(c_Message_Osynth(A))=c_union(c_Message_Oparts(A),c_Message_Osynth(A),tc_Message_Omsg).
% 0.53/0.76 24,23 [] {+} c_Message_Oparts(c_union(A,B,tc_Message_Omsg))=c_union(c_Message_Oparts(A),c_Message_Oparts(B),tc_Message_Omsg).
% 0.53/0.76 25 [] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat).
% 0.53/0.76 26 [] {-} c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg).
% 0.53/0.76 28 [back_demod,11,demod,24,18] {+} -c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(v_G)),c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),tc_nat).
% 0.53/0.76 29 [hyper,14,5] {-} c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(A)),c_Message_OkeysFor(c_Message_Oparts(A)),tc_set(tc_nat)).
% 0.53/0.76 30 [para_into,15.1.1.1,3.3.1] {+} c_Message_OinvKey(A)=v_sko__uhi(B,A)| -c_in(A,c_Message_OkeysFor(c_Message_Osynth(B)),tc_nat)|c_in(A,c_Message_OkeysFor(B),tc_nat).
% 0.53/0.76 33 [hyper,26,6,demod,22,20] {+} c_lessequals(c_Message_Oparts(c_insert(v_X,A,tc_Message_Omsg)),c_union(c_union(c_Message_Oparts(v_H),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),c_Message_Oparts(A),tc_Message_Omsg),tc_set(tc_Message_Omsg)).
% 0.53/0.76 97 [para_into,30.1.1,15.1.1,flip.1] {+} v_sko__uhi(A,c_Message_OinvKey(B))=B| -c_in(c_Message_OinvKey(B),c_Message_OkeysFor(c_Message_Osynth(A)),tc_nat)|c_in(c_Message_OinvKey(B),c_Message_OkeysFor(A),tc_nat).
% 0.53/0.76 113 [hyper,33,5,demod,18,18] {+} c_lessequals(c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,A,tc_Message_Omsg))),c_union(c_union(c_Message_OkeysFor(c_Message_Oparts(v_H)),c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),c_Message_OkeysFor(c_Message_Oparts(A)),tc_nat),tc_set(tc_nat)).
% 0.53/0.76 607 [para_into,97.1.1.2,15.1.1,demod,16,16] {+} v_sko__uhi(A,B)=c_Message_OinvKey(B)| -c_in(B,c_Message_OkeysFor(c_Message_Osynth(A)),tc_nat)|c_in(B,c_Message_OkeysFor(A),tc_nat).
% 0.53/0.76 641 [para_from,607.1.1,1.3.1.1,factor_simp,factor_simp] {+} -c_in(A,c_Message_OkeysFor(c_Message_Osynth(B)),tc_nat)|c_in(A,c_Message_OkeysFor(B),tc_nat)|c_in(c_Message_Omsg_OKey(c_Message_OinvKey(A)),B,tc_Message_Omsg).
% 0.53/0.76 830 [hyper,113,7,25] {-} c_in(v_K,c_union(c_union(c_Message_OkeysFor(c_Message_Oparts(v_H)),c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),c_Message_OkeysFor(c_Message_Oparts(v_G)),tc_nat),tc_nat).
% 0.53/0.76 836 [hyper,830,8] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_G)),tc_nat)|c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(v_H)),c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),tc_nat).
% 0.53/0.76 838 [hyper,836,9] {-} c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(v_H)),c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),tc_nat)|c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(v_G)),A,tc_nat),tc_nat).
% 0.53/0.76 2132 [hyper,838,28] {-} c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(v_H)),c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),tc_nat).
% 0.53/0.76 2136 [hyper,2132,8] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat)|c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat).
% 0.53/0.76 2152 [hyper,2136,10] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat)|c_in(v_K,c_union(A,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),tc_nat).
% 0.53/0.76 2193 [hyper,2152,28] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat).
% 0.53/0.76 2194 [hyper,2193,641] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat)|c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(v_H),tc_Message_Omsg).
% 0.53/0.76 2221 [hyper,2194,7,14,unit_del,12] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat).
% 0.53/0.76 2224 [hyper,2221,7,29] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat).
% 0.53/0.76 2225 [hyper,2224,10] {-} c_in(v_K,c_union(A,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),tc_nat).
% 0.53/0.76 2226 [binary,2225.1,28.1] {-} $F.
% 0.53/0.76
% 0.53/0.76 % SZS output end Refutation
% 0.53/0.76 ------------ end of proof -------------
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Search stopped by max_proofs option.
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Search stopped by max_proofs option.
% 0.53/0.76
% 0.53/0.76 ============ end of search ============
% 0.53/0.76
% 0.53/0.76 ----------- soft-scott stats ----------
% 0.53/0.76
% 0.53/0.76 true clauses given 129 (28.4%)
% 0.53/0.76 false clauses given 325
% 0.53/0.76
% 0.53/0.76 FALSE TRUE
% 0.53/0.76 9 2 0
% 0.53/0.76 13 4 0
% 0.53/0.76 18 8 0
% 0.53/0.76 21 38 34
% 0.53/0.76 22 59 23
% 0.53/0.76 23 93 21
% 0.53/0.76 24 163 39
% 0.53/0.76 25 96 69
% 0.53/0.76 26 93 43
% 0.53/0.76 27 111 55
% 0.53/0.76 28 54 15
% 0.53/0.76 29 37 24
% 0.53/0.76 30 19 17
% 0.53/0.76 31 12 34
% 0.53/0.76 32 6 27
% 0.53/0.76 33 13 27
% 0.53/0.76 34 5 12
% 0.53/0.76 35 0 65
% 0.53/0.76 36 1 70
% 0.53/0.76 37 2 29
% 0.53/0.76 38 0 18
% 0.53/0.76 39 0 50
% 0.53/0.76 40 0 50
% 0.53/0.76 41 0 36
% 0.53/0.76 42 0 16
% 0.53/0.76 43 0 1
% 0.53/0.76 44 0 36
% 0.53/0.76 45 0 5
% 0.53/0.76 46 0 33
% 0.53/0.76 47 0 6
% 0.53/0.76 49 0 6
% 0.53/0.76 51 0 5
% 0.53/0.76 52 0 4
% 0.53/0.76 54 0 1
% 0.53/0.76 57 0 10
% 0.53/0.76 58 0 4
% 0.53/0.76 59 0 1
% 0.53/0.76 tot: 816 886 (52.1% true)
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Model 2 (0.00 seconds, 0 Inserts)
% 0.53/0.76
% 0.53/0.76 That finishes the proof of the theorem.
% 0.53/0.76
% 0.53/0.76 Process 6018 finished Thu Jun 16 01:26:20 2022
%------------------------------------------------------------------------------