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

View Problem - Process Solution

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

% Computer : n023.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:22 EDT 2022

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

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

cnf(2,axiom,
    ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
    file('LCL040-1.p',unknown),
    [] ).

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

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

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

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

cnf(19,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(20,plain,
    is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))),
    inference(hyper,[status(thm)],[4,1,3]),
    [iquote('hyper,4,1,3')] ).

cnf(110,plain,
    is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))),
    inference(hyper,[status(thm)],[19,1,15]),
    [iquote('hyper,19,1,15')] ).

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

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

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

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

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

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

cnf(2289,plain,
    $false,
    inference(binary,[status(thm)],[2288,2]),
    [iquote('binary,2288.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL040-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 09:35:33 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 2.37/2.57  ----- Otter 3.3f, August 2004 -----
% 2.37/2.57  The process was started by sandbox2 on n023.cluster.edu,
% 2.37/2.57  Wed Jul 27 09:35:33 2022
% 2.37/2.57  The command was "./otter".  The process ID is 28874.
% 2.37/2.57  
% 2.37/2.57  set(prolog_style_variables).
% 2.37/2.57  set(auto).
% 2.37/2.57     dependent: set(auto1).
% 2.37/2.57     dependent: set(process_input).
% 2.37/2.57     dependent: clear(print_kept).
% 2.37/2.57     dependent: clear(print_new_demod).
% 2.37/2.57     dependent: clear(print_back_demod).
% 2.37/2.57     dependent: clear(print_back_sub).
% 2.37/2.57     dependent: set(control_memory).
% 2.37/2.57     dependent: assign(max_mem, 12000).
% 2.37/2.57     dependent: assign(pick_given_ratio, 4).
% 2.37/2.57     dependent: assign(stats_level, 1).
% 2.37/2.57     dependent: assign(max_seconds, 10800).
% 2.37/2.57  clear(print_given).
% 2.37/2.57  
% 2.37/2.57  list(usable).
% 2.37/2.57  0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.37/2.57  0 [] is_a_theorem(implies(X,implies(Y,X))).
% 2.37/2.57  0 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))).
% 2.37/2.57  0 [] is_a_theorem(implies(not(not(X)),X)).
% 2.37/2.57  0 [] is_a_theorem(implies(X,not(not(X)))).
% 2.37/2.57  0 [] is_a_theorem(implies(implies(X,Y),implies(not(Y),not(X)))).
% 2.37/2.57  0 [] -is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))).
% 2.37/2.57  end_of_list.
% 2.37/2.57  
% 2.37/2.57  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.37/2.57  
% 2.37/2.57  This is a Horn set without equality.  The strategy will
% 2.37/2.57  be hyperresolution, with satellites in sos and nuclei
% 2.37/2.57  in usable.
% 2.37/2.57  
% 2.37/2.57     dependent: set(hyper_res).
% 2.37/2.57     dependent: clear(order_hyper).
% 2.37/2.57  
% 2.37/2.57  ------------> process usable:
% 2.37/2.57  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.37/2.57  ** KEPT (pick-wt=12): 2 [] -is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))).
% 2.37/2.57  
% 2.37/2.57  ------------> process sos:
% 2.37/2.57  ** KEPT (pick-wt=6): 3 [] is_a_theorem(implies(A,implies(B,A))).
% 2.37/2.57  ** KEPT (pick-wt=14): 4 [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 2.37/2.57  ** KEPT (pick-wt=6): 5 [] is_a_theorem(implies(not(not(A)),A)).
% 2.37/2.57  ** KEPT (pick-wt=6): 6 [] is_a_theorem(implies(A,not(not(A)))).
% 2.37/2.57  ** KEPT (pick-wt=10): 7 [] is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).
% 2.37/2.57  
% 2.37/2.57  ======= end of input processing =======
% 2.37/2.57  
% 2.37/2.57  =========== start of search ===========
% 2.37/2.57  
% 2.37/2.57  
% 2.37/2.57  Resetting weight limit to 12.
% 2.37/2.57  
% 2.37/2.57  
% 2.37/2.57  Resetting weight limit to 12.
% 2.37/2.57  
% 2.37/2.57  sos_size=1733
% 2.37/2.57  
% 2.37/2.57  -------- PROOF -------- 
% 2.37/2.57  
% 2.37/2.57  ----> UNIT CONFLICT at   0.53 sec ----> 2289 [binary,2288.1,2.1] $F.
% 2.37/2.57  
% 2.37/2.57  Length of proof is 11.  Level of proof is 6.
% 2.37/2.57  
% 2.37/2.57  ---------------- PROOF ----------------
% 2.37/2.57  % SZS status Unsatisfiable
% 2.37/2.57  % SZS output start Refutation
% See solution above
% 2.37/2.57  ------------ end of proof -------------
% 2.37/2.57  
% 2.37/2.57  
% 2.37/2.57  Search stopped by max_proofs option.
% 2.37/2.57  
% 2.37/2.57  
% 2.37/2.57  Search stopped by max_proofs option.
% 2.37/2.57  
% 2.37/2.57  ============ end of search ============
% 2.37/2.57  
% 2.37/2.57  -------------- statistics -------------
% 2.37/2.57  clauses given                720
% 2.37/2.57  clauses generated         202393
% 2.37/2.57  clauses kept                2288
% 2.37/2.57  clauses forward subsumed  128493
% 2.37/2.57  clauses back subsumed        100
% 2.37/2.57  Kbytes malloced             5859
% 2.37/2.57  
% 2.37/2.57  ----------- times (seconds) -----------
% 2.37/2.57  user CPU time          0.53          (0 hr, 0 min, 0 sec)
% 2.37/2.57  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 2.37/2.57  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.37/2.57  
% 2.37/2.57  That finishes the proof of the theorem.
% 2.37/2.57  
% 2.37/2.57  Process 28874 finished Wed Jul 27 09:35:35 2022
% 2.37/2.57  Otter interrupted
% 2.37/2.57  PROOF FOUND
%------------------------------------------------------------------------------