↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET859-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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:25 EDT 2022

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

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

cnf(2,axiom,
    ~ c_lesse_quals(v_n,v_m,tc_set(tc_set(t_a))),
    file('SET859-2.p',unknown),
    [] ).

cnf(3,axiom,
    c_lesse_quals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))),
    file('SET859-2.p',unknown),
    [] ).

cnf(4,axiom,
    c_lesse_quals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
    file('SET859-2.p',unknown),
    [] ).

cnf(7,plain,
    c_lesse_quals(v_n,v_m,tc_set(tc_set(t_a))),
    inference(hyper,[status(thm)],[4,1,3]),
    [iquote('hyper,4,1,3')] ).

cnf(8,plain,
    $false,
    inference(binary,[status(thm)],[7,2]),
    [iquote('binary,7.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET859-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n018.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 10:57:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.64/1.85  ----- Otter 3.3f, August 2004 -----
% 1.64/1.85  The process was started by sandbox2 on n018.cluster.edu,
% 1.64/1.85  Wed Jul 27 10:57:46 2022
% 1.64/1.85  The command was "./otter".  The process ID is 22908.
% 1.64/1.85  
% 1.64/1.85  set(prolog_style_variables).
% 1.64/1.85  set(auto).
% 1.64/1.85     dependent: set(auto1).
% 1.64/1.85     dependent: set(process_input).
% 1.64/1.85     dependent: clear(print_kept).
% 1.64/1.85     dependent: clear(print_new_demod).
% 1.64/1.85     dependent: clear(print_back_demod).
% 1.64/1.85     dependent: clear(print_back_sub).
% 1.64/1.85     dependent: set(control_memory).
% 1.64/1.85     dependent: assign(max_mem, 12000).
% 1.64/1.85     dependent: assign(pick_given_ratio, 4).
% 1.64/1.85     dependent: assign(stats_level, 1).
% 1.64/1.85     dependent: assign(max_seconds, 10800).
% 1.64/1.85  clear(print_given).
% 1.64/1.85  
% 1.64/1.85  list(usable).
% 1.64/1.85  0 [] -c_lesse_quals(V_B,V_C,tc_set(T_a))| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_lesse_quals(V_A,V_C,tc_set(T_a)).
% 1.64/1.85  0 [] c_lesse_quals(V_x,c_Zorn_Osucc(V_S,V_x,T_a),tc_set(tc_set(T_a))).
% 1.64/1.85  0 [] c_lesse_quals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))).
% 1.64/1.85  0 [] -c_lesse_quals(v_n,v_m,tc_set(tc_set(t_a))).
% 1.64/1.85  end_of_list.
% 1.64/1.85  
% 1.64/1.85  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.64/1.85  
% 1.64/1.85  This is a Horn set without equality.  The strategy will
% 1.64/1.85  be hyperresolution, with satellites in sos and nuclei
% 1.64/1.85  in usable.
% 1.64/1.85  
% 1.64/1.85     dependent: set(hyper_res).
% 1.64/1.85     dependent: clear(order_hyper).
% 1.64/1.85  
% 1.64/1.85  ------------> process usable:
% 1.64/1.85  ** KEPT (pick-wt=15): 1 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(D,A,tc_set(C))|c_lesse_quals(D,B,tc_set(C)).
% 1.64/1.85  ** KEPT (pick-wt=6): 2 [] -c_lesse_quals(v_n,v_m,tc_set(tc_set(t_a))).
% 1.64/1.85  
% 1.64/1.85  ------------> process sos:
% 1.64/1.85  ** KEPT (pick-wt=9): 3 [] c_lesse_quals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))).
% 1.64/1.85  ** KEPT (pick-wt=9): 4 [] c_lesse_quals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))).
% 1.64/1.85  
% 1.64/1.85  ======= end of input processing =======
% 1.64/1.85  
% 1.64/1.85  =========== start of search ===========
% 1.64/1.85  
% 1.64/1.85  -------- PROOF -------- 
% 1.64/1.85  
% 1.64/1.85  ----> UNIT CONFLICT at   0.00 sec ----> 8 [binary,7.1,2.1] $F.
% 1.64/1.85  
% 1.64/1.85  Length of proof is 1.  Level of proof is 1.
% 1.64/1.85  
% 1.64/1.85  ---------------- PROOF ----------------
% 1.64/1.85  % SZS status Unsatisfiable
% 1.64/1.85  % SZS output start Refutation
% See solution above
% 1.64/1.85  ------------ end of proof -------------
% 1.64/1.85  
% 1.64/1.85  
% 1.64/1.85  Search stopped by max_proofs option.
% 1.64/1.85  
% 1.64/1.85  
% 1.64/1.85  Search stopped by max_proofs option.
% 1.64/1.85  
% 1.64/1.85  ============ end of search ============
% 1.64/1.85  
% 1.64/1.85  -------------- statistics -------------
% 1.64/1.85  clauses given                  2
% 1.64/1.85  clauses generated              4
% 1.64/1.85  clauses kept                   7
% 1.64/1.85  clauses forward subsumed       1
% 1.64/1.85  clauses back subsumed          0
% 1.64/1.85  Kbytes malloced              976
% 1.64/1.85  
% 1.64/1.85  ----------- times (seconds) -----------
% 1.64/1.85  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.64/1.85  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.64/1.85  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.64/1.85  
% 1.64/1.85  That finishes the proof of the theorem.
% 1.64/1.85  
% 1.64/1.85  Process 22908 finished Wed Jul 27 10:57:48 2022
% 1.64/1.85  Otter interrupted
% 1.64/1.85  PROOF FOUND
%------------------------------------------------------------------------------