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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LCL067-1 : TPTP v8.1.0. Released v1.0.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:03:26 EDT 2022

% Result   : Unsatisfiable 2.59s 2.82s
% Output   : Refutation 2.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   32 (  31 unt;   0 nHn;   3 RR)
%            Number of literals    :   34 (   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   89 (  31 sgn)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(145,plain,
    is_a_theorem(implies(implies(implies(A,implies(B,C)),not(not(D))),implies(implies(B,C),implies(implies(D,B),C)))),
    inference(hyper,[status(thm)],[43,1,42]),
    [iquote('hyper,43,1,42')] ).

cnf(149,plain,
    is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))),
    inference(hyper,[status(thm)],[43,1,21]),
    [iquote('hyper,43,1,21')] ).

cnf(152,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(B,implies(D,implies(E,C))))),
    inference(hyper,[status(thm)],[43,1,13]),
    [iquote('hyper,43,1,13')] ).

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

cnf(219,plain,
    is_a_theorem(implies(not(A),implies(A,B))),
    inference(hyper,[status(thm)],[156,1,149]),
    [iquote('hyper,156,1,149')] ).

cnf(221,plain,
    is_a_theorem(implies(A,A)),
    inference(hyper,[status(thm)],[156,1,3]),
    [iquote('hyper,156,1,3')] ).

cnf(256,plain,
    is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
    inference(hyper,[status(thm)],[44,1,219]),
    [iquote('hyper,44,1,219')] ).

cnf(261,plain,
    is_a_theorem(implies(implies(A,implies(implies(B,C),D)),implies(C,implies(A,implies(E,D))))),
    inference(hyper,[status(thm)],[44,1,152]),
    [iquote('hyper,44,1,152')] ).

cnf(288,plain,
    is_a_theorem(implies(A,implies(not(A),B))),
    inference(hyper,[status(thm)],[256,1,221]),
    [iquote('hyper,256,1,221')] ).

cnf(294,plain,
    is_a_theorem(implies(implies(implies(A,not(B)),B),implies(not(B),C))),
    inference(hyper,[status(thm)],[288,1,43]),
    [iquote('hyper,288,1,43')] ).

cnf(580,plain,
    is_a_theorem(implies(implies(A,implies(B,not(A))),implies(B,not(A)))),
    inference(hyper,[status(thm)],[47,1,221]),
    [iquote('hyper,47,1,221')] ).

cnf(581,plain,
    is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))),
    inference(hyper,[status(thm)],[47,1,219]),
    [iquote('hyper,47,1,219')] ).

cnf(2897,plain,
    is_a_theorem(implies(not(A),not(implies(implies(B,not(A)),A)))),
    inference(hyper,[status(thm)],[580,1,294]),
    [iquote('hyper,580,1,294')] ).

cnf(2921,plain,
    is_a_theorem(implies(implies(implies(A,not(B)),B),not(not(B)))),
    inference(hyper,[status(thm)],[2897,1,581]),
    [iquote('hyper,2897,1,581')] ).

cnf(2954,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(implies(A,B),A),B))),
    inference(hyper,[status(thm)],[145,1,2921]),
    [iquote('hyper,145,1,2921')] ).

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

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

