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

View Problem - Process Solution

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

% Computer : n005.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:18 EDT 2022

% Result   : Unsatisfiable 4.93s 5.12s
% Output   : Refutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   37 (  36 unt;   0 nHn;   3 RR)
%            Number of literals    :   39 (   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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  105 (   0 sgn)

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

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

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

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

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

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

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

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

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

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

cnf(36,plain,
    is_a_theorem(e_quivalent(A,A)),
    inference(hyper,[status(thm)],[35,1,35]),
    [iquote('hyper,35,1,35')] ).

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

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

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

cnf(54,plain,
    is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
    inference(hyper,[status(thm)],[41,1,36]),
    [iquote('hyper,41,1,36')] ).

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

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

cnf(105,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,A),e_quivalent(B,B))),
    inference(hyper,[status(thm)],[54,1,36]),
    [iquote('hyper,54,1,36')] ).

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

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

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

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

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

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

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

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

cnf(6748,plain,
    is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,B)),B)),
    inference(hyper,[status(thm)],[6515,1,24]),
    [iquote('hyper,6515,1,24')] ).

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

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

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

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

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

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

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

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

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

cnf(15255,plain,
    $false,
    inference(binary,[status(thm)],[15254,2]),
    [iquote('binary,15254.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n005.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 09:27:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 4.93/5.12  ----- Otter 3.3f, August 2004 -----
% 4.93/5.12  The process was started by sandbox on n005.cluster.edu,
% 4.93/5.12  Wed Jul 27 09:27:20 2022
% 4.93/5.12  The command was "./otter".  The process ID is 24736.
% 4.93/5.12  
% 4.93/5.12  set(prolog_style_variables).
% 4.93/5.12  set(auto).
% 4.93/5.12     dependent: set(auto1).
% 4.93/5.12     dependent: set(process_input).
% 4.93/5.12     dependent: clear(print_kept).
% 4.93/5.12     dependent: clear(print_new_demod).
% 4.93/5.12     dependent: clear(print_back_demod).
% 4.93/5.12     dependent: clear(print_back_sub).
% 4.93/5.12     dependent: set(control_memory).
% 4.93/5.12     dependent: assign(max_mem, 12000).
% 4.93/5.12     dependent: assign(pick_given_ratio, 4).
% 4.93/5.12     dependent: assign(stats_level, 1).
% 4.93/5.12     dependent: assign(max_seconds, 10800).
% 4.93/5.12  clear(print_given).
% 4.93/5.12  
% 4.93/5.12  list(usable).
% 4.93/5.12  0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 4.93/5.12  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),Z),e_quivalent(Y,e_quivalent(Z,X)))).
% 4.93/5.12  0 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,a),e_quivalent(b,c)))).
% 4.93/5.12  end_of_list.
% 4.93/5.12  
% 4.93/5.12  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 4.93/5.12  
% 4.93/5.12  This is a Horn set without equality.  The strategy will
% 4.93/5.12  be hyperresolution, with satellites in sos and nuclei
% 4.93/5.12  in usable.
% 4.93/5.12  
% 4.93/5.12     dependent: set(hyper_res).
% 4.93/5.12     dependent: clear(order_hyper).
% 4.93/5.12  
% 4.93/5.12  ------------> process usable:
% 4.93/5.12  ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.93/5.12  ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,a),e_quivalent(b,c)))).
% 4.93/5.12  
% 4.93/5.12  ------------> process sos:
% 4.93/5.12  ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(B,e_quivalent(C,A)))).
% 4.93/5.12  
% 4.93/5.12  ======= end of input processing =======
% 4.93/5.12  
% 4.93/5.12  =========== start of search ===========
% 4.93/5.12  
% 4.93/5.12  
% 4.93/5.12  Resetting weight limit to 16.
% 4.93/5.12  
% 4.93/5.12  
% 4.93/5.12  Resetting weight limit to 16.
% 4.93/5.12  
% 4.93/5.12  sos_size=5538
% 4.93/5.12  
% 4.93/5.12  -------- PROOF -------- 
% 4.93/5.12  
% 4.93/5.12  ----> UNIT CONFLICT at   3.20 sec ----> 15255 [binary,15254.1,2.1] $F.
% 4.93/5.12  
% 4.93/5.12  Length of proof is 33.  Level of proof is 21.
% 4.93/5.12  
% 4.93/5.12  ---------------- PROOF ----------------
% 4.93/5.12  % SZS status Unsatisfiable
% 4.93/5.12  % SZS output start Refutation
% See solution above
% 4.93/5.12  ------------ end of proof -------------
% 4.93/5.12  
% 4.93/5.12  
% 4.93/5.12  Search stopped by max_proofs option.
% 4.93/5.12  
% 4.93/5.12  
% 4.93/5.12  Search stopped by max_proofs option.
% 4.93/5.12  
% 4.93/5.12  ============ end of search ============
% 4.93/5.12  
% 4.93/5.12  -------------- statistics -------------
% 4.93/5.12  clauses given               1137
% 4.93/5.12  clauses generated         673444
% 4.93/5.12  clauses kept               15254
% 4.93/5.12  clauses forward subsumed  165466
% 4.93/5.12  clauses back subsumed          0
% 4.93/5.12  Kbytes malloced             8789
% 4.93/5.12  
% 4.93/5.12  ----------- times (seconds) -----------
% 4.93/5.12  user CPU time          3.20          (0 hr, 0 min, 3 sec)
% 4.93/5.12  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 4.93/5.12  wall-clock time        5             (0 hr, 0 min, 5 sec)
% 4.93/5.12  
% 4.93/5.12  That finishes the proof of the theorem.
% 4.93/5.12  
% 4.93/5.12  Process 24736 finished Wed Jul 27 09:27:25 2022
% 4.93/5.12  Otter interrupted
% 4.93/5.12  PROOF FOUND
%------------------------------------------------------------------------------