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

View Problem - Process Solution

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

% Computer : n020.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:38 EDT 2022

% Result   : Unsatisfiable 36.00s 36.16s
% Output   : Refutation 36.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   42 (  41 unt;   0 nHn;   3 RR)
%            Number of literals    :   44 (   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   :  158 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ is_a_theorem(e_quivalent(A,B))
    | ~ is_a_theorem(A)
    | is_a_theorem(B) ),
    file('LCL125-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('LCL125-1.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

cnf(19,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)],[15,1,15]),
    [iquote('hyper,15,1,15')] ).

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

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

cnf(65,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)],[19,1,15]),
    [iquote('hyper,19,1,15')] ).

cnf(67,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)],[19,1,9]),
    [iquote('hyper,19,1,9')] ).

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

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

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

cnf(480,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)],[67,1,65]),
    [iquote('hyper,67,1,65')] ).

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

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

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

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

cnf(918,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)],[138,1,11]),
    [iquote('hyper,138,1,11')] ).

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

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

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

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

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

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

cnf(5679,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
    inference(hyper,[status(thm)],[1916,1,480]),
    [iquote('hyper,1916,1,480')] ).

cnf(5691,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,B)),A)),
    inference(hyper,[status(thm)],[5679,1,2873]),
    [iquote('hyper,5679,1,2873')] ).

cnf(5862,plain,
    is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,C),B)),A)),
    inference(hyper,[status(thm)],[5691,1,2875]),
    [iquote('hyper,5691,1,2875')] ).

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

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

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

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

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

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

cnf(11643,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)],[11578,1,2873]),
    [iquote('hyper,11578,1,2873')] ).

cnf(11720,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)],[11643,1,929]),
    [iquote('hyper,11643,1,929')] ).

cnf(11721,plain,
    $false,
    inference(binary,[status(thm)],[11720,2]),
    [iquote('binary,11720.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL125-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 09:28:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 36.00/36.16  ----- Otter 3.3f, August 2004 -----
% 36.00/36.16  The process was started by sandbox2 on n020.cluster.edu,
% 36.00/36.16  Wed Jul 27 09:28:53 2022
% 36.00/36.16  The command was "./otter".  The process ID is 914.
% 36.00/36.16  
% 36.00/36.16  set(prolog_style_variables).
% 36.00/36.16  set(auto).
% 36.00/36.16     dependent: set(auto1).
% 36.00/36.16     dependent: set(process_input).
% 36.00/36.16     dependent: clear(print_kept).
% 36.00/36.16     dependent: clear(print_new_demod).
% 36.00/36.16     dependent: clear(print_back_demod).
% 36.00/36.16     dependent: clear(print_back_sub).
% 36.00/36.16     dependent: set(control_memory).
% 36.00/36.16     dependent: assign(max_mem, 12000).
% 36.00/36.16     dependent: assign(pick_given_ratio, 4).
% 36.00/36.16     dependent: assign(stats_level, 1).
% 36.00/36.16     dependent: assign(max_seconds, 10800).
% 36.00/36.16  clear(print_given).
% 36.00/36.16  
% 36.00/36.16  list(usable).
% 36.00/36.16  0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 36.00/36.16  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(Z,Y)),e_quivalent(X,Z))).
% 36.00/36.16  0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(X,e_quivalent(Y,Z)),e_quivalent(Z,Y)))).
% 36.00/36.16  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)))))).
% 36.00/36.16  end_of_list.
% 36.00/36.16  
% 36.00/36.16  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 36.00/36.16  
% 36.00/36.16  This is a Horn set without equality.  The strategy will
% 36.00/36.16  be hyperresolution, with satellites in sos and nuclei
% 36.00/36.16  in usable.
% 36.00/36.16  
% 36.00/36.16     dependent: set(hyper_res).
% 36.00/36.16     dependent: clear(order_hyper).
% 36.00/36.16  
% 36.00/36.16  ------------> process usable:
% 36.00/36.16  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 36.00/36.16  ** 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)))))).
% 36.00/36.16  
% 36.00/36.16  ------------> process sos:
% 36.00/36.16  ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(A,C))).
% 36.00/36.16  ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)))).
% 36.00/36.16  
% 36.00/36.16  ======= end of input processing =======
% 36.00/36.16  
% 36.00/36.16  =========== start of search ===========
% 36.00/36.16  
% 36.00/36.16  
% 36.00/36.16  Resetting weight limit to 20.
% 36.00/36.16  
% 36.00/36.16  
% 36.00/36.16  Resetting weight limit to 20.
% 36.00/36.16  
% 36.00/36.16  sos_size=5267
% 36.00/36.16  
% 36.00/36.16  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 36.00/36.16  
% 36.00/36.16  ----> UNIT CONFLICT at  34.04 sec ----> 11721 [binary,11720.1,2.1] $F.
% 36.00/36.16  
% 36.00/36.16  Length of proof is 37.  Level of proof is 17.
% 36.00/36.16  
% 36.00/36.16  ---------------- PROOF ----------------
% 36.00/36.16  % SZS status Unsatisfiable
% 36.00/36.16  % SZS output start Refutation
% See solution above
% 36.00/36.16  ------------ end of proof -------------
% 36.00/36.16  
% 36.00/36.16  
% 36.00/36.16  Search stopped by max_proofs option.
% 36.00/36.16  
% 36.00/36.16  
% 36.00/36.16  Search stopped by max_proofs option.
% 36.00/36.16  
% 36.00/36.16  ============ end of search ============
% 36.00/36.16  
% 36.00/36.16  -------------- statistics -------------
% 36.00/36.16  clauses given               4149
% 36.00/36.16  clauses generated        9631134
% 36.00/36.16  clauses kept               11720
% 36.00/36.16  clauses forward subsumed 3057139
% 36.00/36.16  clauses back subsumed        744
% 36.00/36.16  Kbytes malloced             7812
% 36.00/36.16  
% 36.00/36.16  ----------- times (seconds) -----------
% 36.00/36.16  user CPU time         34.04          (0 hr, 0 min, 34 sec)
% 36.00/36.16  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 36.00/36.16  wall-clock time       36             (0 hr, 0 min, 36 sec)
% 36.00/36.16  
% 36.00/36.16  That finishes the proof of the theorem.
% 36.00/36.16  
% 36.00/36.16  Process 914 finished Wed Jul 27 09:29:29 2022
% 36.00/36.16  Otter interrupted
% 36.00/36.16  PROOF FOUND
%------------------------------------------------------------------------------