TSTP Solution File: SYN313-1.001.002 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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:24:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ p(A,f0(A),B)
    | ~ p(A,f1(B),C) ),
    file('SYN313-1.001.002.p',unknown),
    [] ).

cnf(2,axiom,
    ( p(h0,A,j0(B))
    | p(h1(A),C,j1(B))
    | p(h2(C),B,j2(B)) ),
    file('SYN313-1.001.002.p',unknown),
    [] ).

cnf(3,plain,
    ( p(h1(f1(j0(A))),B,j1(C))
    | p(h2(B),C,j2(C))
    | p(h1(f0(h0)),D,j1(A))
    | p(h2(D),A,j2(A)) ),
    inference(hyper,[status(thm)],[2,1,2]),
    [iquote('hyper,2,1,2')] ).

cnf(72,plain,
    ( p(h2(f1(j1(A))),B,j2(B))
    | p(h1(f0(h0)),C,j1(D))
    | p(h2(C),D,j2(D))
    | p(h2(f0(h1(f1(j0(D))))),A,j2(A)) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3,1,3])])]),
    [iquote('hyper,3,1,3,factor_simp,factor_simp')] ).

cnf(373,plain,
    ( p(h1(f0(h0)),A,j1(B))
    | p(h2(A),B,j2(B))
    | p(h2(f0(h1(f1(j0(B))))),C,j2(C)) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[72,1,72])])])]),
    [iquote('hyper,72,1,72,factor_simp,factor_simp,factor_simp')] ).

cnf(585,plain,
    ( p(h1(f0(h0)),A,j1(B))
    | p(h2(A),B,j2(B)) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[373,1,373])])]),
    [iquote('hyper,373,1,373,factor_simp,factor_simp')] ).

cnf(595,plain,
    ( p(h2(f1(j1(A))),B,j2(B))
    | p(h2(f0(h1(f0(h0)))),A,j2(A)) ),
    inference(hyper,[status(thm)],[585,1,585]),
    [iquote('hyper,585,1,585')] ).

cnf(623,plain,
    p(h2(f0(h1(f0(h0)))),A,j2(A)),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[595,1,595])]),
    [iquote('hyper,595,1,595,factor_simp')] ).

cnf(629,plain,
    $false,
    inference(hyper,[status(thm)],[623,1,623]),
    [iquote('hyper,623,1,623')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n007.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 11:06:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.86/2.09  ----- Otter 3.3f, August 2004 -----
% 1.86/2.09  The process was started by sandbox on n007.cluster.edu,
% 1.86/2.09  Wed Jul 27 11:06:46 2022
% 1.86/2.09  The command was "./otter".  The process ID is 28250.
% 1.86/2.09  
% 1.86/2.09  set(prolog_style_variables).
% 1.86/2.09  set(auto).
% 1.86/2.09     dependent: set(auto1).
% 1.86/2.09     dependent: set(process_input).
% 1.86/2.09     dependent: clear(print_kept).
% 1.86/2.09     dependent: clear(print_new_demod).
% 1.86/2.09     dependent: clear(print_back_demod).
% 1.86/2.09     dependent: clear(print_back_sub).
% 1.86/2.09     dependent: set(control_memory).
% 1.86/2.09     dependent: assign(max_mem, 12000).
% 1.86/2.09     dependent: assign(pick_given_ratio, 4).
% 1.86/2.09     dependent: assign(stats_level, 1).
% 1.86/2.09     dependent: assign(max_seconds, 10800).
% 1.86/2.09  clear(print_given).
% 1.86/2.09  
% 1.86/2.09  list(usable).
% 1.86/2.09  0 [] -p(X0,f0(X0),X1)| -p(X0,f1(X1),X2).
% 1.86/2.09  0 [] p(h0,Y0,j0(Y2))|p(h1(Y0),Y1,j1(Y2))|p(h2(Y1),Y2,j2(Y2)).
% 1.86/2.09  end_of_list.
% 1.86/2.09  
% 1.86/2.09  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.86/2.09  
% 1.86/2.09  This is a non-Horn set without equality.  The strategy will
% 1.86/2.09  be ordered hyper_res, unit deletion, and factoring, with
% 1.86/2.09  satellites in sos and with nuclei in usable.
% 1.86/2.09  
% 1.86/2.09     dependent: set(hyper_res).
% 1.86/2.09     dependent: set(factor).
% 1.86/2.09     dependent: set(unit_deletion).
% 1.86/2.09  
% 1.86/2.09  ------------> process usable:
% 1.86/2.09  ** KEPT (pick-wt=10): 1 [] -p(A,f0(A),B)| -p(A,f1(B),C).
% 1.86/2.09  
% 1.86/2.09  ------------> process sos:
% 1.86/2.09  ** KEPT (pick-wt=17): 2 [] p(h0,A,j0(B))|p(h1(A),C,j1(B))|p(h2(C),B,j2(B)).
% 1.86/2.09  
% 1.86/2.09  ======= end of input processing =======
% 1.86/2.09  
% 1.86/2.09  =========== start of search ===========
% 1.86/2.09  
% 1.86/2.09  -------- PROOF -------- 
% 1.86/2.09  
% 1.86/2.09  -----> EMPTY CLAUSE at   0.18 sec ----> 629 [hyper,623,1,623] $F.
% 1.86/2.09  
% 1.86/2.09  Length of proof is 6.  Level of proof is 6.
% 1.86/2.09  
% 1.86/2.09  ---------------- PROOF ----------------
% 1.86/2.09  % SZS status Unsatisfiable
% 1.86/2.09  % SZS output start Refutation
% See solution above
% 1.86/2.09  ------------ end of proof -------------
% 1.86/2.09  
% 1.86/2.09  
% 1.86/2.09  Search stopped by max_proofs option.
% 1.86/2.09  
% 1.86/2.09  
% 1.86/2.09  Search stopped by max_proofs option.
% 1.86/2.09  
% 1.86/2.09  ============ end of search ============
% 1.86/2.09  
% 1.86/2.09  -------------- statistics -------------
% 1.86/2.09  clauses given                 20
% 1.86/2.09  clauses generated           1095
% 1.86/2.09  clauses kept                 628
% 1.86/2.09  clauses forward subsumed     468
% 1.86/2.09  clauses back subsumed        551
% 1.86/2.09  Kbytes malloced             1953
% 1.86/2.09  
% 1.86/2.09  ----------- times (seconds) -----------
% 1.86/2.09  user CPU time          0.18          (0 hr, 0 min, 0 sec)
% 1.86/2.09  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.86/2.09  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.86/2.09  
% 1.86/2.09  That finishes the proof of the theorem.
% 1.86/2.09  
% 1.86/2.09  Process 28250 finished Wed Jul 27 11:06:48 2022
% 1.86/2.09  Otter interrupted
% 1.86/2.09  PROOF FOUND
%------------------------------------------------------------------------------