TSTP Solution File: SWW951+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n024.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  : 300s
% DateTime : Wed Jul 27 13:23:13 EDT 2022

% Result   : Theorem 1.75s 1.95s
% Output   : Refutation 1.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   7 unt;   0 nHn;  11 RR)
%            Number of literals    :   16 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :    5 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(76,axiom,
    ( ~ pred_attacker(tuple_T_out_4(A))
    | pred_attacker(A) ),
    file('SWW951+1.p',unknown),
    [] ).

cnf(79,axiom,
    ( ~ pred_attacker(A)
    | pred_attacker(tuple_T_in_3(A)) ),
    file('SWW951+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( ~ pred_attacker(A)
    | pred_attacker(tuple_T_in_1(A)) ),
    file('SWW951+1.p',unknown),
    [] ).

cnf(86,axiom,
    ( ~ pred_attacker(tuple_T_in_3(A))
    | ~ pred_attacker(tuple_T_in_1(B))
    | pred_attacker(tuple_T_out_4(name_objective)) ),
    file('SWW951+1.p',unknown),
    [] ).

cnf(87,axiom,
    ~ pred_attacker(name_objective),
    file('SWW951+1.p',unknown),
    [] ).

cnf(97,axiom,
    pred_attacker(tuple_true),
    file('SWW951+1.p',unknown),
    [] ).

cnf(109,plain,
    pred_attacker(tuple_T_in_1(tuple_true)),
    inference(hyper,[status(thm)],[97,81]),
    [iquote('hyper,97,81')] ).

cnf(110,plain,
    pred_attacker(tuple_T_in_3(tuple_true)),
    inference(hyper,[status(thm)],[97,79]),
    [iquote('hyper,97,79')] ).

cnf(390,plain,
    pred_attacker(tuple_T_out_4(name_objective)),
    inference(hyper,[status(thm)],[110,86,109]),
    [iquote('hyper,110,86,109')] ).

cnf(7147,plain,
    pred_attacker(name_objective),
    inference(hyper,[status(thm)],[390,76]),
    [iquote('hyper,390,76')] ).

