TSTP Solution File: SYN084-2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n023.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:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( big_p(f(f(A)))
    | big_p(A)
    | ~ big_p(a) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( big_p(f(f(A)))
    | ~ big_p(f(A))
    | ~ big_p(a) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(f(f(sk2))) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(4,axiom,
    ( big_p(f(sk1))
    | big_p(f(sk2))
    | ~ big_p(sk1)
    | ~ big_p(sk2) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(5,axiom,
    ( big_p(f(sk1))
    | ~ big_p(sk1)
    | ~ big_p(f(f(sk2))) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(6,axiom,
    ( big_p(f(sk2))
    | ~ big_p(sk2)
    | ~ big_p(f(f(sk1))) ),
    file('SYN084-2.p',unknown),
    [] ).

cnf(7,axiom,
    big_p(a),
    file('SYN084-2.p',unknown),
    [] ).

cnf(8,plain,
    ( big_p(f(f(A)))
    | big_p(A) ),
    inference(hyper,[status(thm)],[7,1]),
    [iquote('hyper,7,1')] ).

cnf(12,plain,
    ( big_p(sk2)
    | big_p(sk1) ),
    inference(hyper,[status(thm)],[8,3,8]),
    [iquote('hyper,8,3,8')] ).

cnf(23,plain,
    ( big_p(sk1)
    | big_p(f(sk2)) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[12,6,8])]),
    [iquote('hyper,12,6,8,factor_simp')] ).

cnf(25,plain,
    ( big_p(sk2)
    | big_p(f(sk1)) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[12,5,8])]),
    [iquote('hyper,12,5,8,factor_simp')] ).

cnf(28,plain,
    ( big_p(sk1)
    | big_p(f(f(sk2))) ),
    inference(hyper,[status(thm)],[23,2,7]),
    [iquote('hyper,23,2,7')] ).

cnf(29,plain,
    ( big_p(f(sk1))
    | big_p(f(sk2)) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[25,4,23])])]),
    [iquote('hyper,25,4,23,factor_simp,factor_simp')] ).

cnf(31,plain,
    ( big_p(sk2)
    | big_p(f(f(sk1))) ),
    inference(hyper,[status(thm)],[25,2,7]),
    [iquote('hyper,25,2,7')] ).

cnf(36,plain,
    big_p(sk1),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[28,3,8])]),
    [iquote('hyper,28,3,8,factor_simp')] ).

cnf(39,plain,
    ( big_p(f(sk2))
    | big_p(f(f(sk1))) ),
    inference(hyper,[status(thm)],[29,2,7]),
    [iquote('hyper,29,2,7')] ).

cnf(43,plain,
    big_p(sk2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[31,3,8])]),
    [iquote('hyper,31,3,8,factor_simp')] ).

cnf(56,plain,
    big_p(f(sk2)),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[39,6,43])]),
    [iquote('hyper,39,6,43,factor_simp')] ).

cnf(59,plain,
    big_p(f(f(sk2))),
    inference(hyper,[status(thm)],[56,2,7]),
    [iquote('hyper,56,2,7')] ).

cnf(60,plain,
    big_p(f(sk1)),
    inference(hyper,[status(thm)],[59,5,36]),
    [iquote('hyper,59,5,36')] ).

cnf(71,plain,
    big_p(f(f(sk1))),
    inference(hyper,[status(thm)],[60,2,7]),
    [iquote('hyper,60,2,7')] ).

cnf(72,plain,
    $false,
    inference(hyper,[status(thm)],[71,3,59]),
    [iquote('hyper,71,3,59')] ).

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