cnf(3184,plain,
    $false,
    inference(binary,[status(thm)],[3183,2]),
    [iquote('binary,3183.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL067-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n008.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:18:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.59/2.82  ----- Otter 3.3f, August 2004 -----
% 2.59/2.82  The process was started by sandbox2 on n008.cluster.edu,
% 2.59/2.82  Wed Jul 27 09:18:38 2022
% 2.59/2.82  The command was "./otter".  The process ID is 18436.
% 2.59/2.82  
% 2.59/2.82  set(prolog_style_variables).
% 2.59/2.82  set(auto).
% 2.59/2.82     dependent: set(auto1).
% 2.59/2.82     dependent: set(process_input).
% 2.59/2.82     dependent: clear(print_kept).
% 2.59/2.82     dependent: clear(print_new_demod).
% 2.59/2.82     dependent: clear(print_back_demod).
% 2.59/2.82     dependent: clear(print_back_sub).
% 2.59/2.82     dependent: set(control_memory).
% 2.59/2.82     dependent: assign(max_mem, 12000).
% 2.59/2.82     dependent: assign(pick_given_ratio, 4).
% 2.59/2.82     dependent: assign(stats_level, 1).
% 2.59/2.82     dependent: assign(max_seconds, 10800).
% 2.59/2.82  clear(print_given).
% 2.59/2.82  
% 2.59/2.82  list(usable).
% 2.59/2.82  0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.59/2.82  0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 2.59/2.82  0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 2.59/2.82  0 [] is_a_theorem(implies(implies(not(X),Z),implies(implies(Y,Z),implies(implies(X,Y),Z)))).
% 2.59/2.82  0 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.59/2.82  end_of_list.
% 2.59/2.82  
% 2.59/2.82  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.59/2.82  
% 2.59/2.82  This is a Horn set without equality.  The strategy will
% 2.59/2.82  be hyperresolution, with satellites in sos and nuclei
% 2.59/2.82  in usable.
% 2.59/2.82  
% 2.59/2.82     dependent: set(hyper_res).
% 2.59/2.82     dependent: clear(order_hyper).
% 2.59/2.82  
% 2.59/2.82  ------------> process usable:
% 2.59/2.82  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.59/2.82  ** KEPT (pick-wt=12): 2 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.59/2.82  
% 2.59/2.82  ------------> process sos:
% 2.59/2.82  ** KEPT (pick-wt=10): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 2.59/2.82  ** KEPT (pick-wt=11): 4 [] is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 2.59/2.82  ** KEPT (pick-wt=15): 5 [] is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))).
% 2.59/2.82  
% 2.59/2.82  ======= end of input processing =======
% 2.59/2.82  
% 2.59/2.82  =========== start of search ===========
% 2.59/2.82  
% 2.59/2.82  
% 2.59/2.82  Resetting weight limit to 12.
% 2.59/2.82  
% 2.59/2.82  
% 2.59/2.82  Resetting weight limit to 12.
% 2.59/2.82  
% 2.59/2.82  sos_size=2373
% 2.59/2.82  
% 2.59/2.82  -------- PROOF -------- 
% 2.59/2.82  
% 2.59/2.82  ----> UNIT CONFLICT at   0.93 sec ----> 3184 [binary,3183.1,2.1] $F.
% 2.59/2.82  
% 2.59/2.82  Length of proof is 26.  Level of proof is 12.
% 2.59/2.82  
% 2.59/2.82  ---------------- PROOF ----------------
% 2.59/2.82  % SZS status Unsatisfiable
% 2.59/2.82  % SZS output start Refutation
% See solution above
% 2.59/2.82  ------------ end of proof -------------
% 2.59/2.82  
% 2.59/2.82  
% 2.59/2.82  Search stopped by max_proofs option.
% 2.59/2.82  
% 2.59/2.82  
% 2.59/2.82  Search stopped by max_proofs option.
% 2.59/2.82  
% 2.59/2.82  ============ end of search ============
% 2.59/2.82  
% 2.59/2.82  -------------- statistics -------------
% 2.59/2.82  clauses given                997
% 2.59/2.82  clauses generated         492984
% 2.59/2.82  clauses kept                3183
% 2.59/2.82  clauses forward subsumed  180485
% 2.59/2.82  clauses back subsumed         77
% 2.59/2.82  Kbytes malloced             5859
% 2.59/2.82  
% 2.59/2.82  ----------- times (seconds) -----------
% 2.59/2.82  user CPU time          0.93          (0 hr, 0 min, 0 sec)
% 2.59/2.82  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 2.59/2.82  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 2.59/2.82  
% 2.59/2.82  That finishes the proof of the theorem.
% 2.59/2.82  
% 2.59/2.82  Process 18436 finished Wed Jul 27 09:18:41 2022
% 2.59/2.82  Otter interrupted
% 2.59/2.82  PROOF FOUND
%------------------------------------------------------------------------------