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

View Problem - Process Solution

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

% Computer : n011.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 12:48:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( succeeds(A,B)
    | ~ follows(A,B) ),
    file('COM002-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( succeeds(A,B)
    | ~ succeeds(A,C)
    | ~ succeeds(C,B) ),
    file('COM002-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( succeeds(A,B)
    | ~ has(B,goto(C))
    | ~ labels(C,A) ),
    file('COM002-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ succeeds(p3,p3),
    file('COM002-1.p',unknown),
    [] ).

cnf(9,axiom,
    labels(loop,p3),
    file('COM002-1.p',unknown),
    [] ).

cnf(14,axiom,
    follows(p6,p3),
    file('COM002-1.p',unknown),
    [] ).

cnf(16,axiom,
    follows(p7,p6),
    file('COM002-1.p',unknown),
    [] ).

cnf(18,axiom,
    follows(p8,p7),
    file('COM002-1.p',unknown),
    [] ).

cnf(19,axiom,
    has(p8,goto(loop)),
    file('COM002-1.p',unknown),
    [] ).

cnf(23,plain,
    succeeds(p6,p3),
    inference(hyper,[status(thm)],[14,1]),
    [iquote('hyper,14,1')] ).

cnf(24,plain,
    succeeds(p7,p6),
    inference(hyper,[status(thm)],[16,1]),
    [iquote('hyper,16,1')] ).

cnf(25,plain,
    succeeds(p8,p7),
    inference(hyper,[status(thm)],[18,1]),
    [iquote('hyper,18,1')] ).

cnf(29,plain,
    succeeds(p7,p3),
    inference(hyper,[status(thm)],[24,2,23]),
    [iquote('hyper,24,2,23')] ).

cnf(36,plain,
    succeeds(p8,p3),
    inference(hyper,[status(thm)],[29,2,25]),
    [iquote('hyper,29,2,25')] ).

cnf(42,plain,
    succeeds(p3,p8),
    inference(hyper,[status(thm)],[19,3,9]),
    [iquote('hyper,19,3,9')] ).

cnf(48,plain,
    succeeds(p3,p3),
    inference(hyper,[status(thm)],[42,2,36]),
    [iquote('hyper,42,2,36')] ).

