TSTP Solution File: SYN729+1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n017.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   : Theorem 1.56s 1.77s
% Output   : Refutation 1.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   6 unt;   0 nHn;  11 RR)
%            Number of literals    :   16 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ p(A)
    | l(A,g(h(dollar_f1(A)))) ),
    file('SYN729+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ p(A)
    | p(dollar_f1(A)) ),
    file('SYN729+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p(A)
    | p(g(A)) ),
    file('SYN729+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p(A)
    | p(h(A)) ),
    file('SYN729+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ l(dollar_c1,A)
    | ~ p(A) ),
    file('SYN729+1.p',unknown),
    [] ).

cnf(6,axiom,
    p(dollar_c1),
    file('SYN729+1.p',unknown),
    [] ).

cnf(9,plain,
    p(dollar_f1(dollar_c1)),
    inference(hyper,[status(thm)],[6,2]),
    [iquote('hyper,6,2')] ).

cnf(10,plain,
    l(dollar_c1,g(h(dollar_f1(dollar_c1)))),
    inference(hyper,[status(thm)],[6,1]),
    [iquote('hyper,6,1')] ).

cnf(19,plain,
    p(h(dollar_f1(dollar_c1))),
    inference(hyper,[status(thm)],[9,4]),
    [iquote('hyper,9,4')] ).

cnf(48,plain,
    p(g(h(dollar_f1(dollar_c1)))),
    inference(hyper,[status(thm)],[19,3]),
    [iquote('hyper,19,3')] ).

cnf(135,plain,
    $false,
    inference(hyper,[status(thm)],[48,5,10]),
    [iquote('hyper,48,5,10')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN729+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n017.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 10:23:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.56/1.77  ----- Otter 3.3f, August 2004 -----
% 1.56/1.77  The process was started by sandbox2 on n017.cluster.edu,
% 1.56/1.77  Wed Jul 27 10:23:18 2022
% 1.56/1.77  The command was "./otter".  The process ID is 2704.
% 1.56/1.77  
% 1.56/1.77  set(prolog_style_variables).
% 1.56/1.77  set(auto).
% 1.56/1.77     dependent: set(auto1).
% 1.56/1.77     dependent: set(process_input).
% 1.56/1.77     dependent: clear(print_kept).
% 1.56/1.77     dependent: clear(print_new_demod).
% 1.56/1.77     dependent: clear(print_back_demod).
% 1.56/1.77     dependent: clear(print_back_sub).
% 1.56/1.77     dependent: set(control_memory).
% 1.56/1.77     dependent: assign(max_mem, 12000).
% 1.56/1.77     dependent: assign(pick_given_ratio, 4).
% 1.56/1.77     dependent: assign(stats_level, 1).
% 1.56/1.77     dependent: assign(max_seconds, 10800).
% 1.56/1.77  clear(print_given).
% 1.56/1.77  
% 1.56/1.77  formula_list(usable).
% 1.56/1.77  -((all X exists Y (p(X)->l(X,g(h(Y)))&p(Y)))& (all W (p(W)->p(g(W))&p(h(W))))-> (all X (p(X)-> (exists Y (l(X,Y)&p(Y)))))).
% 1.56/1.77  end_of_list.
% 1.56/1.77  
% 1.56/1.77  -------> usable clausifies to:
% 1.56/1.77  
% 1.56/1.77  list(usable).
% 1.56/1.77  0 [] -p(X)|l(X,g(h($f1(X)))).
% 1.56/1.77  0 [] -p(X)|p($f1(X)).
% 1.56/1.77  0 [] -p(W)|p(g(W)).
% 1.56/1.77  0 [] -p(W)|p(h(W)).
% 1.56/1.77  0 [] p($c1).
% 1.56/1.77  0 [] -l($c1,Y)| -p(Y).
% 1.56/1.77  end_of_list.
% 1.56/1.77  
% 1.56/1.77  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.56/1.77  
% 1.56/1.77  This is a Horn set without equality.  The strategy will
% 1.56/1.77  be hyperresolution, with satellites in sos and nuclei
% 1.56/1.77  in usable.
% 1.56/1.77  
% 1.56/1.77     dependent: set(hyper_res).
% 1.56/1.77     dependent: clear(order_hyper).
% 1.56/1.77  
% 1.56/1.77  ------------> process usable:
% 1.56/1.77  ** KEPT (pick-wt=8): 1 [] -p(A)|l(A,g(h($f1(A)))).
% 1.56/1.77  ** KEPT (pick-wt=5): 2 [] -p(A)|p($f1(A)).
% 1.56/1.77  ** KEPT (pick-wt=5): 3 [] -p(A)|p(g(A)).
% 1.56/1.77  ** KEPT (pick-wt=5): 4 [] -p(A)|p(h(A)).
% 1.56/1.77  ** KEPT (pick-wt=5): 5 [] -l($c1,A)| -p(A).
% 1.56/1.77  
% 1.56/1.77  ------------> process sos:
% 1.56/1.77  ** KEPT (pick-wt=2): 6 [] p($c1).
% 1.56/1.77  
% 1.56/1.77  ======= end of input processing =======
% 1.56/1.77  
% 1.56/1.77  =========== start of search ===========
% 1.56/1.77  
% 1.56/1.77  -------- PROOF -------- 
% 1.56/1.77  
% 1.56/1.77  -----> EMPTY CLAUSE at   0.00 sec ----> 135 [hyper,48,5,10] $F.
% 1.56/1.77  
% 1.56/1.77  Length of proof is 4.  Level of proof is 3.
% 1.56/1.77  
% 1.56/1.77  ---------------- PROOF ----------------
% 1.56/1.77  % SZS status Theorem
% 1.56/1.77  % SZS output start Refutation
% See solution above
% 1.56/1.77  ------------ end of proof -------------
% 1.56/1.77  
% 1.56/1.77  
% 1.56/1.77  Search stopped by max_proofs option.
% 1.56/1.77  
% 1.56/1.77  
% 1.56/1.77  Search stopped by max_proofs option.
% 1.56/1.77  
% 1.56/1.77  ============ end of search ============
% 1.56/1.77  
% 1.56/1.77  -------------- statistics -------------
% 1.56/1.77  clauses given                 40
% 1.56/1.77  clauses generated            129
% 1.56/1.77  clauses kept                 134
% 1.56/1.77  clauses forward subsumed       0
% 1.56/1.77  clauses back subsumed          0
% 1.56/1.77  Kbytes malloced              976
% 1.56/1.77  
% 1.56/1.77  ----------- times (seconds) -----------
% 1.56/1.77  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.56/1.77  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.56/1.77  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.56/1.77  
% 1.56/1.77  That finishes the proof of the theorem.
% 1.56/1.77  
% 1.56/1.77  Process 2704 finished Wed Jul 27 10:23:19 2022
% 1.56/1.77  Otter interrupted
% 1.56/1.77  PROOF FOUND
%------------------------------------------------------------------------------