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

View Problem - Process Solution

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

% Computer : n008.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:15 EDT 2022

% Result   : Theorem 1.66s 1.87s
% Output   : Refutation 1.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   4 unt;   2 nHn;   7 RR)
%            Number of literals    :   15 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   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   :    6 (   0 sgn)

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

cnf(2,plain,
    ( ~ element(A,dollar_c1)
    | ~ element(dollar_c1,A) ),
    inference(factor,[status(thm)],[1]),
    [iquote('factor,1.1.2')] ).

cnf(3,plain,
    ~ element(dollar_c1,dollar_c1),
    inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[1])]),
    [iquote('factor,1.1.3,factor_simp')] ).

cnf(4,plain,
    ( ~ element(A,dollar_c1)
    | ~ element(A,A) ),
    inference(factor,[status(thm)],[1]),
    [iquote('factor,1.2.3')] ).

cnf(5,axiom,
    ( element(A,dollar_c1)
    | element(A,dollar_f1(A)) ),
    file('SET786+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( element(A,dollar_c1)
    | element(dollar_f1(A),A) ),
    file('SET786+1.p',unknown),
    [] ).

cnf(7,plain,
    element(dollar_c1,dollar_f1(dollar_c1)),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[5,4,5])]),
    [iquote('hyper,5,4,5,factor_simp')] ).

cnf(12,plain,
    element(dollar_c1,dollar_c1),
    inference(hyper,[status(thm)],[6,2,7]),
    [iquote('hyper,6,2,7')] ).

cnf(13,plain,
    $false,
    inference(binary,[status(thm)],[12,3]),
    [iquote('binary,12.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET786+1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 10:38:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.66/1.87  ----- Otter 3.3f, August 2004 -----
% 1.66/1.87  The process was started by sandbox2 on n008.cluster.edu,
% 1.66/1.87  Wed Jul 27 10:38:23 2022
% 1.66/1.87  The command was "./otter".  The process ID is 11827.
% 1.66/1.87  
% 1.66/1.87  set(prolog_style_variables).
% 1.66/1.87  set(auto).
% 1.66/1.87     dependent: set(auto1).
% 1.66/1.87     dependent: set(process_input).
% 1.66/1.87     dependent: clear(print_kept).
% 1.66/1.87     dependent: clear(print_new_demod).
% 1.66/1.87     dependent: clear(print_back_demod).
% 1.66/1.87     dependent: clear(print_back_sub).
% 1.66/1.87     dependent: set(control_memory).
% 1.66/1.87     dependent: assign(max_mem, 12000).
% 1.66/1.87     dependent: assign(pick_given_ratio, 4).
% 1.66/1.87     dependent: assign(stats_level, 1).
% 1.66/1.87     dependent: assign(max_seconds, 10800).
% 1.66/1.87  clear(print_given).
% 1.66/1.87  
% 1.66/1.87  formula_list(usable).
% 1.66/1.87  -(-(exists Y all X (element(X,Y)<-> -(exists Z (element(X,Z)&element(Z,X)))))).
% 1.66/1.87  end_of_list.
% 1.66/1.87  
% 1.66/1.87  -------> usable clausifies to:
% 1.66/1.87  
% 1.66/1.87  list(usable).
% 1.66/1.87  0 [] -element(X,$c1)| -element(X,Z)| -element(Z,X).
% 1.66/1.87  0 [] element(X,$c1)|element(X,$f1(X)).
% 1.66/1.87  0 [] element(X,$c1)|element($f1(X),X).
% 1.66/1.87  end_of_list.
% 1.66/1.87  
% 1.66/1.87  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.66/1.87  
% 1.66/1.87  This is a non-Horn set without equality.  The strategy will
% 1.66/1.87  be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.87  satellites in sos and with nuclei in usable.
% 1.66/1.87  
% 1.66/1.87     dependent: set(hyper_res).
% 1.66/1.87     dependent: set(factor).
% 1.66/1.87     dependent: set(unit_deletion).
% 1.66/1.87  
% 1.66/1.87  ------------> process usable:
% 1.66/1.87  ** KEPT (pick-wt=9): 1 [] -element(A,$c1)| -element(A,B)| -element(B,A).
% 1.66/1.87  
% 1.66/1.87  ------------> process sos:
% 1.66/1.87  ** KEPT (pick-wt=7): 5 [] element(A,$c1)|element(A,$f1(A)).
% 1.66/1.87  ** KEPT (pick-wt=7): 6 [] element(A,$c1)|element($f1(A),A).
% 1.66/1.87  
% 1.66/1.87  ======= end of input processing =======
% 1.66/1.87  
% 1.66/1.87  =========== start of search ===========
% 1.66/1.87  
% 1.66/1.87  -------- PROOF -------- 
% 1.66/1.87  
% 1.66/1.87  ----> UNIT CONFLICT at   0.00 sec ----> 13 [binary,12.1,3.1] $F.
% 1.66/1.87  
% 1.66/1.87  Length of proof is 5.  Level of proof is 3.
% 1.66/1.87  
% 1.66/1.87  ---------------- PROOF ----------------
% 1.66/1.87  % SZS status Theorem
% 1.66/1.87  % SZS output start Refutation
% See solution above
% 1.66/1.87  ------------ end of proof -------------
% 1.66/1.87  
% 1.66/1.87  
% 1.66/1.87  Search stopped by max_proofs option.
% 1.66/1.87  
% 1.66/1.87  
% 1.66/1.87  Search stopped by max_proofs option.
% 1.66/1.87  
% 1.66/1.87  ============ end of search ============
% 1.66/1.87  
% 1.66/1.87  -------------- statistics -------------
% 1.66/1.87  clauses given                  4
% 1.66/1.87  clauses generated             72
% 1.66/1.87  clauses kept                  12
% 1.66/1.87  clauses forward subsumed      63
% 1.66/1.87  clauses back subsumed          0
% 1.66/1.87  Kbytes malloced              976
% 1.66/1.87  
% 1.66/1.87  ----------- times (seconds) -----------
% 1.66/1.87  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.87  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.87  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.66/1.87  
% 1.66/1.87  That finishes the proof of the theorem.
% 1.66/1.87  
% 1.66/1.87  Process 11827 finished Wed Jul 27 10:38:25 2022
% 1.66/1.87  Otter interrupted
% 1.66/1.87  PROOF FOUND
%------------------------------------------------------------------------------