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

View Problem - Process Solution

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

% Computer : n018.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 12:48:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    response(A,A) != A,
    file('COL058-1.p',unknown),
    [] ).

cnf(2,axiom,
    A = A,
    file('COL058-1.p',unknown),
    [] ).

cnf(3,axiom,
    response(response(lark,A),B) = response(A,response(B,B)),
    file('COL058-1.p',unknown),
    [] ).

cnf(4,plain,
    response(A,response(B,B)) = response(response(lark,A),B),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
    [iquote('copy,3,flip.1')] ).

cnf(13,plain,
    response(response(lark,response(A,A)),A) != response(A,A),
    inference(para_from,[status(thm),theory(equality)],[4,1]),
    [iquote('para_from,4.1.1,1.1.1')] ).

cnf(17,plain,
    response(response(response(lark,lark),A),A) != response(A,A),
    inference(para_into,[status(thm),theory(equality)],[13,4]),
    [iquote('para_into,13.1.1.1,4.1.1')] ).

cnf(19,plain,
    response(response(response(lark,response(lark,lark)),A),response(A,A)) != response(response(A,A),response(A,A)),
    inference(para_into,[status(thm),theory(equality)],[17,4]),
    [iquote('para_into,17.1.1.1,4.1.1')] ).

cnf(20,plain,
    $false,
    inference(binary,[status(thm)],[19,2]),
    [iquote('binary,19.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n018.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  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 02:28:31 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.73/1.94  ----- Otter 3.3f, August 2004 -----
% 1.73/1.94  The process was started by sandbox2 on n018.cluster.edu,
% 1.73/1.94  Wed Jul 27 02:28:31 2022
% 1.73/1.94  The command was "./otter".  The process ID is 16050.
% 1.73/1.94  
% 1.73/1.94  set(prolog_style_variables).
% 1.73/1.94  set(auto).
% 1.73/1.94     dependent: set(auto1).
% 1.73/1.94     dependent: set(process_input).
% 1.73/1.94     dependent: clear(print_kept).
% 1.73/1.94     dependent: clear(print_new_demod).
% 1.73/1.94     dependent: clear(print_back_demod).
% 1.73/1.94     dependent: clear(print_back_sub).
% 1.73/1.94     dependent: set(control_memory).
% 1.73/1.94     dependent: assign(max_mem, 12000).
% 1.73/1.94     dependent: assign(pick_given_ratio, 4).
% 1.73/1.94     dependent: assign(stats_level, 1).
% 1.73/1.94     dependent: assign(max_seconds, 10800).
% 1.73/1.94  clear(print_given).
% 1.73/1.94  
% 1.73/1.94  list(usable).
% 1.73/1.94  0 [] A=A.
% 1.73/1.94  0 [] response(response(lark,X1),X2)=response(X1,response(X2,X2)).
% 1.73/1.94  0 [] response(X,X)!=X.
% 1.73/1.94  end_of_list.
% 1.73/1.94  
% 1.73/1.94  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.73/1.94  
% 1.73/1.94  All clauses are units, and equality is present; the
% 1.73/1.94  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.73/1.94  
% 1.73/1.94     dependent: set(knuth_bendix).
% 1.73/1.94     dependent: set(anl_eq).
% 1.73/1.94     dependent: set(para_from).
% 1.73/1.94     dependent: set(para_into).
% 1.73/1.94     dependent: clear(para_from_right).
% 1.73/1.94     dependent: clear(para_into_right).
% 1.73/1.94     dependent: set(para_from_vars).
% 1.73/1.94     dependent: set(eq_units_both_ways).
% 1.73/1.94     dependent: set(dynamic_demod_all).
% 1.73/1.94     dependent: set(dynamic_demod).
% 1.73/1.94     dependent: set(order_eq).
% 1.73/1.94     dependent: set(back_demod).
% 1.73/1.94     dependent: set(lrpo).
% 1.73/1.94  
% 1.73/1.94  ------------> process usable:
% 1.73/1.94  ** KEPT (pick-wt=5): 1 [] response(A,A)!=A.
% 1.73/1.94  
% 1.73/1.94  ------------> process sos:
% 1.73/1.94  ** KEPT (pick-wt=3): 2 [] A=A.
% 1.73/1.94  ** KEPT (pick-wt=11): 3 [] response(response(lark,A),B)=response(A,response(B,B)).
% 1.73/1.94    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.73/1.94  ** KEPT (pick-wt=11): 4 [copy,3,flip.1] response(A,response(B,B))=response(response(lark,A),B).
% 1.73/1.94    Following clause subsumed by 3 during input processing: 0 [copy,4,flip.1] response(response(lark,A),B)=response(A,response(B,B)).
% 1.73/1.94  
% 1.73/1.94  ======= end of input processing =======
% 1.73/1.94  
% 1.73/1.94  =========== start of search ===========
% 1.73/1.94  
% 1.73/1.94  -------- PROOF -------- 
% 1.73/1.94  
% 1.73/1.94  ----> UNIT CONFLICT at   0.00 sec ----> 20 [binary,19.1,2.1] $F.
% 1.73/1.94  
% 1.73/1.94  Length of proof is 4.  Level of proof is 4.
% 1.73/1.94  
% 1.73/1.94  ---------------- PROOF ----------------
% 1.73/1.94  % SZS status Unsatisfiable
% 1.73/1.94  % SZS output start Refutation
% See solution above
% 1.73/1.94  ------------ end of proof -------------
% 1.73/1.94  
% 1.73/1.94  
% 1.73/1.94  Search stopped by max_proofs option.
% 1.73/1.94  
% 1.73/1.94  
% 1.73/1.94  Search stopped by max_proofs option.
% 1.73/1.94  
% 1.73/1.94  ============ end of search ============
% 1.73/1.94  
% 1.73/1.94  -------------- statistics -------------
% 1.73/1.94  clauses given                  5
% 1.73/1.94  clauses generated             18
% 1.73/1.94  clauses kept                  19
% 1.73/1.94  clauses forward subsumed      13
% 1.73/1.94  clauses back subsumed          0
% 1.73/1.94  Kbytes malloced              976
% 1.73/1.94  
% 1.73/1.94  ----------- times (seconds) -----------
% 1.73/1.94  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.73/1.94  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.73/1.94  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.73/1.94  
% 1.73/1.94  That finishes the proof of the theorem.
% 1.73/1.94  
% 1.73/1.94  Process 16050 finished Wed Jul 27 02:28:32 2022
% 1.73/1.94  Otter interrupted
% 1.73/1.94  PROOF FOUND
%------------------------------------------------------------------------------