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

View Problem - Process Solution

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

% Computer : n016.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:04:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ is_a_theorem(implies(A,B))
    | ~ is_a_theorem(A)
    | is_a_theorem(B) ),
    file('LCL398-1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ is_a_theorem(implies(not(implies(x,x)),y)),
    file('LCL398-1.p',unknown),
    [] ).

cnf(3,axiom,
    is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    file('LCL398-1.p',unknown),
    [] ).

cnf(4,axiom,
    is_a_theorem(implies(implies(not(A),A),A)),
    file('LCL398-1.p',unknown),
    [] ).

cnf(5,axiom,
    is_a_theorem(implies(A,implies(not(A),B))),
    file('LCL398-1.p',unknown),
    [] ).

cnf(9,plain,
    is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))),
    inference(hyper,[status(thm)],[5,1,3]),
    [iquote('hyper,5,1,3')] ).

cnf(40,plain,
    is_a_theorem(implies(A,A)),
    inference(hyper,[status(thm)],[9,1,4]),
    [iquote('hyper,9,1,4')] ).

cnf(42,plain,
    is_a_theorem(implies(not(implies(A,A)),B)),
    inference(hyper,[status(thm)],[40,1,5]),
    [iquote('hyper,40,1,5')] ).

cnf(43,plain,
    $false,
    inference(binary,[status(thm)],[42,2]),
    [iquote('binary,42.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n016.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 09:37:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.67/1.89  ----- Otter 3.3f, August 2004 -----
% 1.67/1.89  The process was started by sandbox2 on n016.cluster.edu,
% 1.67/1.89  Wed Jul 27 09:37:07 2022
% 1.67/1.89  The command was "./otter".  The process ID is 13216.
% 1.67/1.89  
% 1.67/1.89  set(prolog_style_variables).
% 1.67/1.89  set(auto).
% 1.67/1.89     dependent: set(auto1).
% 1.67/1.89     dependent: set(process_input).
% 1.67/1.89     dependent: clear(print_kept).
% 1.67/1.89     dependent: clear(print_new_demod).
% 1.67/1.89     dependent: clear(print_back_demod).
% 1.67/1.89     dependent: clear(print_back_sub).
% 1.67/1.89     dependent: set(control_memory).
% 1.67/1.89     dependent: assign(max_mem, 12000).
% 1.67/1.89     dependent: assign(pick_given_ratio, 4).
% 1.67/1.89     dependent: assign(stats_level, 1).
% 1.67/1.89     dependent: assign(max_seconds, 10800).
% 1.67/1.89  clear(print_given).
% 1.67/1.89  
% 1.67/1.89  list(usable).
% 1.67/1.89  0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.67/1.89  0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 1.67/1.89  0 [] is_a_theorem(implies(implies(not(X),X),X)).
% 1.67/1.89  0 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 1.67/1.89  0 [] -is_a_theorem(implies(not(implies(x,x)),y)).
% 1.67/1.89  end_of_list.
% 1.67/1.89  
% 1.67/1.89  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.67/1.89  
% 1.67/1.89  This is a Horn set without equality.  The strategy will
% 1.67/1.89  be hyperresolution, with satellites in sos and nuclei
% 1.67/1.89  in usable.
% 1.67/1.89  
% 1.67/1.89     dependent: set(hyper_res).
% 1.67/1.89     dependent: clear(order_hyper).
% 1.67/1.89  
% 1.67/1.89  ------------> process usable:
% 1.67/1.89  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.67/1.89  ** KEPT (pick-wt=7): 2 [] -is_a_theorem(implies(not(implies(x,x)),y)).
% 1.67/1.89  
% 1.67/1.89  ------------> process sos:
% 1.67/1.89  ** KEPT (pick-wt=12): 3 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.67/1.89  ** KEPT (pick-wt=7): 4 [] is_a_theorem(implies(implies(not(A),A),A)).
% 1.67/1.89  ** KEPT (pick-wt=7): 5 [] is_a_theorem(implies(A,implies(not(A),B))).
% 1.67/1.89  
% 1.67/1.89  ======= end of input processing =======
% 1.67/1.89  
% 1.67/1.89  =========== start of search ===========
% 1.67/1.89  
% 1.67/1.89  -------- PROOF -------- 
% 1.67/1.89  
% 1.67/1.89  ----> UNIT CONFLICT at   0.00 sec ----> 43 [binary,42.1,2.1] $F.
% 1.67/1.89  
% 1.67/1.89  Length of proof is 3.  Level of proof is 3.
% 1.67/1.89  
% 1.67/1.89  ---------------- PROOF ----------------
% 1.67/1.89  % SZS status Unsatisfiable
% 1.67/1.89  % SZS output start Refutation
% See solution above
% 1.67/1.89  ------------ end of proof -------------
% 1.67/1.89  
% 1.67/1.89  
% 1.67/1.89  Search stopped by max_proofs option.
% 1.67/1.89  
% 1.67/1.89  
% 1.67/1.89  Search stopped by max_proofs option.
% 1.67/1.89  
% 1.67/1.89  ============ end of search ============
% 1.67/1.89  
% 1.67/1.89  -------------- statistics -------------
% 1.67/1.89  clauses given                 10
% 1.67/1.89  clauses generated             50
% 1.67/1.89  clauses kept                  42
% 1.67/1.89  clauses forward subsumed      13
% 1.67/1.89  clauses back subsumed          0
% 1.67/1.89  Kbytes malloced              976
% 1.67/1.89  
% 1.67/1.89  ----------- times (seconds) -----------
% 1.67/1.89  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.89  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.89  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.67/1.89  
% 1.67/1.89  That finishes the proof of the theorem.
% 1.67/1.89  
% 1.67/1.89  Process 13216 finished Wed Jul 27 09:37:09 2022
% 1.67/1.90  Otter interrupted
% 1.67/1.90  PROOF FOUND
%------------------------------------------------------------------------------