TSTP Solution File: SET062+3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET062+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

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

% Result   : Theorem 1.34s 1.88s
% Output   : Refutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   4 unt;   1 nHn;   4 RR)
%            Number of literals    :    6 (   0 equ;   2 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-2 aty)
%            Number of variables   :    3 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ member(A,empty_set),
    file('SET062+3.p',unknown),
    [] ).

cnf(5,axiom,
    ~ subset(empty_set,dollar_c1),
    file('SET062+3.p',unknown),
    [] ).

cnf(6,axiom,
    ( subset(A,B)
    | member(dollar_f1(A,B),A) ),
    file('SET062+3.p',unknown),
    [] ).

cnf(9,plain,
    member(dollar_f1(empty_set,dollar_c1),empty_set),
    inference(hyper,[status(thm)],[6,5]),
    [iquote('hyper,6,5')] ).

cnf(10,plain,
    $false,
    inference(binary,[status(thm)],[9,1]),
    [iquote('binary,9.1,1.1')] ).

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