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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN728-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n015.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:25:12 EDT 2022

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

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

cnf(2,axiom,
    ( ~ m(g(A))
    | ~ q(A) ),
    file('SYN728-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p(sk2,sk2)
    | ~ p(g(sk2),A) ),
    file('SYN728-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( m(A)
    | p(A,sk1(A)) ),
    file('SYN728-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( q(f(A,sk1(A)))
    | p(A,sk1(A)) ),
    file('SYN728-1.p',unknown),
    [] ).

cnf(6,plain,
    ( p(A,sk1(A))
    | p(g(f(A,sk1(A))),sk1(g(f(A,sk1(A))))) ),
    inference(hyper,[status(thm)],[5,2,4]),
    [iquote('hyper,5,2,4')] ).

cnf(8,plain,
    ( p(A,sk1(A))
    | p(B,B) ),
    inference(hyper,[status(thm)],[6,1]),
    [iquote('hyper,6,1')] ).

cnf(9,plain,
    p(A,A),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[8,1])]),
    [iquote('hyper,8,1,factor_simp')] ).

cnf(11,plain,
    $false,
    inference(hyper,[status(thm)],[9,3,9]),
    [iquote('hyper,9,3,9')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN728-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n015.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:31:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.94/2.13  ----- Otter 3.3f, August 2004 -----
% 1.94/2.13  The process was started by sandbox2 on n015.cluster.edu,
% 1.94/2.13  Wed Jul 27 11:31:57 2022
% 1.94/2.13  The command was "./otter".  The process ID is 1852.
% 1.94/2.13  
% 1.94/2.13  set(prolog_style_variables).
% 1.94/2.13  set(auto).
% 1.94/2.13     dependent: set(auto1).
% 1.94/2.13     dependent: set(process_input).
% 1.94/2.13     dependent: clear(print_kept).
% 1.94/2.13     dependent: clear(print_new_demod).
% 1.94/2.13     dependent: clear(print_back_demod).
% 1.94/2.13     dependent: clear(print_back_sub).
% 1.94/2.13     dependent: set(control_memory).
% 1.94/2.13     dependent: assign(max_mem, 12000).
% 1.94/2.13     dependent: assign(pick_given_ratio, 4).
% 1.94/2.13     dependent: assign(stats_level, 1).
% 1.94/2.13     dependent: assign(max_seconds, 10800).
% 1.94/2.13  clear(print_given).
% 1.94/2.13  
% 1.94/2.13  list(usable).
% 1.94/2.13  0 [] p(C,C)| -p(A,B).
% 1.94/2.13  0 [] m(A)|p(A,sk1(A)).
% 1.94/2.13  0 [] q(f(A,sk1(A)))|p(A,sk1(A)).
% 1.94/2.13  0 [] -m(g(A))| -q(A).
% 1.94/2.13  0 [] -p(sk2,sk2)| -p(g(sk2),A).
% 1.94/2.13  end_of_list.
% 1.94/2.13  
% 1.94/2.13  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.94/2.13  
% 1.94/2.13  This is a non-Horn set without equality.  The strategy will
% 1.94/2.13  be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.13  satellites in sos and with nuclei in usable.
% 1.94/2.13  
% 1.94/2.13     dependent: set(hyper_res).
% 1.94/2.13     dependent: set(factor).
% 1.94/2.13     dependent: set(unit_deletion).
% 1.94/2.13  
% 1.94/2.13  ------------> process usable:
% 1.94/2.13  ** KEPT (pick-wt=6): 1 [] p(A,A)| -p(B,C).
% 1.94/2.13  ** KEPT (pick-wt=5): 2 [] -m(g(A))| -q(A).
% 1.94/2.13  ** KEPT (pick-wt=7): 3 [] -p(sk2,sk2)| -p(g(sk2),A).
% 1.94/2.13  
% 1.94/2.13  ------------> process sos:
% 1.94/2.13  ** KEPT (pick-wt=6): 4 [] m(A)|p(A,sk1(A)).
% 1.94/2.13  ** KEPT (pick-wt=9): 5 [] q(f(A,sk1(A)))|p(A,sk1(A)).
% 1.94/2.13  
% 1.94/2.13  ======= end of input processing =======
% 1.94/2.13  
% 1.94/2.13  =========== start of search ===========
% 1.94/2.13  
% 1.94/2.13  -------- PROOF -------- 
% 1.94/2.13  
% 1.94/2.13  -----> EMPTY CLAUSE at   0.00 sec ----> 11 [hyper,9,3,9] $F.
% 1.94/2.13  
% 1.94/2.13  Length of proof is 3.  Level of proof is 3.
% 1.94/2.13  
% 1.94/2.13  ---------------- PROOF ----------------
% 1.94/2.13  % SZS status Unsatisfiable
% 1.94/2.13  % SZS output start Refutation
% See solution above
% 1.94/2.13  ------------ end of proof -------------
% 1.94/2.13  
% 1.94/2.13  
% 1.94/2.13  Search stopped by max_proofs option.
% 1.94/2.13  
% 1.94/2.13  
% 1.94/2.13  Search stopped by max_proofs option.
% 1.94/2.13  
% 1.94/2.13  ============ end of search ============
% 1.94/2.13  
% 1.94/2.13  -------------- statistics -------------
% 1.94/2.13  clauses given                  5
% 1.94/2.13  clauses generated             11
% 1.94/2.13  clauses kept                  10
% 1.94/2.13  clauses forward subsumed       5
% 1.94/2.13  clauses back subsumed          6
% 1.94/2.13  Kbytes malloced              976
% 1.94/2.13  
% 1.94/2.13  ----------- times (seconds) -----------
% 1.94/2.13  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.94/2.13  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.94/2.13  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.94/2.13  
% 1.94/2.13  That finishes the proof of the theorem.
% 1.94/2.13  
% 1.94/2.13  Process 1852 finished Wed Jul 27 11:31:59 2022
% 1.94/2.13  Otter interrupted
% 1.94/2.13  PROOF FOUND
%------------------------------------------------------------------------------