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

View Problem - Process Solution

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

% Computer : n021.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:12:54 EDT 2022

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

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

cnf(2,axiom,
    ( element(A,dollar_c1)
    | ~ element(A,A) ),
    file('SET044+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ element(A,dollar_f1(B))
    | ~ element(A,B) ),
    file('SET044+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( element(A,dollar_f1(B))
    | element(A,B) ),
    file('SET044+1.p',unknown),
    [] ).

cnf(6,plain,
    ( element(dollar_f1(A),A)
    | element(dollar_f1(A),dollar_c1) ),
    inference(hyper,[status(thm)],[4,2]),
    [iquote('hyper,4,2')] ).

cnf(8,plain,
    ( element(A,dollar_f1(dollar_c1))
    | element(A,A) ),
    inference(hyper,[status(thm)],[4,1]),
    [iquote('hyper,4,1')] ).

cnf(9,plain,
    element(dollar_f1(dollar_c1),dollar_c1),
    inference(factor,[status(thm)],[6]),
    [iquote('factor,6.1.2')] ).

cnf(10,plain,
    element(dollar_f1(dollar_c1),dollar_f1(dollar_c1)),
    inference(factor,[status(thm)],[8]),
    [iquote('factor,8.1.2')] ).

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

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