TSTP Solution File: SWW959+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 : Thu Jul 21 01:27:46 EDT 2022
% Result : Theorem 1.64s 1.86s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% 0.00/0.10 % Command : sos-script %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun Jun 5 15:31:48 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.10/0.31 ----- Otter 3.2, August 2001 -----
% 0.10/0.31 The process was started by sandbox2 on n032.cluster.edu,
% 0.10/0.31 Sun Jun 5 15:31:48 2022
% 0.10/0.31 The command was "./sos". The process ID is 27724.
% 0.10/0.31
% 0.10/0.31 set(prolog_style_variables).
% 0.10/0.31 set(auto).
% 0.10/0.31 dependent: set(auto1).
% 0.10/0.31 dependent: set(process_input).
% 0.10/0.31 dependent: clear(print_kept).
% 0.10/0.31 dependent: clear(print_new_demod).
% 0.10/0.31 dependent: clear(print_back_demod).
% 0.10/0.31 dependent: clear(print_back_sub).
% 0.10/0.31 dependent: set(control_memory).
% 0.10/0.31 dependent: assign(max_mem, 12000).
% 0.10/0.31 dependent: assign(pick_given_ratio, 4).
% 0.10/0.31 dependent: assign(stats_level, 1).
% 0.10/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.31 dependent: assign(sos_limit, 5000).
% 0.10/0.31 dependent: assign(max_weight, 60).
% 0.10/0.31 clear(print_given).
% 0.10/0.31
% 0.10/0.31 formula_list(usable).
% 0.10/0.31
% 0.10/0.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.10/0.31
% 0.10/0.31 This ia a non-Horn set with equality. The strategy will be
% 0.10/0.31 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.10/0.31 unit deletion, with positive clauses in sos and nonpositive
% 0.10/0.31 clauses in usable.
% 0.10/0.31
% 0.10/0.31 dependent: set(knuth_bendix).
% 0.10/0.31 dependent: set(para_from).
% 0.10/0.31 dependent: set(para_into).
% 0.10/0.31 dependent: clear(para_from_right).
% 0.10/0.31 dependent: clear(para_into_right).
% 0.10/0.31 dependent: set(para_from_vars).
% 0.10/0.31 dependent: set(eq_units_both_ways).
% 0.10/0.31 dependent: set(dynamic_demod_all).
% 0.10/0.31 dependent: set(dynamic_demod).
% 0.10/0.31 dependent: set(order_eq).
% 0.10/0.31 dependent: set(back_demod).
% 0.10/0.31 dependent: set(lrpo).
% 0.10/0.31 dependent: set(hyper_res).
% 0.10/0.31 dependent: set(unit_deletion).
% 0.10/0.31 dependent: set(factor).
% 0.10/0.31
% 0.10/0.31 ------------> process usable:
% 0.10/0.31
% 0.10/0.31 ------------> process sos:
% 0.10/0.31 Following clause subsumed by 268 during input processing: 0 [copy,268,flip.1] {-} A=A.
% 0.10/0.31
% 0.10/0.31 ======= end of input processing =======
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 Failed to model usable list: disabling FINDER
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 -------------- Softie stats --------------
% 0.14/0.36
% 0.14/0.36 UPDATE_STOP: 300
% 0.14/0.36 SFINDER_TIME_LIMIT: 2
% 0.14/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.36 number of clauses in intial UL: 152
% 0.14/0.36 number of clauses initially in problem: 190
% 0.14/0.36 percentage of clauses intially in UL: 80
% 0.14/0.36 percentage of distinct symbols occuring in initial UL: 89
% 0.14/0.36 percent of all initial clauses that are short: 100
% 0.14/0.36 absolute distinct symbol count: 57
% 0.14/0.36 distinct predicate count: 6
% 0.14/0.36 distinct function count: 36
% 0.14/0.36 distinct constant count: 15
% 0.14/0.36
% 0.14/0.36 ---------- no more Softie stats ----------
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 =========== start of search ===========
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43 Changing weight limit from 60 to 5.
% 0.14/0.43
% 0.14/0.43 Resetting weight limit to 5 after 35 givens.
% 0.14/0.43
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 Changing weight limit from 5 to 4.
% 0.62/0.81
% 0.62/0.81 Resetting weight limit to 4 after 160 givens.
% 0.62/0.81
% 1.64/1.86
% 1.64/1.86 -------- PROOF --------
% 1.64/1.86 % SZS status Theorem
% 1.64/1.86 % SZS output start Refutation
% 1.64/1.86
% 1.64/1.86 Modelling stopped after 300 given clauses and 0.00 seconds
% 1.64/1.86
% 1.64/1.86
% 1.64/1.86 ----> UNIT CONFLICT at 1.14 sec ----> 42178 [binary,42177.1,218.1] {-} $F.
% 1.64/1.86
% 1.64/1.86 Length of proof is 5. Level of proof is 3.
% 1.64/1.86
% 1.64/1.86 ---------------- PROOF ----------------
% 1.64/1.86 % SZS status Theorem
% 1.64/1.86 % SZS output start Refutation
% 1.64/1.86
% 1.64/1.86 181 [] {+} -pred_attacker(tuple_client_B_out_6(A))|pred_attacker(A).
% 1.64/1.86 187 [] {+} -pred_attacker(A)|pred_attacker(tuple_client_B_in_5(A)).
% 1.64/1.86 189 [] {+} -pred_attacker(A)|pred_attacker(tuple_client_B_in_3(A)).
% 1.64/1.86 191 [] {+} -pred_attacker(A)|pred_attacker(tuple_client_B_in_2(A)).
% 1.64/1.86 215 [] {+} -pred_eq_bitstring_bitstring(name_Nb(A),constr_adec(B,name_skB))| -pred_attacker(tuple_client_B_in_5(B))| -pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(C,name_skB)))| -pred_attacker(tuple_client_B_in_3(C))| -pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(D,constr_pkey(name_skS))))| -pred_attacker(tuple_client_B_in_2(D))|pred_attacker(tuple_client_B_out_6(name_objective)).
% 1.64/1.86 218 [] {+} -pred_attacker(name_objective).
% 1.64/1.86 247 [] {-} pred_eq_bitstring_bitstring(A,B).
% 1.64/1.86 248 [] {-} pred_attacker(tuple_true).
% 1.64/1.86 296 [hyper,248,191] {-} pred_attacker(tuple_client_B_in_2(tuple_true)).
% 1.64/1.86 297 [hyper,248,189] {-} pred_attacker(tuple_client_B_in_3(tuple_true)).
% 1.64/1.86 298 [hyper,248,187] {-} pred_attacker(tuple_client_B_in_5(tuple_true)).
% 1.64/1.86 4553 [hyper,298,215,247,247,297,247,296] {-} pred_attacker(tuple_client_B_out_6(name_objective)).
% 1.64/1.86 42177 [hyper,4553,181] {-} pred_attacker(name_objective).
% 1.64/1.86 42178 [binary,42177.1,218.1] {-} $F.
% 1.64/1.86
% 1.64/1.86 % SZS output end Refutation
% 1.64/1.86 ------------ end of proof -------------
% 1.64/1.86
% 1.64/1.86
% 1.64/1.86 Search stopped by max_proofs option.
% 1.64/1.86
% 1.64/1.86
% 1.64/1.86 Search stopped by max_proofs option.
% 1.64/1.86
% 1.64/1.86 ============ end of search ============
% 1.64/1.86
% 1.64/1.86 That finishes the proof of the theorem.
% 1.64/1.86
% 1.64/1.86 Process 27724 finished Sun Jun 5 15:31:50 2022
%------------------------------------------------------------------------------