TSTP Solution File: SYN005-1.010 by Otter---3.3

View Problem - Process Solution

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

% Computer : n024.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:23:17 EDT 2022

% Result   : Unsatisfiable 1.67s 1.88s
% Output   : Refutation 1.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   12 (  11 unt;   0 nHn;  12 RR)
%            Number of literals    :   21 (   0 equ;  10 neg)
%            Maximal clause size   :   10 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ p_1(A,B)
    | ~ p_2(B,C)
    | ~ p_3(C,D)
    | ~ p_4(D,E)
    | ~ p_5(E,F)
    | ~ p_6(F,G)
    | ~ p_7(G,H)
    | ~ p_8(H,I)
    | ~ p_9(I,J)
    | ~ p_10(J,A) ),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(2,axiom,
    p_1(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(3,axiom,
    p_2(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(4,axiom,
    p_3(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(5,axiom,
    p_4(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(6,axiom,
    p_5(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(7,axiom,
    p_6(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(8,axiom,
    p_7(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(9,axiom,
    p_8(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(10,axiom,
    p_9(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(11,axiom,
    p_10(a,a),
    file('SYN005-1.010.p',unknown),
    [] ).

cnf(12,plain,
    $false,
    inference(hyper,[status(thm)],[11,1,2,3,4,5,6,7,8,9,10]),
    [iquote('hyper,11,1,2,3,4,5,6,7,8,9,10')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n024.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 11:23:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.67/1.88  ----- Otter 3.3f, August 2004 -----
% 1.67/1.88  The process was started by sandbox2 on n024.cluster.edu,
% 1.67/1.88  Wed Jul 27 11:23:10 2022
% 1.67/1.88  The command was "./otter".  The process ID is 24659.
% 1.67/1.88  
% 1.67/1.88  set(prolog_style_variables).
% 1.67/1.88  set(auto).
% 1.67/1.88     dependent: set(auto1).
% 1.67/1.88     dependent: set(process_input).
% 1.67/1.88     dependent: clear(print_kept).
% 1.67/1.88     dependent: clear(print_new_demod).
% 1.67/1.88     dependent: clear(print_back_demod).
% 1.67/1.88     dependent: clear(print_back_sub).
% 1.67/1.88     dependent: set(control_memory).
% 1.67/1.88     dependent: assign(max_mem, 12000).
% 1.67/1.88     dependent: assign(pick_given_ratio, 4).
% 1.67/1.88     dependent: assign(stats_level, 1).
% 1.67/1.88     dependent: assign(max_seconds, 10800).
% 1.67/1.88  clear(print_given).
% 1.67/1.88  
% 1.67/1.88  list(usable).
% 1.67/1.88  0 [] -p_1(X1,X2)| -p_2(X2,X3)| -p_3(X3,X4)| -p_4(X4,X5)| -p_5(X5,X6)| -p_6(X6,X7)| -p_7(X7,X8)| -p_8(X8,X9)| -p_9(X9,X10)| -p_10(X10,X1).
% 1.67/1.88  0 [] p_1(a,a).
% 1.67/1.88  0 [] p_2(a,a).
% 1.67/1.88  0 [] p_3(a,a).
% 1.67/1.88  0 [] p_4(a,a).
% 1.67/1.88  0 [] p_5(a,a).
% 1.67/1.88  0 [] p_6(a,a).
% 1.67/1.88  0 [] p_7(a,a).
% 1.67/1.88  0 [] p_8(a,a).
% 1.67/1.88  0 [] p_9(a,a).
% 1.67/1.88  0 [] p_10(a,a).
% 1.67/1.88  end_of_list.
% 1.67/1.88  
% 1.67/1.88  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 1.67/1.88  
% 1.67/1.88  This is a Horn set without equality.  The strategy will
% 1.67/1.88  be hyperresolution, with satellites in sos and nuclei
% 1.67/1.88  in usable.
% 1.67/1.88  
% 1.67/1.88     dependent: set(hyper_res).
% 1.67/1.88     dependent: clear(order_hyper).
% 1.67/1.88  
% 1.67/1.88  ------------> process usable:
% 1.67/1.88  ** KEPT (pick-wt=30): 1 [] -p_1(A,B)| -p_2(B,C)| -p_3(C,D)| -p_4(D,E)| -p_5(E,F)| -p_6(F,G)| -p_7(G,H)| -p_8(H,I)| -p_9(I,J)| -p_10(J,A).
% 1.67/1.88  
% 1.67/1.88  ------------> process sos:
% 1.67/1.88  ** KEPT (pick-wt=3): 2 [] p_1(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 3 [] p_2(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 4 [] p_3(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 5 [] p_4(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 6 [] p_5(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 7 [] p_6(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 8 [] p_7(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 9 [] p_8(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 10 [] p_9(a,a).
% 1.67/1.88  ** KEPT (pick-wt=3): 11 [] p_10(a,a).
% 1.67/1.88  
% 1.67/1.88  ======= end of input processing =======
% 1.67/1.88  
% 1.67/1.88  =========== start of search ===========
% 1.67/1.88  
% 1.67/1.88  -------- PROOF -------- 
% 1.67/1.88  
% 1.67/1.88  -----> EMPTY CLAUSE at   0.00 sec ----> 12 [hyper,11,1,2,3,4,5,6,7,8,9,10] $F.
% 1.67/1.88  
% 1.67/1.88  Length of proof is 0.  Level of proof is 0.
% 1.67/1.88  
% 1.67/1.88  ---------------- PROOF ----------------
% 1.67/1.88  % SZS status Unsatisfiable
% 1.67/1.88  % SZS output start Refutation
% See solution above
% 1.67/1.88  ------------ end of proof -------------
% 1.67/1.88  
% 1.67/1.88  
% 1.67/1.88  Search stopped by max_proofs option.
% 1.67/1.88  
% 1.67/1.88  
% 1.67/1.88  Search stopped by max_proofs option.
% 1.67/1.88  
% 1.67/1.88  ============ end of search ============
% 1.67/1.88  
% 1.67/1.88  -------------- statistics -------------
% 1.67/1.88  clauses given                 10
% 1.67/1.88  clauses generated              1
% 1.67/1.88  clauses kept                  11
% 1.67/1.88  clauses forward subsumed       0
% 1.67/1.88  clauses back subsumed          0
% 1.67/1.88  Kbytes malloced              976
% 1.67/1.88  
% 1.67/1.88  ----------- times (seconds) -----------
% 1.67/1.88  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.88  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.88  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.67/1.88  
% 1.67/1.88  That finishes the proof of the theorem.
% 1.67/1.88  
% 1.67/1.88  Process 24659 finished Wed Jul 27 11:23:11 2022
% 1.67/1.88  Otter interrupted
% 1.67/1.88  PROOF FOUND
%------------------------------------------------------------------------------