cnf(49,plain,
    $false,
    inference(binary,[status(thm)],[48,5]),
    [iquote('binary,48.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 06:31:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.81/2.02  ----- Otter 3.3f, August 2004 -----
% 1.81/2.02  The process was started by sandbox on n011.cluster.edu,
% 1.81/2.02  Wed Jul 27 06:31:55 2022
% 1.81/2.02  The command was "./otter".  The process ID is 23948.
% 1.81/2.02  
% 1.81/2.02  set(prolog_style_variables).
% 1.81/2.02  set(auto).
% 1.81/2.02     dependent: set(auto1).
% 1.81/2.02     dependent: set(process_input).
% 1.81/2.02     dependent: clear(print_kept).
% 1.81/2.02     dependent: clear(print_new_demod).
% 1.81/2.02     dependent: clear(print_back_demod).
% 1.81/2.02     dependent: clear(print_back_sub).
% 1.81/2.02     dependent: set(control_memory).
% 1.81/2.02     dependent: assign(max_mem, 12000).
% 1.81/2.02     dependent: assign(pick_given_ratio, 4).
% 1.81/2.02     dependent: assign(stats_level, 1).
% 1.81/2.02     dependent: assign(max_seconds, 10800).
% 1.81/2.02  clear(print_given).
% 1.81/2.02  
% 1.81/2.02  list(usable).
% 1.81/2.02  0 [] succeeds(Goal_state,Start_state)| -follows(Goal_state,Start_state).
% 1.81/2.02  0 [] succeeds(Goal_state,Start_state)| -succeeds(Goal_state,Intermediate_state)| -succeeds(Intermediate_state,Start_state).
% 1.81/2.02  0 [] succeeds(Goal_state,Start_state)| -has(Start_state,goto(Label))| -labels(Label,Goal_state).
% 1.81/2.02  0 [] succeeds(Goal_state,Start_state)| -has(Start_state,ifthen(Condition,Goal_state)).
% 1.81/2.02  0 [] has(p1,assign(register_j,n0)).
% 1.81/2.02  0 [] follows(p2,p1).
% 1.81/2.02  0 [] has(p2,assign(register_k,n1)).
% 1.81/2.02  0 [] labels(loop,p3).
% 1.81/2.02  0 [] follows(p3,p2).
% 1.81/2.02  0 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.81/2.02  0 [] has(p4,goto(out)).
% 1.81/2.02  0 [] follows(p5,p4).
% 1.81/2.02  0 [] follows(p6,p3).
% 1.81/2.02  0 [] has(p6,assign(register_k,times(n2,register_k))).
% 1.81/2.02  0 [] follows(p7,p6).
% 1.81/2.02  0 [] has(p7,assign(register_j,plus(register_j,n1))).
% 1.81/2.02  0 [] follows(p8,p7).
% 1.81/2.02  0 [] has(p8,goto(loop)).
% 1.81/2.02  0 [] -succeeds(p3,p3).
% 1.81/2.02  end_of_list.
% 1.81/2.02  
% 1.81/2.02  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.81/2.02  
% 1.81/2.02  This is a Horn set without equality.  The strategy will
% 1.81/2.02  be hyperresolution, with satellites in sos and nuclei
% 1.81/2.02  in usable.
% 1.81/2.02  
% 1.81/2.02     dependent: set(hyper_res).
% 1.81/2.02     dependent: clear(order_hyper).
% 1.81/2.02  
% 1.81/2.02  ------------> process usable:
% 1.81/2.02  ** KEPT (pick-wt=6): 1 [] succeeds(A,B)| -follows(A,B).
% 1.81/2.02  ** KEPT (pick-wt=9): 2 [] succeeds(A,B)| -succeeds(A,C)| -succeeds(C,B).
% 1.81/2.02  ** KEPT (pick-wt=10): 3 [] succeeds(A,B)| -has(B,goto(C))| -labels(C,A).
% 1.81/2.02  ** KEPT (pick-wt=8): 4 [] succeeds(A,B)| -has(B,ifthen(C,A)).
% 1.81/2.02  ** KEPT (pick-wt=3): 5 [] -succeeds(p3,p3).
% 1.81/2.02  
% 1.81/2.02  ------------> process sos:
% 1.81/2.02  ** KEPT (pick-wt=5): 6 [] has(p1,assign(register_j,n0)).
% 1.81/2.02  ** KEPT (pick-wt=3): 7 [] follows(p2,p1).
% 1.81/2.02  ** KEPT (pick-wt=5): 8 [] has(p2,assign(register_k,n1)).
% 1.81/2.02  ** KEPT (pick-wt=3): 9 [] labels(loop,p3).
% 1.81/2.02  ** KEPT (pick-wt=3): 10 [] follows(p3,p2).
% 1.81/2.02  ** KEPT (pick-wt=7): 11 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.81/2.02  ** KEPT (pick-wt=4): 12 [] has(p4,goto(out)).
% 1.81/2.02  ** KEPT (pick-wt=3): 13 [] follows(p5,p4).
% 1.81/2.02  ** KEPT (pick-wt=3): 14 [] follows(p6,p3).
% 1.81/2.02  ** KEPT (pick-wt=7): 15 [] has(p6,assign(register_k,times(n2,register_k))).
% 1.81/2.02  ** KEPT (pick-wt=3): 16 [] follows(p7,p6).
% 1.81/2.02  ** KEPT (pick-wt=7): 17 [] has(p7,assign(register_j,plus(register_j,n1))).
% 1.81/2.02  ** KEPT (pick-wt=3): 18 [] follows(p8,p7).
% 1.81/2.02  ** KEPT (pick-wt=4): 19 [] has(p8,goto(loop)).
% 1.81/2.02  
% 1.81/2.02  ======= end of input processing =======
% 1.81/2.02  
% 1.81/2.02  =========== start of search ===========
% 1.81/2.02  
% 1.81/2.02  -------- PROOF -------- 
% 1.81/2.02  
% 1.81/2.02  ----> UNIT CONFLICT at   0.00 sec ----> 49 [binary,48.1,5.1] $F.
% 1.81/2.02  
% 1.81/2.02  Length of proof is 7.  Level of proof is 4.
% 1.81/2.02  
% 1.81/2.02  ---------------- PROOF ----------------
% 1.81/2.02  % SZS status Unsatisfiable
% 1.81/2.02  % SZS output start Refutation
% See solution above
% 1.81/2.02  ------------ end of proof -------------
% 1.81/2.02  
% 1.81/2.02  
% 1.81/2.02  Search stopped by max_proofs option.
% 1.81/2.02  
% 1.81/2.02  
% 1.81/2.02  Search stopped by max_proofs option.
% 1.81/2.02  
% 1.81/2.02  ============ end of search ============
% 1.81/2.02  
% 1.81/2.02  -------------- statistics -------------
% 1.81/2.02  clauses given                 37
% 1.81/2.02  clauses generated             45
% 1.81/2.02  clauses kept                  48
% 1.81/2.02  clauses forward subsumed      16
% 1.81/2.02  clauses back subsumed          0
% 1.81/2.02  Kbytes malloced              976
% 1.81/2.02  
% 1.81/2.02  ----------- times (seconds) -----------
% 1.81/2.02  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.81/2.02  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.81/2.02  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.81/2.02  
% 1.81/2.02  That finishes the proof of the theorem.
% 1.81/2.02  
% 1.81/2.02  Process 23948 finished Wed Jul 27 06:31:57 2022
% 1.81/2.02  Otter interrupted
% 1.81/2.02  PROOF FOUND
%------------------------------------------------------------------------------