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

View Problem - Process Solution

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

% Result   : Unsatisfiable 1.81s 2.01s
% Output   : Refutation 1.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    3
% 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    :    7 (   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   :   91 (  48 sgn)

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

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

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

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

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

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

cnf(23,plain,
    is_a_theorem(implies(A,implies(falsehood,B))),
    inference(hyper,[status(thm)],[14,1,14]),
    [iquote('hyper,14,1,14')] ).

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

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

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

cnf(33,plain,
    is_a_theorem(implies(implies(implies(A,implies(implies(implies(B,C),implies(D,falsehood)),E)),B),implies(D,B))),
    inference(hyper,[status(thm)],[29,1,3]),
    [iquote('hyper,29,1,3')] ).

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

cnf(122,plain,
    is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(D,implies(C,A)))),
    inference(hyper,[status(thm)],[62,1,29]),
    [iquote('hyper,62,1,29')] ).

cnf(123,plain,
    is_a_theorem(implies(implies(implies(A,B),implies(implies(falsehood,C),falsehood)),implies(D,A))),
    inference(hyper,[status(thm)],[62,1,26]),
    [iquote('hyper,62,1,26')] ).

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

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

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

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

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

cnf(270,plain,
    is_a_theorem(implies(A,implies(implies(A,falsehood),B))),
    inference(hyper,[status(thm)],[255,1,149]),
    [iquote('hyper,255,1,149')] ).

cnf(271,plain,
    is_a_theorem(implies(A,implies(B,B))),
    inference(hyper,[status(thm)],[255,1,122]),
    [iquote('hyper,255,1,122')] ).

cnf(275,plain,
    is_a_theorem(implies(A,A)),
    inference(hyper,[status(thm)],[271,1,271]),
    [iquote('hyper,271,1,271')] ).

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

cnf(281,plain,
    is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(C,A))),
    inference(hyper,[status(thm)],[275,1,62]),
    [iquote('hyper,275,1,62')] ).

cnf(292,plain,
    is_a_theorem(implies(A,implies(implies(implies(implies(A,falsehood),B),falsehood),C))),
    inference(hyper,[status(thm)],[270,1,149]),
    [iquote('hyper,270,1,149')] ).

cnf(988,plain,
    is_a_theorem(implies(implies(implies(implies(implies(A,B),falsehood),C),falsehood),A)),
    inference(hyper,[status(thm)],[292,1,281]),
    [iquote('hyper,292,1,281')] ).

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

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

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

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

cnf(1621,plain,
    is_a_theorem(implies(implies(implies(A,B),A),A)),
    inference(hyper,[status(thm)],[1566,1,1585]),
    [iquote('hyper,1566,1,1585')] ).

cnf(1622,plain,
    $false,
    inference(binary,[status(thm)],[1621,2]),
    [iquote('binary,1621.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL034-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n016.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:43:52 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.81/2.01  ----- Otter 3.3f, August 2004 -----
% 1.81/2.01  The process was started by sandbox2 on n016.cluster.edu,
% 1.81/2.01  Wed Jul 27 09:43:52 2022
% 1.81/2.01  The command was "./otter".  The process ID is 31006.
% 1.81/2.01  
% 1.81/2.01  set(prolog_style_variables).
% 1.81/2.01  set(auto).
% 1.81/2.01     dependent: set(auto1).
% 1.81/2.01     dependent: set(process_input).
% 1.81/2.01     dependent: clear(print_kept).
% 1.81/2.01     dependent: clear(print_new_demod).
% 1.81/2.01     dependent: clear(print_back_demod).
% 1.81/2.01     dependent: clear(print_back_sub).
% 1.81/2.01     dependent: set(control_memory).
% 1.81/2.01     dependent: assign(max_mem, 12000).
% 1.81/2.01     dependent: assign(pick_given_ratio, 4).
% 1.81/2.01     dependent: assign(stats_level, 1).
% 1.81/2.01     dependent: assign(max_seconds, 10800).
% 1.81/2.01  clear(print_given).
% 1.81/2.01  
% 1.81/2.01  list(usable).
% 1.81/2.01  0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.81/2.01  0 [] is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))).
% 1.81/2.01  0 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.81/2.01  end_of_list.
% 1.81/2.01  
% 1.81/2.01  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.81/2.01  
% 1.81/2.01  This is a Horn set without equality.  The strategy will
% 1.81/2.01  be hyperresolution, with satellites in sos and nuclei
% 1.81/2.01  in usable.
% 1.81/2.01  
% 1.81/2.01     dependent: set(hyper_res).
% 1.81/2.01     dependent: clear(order_hyper).
% 1.81/2.01  
% 1.81/2.01  ------------> process usable:
% 1.81/2.01  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.81/2.01  ** KEPT (pick-wt=8): 2 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.81/2.01  
% 1.81/2.01  ------------> process sos:
% 1.81/2.01  ** KEPT (pick-wt=20): 3 [] is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))).
% 1.81/2.01  
% 1.81/2.01  ======= end of input processing =======
% 1.81/2.01  
% 1.81/2.01  =========== start of search ===========
% 1.81/2.01  
% 1.81/2.01  -------- PROOF -------- 
% 1.81/2.01  
% 1.81/2.01  ----> UNIT CONFLICT at   0.12 sec ----> 1622 [binary,1621.1,2.1] $F.
% 1.81/2.01  
% 1.81/2.01  Length of proof is 28.  Level of proof is 22.
% 1.81/2.01  
% 1.81/2.01  ---------------- PROOF ----------------
% 1.81/2.01  % SZS status Unsatisfiable
% 1.81/2.01  % SZS output start Refutation
% See solution above
% 1.81/2.01  ------------ end of proof -------------
% 1.81/2.01  
% 1.81/2.01  
% 1.81/2.01  Search stopped by max_proofs option.
% 1.81/2.01  
% 1.81/2.01  
% 1.81/2.01  Search stopped by max_proofs option.
% 1.81/2.01  
% 1.81/2.01  ============ end of search ============
% 1.81/2.01  
% 1.81/2.01  -------------- statistics -------------
% 1.81/2.01  clauses given                137
% 1.81/2.01  clauses generated          12315
% 1.81/2.01  clauses kept                1621
% 1.81/2.01  clauses forward subsumed   10697
% 1.81/2.01  clauses back subsumed         73
% 1.81/2.01  Kbytes malloced             1953
% 1.81/2.01  
% 1.81/2.01  ----------- times (seconds) -----------
% 1.81/2.01  user CPU time          0.12          (0 hr, 0 min, 0 sec)
% 1.81/2.01  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.81/2.01  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.81/2.01  
% 1.81/2.01  That finishes the proof of the theorem.
% 1.81/2.01  
% 1.81/2.01  Process 31006 finished Wed Jul 27 09:43:54 2022
% 1.81/2.01  Otter interrupted
% 1.81/2.01  PROOF FOUND
%------------------------------------------------------------------------------