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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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 5.21s 5.40s
% Output   : Refutation 5.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            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    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   85 (   0 sgn)

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

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

cnf(3,axiom,
    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)))))),
    file('LCL123-1.p',unknown),
    [] ).

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

cnf(6,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),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(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(A,D),e_quivalent(B,D)),C))),
    inference(hyper,[status(thm)],[6,1,6]),
    [iquote('hyper,6,1,6')] ).

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

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

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

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

cnf(30,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
    inference(hyper,[status(thm)],[25,1,17]),
    [iquote('hyper,25,1,17')] ).

cnf(31,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)],[25,1,4]),
    [iquote('hyper,25,1,4')] ).

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

cnf(35,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)],[32,1,6]),
    [iquote('hyper,32,1,6')] ).

cnf(37,plain,
    is_a_theorem(e_quivalent(A,A)),
    inference(hyper,[status(thm)],[32,1,30]),
    [iquote('hyper,32,1,30')] ).

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

cnf(53,plain,
    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)))),
    inference(hyper,[status(thm)],[35,1,31]),
    [iquote('hyper,35,1,31')] ).

cnf(121,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
    inference(hyper,[status(thm)],[49,1,31]),
    [iquote('hyper,49,1,31')] ).

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

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

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

cnf(827,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)))),
    inference(hyper,[status(thm)],[53,1,237]),
    [iquote('hyper,53,1,237')] ).

cnf(885,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)],[827,1,53]),
    [iquote('hyper,827,1,53')] ).

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

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

cnf(10730,plain,
    $false,
    inference(binary,[status(thm)],[10729,2]),
    [iquote('binary,10729.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.12/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 09:16:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 5.21/5.40  ----- Otter 3.3f, August 2004 -----
% 5.21/5.40  The process was started by sandbox on n018.cluster.edu,
% 5.21/5.40  Wed Jul 27 09:16:01 2022
% 5.21/5.40  The command was "./otter".  The process ID is 29142.
% 5.21/5.40  
% 5.21/5.40  set(prolog_style_variables).
% 5.21/5.40  set(auto).
% 5.21/5.40     dependent: set(auto1).
% 5.21/5.40     dependent: set(process_input).
% 5.21/5.40     dependent: clear(print_kept).
% 5.21/5.40     dependent: clear(print_new_demod).
% 5.21/5.40     dependent: clear(print_back_demod).
% 5.21/5.40     dependent: clear(print_back_sub).
% 5.21/5.40     dependent: set(control_memory).
% 5.21/5.40     dependent: assign(max_mem, 12000).
% 5.21/5.40     dependent: assign(pick_given_ratio, 4).
% 5.21/5.40     dependent: assign(stats_level, 1).
% 5.21/5.40     dependent: assign(max_seconds, 10800).
% 5.21/5.40  clear(print_given).
% 5.21/5.40  
% 5.21/5.40  list(usable).
% 5.21/5.40  0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 5.21/5.40  0 [] is_a_theorem(e_quivalent(X,e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Y,U),e_quivalent(Z,U)))))).
% 5.21/5.40  0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(b,c)),e_quivalent(e,e_quivalent(b,f))),e_quivalent(a,e_quivalent(e,e_quivalent(c,f))))).
% 5.21/5.40  end_of_list.
% 5.21/5.40  
% 5.21/5.40  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 5.21/5.40  
% 5.21/5.40  This is a Horn set without equality.  The strategy will
% 5.21/5.40  be hyperresolution, with satellites in sos and nuclei
% 5.21/5.40  in usable.
% 5.21/5.40  
% 5.21/5.40     dependent: set(hyper_res).
% 5.21/5.40     dependent: clear(order_hyper).
% 5.21/5.40  
% 5.21/5.40  ------------> process usable:
% 5.21/5.40  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 5.21/5.40  ** KEPT (pick-wt=20): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(b,c)),e_quivalent(e,e_quivalent(b,f))),e_quivalent(a,e_quivalent(e,e_quivalent(c,f))))).
% 5.21/5.40  
% 5.21/5.40  ------------> process sos:
% 5.21/5.40  ** KEPT (pick-wt=16): 3 [] 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)))))).
% 5.21/5.40  
% 5.21/5.40  ======= end of input processing =======
% 5.21/5.40  
% 5.21/5.40  =========== start of search ===========
% 5.21/5.40  
% 5.21/5.40  
% 5.21/5.40  Resetting weight limit to 20.
% 5.21/5.40  
% 5.21/5.40  
% 5.21/5.40  Resetting weight limit to 20.
% 5.21/5.40  
% 5.21/5.40  sos_size=5849
% 5.21/5.40  
% 5.21/5.40  -------- PROOF -------- 
% 5.21/5.40  
% 5.21/5.40  ----> UNIT CONFLICT at   3.49 sec ----> 10730 [binary,10729.1,2.1] $F.
% 5.21/5.40  
% 5.21/5.40  Length of proof is 22.  Level of proof is 17.
% 5.21/5.40  
% 5.21/5.40  ---------------- PROOF ----------------
% 5.21/5.40  % SZS status Unsatisfiable
% 5.21/5.40  % SZS output start Refutation
% See solution above
% 5.21/5.40  ------------ end of proof -------------
% 5.21/5.40  
% 5.21/5.40  
% 5.21/5.40  Search stopped by max_proofs option.
% 5.21/5.40  
% 5.21/5.40  
% 5.21/5.40  Search stopped by max_proofs option.
% 5.21/5.40  
% 5.21/5.40  ============ end of search ============
% 5.21/5.40  
% 5.21/5.40  -------------- statistics -------------
% 5.21/5.40  clauses given               1127
% 5.21/5.40  clauses generated         748126
% 5.21/5.40  clauses kept               10729
% 5.21/5.40  clauses forward subsumed  344603
% 5.21/5.40  clauses back subsumed         10
% 5.21/5.40  Kbytes malloced             6835
% 5.21/5.40  
% 5.21/5.40  ----------- times (seconds) -----------
% 5.21/5.40  user CPU time          3.49          (0 hr, 0 min, 3 sec)
% 5.21/5.40  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 5.21/5.40  wall-clock time        5             (0 hr, 0 min, 5 sec)
% 5.21/5.40  
% 5.21/5.40  That finishes the proof of the theorem.
% 5.21/5.40  
% 5.21/5.40  Process 29142 finished Wed Jul 27 09:16:06 2022
% 5.21/5.40  Otter interrupted
% 5.21/5.40  PROOF FOUND
%------------------------------------------------------------------------------