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

View Problem - Process Solution

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

% Computer : n012.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:39 EDT 2022

% Result   : Unsatisfiable 38.35s 38.54s
% Output   : Refutation 38.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   26 (  25 unt;   0 nHn;   3 RR)
%            Number of literals    :   28 (   0 equ;   3 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   90 (   0 sgn)

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

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

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

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

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

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

cnf(7,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,B)),A)),
    inference(hyper,[status(thm)],[6,1,4]),
    [iquote('hyper,6,1,4')] ).

cnf(9,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,A),e_quivalent(B,B))),
    inference(hyper,[status(thm)],[7,1,7]),
    [iquote('hyper,7,1,7')] ).

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

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

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

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

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

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

cnf(83,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(D,C)),e_quivalent(e_quivalent(E,F),e_quivalent(D,B))),e_quivalent(F,E)))),
    inference(hyper,[status(thm)],[34,1,5]),
    [iquote('hyper,34,1,5')] ).

cnf(84,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,D))),e_quivalent(e_quivalent(A,e_quivalent(D,C)),B))),
    inference(hyper,[status(thm)],[34,1,3]),
    [iquote('hyper,34,1,3')] ).

cnf(98,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(A,D),e_quivalent(B,D)),C))),
    inference(hyper,[status(thm)],[37,1,37]),
    [iquote('hyper,37,1,37')] ).

cnf(1185,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(e_quivalent(A,D),e_quivalent(C,D)))),
    inference(hyper,[status(thm)],[98,1,37]),
    [iquote('hyper,98,1,37')] ).

cnf(1204,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),C)),e_quivalent(A,D))),
    inference(hyper,[status(thm)],[98,1,14]),
    [iquote('hyper,98,1,14')] ).

cnf(1206,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(e_quivalent(C,B),D)),A)),
    inference(hyper,[status(thm)],[98,1,10]),
    [iquote('hyper,98,1,10')] ).

cnf(8598,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(D,C))),e_quivalent(D,B)))),
    inference(hyper,[status(thm)],[1204,1,83]),
    [iquote('hyper,1204,1,83')] ).

cnf(8602,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),D)),e_quivalent(C,B)),D),E),e_quivalent(A,E))),
    inference(hyper,[status(thm)],[1206,1,1185]),
    [iquote('hyper,1206,1,1185')] ).

cnf(10103,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(B,D),e_quivalent(C,D))))),
    inference(hyper,[status(thm)],[8598,1,84]),
    [iquote('hyper,8598,1,84')] ).

cnf(10903,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(C,D),e_quivalent(B,D))),A)),
    inference(hyper,[status(thm)],[10103,1,84]),
    [iquote('hyper,10103,1,84')] ).

cnf(12152,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))))),
    inference(hyper,[status(thm)],[8602,1,10903]),
    [iquote('hyper,8602,1,10903')] ).

cnf(12153,plain,
    $false,
    inference(binary,[status(thm)],[12152,2]),
    [iquote('binary,12152.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : LCL129-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n012.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:13:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 38.35/38.54  ----- Otter 3.3f, August 2004 -----
% 38.35/38.54  The process was started by sandbox2 on n012.cluster.edu,
% 38.35/38.54  Wed Jul 27 09:13:05 2022
% 38.35/38.54  The command was "./otter".  The process ID is 19517.
% 38.35/38.54  
% 38.35/38.54  set(prolog_style_variables).
% 38.35/38.54  set(auto).
% 38.35/38.54     dependent: set(auto1).
% 38.35/38.54     dependent: set(process_input).
% 38.35/38.54     dependent: clear(print_kept).
% 38.35/38.54     dependent: clear(print_new_demod).
% 38.35/38.54     dependent: clear(print_back_demod).
% 38.35/38.54     dependent: clear(print_back_sub).
% 38.35/38.54     dependent: set(control_memory).
% 38.35/38.54     dependent: assign(max_mem, 12000).
% 38.35/38.54     dependent: assign(pick_given_ratio, 4).
% 38.35/38.54     dependent: assign(stats_level, 1).
% 38.35/38.54     dependent: assign(max_seconds, 10800).
% 38.35/38.54  clear(print_given).
% 38.35/38.54  
% 38.35/38.54  list(usable).
% 38.35/38.54  0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 38.35/38.54  0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(Y,Z)),e_quivalent(e_quivalent(X,e_quivalent(U,Z)),e_quivalent(Y,U)))).
% 38.35/38.54  0 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 38.35/38.54  end_of_list.
% 38.35/38.54  
% 38.35/38.54  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 38.35/38.54  
% 38.35/38.54  This is a Horn set without equality.  The strategy will
% 38.35/38.54  be hyperresolution, with satellites in sos and nuclei
% 38.35/38.54  in usable.
% 38.35/38.54  
% 38.35/38.54     dependent: set(hyper_res).
% 38.35/38.54     dependent: clear(order_hyper).
% 38.35/38.54  
% 38.35/38.54  ------------> process usable:
% 38.35/38.54  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 38.35/38.54  ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 38.35/38.54  
% 38.35/38.54  ------------> process sos:
% 38.35/38.54  ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(A,e_quivalent(D,C)),e_quivalent(B,D)))).
% 38.35/38.54  
% 38.35/38.54  ======= end of input processing =======
% 38.35/38.54  
% 38.35/38.54  =========== start of search ===========
% 38.35/38.54  
% 38.35/38.54  
% 38.35/38.54  Resetting weight limit to 20.
% 38.35/38.54  
% 38.35/38.54  
% 38.35/38.54  Resetting weight limit to 20.
% 38.35/38.54  
% 38.35/38.54  sos_size=6636
% 38.35/38.54  
% 38.35/38.54  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 38.35/38.54  
% 38.35/38.54  ----> UNIT CONFLICT at  36.65 sec ----> 12153 [binary,12152.1,2.1] $F.
% 38.35/38.54  
% 38.35/38.54  Length of proof is 22.  Level of proof is 12.
% 38.35/38.54  
% 38.35/38.54  ---------------- PROOF ----------------
% 38.35/38.54  % SZS status Unsatisfiable
% 38.35/38.54  % SZS output start Refutation
% See solution above
% 38.35/38.54  ------------ end of proof -------------
% 38.35/38.54  
% 38.35/38.54  
% 38.35/38.54  Search stopped by max_proofs option.
% 38.35/38.54  
% 38.35/38.54  
% 38.35/38.54  Search stopped by max_proofs option.
% 38.35/38.54  
% 38.35/38.54  ============ end of search ============
% 38.35/38.54  
% 38.35/38.54  -------------- statistics -------------
% 38.35/38.54  clauses given               4394
% 38.35/38.54  clauses generated        10797654
% 38.35/38.54  clauses kept               12152
% 38.35/38.54  clauses forward subsumed 4636771
% 38.35/38.54  clauses back subsumed         90
% 38.35/38.54  Kbytes malloced             7812
% 38.35/38.54  
% 38.35/38.54  ----------- times (seconds) -----------
% 38.35/38.54  user CPU time         36.65          (0 hr, 0 min, 36 sec)
% 38.35/38.54  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 38.35/38.54  wall-clock time       38             (0 hr, 0 min, 38 sec)
% 38.35/38.54  
% 38.35/38.54  That finishes the proof of the theorem.
% 38.35/38.54  
% 38.35/38.54  Process 19517 finished Wed Jul 27 09:13:43 2022
% 38.35/38.54  Otter interrupted
% 38.35/38.54  PROOF FOUND
%------------------------------------------------------------------------------