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

View Problem - Process Solution

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

% Computer : n011.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:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ~ p(A,B),
    file('SYN732+1.p',unknown),
    [] ).

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

cnf(5,plain,
    $false,
    inference(binary,[status(thm)],[4,2]),
    [iquote('binary,4.1,2.1')] ).

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