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

View Problem - Process Solution

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

% Computer : n029.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:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_p(A)
    | big_q(dollar_c1) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( big_p(dollar_c2)
    | ~ big_q(A) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_p(A)
    | ~ big_q(B)
    | ~ big_r(A)
    | big_s(B) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big_p(A)
    | ~ big_q(B)
    | big_r(A)
    | ~ big_s(B) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_p(A)
    | big_r(A)
    | ~ big_q(B)
    | big_s(B) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( big_p(dollar_c3)
    | ~ big_s(dollar_c4) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ big_r(dollar_c3)
    | big_q(dollar_c4) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ big_r(dollar_c3)
    | ~ big_s(dollar_c4) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( big_p(dollar_c3)
    | big_q(dollar_c4) ),
    file('SYN056+1.p',unknown),
    [] ).

cnf(10,plain,
    ( big_p(dollar_c3)
    | big_p(dollar_c2) ),
    inference(hyper,[status(thm)],[9,2]),
    [iquote('hyper,9,2')] ).

cnf(11,plain,
    ( big_p(dollar_c2)
    | big_q(dollar_c1) ),
    inference(hyper,[status(thm)],[10,1]),
    [iquote('hyper,10,1')] ).

cnf(15,plain,
    big_p(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[11,2])]),
    [iquote('hyper,11,2,factor_simp')] ).

cnf(16,plain,
    big_q(dollar_c1),
    inference(hyper,[status(thm)],[15,1]),
    [iquote('hyper,15,1')] ).

cnf(17,plain,
    ( big_r(dollar_c2)
    | big_s(dollar_c1) ),
    inference(hyper,[status(thm)],[16,5,15]),
    [iquote('hyper,16,5,15')] ).

cnf(19,plain,
    big_r(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,4,15,16])]),
    [iquote('hyper,17,4,15,16,factor_simp')] ).

cnf(20,plain,
    big_s(dollar_c1),
    inference(hyper,[status(thm)],[19,3,15,16]),
    [iquote('hyper,19,3,15,16')] ).

cnf(21,plain,
    ( big_s(dollar_c4)
    | big_p(dollar_c3) ),
    inference(hyper,[status(thm)],[19,3,15,9]),
    [iquote('hyper,19,3,15,9')] ).

cnf(22,plain,
    big_p(dollar_c3),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,6])]),
    [iquote('hyper,21,6,factor_simp')] ).

cnf(23,plain,
    big_r(dollar_c3),
    inference(hyper,[status(thm)],[22,4,16,20]),
    [iquote('hyper,22,4,16,20')] ).

cnf(24,plain,
    big_q(dollar_c4),
    inference(hyper,[status(thm)],[23,7]),
    [iquote('hyper,23,7')] ).

cnf(25,plain,
    big_s(dollar_c4),
    inference(hyper,[status(thm)],[24,3,22,23]),
    [iquote('hyper,24,3,22,23')] ).

cnf(26,plain,
    $false,
    inference(hyper,[status(thm)],[25,8,23]),
    [iquote('hyper,25,8,23')] ).

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