TSTP Solution File: SET844-2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.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:14:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ c_lesse_quals(A,c_Zorn_OTFin(B,C),tc_set(tc_set(tc_set(C))))
    | c_in(c_Union(A,tc_set(C)),c_Zorn_OTFin(B,C),tc_set(tc_set(C))) ),
    file('SET844-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | ~ c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | A != c_Zorn_Osucc(B,A,C)
    | c_lesse_quals(D,A,tc_set(tc_set(C))) ),
    file('SET844-2.p',unknown),
    [] ).

cnf(3,plain,
    ( ~ c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | ~ c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | c_Zorn_Osucc(B,A,C) != A
    | c_lesse_quals(D,A,tc_set(tc_set(C))) ),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2])]),
    [iquote('copy,2,flip.3')] ).

cnf(4,axiom,
    ~ c_lesse_quals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    file('SET844-2.p',unknown),
    [] ).

cnf(6,axiom,
    c_lesse_quals(A,A,tc_set(B)),
    file('SET844-2.p',unknown),
    [] ).

cnf(7,axiom,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('SET844-2.p',unknown),
    [] ).

cnf(8,axiom,
    v_m = c_Zorn_Osucc(v_S,v_m,t_a),
    file('SET844-2.p',unknown),
    [] ).

cnf(9,plain,
    c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
    [iquote('copy,8,flip.1')] ).

cnf(11,plain,
    c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))),
    inference(hyper,[status(thm)],[6,1]),
    [iquote('hyper,6,1')] ).

cnf(13,plain,
    c_lesse_quals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    inference(hyper,[status(thm)],[11,3,7,9]),
    [iquote('hyper,11,3,7,9')] ).

cnf(14,plain,
    $false,
    inference(binary,[status(thm)],[13,4]),
    [iquote('binary,13.1,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/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:44:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.68/1.88  ----- Otter 3.3f, August 2004 -----
% 1.68/1.88  The process was started by sandbox on n021.cluster.edu,
% 1.68/1.88  Wed Jul 27 10:44:23 2022
% 1.68/1.88  The command was "./otter".  The process ID is 11459.
% 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  list(usable).
% 1.68/1.88  0 [] A=A.
% 1.68/1.88  0 [] c_lesse_quals(V_A,V_A,tc_set(T_a)).
% 1.68/1.88  0 [] -c_lesse_quals(V_Y,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(tc_set(T_a))))|c_in(c_Union(V_Y,tc_set(T_a)),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a))).
% 1.68/1.88  0 [] -c_in(V_m,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))| -c_in(V_n,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))|V_m!=c_Zorn_Osucc(V_S,V_m,T_a)|c_lesse_quals(V_n,V_m,tc_set(tc_set(T_a))).
% 1.68/1.88  0 [] c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.88  0 [] v_m=c_Zorn_Osucc(v_S,v_m,t_a).
% 1.68/1.88  0 [] -c_lesse_quals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 1.68/1.88  end_of_list.
% 1.68/1.88  
% 1.68/1.88  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.68/1.88  
% 1.68/1.88  This is a Horn set with equality.  The strategy will be
% 1.68/1.88  Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.88  sos and nonpositive clauses in usable.
% 1.68/1.88  
% 1.68/1.88     dependent: set(knuth_bendix).
% 1.68/1.88     dependent: set(anl_eq).
% 1.68/1.88     dependent: set(para_from).
% 1.68/1.88     dependent: set(para_into).
% 1.68/1.88     dependent: clear(para_from_right).
% 1.68/1.88     dependent: clear(para_into_right).
% 1.68/1.88     dependent: set(para_from_vars).
% 1.68/1.88     dependent: set(eq_units_both_ways).
% 1.68/1.88     dependent: set(dynamic_demod_all).
% 1.68/1.88     dependent: set(dynamic_demod).
% 1.68/1.88     dependent: set(order_eq).
% 1.68/1.88     dependent: set(back_demod).
% 1.68/1.88     dependent: set(lrpo).
% 1.68/1.88     dependent: set(hyper_res).
% 1.68/1.88     dependent: clear(order_hyper).
% 1.68/1.88  
% 1.68/1.88  ------------> process usable:
% 1.68/1.88  ** KEPT (pick-wt=20): 1 [] -c_lesse_quals(A,c_Zorn_OTFin(B,C),tc_set(tc_set(tc_set(C))))|c_in(c_Union(A,tc_set(C)),c_Zorn_OTFin(B,C),tc_set(tc_set(C))).
% 1.68/1.88  ** KEPT (pick-wt=28): 3 [copy,2,flip.3] -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_Zorn_Osucc(B,A,C)!=A|c_lesse_quals(D,A,tc_set(tc_set(C))).
% 1.68/1.88  ** KEPT (pick-wt=11): 4 [] -c_lesse_quals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 1.68/1.88  
% 1.68/1.88  ------------> process sos:
% 1.68/1.88  ** KEPT (pick-wt=3): 5 [] A=A.
% 1.68/1.88  ** KEPT (pick-wt=5): 6 [] c_lesse_quals(A,A,tc_set(B)).
% 1.68/1.88  ** KEPT (pick-wt=8): 7 [] c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.88  ** KEPT (pick-wt=6): 9 [copy,8,flip.1] c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 1.68/1.88  ---> New Demodulator: 10 [new_demod,9] c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 1.68/1.88    Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.68/1.88  >>>> Starting back demodulation with 10.
% 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  ----> UNIT CONFLICT at   0.00 sec ----> 14 [binary,13.1,4.1] $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 Unsatisfiable
% 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                  5
% 1.68/1.88  clauses generated              7
% 1.68/1.88  clauses kept                  10
% 1.68/1.88  clauses forward subsumed       5
% 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 11459 finished Wed Jul 27 10:44:24 2022
% 1.68/1.88  Otter interrupted
% 1.68/1.88  PROOF FOUND
%------------------------------------------------------------------------------