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

View Problem - Process Solution

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

% Computer : n007.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:03:26 EDT 2022

% Result   : Unsatisfiable 1.76s 1.93s
% Output   : Refutation 1.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   22 (  21 unt;   0 nHn;   3 RR)
%            Number of literals    :   24 (   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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   46 (  13 sgn)

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

cnf(2,axiom,
    ~ is_a_theorem(implies(implies(not(a),a),a)),
    file('LCL065-1.p',unknown),
    [] ).

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

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

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

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

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

cnf(11,plain,
    is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))),
    inference(hyper,[status(thm)],[4,1,4]),
    [iquote('hyper,4,1,4')] ).

cnf(13,plain,
    is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))),
    inference(hyper,[status(thm)],[4,1,8]),
    [iquote('hyper,4,1,8')] ).

cnf(16,plain,
    is_a_theorem(implies(implies(A,B),implies(A,A))),
    inference(hyper,[status(thm)],[4,1,3]),
    [iquote('hyper,4,1,3')] ).

cnf(19,plain,
    is_a_theorem(implies(A,A)),
    inference(hyper,[status(thm)],[16,1,8]),
    [iquote('hyper,16,1,8')] ).

cnf(20,plain,
    is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))),
    inference(hyper,[status(thm)],[19,1,4]),
    [iquote('hyper,19,1,4')] ).

cnf(21,plain,
    is_a_theorem(implies(A,implies(B,B))),
    inference(hyper,[status(thm)],[19,1,3]),
    [iquote('hyper,19,1,3')] ).

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

cnf(60,plain,
    is_a_theorem(implies(implies(implies(A,implies(B,B)),C),C)),
    inference(hyper,[status(thm)],[20,1,22]),
    [iquote('hyper,20,1,22')] ).

cnf(66,plain,
    is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)),
    inference(hyper,[status(thm)],[20,1,6]),
    [iquote('hyper,20,1,6')] ).

cnf(77,plain,
    is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
    inference(hyper,[status(thm)],[11,1,60]),
    [iquote('hyper,11,1,60')] ).

cnf(137,plain,
    is_a_theorem(implies(not(A),implies(A,B))),
    inference(hyper,[status(thm)],[13,1,66]),
    [iquote('hyper,13,1,66')] ).

cnf(155,plain,
    is_a_theorem(implies(implies(not(A),A),implies(not(A),B))),
    inference(hyper,[status(thm)],[137,1,4]),
    [iquote('hyper,137,1,4')] ).

cnf(638,plain,
    is_a_theorem(implies(implies(not(A),A),implies(B,A))),
    inference(hyper,[status(thm)],[155,1,13]),
    [iquote('hyper,155,1,13')] ).

cnf(653,plain,
    is_a_theorem(implies(implies(not(A),A),A)),
    inference(hyper,[status(thm)],[638,1,77]),
    [iquote('hyper,638,1,77')] ).

cnf(654,plain,
    $false,
    inference(binary,[status(thm)],[653,2]),
    [iquote('binary,653.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : otter-tptp-script %s
% 0.14/0.34  % Computer : n007.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Jul 27 09:07:46 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.76/1.93  ----- Otter 3.3f, August 2004 -----
% 1.76/1.93  The process was started by sandbox on n007.cluster.edu,
% 1.76/1.93  Wed Jul 27 09:07:46 2022
% 1.76/1.93  The command was "./otter".  The process ID is 21741.
% 1.76/1.93  
% 1.76/1.93  set(prolog_style_variables).
% 1.76/1.93  set(auto).
% 1.76/1.93     dependent: set(auto1).
% 1.76/1.93     dependent: set(process_input).
% 1.76/1.93     dependent: clear(print_kept).
% 1.76/1.93     dependent: clear(print_new_demod).
% 1.76/1.93     dependent: clear(print_back_demod).
% 1.76/1.93     dependent: clear(print_back_sub).
% 1.76/1.93     dependent: set(control_memory).
% 1.76/1.93     dependent: assign(max_mem, 12000).
% 1.76/1.93     dependent: assign(pick_given_ratio, 4).
% 1.76/1.93     dependent: assign(stats_level, 1).
% 1.76/1.93     dependent: assign(max_seconds, 10800).
% 1.76/1.93  clear(print_given).
% 1.76/1.93  
% 1.76/1.93  list(usable).
% 1.76/1.93  0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.76/1.93  0 [] is_a_theorem(implies(X,implies(Y,X))).
% 1.76/1.93  0 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))).
% 1.76/1.93  0 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 1.76/1.93  0 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 1.76/1.93  end_of_list.
% 1.76/1.93  
% 1.76/1.93  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.76/1.93  
% 1.76/1.93  This is a Horn set without equality.  The strategy will
% 1.76/1.93  be hyperresolution, with satellites in sos and nuclei
% 1.76/1.93  in usable.
% 1.76/1.93  
% 1.76/1.93     dependent: set(hyper_res).
% 1.76/1.93     dependent: clear(order_hyper).
% 1.76/1.93  
% 1.76/1.93  ------------> process usable:
% 1.76/1.93  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.76/1.93  ** KEPT (pick-wt=7): 2 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 1.76/1.93  
% 1.76/1.93  ------------> process sos:
% 1.76/1.93  ** KEPT (pick-wt=6): 3 [] is_a_theorem(implies(A,implies(B,A))).
% 1.76/1.93  ** KEPT (pick-wt=14): 4 [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 1.76/1.93  ** KEPT (pick-wt=10): 5 [] is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 1.76/1.93  
% 1.76/1.93  ======= end of input processing =======
% 1.76/1.93  
% 1.76/1.93  =========== start of search ===========
% 1.76/1.93  
% 1.76/1.93  -------- PROOF -------- 
% 1.76/1.93  
% 1.76/1.93  ----> UNIT CONFLICT at   0.02 sec ----> 654 [binary,653.1,2.1] $F.
% 1.76/1.93  
% 1.76/1.93  Length of proof is 16.  Level of proof is 8.
% 1.76/1.93  
% 1.76/1.93  ---------------- PROOF ----------------
% 1.76/1.93  % SZS status Unsatisfiable
% 1.76/1.93  % SZS output start Refutation
% See solution above
% 1.76/1.93  ------------ end of proof -------------
% 1.76/1.93  
% 1.76/1.93  
% 1.76/1.93  Search stopped by max_proofs option.
% 1.76/1.93  
% 1.76/1.93  
% 1.76/1.93  Search stopped by max_proofs option.
% 1.76/1.93  
% 1.76/1.93  ============ end of search ============
% 1.76/1.93  
% 1.76/1.93  -------------- statistics -------------
% 1.76/1.93  clauses given                 72
% 1.76/1.93  clauses generated           2992
% 1.76/1.93  clauses kept                 653
% 1.76/1.93  clauses forward subsumed    2344
% 1.76/1.93  clauses back subsumed          6
% 1.76/1.93  Kbytes malloced             2929
% 1.76/1.93  
% 1.76/1.93  ----------- times (seconds) -----------
% 1.76/1.93  user CPU time          0.02          (0 hr, 0 min, 0 sec)
% 1.76/1.93  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.76/1.93  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.76/1.93  
% 1.76/1.93  That finishes the proof of the theorem.
% 1.76/1.93  
% 1.76/1.93  Process 21741 finished Wed Jul 27 09:07:47 2022
% 1.76/1.94  Otter interrupted
% 1.76/1.94  PROOF FOUND
%------------------------------------------------------------------------------