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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_p(A)
    | ~ big_q(B)
    | big_r(dollar_f1(A,B)) ),
    file('SYN050+1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ big_r(A),
    file('SYN050+1.p',unknown),
    [] ).

cnf(4,axiom,
    big_p(A),
    file('SYN050+1.p',unknown),
    [] ).

cnf(5,axiom,
    big_q(A),
    file('SYN050+1.p',unknown),
    [] ).

cnf(7,plain,
    big_r(dollar_f1(A,B)),
    inference(hyper,[status(thm)],[5,1,4]),
    [iquote('hyper,5,1,4')] ).

cnf(8,plain,
    $false,
    inference(binary,[status(thm)],[7,3]),
    [iquote('binary,7.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN050+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Jul 27 11:31:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.96/2.14  ----- Otter 3.3f, August 2004 -----
% 1.96/2.14  The process was started by sandbox on n026.cluster.edu,
% 1.96/2.14  Wed Jul 27 11:31:39 2022
% 1.96/2.14  The command was "./otter".  The process ID is 12137.
% 1.96/2.14  
% 1.96/2.14  set(prolog_style_variables).
% 1.96/2.14  set(auto).
% 1.96/2.14     dependent: set(auto1).
% 1.96/2.14     dependent: set(process_input).
% 1.96/2.14     dependent: clear(print_kept).
% 1.96/2.14     dependent: clear(print_new_demod).
% 1.96/2.14     dependent: clear(print_back_demod).
% 1.96/2.14     dependent: clear(print_back_sub).
% 1.96/2.14     dependent: set(control_memory).
% 1.96/2.14     dependent: assign(max_mem, 12000).
% 1.96/2.14     dependent: assign(pick_given_ratio, 4).
% 1.96/2.14     dependent: assign(stats_level, 1).
% 1.96/2.14     dependent: assign(max_seconds, 10800).
% 1.96/2.14  clear(print_given).
% 1.96/2.14  
% 1.96/2.14  formula_list(usable).
% 1.96/2.14  -((all X Y exists Z all W (big_p(X)&big_q(Y)->big_r(Z)&big_s(W)))-> (exists X1 Y1 (big_p(X1)&big_q(Y1)-> (exists Z1 big_r(Z1))))).
% 1.96/2.14  end_of_list.
% 1.96/2.14  
% 1.96/2.14  -------> usable clausifies to:
% 1.96/2.14  
% 1.96/2.14  list(usable).
% 1.96/2.14  0 [] -big_p(X)| -big_q(Y)|big_r($f1(X,Y)).
% 1.96/2.14  0 [] -big_p(X)| -big_q(Y)|big_s(W).
% 1.96/2.14  0 [] big_p(X1).
% 1.96/2.14  0 [] big_q(Y1).
% 1.96/2.14  0 [] -big_r(Z1).
% 1.96/2.14  end_of_list.
% 1.96/2.14  
% 1.96/2.14  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.96/2.14  
% 1.96/2.14  This is a Horn set without equality.  The strategy will
% 1.96/2.14  be hyperresolution, with satellites in sos and nuclei
% 1.96/2.14  in usable.
% 1.96/2.14  
% 1.96/2.14     dependent: set(hyper_res).
% 1.96/2.14     dependent: clear(order_hyper).
% 1.96/2.14  
% 1.96/2.14  ------------> process usable:
% 1.96/2.14  ** KEPT (pick-wt=8): 1 [] -big_p(A)| -big_q(B)|big_r($f1(A,B)).
% 1.96/2.14  ** KEPT (pick-wt=6): 2 [] -big_p(A)| -big_q(B)|big_s(C).
% 1.96/2.14  ** KEPT (pick-wt=2): 3 [] -big_r(A).
% 1.96/2.14  
% 1.96/2.14  ------------> process sos:
% 1.96/2.14  ** KEPT (pick-wt=2): 4 [] big_p(A).
% 1.96/2.14  ** KEPT (pick-wt=2): 5 [] big_q(A).
% 1.96/2.14  
% 1.96/2.14  ======= end of input processing =======
% 1.96/2.14  
% 1.96/2.14  =========== start of search ===========
% 1.96/2.14  
% 1.96/2.14  -------- PROOF -------- 
% 1.96/2.14  
% 1.96/2.14  ----> UNIT CONFLICT at   0.00 sec ----> 8 [binary,7.1,3.1] $F.
% 1.96/2.14  
% 1.96/2.14  Length of proof is 1.  Level of proof is 1.
% 1.96/2.14  
% 1.96/2.14  ---------------- PROOF ----------------
% 1.96/2.14  % SZS status Theorem
% 1.96/2.14  % SZS output start Refutation
% See solution above
% 1.96/2.14  ------------ end of proof -------------
% 1.96/2.14  
% 1.96/2.14  
% 1.96/2.14  Search stopped by max_proofs option.
% 1.96/2.14  
% 1.96/2.14  
% 1.96/2.14  Search stopped by max_proofs option.
% 1.96/2.14  
% 1.96/2.14  ============ end of search ============
% 1.96/2.14  
% 1.96/2.14  -------------- statistics -------------
% 1.96/2.14  clauses given                  2
% 1.96/2.14  clauses generated              2
% 1.96/2.14  clauses kept                   7
% 1.96/2.14  clauses forward subsumed       0
% 1.96/2.14  clauses back subsumed          0
% 1.96/2.14  Kbytes malloced              976
% 1.96/2.14  
% 1.96/2.14  ----------- times (seconds) -----------
% 1.96/2.14  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.14  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.14  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.96/2.14  
% 1.96/2.14  That finishes the proof of the theorem.
% 1.96/2.14  
% 1.96/2.14  Process 12137 finished Wed Jul 27 11:31:41 2022
% 1.96/2.14  Otter interrupted
% 1.96/2.14  PROOF FOUND
%------------------------------------------------------------------------------