cnf(7148,plain,
    $false,
    inference(binary,[status(thm)],[7147,87]),
    [iquote('binary,7147.1,87.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 03:03:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.66/1.85  ----- Otter 3.3f, August 2004 -----
% 1.66/1.85  The process was started by sandbox2 on n024.cluster.edu,
% 1.66/1.85  Wed Jul 27 03:03:25 2022
% 1.66/1.85  The command was "./otter".  The process ID is 14904.
% 1.66/1.85  
% 1.66/1.85  set(prolog_style_variables).
% 1.66/1.85  set(auto).
% 1.66/1.85     dependent: set(auto1).
% 1.66/1.85     dependent: set(process_input).
% 1.66/1.85     dependent: clear(print_kept).
% 1.66/1.85     dependent: clear(print_new_demod).
% 1.66/1.85     dependent: clear(print_back_demod).
% 1.66/1.85     dependent: clear(print_back_sub).
% 1.66/1.85     dependent: set(control_memory).
% 1.66/1.85     dependent: assign(max_mem, 12000).
% 1.66/1.85     dependent: assign(pick_given_ratio, 4).
% 1.66/1.85     dependent: assign(stats_level, 1).
% 1.66/1.85     dependent: assign(max_seconds, 10800).
% 1.66/1.85  clear(print_given).
% 1.66/1.85  
% 1.66/1.85  formula_list(usable).
% 1.66/1.85  all A (A=A).
% 1.66/1.85  constr_CONST_0x30!=constr_CONST_1.
% 1.66/1.85  constr_CONST_0x30!=constr_CONST_2.
% 1.66/1.85  constr_CONST_0x30!=constr_CONST_3.
% 1.66/1.85  constr_CONST_0x30!=constr_CONST_4.
% 1.66/1.85  constr_CONST_0x30!=constr_ZERO.
% 1.66/1.85  constr_CONST_0x30!=name_c.
% 1.66/1.85  constr_CONST_0x30!=name_k.
% 1.66/1.85  constr_CONST_0x30!=name_objective.
% 1.66/1.85  constr_CONST_1!=constr_CONST_2.
% 1.66/1.85  constr_CONST_1!=constr_CONST_3.
% 1.66/1.85  constr_CONST_1!=constr_CONST_4.
% 1.66/1.85  constr_CONST_1!=constr_ZERO.
% 1.66/1.85  constr_CONST_1!=name_c.
% 1.66/1.85  constr_CONST_1!=name_k.
% 1.66/1.85  constr_CONST_1!=name_objective.
% 1.66/1.85  constr_CONST_2!=constr_CONST_3.
% 1.66/1.85  constr_CONST_2!=constr_CONST_4.
% 1.66/1.85  constr_CONST_2!=constr_ZERO.
% 1.66/1.85  constr_CONST_2!=name_c.
% 1.66/1.85  constr_CONST_2!=name_k.
% 1.66/1.85  constr_CONST_2!=name_objective.
% 1.66/1.85  constr_CONST_3!=constr_CONST_4.
% 1.66/1.85  constr_CONST_3!=constr_ZERO.
% 1.66/1.85  constr_CONST_3!=name_c.
% 1.66/1.85  constr_CONST_3!=name_k.
% 1.66/1.85  constr_CONST_3!=name_objective.
% 1.66/1.85  constr_CONST_4!=constr_ZERO.
% 1.66/1.85  constr_CONST_4!=name_c.
% 1.66/1.85  constr_CONST_4!=name_k.
% 1.66/1.85  constr_CONST_4!=name_objective.
% 1.66/1.85  constr_ZERO!=name_c.
% 1.66/1.85  constr_ZERO!=name_k.
% 1.66/1.85  constr_ZERO!=name_objective.
% 1.66/1.85  name_c!=name_k.
% 1.66/1.85  name_c!=name_objective.
% 1.66/1.85  name_k!=name_objective.
% 1.66/1.85  all VAR_X_10X30 (constr_xor(VAR_X_10X30,VAR_X_10X30)=constr_ZERO).
% 1.66/1.85  all VAR_X_9 (constr_xor(VAR_X_9,constr_ZERO)=VAR_X_9).
% 1.66/1.85  all VAR_X_7 VAR_Y_8 (constr_xor(VAR_X_7,VAR_Y_8)=constr_xor(VAR_Y_8,VAR_X_7)).
% 1.66/1.85  all VAR_X_0X30 VAR_Y_0X30 VAR_Z_0X30 (constr_xor(VAR_X_0X30,constr_xor(VAR_Y_0X30,VAR_Z_0X30))=constr_xor(constr_xor(VAR_X_0X30,VAR_Y_0X30),VAR_Z_0X30)).
% 1.66/1.85  all VAR_V_26 VAR_V_27 (pred_attacker(VAR_V_26)&pred_attacker(VAR_V_27)->pred_attacker(constr_xor(VAR_V_26,VAR_V_27))).
% 1.66/1.85  pred_attacker(tuple_true).
% 1.66/1.85  all VAR_V_30X30 (pred_attacker(VAR_V_30X30)->pred_attacker(constr_h(VAR_V_30X30))).
% 1.66/1.85  pred_attacker(tuple_false).
% 1.66/1.85  pred_attacker(constr_ZERO).
% 1.66/1.85  all VAR_V_32 (pred_attacker(VAR_V_32)->pred_attacker(tuple_T_out_4(VAR_V_32))).
% 1.66/1.85  all VAR_V_35 (pred_attacker(tuple_T_out_4(VAR_V_35))->pred_attacker(VAR_V_35)).
% 1.66/1.85  all VAR_V_38 (pred_attacker(VAR_V_38)->pred_attacker(tuple_T_out_2(VAR_V_38))).
% 1.66/1.85  all VAR_V_41 (pred_attacker(tuple_T_out_2(VAR_V_41))->pred_attacker(VAR_V_41)).
% 1.66/1.85  all VAR_V_44 (pred_attacker(VAR_V_44)->pred_attacker(tuple_T_in_3(VAR_V_44))).
% 1.66/1.85  all VAR_V_47 (pred_attacker(tuple_T_in_3(VAR_V_47))->pred_attacker(VAR_V_47)).
% 1.66/1.85  all VAR_V_50X30 (pred_attacker(VAR_V_50X30)->pred_attacker(tuple_T_in_1(VAR_V_50X30))).
% 1.66/1.85  all VAR_V_53 (pred_attacker(tuple_T_in_1(VAR_V_53))->pred_attacker(VAR_V_53)).
% 1.66/1.85  pred_attacker(constr_CONST_4).
% 1.66/1.85  pred_attacker(constr_CONST_3).
% 1.66/1.85  pred_attacker(constr_CONST_2).
% 1.66/1.85  pred_attacker(constr_CONST_1).
% 1.66/1.85  pred_attacker(constr_CONST_0x30).
% 1.66/1.85  all VAR_V_59 VAR_V_60X30 (pred_mess(VAR_V_60X30,VAR_V_59)&pred_attacker(VAR_V_60X30)->pred_attacker(VAR_V_59)).
% 1.66/1.85  all VAR_V_61 VAR_V_62 (pred_attacker(VAR_V_62)&pred_attacker(VAR_V_61)->pred_mess(VAR_V_62,VAR_V_61)).
% 1.66/1.85  pred_attacker(name_c).
% 1.66/1.85  all VAR_V_64 pred_e_qual(VAR_V_64,VAR_V_64).
% 1.66/1.85  all VAR_V_65 pred_attacker(name_new0x2Dname(VAR_V_65)).
% 1.66/1.85  all VAR_R1_85 (pred_attacker(tuple_T_in_1(VAR_R1_85))->pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85))))).
% 1.66/1.85  all VAR_K_XOR_K1_10X305 VAR_R1_10X306 (pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305))&pred_attacker(tuple_T_in_1(VAR_R1_10X306))->pred_attacker(tuple_T_out_4(name_objective))).
% 1.66/1.85  -pred_attacker(name_objective).
% 1.66/1.85  end_of_list.
% 1.66/1.85  
% 1.66/1.85  -------> usable clausifies to:
% 1.66/1.85  
% 1.66/1.85  list(usable).
% 1.66/1.85  0 [] A=A.
% 1.66/1.85  0 [] constr_CONST_0x30!=constr_CONST_1.
% 1.66/1.85  0 [] constr_CONST_0x30!=constr_CONST_2.
% 1.66/1.85  0 [] constr_CONST_0x30!=constr_CONST_3.
% 1.66/1.85  0 [] constr_CONST_0x30!=constr_CONST_4.
% 1.66/1.85  0 [] constr_CONST_0x30!=constr_ZERO.
% 1.66/1.85  0 [] constr_CONST_0x30!=name_c.
% 1.66/1.85  0 [] constr_CONST_0x30!=name_k.
% 1.66/1.85  0 [] constr_CONST_0x30!=name_objective.
% 1.66/1.85  0 [] constr_CONST_1!=constr_CONST_2.
% 1.66/1.85  0 [] constr_CONST_1!=constr_CONST_3.
% 1.66/1.85  0 [] constr_CONST_1!=constr_CONST_4.
% 1.66/1.85  0 [] constr_CONST_1!=constr_ZERO.
% 1.66/1.85  0 [] constr_CONST_1!=name_c.
% 1.66/1.85  0 [] constr_CONST_1!=name_k.
% 1.66/1.85  0 [] constr_CONST_1!=name_objective.
% 1.66/1.85  0 [] constr_CONST_2!=constr_CONST_3.
% 1.66/1.85  0 [] constr_CONST_2!=constr_CONST_4.
% 1.66/1.85  0 [] constr_CONST_2!=constr_ZERO.
% 1.66/1.85  0 [] constr_CONST_2!=name_c.
% 1.66/1.85  0 [] constr_CONST_2!=name_k.
% 1.66/1.85  0 [] constr_CONST_2!=name_objective.
% 1.66/1.85  0 [] constr_CONST_3!=constr_CONST_4.
% 1.66/1.85  0 [] constr_CONST_3!=constr_ZERO.
% 1.66/1.85  0 [] constr_CONST_3!=name_c.
% 1.66/1.85  0 [] constr_CONST_3!=name_k.
% 1.66/1.85  0 [] constr_CONST_3!=name_objective.
% 1.66/1.85  0 [] constr_CONST_4!=constr_ZERO.
% 1.66/1.85  0 [] constr_CONST_4!=name_c.
% 1.66/1.85  0 [] constr_CONST_4!=name_k.
% 1.66/1.85  0 [] constr_CONST_4!=name_objective.
% 1.66/1.85  0 [] constr_ZERO!=name_c.
% 1.66/1.85  0 [] constr_ZERO!=name_k.
% 1.66/1.85  0 [] constr_ZERO!=name_objective.
% 1.66/1.85  0 [] name_c!=name_k.
% 1.66/1.85  0 [] name_c!=name_objective.
% 1.66/1.85  0 [] name_k!=name_objective.
% 1.66/1.85  0 [] constr_xor(VAR_X_10X30,VAR_X_10X30)=constr_ZERO.
% 1.66/1.85  0 [] constr_xor(VAR_X_9,constr_ZERO)=VAR_X_9.
% 1.66/1.85  0 [] constr_xor(VAR_X_7,VAR_Y_8)=constr_xor(VAR_Y_8,VAR_X_7).
% 1.66/1.85  0 [] constr_xor(VAR_X_0X30,constr_xor(VAR_Y_0X30,VAR_Z_0X30))=constr_xor(constr_xor(VAR_X_0X30,VAR_Y_0X30),VAR_Z_0X30).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_26)| -pred_attacker(VAR_V_27)|pred_attacker(constr_xor(VAR_V_26,VAR_V_27)).
% 1.66/1.85  0 [] pred_attacker(tuple_true).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_30X30)|pred_attacker(constr_h(VAR_V_30X30)).
% 1.66/1.85  0 [] pred_attacker(tuple_false).
% 1.66/1.85  0 [] pred_attacker(constr_ZERO).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_32)|pred_attacker(tuple_T_out_4(VAR_V_32)).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_out_4(VAR_V_35))|pred_attacker(VAR_V_35).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_38)|pred_attacker(tuple_T_out_2(VAR_V_38)).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_out_2(VAR_V_41))|pred_attacker(VAR_V_41).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_44)|pred_attacker(tuple_T_in_3(VAR_V_44)).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_in_3(VAR_V_47))|pred_attacker(VAR_V_47).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_50X30)|pred_attacker(tuple_T_in_1(VAR_V_50X30)).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_in_1(VAR_V_53))|pred_attacker(VAR_V_53).
% 1.66/1.85  0 [] pred_attacker(constr_CONST_4).
% 1.66/1.85  0 [] pred_attacker(constr_CONST_3).
% 1.66/1.85  0 [] pred_attacker(constr_CONST_2).
% 1.66/1.85  0 [] pred_attacker(constr_CONST_1).
% 1.66/1.85  0 [] pred_attacker(constr_CONST_0x30).
% 1.66/1.85  0 [] -pred_mess(VAR_V_60X30,VAR_V_59)| -pred_attacker(VAR_V_60X30)|pred_attacker(VAR_V_59).
% 1.66/1.85  0 [] -pred_attacker(VAR_V_62)| -pred_attacker(VAR_V_61)|pred_mess(VAR_V_62,VAR_V_61).
% 1.66/1.85  0 [] pred_attacker(name_c).
% 1.66/1.85  0 [] pred_e_qual(VAR_V_64,VAR_V_64).
% 1.66/1.85  0 [] pred_attacker(name_new0x2Dname(VAR_V_65)).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_in_1(VAR_R1_85))|pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85)))).
% 1.66/1.85  0 [] -pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305))| -pred_attacker(tuple_T_in_1(VAR_R1_10X306))|pred_attacker(tuple_T_out_4(name_objective)).
% 1.66/1.85  0 [] -pred_attacker(name_objective).
% 1.66/1.85  end_of_list.
% 1.66/1.85  
% 1.66/1.85  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.66/1.85  
% 1.66/1.85  This is a Horn set with equality.  The strategy will be
% 1.66/1.85  Knuth-Bendix and hyper_res, with positive clauses in
% 1.66/1.85  sos and nonpositive clauses in usable.
% 1.66/1.85  
% 1.66/1.85     dependent: set(knuth_bendix).
% 1.66/1.85     dependent: set(anl_eq).
% 1.66/1.85     dependent: set(para_from).
% 1.66/1.85     dependent: set(para_into).
% 1.66/1.85     dependent: clear(para_from_right).
% 1.66/1.85     dependent: clear(para_into_right).
% 1.66/1.85     dependent: set(para_from_vars).
% 1.66/1.85     dependent: set(eq_units_both_ways).
% 1.66/1.85     dependent: set(dynamic_demod_all).
% 1.66/1.85     dependent: set(dynamic_demod).
% 1.66/1.85     dependent: set(order_eq).
% 1.66/1.85     dependent: set(back_demod).
% 1.66/1.85     dependent: set(lrpo).
% 1.66/1.85     dependent: set(hyper_res).
% 1.66/1.85     dependent: clear(order_hyper).
% 1.66/1.85  
% 1.66/1.85  ------------> process usable:
% 1.66/1.85  ** KEPT (pick-wt=3): 2 [copy,1,flip.1] constr_CONST_1!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 4 [copy,3,flip.1] constr_CONST_2!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 6 [copy,5,flip.1] constr_CONST_3!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 8 [copy,7,flip.1] constr_CONST_4!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 10 [copy,9,flip.1] constr_ZERO!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 12 [copy,11,flip.1] name_c!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 14 [copy,13,flip.1] name_k!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 16 [copy,15,flip.1] name_objective!=constr_CONST_0x30.
% 1.66/1.85  ** KEPT (pick-wt=3): 18 [copy,17,flip.1] constr_CONST_2!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 20 [copy,19,flip.1] constr_CONST_3!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 22 [copy,21,flip.1] constr_CONST_4!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 24 [copy,23,flip.1] constr_ZERO!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 26 [copy,25,flip.1] name_c!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 28 [copy,27,flip.1] name_k!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 30 [copy,29,flip.1] name_objective!=constr_CONST_1.
% 1.66/1.85  ** KEPT (pick-wt=3): 32 [copy,31,flip.1] constr_CONST_3!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 34 [copy,33,flip.1] constr_CONST_4!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 36 [copy,35,flip.1] constr_ZERO!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 38 [copy,37,flip.1] name_c!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 40 [copy,39,flip.1] name_k!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 42 [copy,41,flip.1] name_objective!=constr_CONST_2.
% 1.66/1.85  ** KEPT (pick-wt=3): 44 [copy,43,flip.1] constr_CONST_4!=constr_CONST_3.
% 1.66/1.85  ** KEPT (pick-wt=3): 46 [copy,45,flip.1] constr_ZERO!=constr_CONST_3.
% 1.66/1.85  ** KEPT (pick-wt=3): 48 [copy,47,flip.1] name_c!=constr_CONST_3.
% 1.66/1.85  ** KEPT (pick-wt=3): 50 [copy,49,flip.1] name_k!=constr_CONST_3.
% 1.66/1.85  ** KEPT (pick-wt=3): 52 [copy,51,flip.1] name_objective!=constr_CONST_3.
% 1.66/1.85  ** KEPT (pick-wt=3): 54 [copy,53,flip.1] constr_ZERO!=constr_CONST_4.
% 1.66/1.85  ** KEPT (pick-wt=3): 56 [copy,55,flip.1] name_c!=constr_CONST_4.
% 1.66/1.85  ** KEPT (pick-wt=3): 58 [copy,57,flip.1] name_k!=constr_CONST_4.
% 1.66/1.85  ** KEPT (pick-wt=3): 60 [copy,59,flip.1] name_objective!=constr_CONST_4.
% 1.66/1.85  ** KEPT (pick-wt=3): 62 [copy,61,flip.1] name_c!=constr_ZERO.
% 1.66/1.85  ** KEPT (pick-wt=3): 64 [copy,63,flip.1] name_k!=constr_ZERO.
% 1.66/1.85  ** KEPT (pick-wt=3): 66 [copy,65,flip.1] name_objective!=constr_ZERO.
% 1.66/1.85  ** KEPT (pick-wt=3): 68 [copy,67,flip.1] name_k!=name_c.
% 1.66/1.85  ** KEPT (pick-wt=3): 70 [copy,69,flip.1] name_objective!=name_c.
% 1.66/1.85  ** KEPT (pick-wt=3): 72 [copy,71,flip.1] name_objective!=name_k.
% 1.66/1.85  ** KEPT (pick-wt=8): 73 [] -pred_attacker(A)| -pred_attacker(B)|pred_attacker(constr_xor(A,B)).
% 1.66/1.85  ** KEPT (pick-wt=5): 74 [] -pred_attacker(A)|pred_attacker(constr_h(A)).
% 1.66/1.85  ** KEPT (pick-wt=5): 75 [] -pred_attacker(A)|pred_attacker(tuple_T_out_4(A)).
% 1.66/1.85  ** KEPT (pick-wt=5): 76 [] -pred_attacker(tuple_T_out_4(A))|pred_attacker(A).
% 1.66/1.85  ** KEPT (pick-wt=5): 77 [] -pred_attacker(A)|pred_attacker(tuple_T_out_2(A)).
% 1.66/1.85  ** KEPT (pick-wt=5): 78 [] -pred_attacker(tuple_T_out_2(A))|pred_attacker(A).
% 1.66/1.85  ** KEPT (pick-wt=5): 79 [] -pred_attacker(A)|pred_attacker(tuple_T_in_3(A)).
% 1.66/1.85  ** KEPT (pick-wt=5): 80 [] -pred_attacker(tuple_T_in_3(A))|pred_attacker(A).
% 1.66/1.85  ** KEPT (pick-wt=5): 81 [] -pred_attacker(A)|pred_attacker(tuple_T_in_1(A)).
% 1.66/1.85  ** KEPT (pick-wt=5): 82 [] -pred_attacker(tuple_T_in_1(A))|pred_attacker(A).
% 1.66/1.85  ** KEPT (pick-wt=7): 83 [] -pred_mess(A,B)| -pred_attacker(A)|pred_attacker(B).
% 1.66/1.85  ** KEPT (pick-wt=7): 84 [] -pred_attacker(A)| -pred_attacker(B)|pred_mess(A,B).
% 1.66/1.85  ** KEPT (pick-wt=9): 85 [] -pred_attacker(tuple_T_in_1(A))|pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,A)))).
% 1.66/1.85  ** KEPT (pick-wt=9): 86 [] -pred_attacker(tuple_T_in_3(A))| -pred_attacker(tuple_T_in_1(B))|pred_attacker(tuple_T_out_4(name_objective)).
% 1.66/1.85  ** KEPT (pick-wt=2): 87 [] -pred_attacker(name_objective).
% 1.66/1.85  
% 1.66/1.85  ------------> process sos:
% 1.66/1.85  ** KEPT (pick-wt=3): 88 [] A=A.
% 1.66/1.85  ** KEPT (pick-wt=5): 89 [] constr_xor(A,A)=constr_ZERO.
% 1.66/1.85  ---> New Demodulator: 90 [new_demod,89] constr_xor(A,A)=constr_ZERO.
% 1.66/1.85  ** KEPT (pick-wt=5): 91 [] constr_xor(A,constr_ZERO)=A.
% 1.66/1.85  ---> New Demodulator: 92 [new_demod,91] constr_xor(A,constr_ZERO)=A.
% 1.66/1.85  ** KEPT (pick-wt=7): 93 [] constr_xor(A,B)=constr_xor(B,A).
% 1.66/1.85  ** KEPT (pick-wt=11): 95 [copy,94,flip.1] constr_xor(constr_xor(A,B),C)=constr_xor(A,constr_xor(B,C)).
% 1.66/1.85  ---> New Demodulator: 96 [new_demod,95] constr_xor(constr_xor(A,B),C)=constr_xor(A,constr_xor(B,C)).
% 1.66/1.85  ** KEPT (pick-wt=2): 97 [] pred_attacker(tuple_true).
% 1.66/1.85  ** KEPT (pick-wt=2): 98 [] pred_attacker(tuple_false).
% 1.66/1.85  ** KEPT (pick-wt=2): 99 [] pred_attacker(constr_ZERO).
% 1.66/1.85  ** KEPT (pick-wt=2): 100 [] pred_attacker(constr_CONST_4).
% 1.66/1.85  ** KEPT (pick-wt=2): 101 [] pred_attacker(constr_CONST_3).
% 1.75/1.95  ** KEPT (pick-wt=2): 102 [] pred_attacker(constr_CONST_2).
% 1.75/1.95  ** KEPT (pick-wt=2): 103 [] pred_attacker(constr_CONST_1).
% 1.75/1.95  ** KEPT (pick-wt=2): 104 [] pred_attacker(constr_CONST_0x30).
% 1.75/1.95  ** KEPT (pick-wt=2): 105 [] pred_attacker(name_c).
% 1.75/1.95  ** KEPT (pick-wt=3): 106 [] pred_e_qual(A,A).
% 1.75/1.95  ** KEPT (pick-wt=3): 107 [] pred_attacker(name_new0x2Dname(A)).
% 1.75/1.95    Following clause subsumed by 88 during input processing: 0 [copy,88,flip.1] A=A.
% 1.75/1.95  >>>> Starting back demodulation with 90.
% 1.75/1.95  >>>> Starting back demodulation with 92.
% 1.75/1.95    Following clause subsumed by 93 during input processing: 0 [copy,93,flip.1] constr_xor(A,B)=constr_xor(B,A).
% 1.75/1.95  >>>> Starting back demodulation with 96.
% 1.75/1.95  
% 1.75/1.95  ======= end of input processing =======
% 1.75/1.95  
% 1.75/1.95  =========== start of search ===========
% 1.75/1.95  
% 1.75/1.95  
% 1.75/1.95  Resetting weight limit to 4.
% 1.75/1.95  
% 1.75/1.95  
% 1.75/1.95  Resetting weight limit to 4.
% 1.75/1.95  
% 1.75/1.95  sos_size=6653
% 1.75/1.95  
% 1.75/1.95  -------- PROOF -------- 
% 1.75/1.95  
% 1.75/1.95  ----> UNIT CONFLICT at   0.10 sec ----> 7148 [binary,7147.1,87.1] $F.
% 1.75/1.95  
% 1.75/1.95  Length of proof is 4.  Level of proof is 3.
% 1.75/1.95  
% 1.75/1.95  ---------------- PROOF ----------------
% 1.75/1.95  % SZS status Theorem
% 1.75/1.95  % SZS output start Refutation
% See solution above
% 1.75/1.95  ------------ end of proof -------------
% 1.75/1.95  
% 1.75/1.95  
% 1.75/1.95  Search stopped by max_proofs option.
% 1.75/1.95  
% 1.75/1.95  
% 1.75/1.95  Search stopped by max_proofs option.
% 1.75/1.95  
% 1.75/1.95  ============ end of search ============
% 1.75/1.95  
% 1.75/1.95  -------------- statistics -------------
% 1.75/1.95  clauses given                168
% 1.75/1.95  clauses generated          13710
% 1.75/1.95  clauses kept                7104
% 1.75/1.95  clauses forward subsumed     735
% 1.75/1.95  clauses back subsumed          3
% 1.75/1.95  Kbytes malloced             4882
% 1.75/1.95  
% 1.75/1.95  ----------- times (seconds) -----------
% 1.75/1.95  user CPU time          0.10          (0 hr, 0 min, 0 sec)
% 1.75/1.95  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 1.75/1.95  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.75/1.95  
% 1.75/1.95  That finishes the proof of the theorem.
% 1.75/1.95  
% 1.75/1.95  Process 14904 finished Wed Jul 27 03:03:26 2022
% 1.75/1.95  Otter interrupted
% 1.75/1.95  PROOF FOUND
%------------------------------------------------------------------------------