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

View Problem - Process Solution

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

% Computer : n028.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:32 EDT 2022

% Result   : Unsatisfiable 1.80s 2.03s
% Output   : Refutation 1.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   33 (  32 unt;   0 nHn;   3 RR)
%            Number of literals    :   35 (   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :  118 (  65 sgn)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(1528,plain,
    is_a_theorem(implies(A,implies(implies(A,B),B))),
    inference(hyper,[status(thm)],[616,1,698]),
    [iquote('hyper,616,1,698')] ).

cnf(1529,plain,
    $false,
    inference(binary,[status(thm)],[1528,2]),
    [iquote('binary,1528.1,2.1')] ).

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