TSTP Solution File: SWV818-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWV818-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n008.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:21:37 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    v_s != v_t,
    file('SWV818-1.p',unknown),
    [] ).

cnf(2,plain,
    v_t != v_s,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
    [iquote('copy,1,flip.1')] ).

cnf(6,axiom,
    A = v_ta,
    file('SWV818-1.p',unknown),
    [] ).

cnf(7,plain,
    v_ta = A,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
    [iquote('copy,6,flip.1')] ).

cnf(8,plain,
    v_ta != v_s,
    inference(para_from,[status(thm),theory(equality)],[6,2]),
    [iquote('para_from,6.1.1,2.1.1')] ).

cnf(9,plain,
    $false,
    inference(binary,[status(thm)],[8,7]),
    [iquote('binary,8.1,7.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV818-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.14/0.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Jul 27 05:56:23 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.75/1.92  ----- Otter 3.3f, August 2004 -----
% 1.75/1.92  The process was started by sandbox2 on n008.cluster.edu,
% 1.75/1.92  Wed Jul 27 05:56:23 2022
% 1.75/1.92  The command was "./otter".  The process ID is 19922.
% 1.75/1.92  
% 1.75/1.92  set(prolog_style_variables).
% 1.75/1.92  set(auto).
% 1.75/1.92     dependent: set(auto1).
% 1.75/1.92     dependent: set(process_input).
% 1.75/1.92     dependent: clear(print_kept).
% 1.75/1.92     dependent: clear(print_new_demod).
% 1.75/1.92     dependent: clear(print_back_demod).
% 1.75/1.92     dependent: clear(print_back_sub).
% 1.75/1.92     dependent: set(control_memory).
% 1.75/1.92     dependent: assign(max_mem, 12000).
% 1.75/1.92     dependent: assign(pick_given_ratio, 4).
% 1.75/1.92     dependent: assign(stats_level, 1).
% 1.75/1.92     dependent: assign(max_seconds, 10800).
% 1.75/1.92  clear(print_given).
% 1.75/1.92  
% 1.75/1.92  list(usable).
% 1.75/1.92  0 [] A=A.
% 1.75/1.92  0 [] c_Code__Evaluation_Otracing(V_s,V_x,T_a)=V_x.
% 1.75/1.92  0 [] c_Code__Evaluation_Otracing(v_s,v_x,t_a)=v_x.
% 1.75/1.92  0 [] v_s!=v_t.
% 1.75/1.92  0 [] V_s=v_ta.
% 1.75/1.92  end_of_list.
% 1.75/1.92  
% 1.75/1.92  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.75/1.92  
% 1.75/1.92  All clauses are units, and equality is present; the
% 1.75/1.92  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.75/1.92  
% 1.75/1.92     dependent: set(knuth_bendix).
% 1.75/1.92     dependent: set(anl_eq).
% 1.75/1.92     dependent: set(para_from).
% 1.75/1.92     dependent: set(para_into).
% 1.75/1.92     dependent: clear(para_from_right).
% 1.75/1.92     dependent: clear(para_into_right).
% 1.75/1.92     dependent: set(para_from_vars).
% 1.75/1.92     dependent: set(eq_units_both_ways).
% 1.75/1.92     dependent: set(dynamic_demod_all).
% 1.75/1.92     dependent: set(dynamic_demod).
% 1.75/1.92     dependent: set(order_eq).
% 1.75/1.92     dependent: set(back_demod).
% 1.75/1.92     dependent: set(lrpo).
% 1.75/1.92  
% 1.75/1.92  ------------> process usable:
% 1.75/1.92  ** KEPT (pick-wt=3): 2 [copy,1,flip.1] v_t!=v_s.
% 1.75/1.92  
% 1.75/1.92  ------------> process sos:
% 1.75/1.92  ** KEPT (pick-wt=3): 3 [] A=A.
% 1.75/1.92  ** KEPT (pick-wt=6): 4 [] c_Code__Evaluation_Otracing(A,B,C)=B.
% 1.75/1.92  ---> New Demodulator: 5 [new_demod,4] c_Code__Evaluation_Otracing(A,B,C)=B.
% 1.75/1.92    Following clause subsumed by 3 during input processing: 0 [demod,5] v_x=v_x.
% 1.75/1.92  ** KEPT (pick-wt=3): 6 [] A=v_ta.
% 1.75/1.92    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.75/1.92  >>>> Starting back demodulation with 5.
% 1.75/1.92  ** KEPT (pick-wt=3): 7 [copy,6,flip.1] v_ta=A.
% 1.75/1.92    Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] A=v_ta.
% 1.75/1.92  
% 1.75/1.92  ======= end of input processing =======
% 1.75/1.92  
% 1.75/1.92  =========== start of search ===========
% 1.75/1.92  
% 1.75/1.92  -------- PROOF -------- 
% 1.75/1.92  
% 1.75/1.92  ----> UNIT CONFLICT at   0.00 sec ----> 9 [binary,8.1,7.1] $F.
% 1.75/1.92  
% 1.75/1.92  Length of proof is 3.  Level of proof is 2.
% 1.75/1.92  
% 1.75/1.92  ---------------- PROOF ----------------
% 1.75/1.92  % SZS status Unsatisfiable
% 1.75/1.92  % SZS output start Refutation
% See solution above
% 1.75/1.92  ------------ end of proof -------------
% 1.75/1.92  
% 1.75/1.92  
% 1.75/1.92  Search stopped by max_proofs option.
% 1.75/1.92  
% 1.75/1.92  
% 1.75/1.92  Search stopped by max_proofs option.
% 1.75/1.92  
% 1.75/1.92  ============ end of search ============
% 1.75/1.92  
% 1.75/1.92  -------------- statistics -------------
% 1.75/1.92  clauses given                  2
% 1.75/1.92  clauses generated              1
% 1.75/1.92  clauses kept                   6
% 1.75/1.92  clauses forward subsumed       3
% 1.75/1.92  clauses back subsumed          0
% 1.75/1.92  Kbytes malloced              976
% 1.75/1.92  
% 1.75/1.92  ----------- times (seconds) -----------
% 1.75/1.92  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.75/1.92  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.75/1.92  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.75/1.92  
% 1.75/1.92  That finishes the proof of the theorem.
% 1.75/1.92  
% 1.75/1.92  Process 19922 finished Wed Jul 27 05:56:25 2022
% 1.75/1.92  Otter interrupted
% 1.75/1.92  PROOF FOUND
%------------------------------------------------------------------------------