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

View Problem - Process Solution

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

% Computer : n019.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:14:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ subset(singleton(dollar_c2),dollar_c1)
    | ~ in(dollar_c2,dollar_c1) ),
    file('SEU158+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ subset(singleton(A),B)
    | in(A,B) ),
    file('SEU158+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( subset(singleton(A),B)
    | ~ in(A,B) ),
    file('SEU158+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( subset(singleton(dollar_c2),dollar_c1)
    | in(dollar_c2,dollar_c1) ),
    file('SEU158+1.p',unknown),
    [] ).

cnf(9,plain,
    in(dollar_c2,dollar_c1),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[7,3])]),
    [iquote('hyper,7,3,factor_simp')] ).

cnf(10,plain,
    subset(singleton(dollar_c2),dollar_c1),
    inference(hyper,[status(thm)],[9,4]),
    [iquote('hyper,9,4')] ).

cnf(11,plain,
    $false,
    inference(hyper,[status(thm)],[10,2,9]),
    [iquote('hyper,10,2,9')] ).

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