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

View Problem - Process Solution

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

% Computer : n004.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:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ q(A)
    | p(A) ),
    file('SYN967+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p(dollar_c2)
    | ~ p(dollar_c1) ),
    file('SYN967+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( p(A)
    | q(A) ),
    file('SYN967+1.p',unknown),
    [] ).

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

cnf(7,plain,
    $false,
    inference(hyper,[status(thm)],[6,4,6]),
    [iquote('hyper,6,4,6')] ).

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