↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYO613-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n004.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:26:25 EDT 2022

% Result   : Unsatisfiable 1.71s 1.93s
% Output   : Refutation 1.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    4 (   3 unt;   0 nHn;   2 RR)
%            Number of literals    :   26 (   0 equ;  23 neg)
%            Maximal clause size   :   23 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ e_q(f(A),a0)
    | ~ e_q(f(B),a0)
    | ~ e_q(f(C),a0)
    | ~ e_q(f(D),a0)
    | ~ e_q(f(E),a0)
    | ~ e_q(f(F),a0)
    | ~ e_q(f(G),a0)
    | ~ e_q(f(H),a0)
    | ~ e_q(f(I),a0)
    | ~ e_q(f(J),a0)
    | ~ e_q(f(K),a0)
    | ~ e_q(f(L),a0)
    | ~ le(s(A),B)
    | ~ le(s(B),C)
    | ~ le(s(C),D)
    | ~ le(s(D),E)
    | ~ le(s(E),F)
    | ~ le(s(F),G)
    | ~ le(s(G),H)
    | ~ le(s(H),I)
    | ~ le(s(I),J)
    | ~ le(s(J),K)
    | ~ le(s(K),L) ),
    file('SYO613-1.p',unknown),
    [] ).

cnf(4,axiom,
    le(A,A),
    file('SYO613-1.p',unknown),
    [] ).

cnf(5,axiom,
    e_q(f(A),a0),
    file('SYO613-1.p',unknown),
    [] ).

cnf(8,plain,
    $false,
    inference(hyper,[status(thm)],[5,3,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,4,4,4,4,4,4,4]),
    [iquote('hyper,5,3,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,4,4,4,4,4,4,4')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYO613-1 : TPTP v8.1.0. Released v7.1.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n004.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 10:06:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.71/1.92  ----- Otter 3.3f, August 2004 -----
% 1.71/1.92  The process was started by sandbox on n004.cluster.edu,
% 1.71/1.92  Wed Jul 27 10:06:21 2022
% 1.71/1.92  The command was "./otter".  The process ID is 22175.
% 1.71/1.92  
% 1.71/1.92  set(prolog_style_variables).
% 1.71/1.92  set(auto).
% 1.71/1.92     dependent: set(auto1).
% 1.71/1.92     dependent: set(process_input).
% 1.71/1.92     dependent: clear(print_kept).
% 1.71/1.92     dependent: clear(print_new_demod).
% 1.71/1.92     dependent: clear(print_back_demod).
% 1.71/1.92     dependent: clear(print_back_sub).
% 1.71/1.92     dependent: set(control_memory).
% 1.71/1.92     dependent: assign(max_mem, 12000).
% 1.71/1.92     dependent: assign(pick_given_ratio, 4).
% 1.71/1.92     dependent: assign(stats_level, 1).
% 1.71/1.92     dependent: assign(max_seconds, 10800).
% 1.71/1.92  clear(print_given).
% 1.71/1.92  
% 1.71/1.92  list(usable).
% 1.71/1.92  0 [] le(A,A).
% 1.71/1.92  0 [] -le(max(A,B),C)|le(A,C).
% 1.71/1.92  0 [] -le(max(A,B),C)|le(B,C).
% 1.71/1.92  0 [] e_q(f(A),a0).
% 1.71/1.92  0 [] -e_q(f(A0),a0)| -e_q(f(A1),a0)| -e_q(f(A2),a0)| -e_q(f(A3),a0)| -e_q(f(A4),a0)| -e_q(f(A5),a0)| -e_q(f(A6),a0)| -e_q(f(A7),a0)| -e_q(f(A8),a0)| -e_q(f(A9),a0)| -e_q(f(A10),a0)| -e_q(f(A11),a0)| -le(s(A0),A1)| -le(s(A1),A2)| -le(s(A2),A3)| -le(s(A3),A4)| -le(s(A4),A5)| -le(s(A5),A6)| -le(s(A6),A7)| -le(s(A7),A8)| -le(s(A8),A9)| -le(s(A9),A10)| -le(s(A10),A11).
% 1.71/1.93  end_of_list.
% 1.71/1.93  
% 1.71/1.93  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=23.
% 1.71/1.93  
% 1.71/1.93  This is a Horn set without equality.  The strategy will
% 1.71/1.93  be hyperresolution, with satellites in sos and nuclei
% 1.71/1.93  in usable.
% 1.71/1.93  
% 1.71/1.93     dependent: set(hyper_res).
% 1.71/1.93     dependent: clear(order_hyper).
% 1.71/1.93  
% 1.71/1.93  ------------> process usable:
% 1.71/1.93  ** KEPT (pick-wt=8): 1 [] -le(max(A,B),C)|le(A,C).
% 1.71/1.93  ** KEPT (pick-wt=8): 2 [] -le(max(A,B),C)|le(B,C).
% 1.71/1.93  ** KEPT (pick-wt=92): 3 [] -e_q(f(A),a0)| -e_q(f(B),a0)| -e_q(f(C),a0)| -e_q(f(D),a0)| -e_q(f(E),a0)| -e_q(f(F),a0)| -e_q(f(G),a0)| -e_q(f(H),a0)| -e_q(f(I),a0)| -e_q(f(J),a0)| -e_q(f(K),a0)| -e_q(f(L),a0)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G)| -le(s(G),H)| -le(s(H),I)| -le(s(I),J)| -le(s(J),K)| -le(s(K),L).
% 1.71/1.93  
% 1.71/1.93  ------------> process sos:
% 1.71/1.93  ** KEPT (pick-wt=3): 4 [] le(A,A).
% 1.71/1.93  ** KEPT (pick-wt=4): 5 [] e_q(f(A),a0).
% 1.71/1.93  
% 1.71/1.93  ======= end of input processing =======
% 1.71/1.93  
% 1.71/1.93  =========== start of search ===========
% 1.71/1.93  
% 1.71/1.93  -------- PROOF -------- 
% 1.71/1.93  
% 1.71/1.93  -----> EMPTY CLAUSE at   0.00 sec ----> 8 [hyper,5,3,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,4,4,4,4,4,4,4] $F.
% 1.71/1.93  
% 1.71/1.93  Length of proof is 0.  Level of proof is 0.
% 1.71/1.93  
% 1.71/1.93  ---------------- PROOF ----------------
% 1.71/1.93  % SZS status Unsatisfiable
% 1.71/1.93  % SZS output start Refutation
% See solution above
% 1.71/1.93  ------------ end of proof -------------
% 1.71/1.93  
% 1.71/1.93  
% 1.71/1.93  Search stopped by max_proofs option.
% 1.71/1.93  
% 1.71/1.93  
% 1.71/1.93  Search stopped by max_proofs option.
% 1.71/1.93  
% 1.71/1.93  ============ end of search ============
% 1.71/1.93  
% 1.71/1.93  -------------- statistics -------------
% 1.71/1.93  clauses given                  2
% 1.71/1.93  clauses generated              3
% 1.71/1.93  clauses kept                   7
% 1.71/1.93  clauses forward subsumed       0
% 1.71/1.93  clauses back subsumed          0
% 1.71/1.93  Kbytes malloced              976
% 1.71/1.93  
% 1.71/1.93  ----------- times (seconds) -----------
% 1.71/1.93  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.93  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.93  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.71/1.93  
% 1.71/1.93  That finishes the proof of the theorem.
% 1.71/1.93  
% 1.71/1.93  Process 22175 finished Wed Jul 27 10:06:22 2022
% 1.71/1.93  Otter interrupted
% 1.71/1.93  PROOF FOUND
%------------------------------------------------------------------------------