↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LAT277-2 : TPTP v8.1.0. Released v3.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:02:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('LAT277-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_Relation_Orefl(A,B,C)
    | ~ c_in(D,A,C)
    | c_in(c_Pair(D,D,C,C),B,tc_prod(C,C)) ),
    file('LAT277-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))
    | c_Relation_Orefl(c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(A,B,tc_Product__Type_Ounit),B) ),
    file('LAT277-2.p',unknown),
    [] ).

cnf(5,axiom,
    c_in(v_x,v_A,t_a),
    file('LAT277-2.p',unknown),
    [] ).

cnf(6,axiom,
    v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
    file('LAT277-2.p',unknown),
    [] ).

cnf(8,plain,
    c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
    [iquote('copy,6,flip.1')] ).

cnf(9,axiom,
    c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('LAT277-2.p',unknown),
    [] ).

cnf(10,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    file('LAT277-2.p',unknown),
    [] ).

cnf(12,plain,
    c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
    [iquote('copy,10,flip.1')] ).

cnf(14,plain,
    c_Relation_Orefl(v_A,v_r,t_a),
    inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[9,3]),8,12]),
    [iquote('hyper,9,3,demod,8,12')] ).

cnf(15,plain,
    c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(hyper,[status(thm)],[14,2,5]),
    [iquote('hyper,14,2,5')] ).

cnf(16,plain,
    $false,
    inference(binary,[status(thm)],[15,1]),
    [iquote('binary,15.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LAT277-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 08:36:34 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.73/1.93  ----- Otter 3.3f, August 2004 -----
% 1.73/1.93  The process was started by sandbox2 on n028.cluster.edu,
% 1.73/1.93  Wed Jul 27 08:36:34 2022
% 1.73/1.93  The command was "./otter".  The process ID is 20837.
% 1.73/1.93  
% 1.73/1.93  set(prolog_style_variables).
% 1.73/1.93  set(auto).
% 1.73/1.93     dependent: set(auto1).
% 1.73/1.93     dependent: set(process_input).
% 1.73/1.93     dependent: clear(print_kept).
% 1.73/1.93     dependent: clear(print_new_demod).
% 1.73/1.93     dependent: clear(print_back_demod).
% 1.73/1.93     dependent: clear(print_back_sub).
% 1.73/1.93     dependent: set(control_memory).
% 1.73/1.93     dependent: assign(max_mem, 12000).
% 1.73/1.93     dependent: assign(pick_given_ratio, 4).
% 1.73/1.93     dependent: assign(stats_level, 1).
% 1.73/1.93     dependent: assign(max_seconds, 10800).
% 1.73/1.93  clear(print_given).
% 1.73/1.93  
% 1.73/1.93  list(usable).
% 1.73/1.93  0 [] A=A.
% 1.73/1.93  0 [] c_in(v_x,v_A,t_a).
% 1.73/1.93  0 [] -c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.73/1.93  0 [] -c_Relation_Orefl(V_A,V_r,T_a)| -c_in(V_a,V_A,T_a)|c_in(c_Pair(V_a,V_a,T_a,T_a),V_r,tc_prod(T_a,T_a)).
% 1.73/1.93  0 [] v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 1.73/1.93  0 [] -c_in(V_P,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))|c_Relation_Orefl(c_Tarski_Opotype_Opset(V_P,T_a,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(V_P,T_a,tc_Product__Type_Ounit),T_a).
% 1.73/1.93  0 [] c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 1.73/1.93  0 [] v_r=c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit).
% 1.73/1.93  end_of_list.
% 1.73/1.93  
% 1.73/1.93  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.73/1.93  
% 1.73/1.93  This is a Horn set with equality.  The strategy will be
% 1.73/1.93  Knuth-Bendix and hyper_res, with positive clauses in
% 1.73/1.93  sos and nonpositive clauses in usable.
% 1.73/1.93  
% 1.73/1.93     dependent: set(knuth_bendix).
% 1.73/1.93     dependent: set(anl_eq).
% 1.73/1.93     dependent: set(para_from).
% 1.73/1.93     dependent: set(para_into).
% 1.73/1.93     dependent: clear(para_from_right).
% 1.73/1.93     dependent: clear(para_into_right).
% 1.73/1.93     dependent: set(para_from_vars).
% 1.73/1.93     dependent: set(eq_units_both_ways).
% 1.73/1.93     dependent: set(dynamic_demod_all).
% 1.73/1.93     dependent: set(dynamic_demod).
% 1.73/1.93     dependent: set(order_eq).
% 1.73/1.93     dependent: set(back_demod).
% 1.73/1.93     dependent: set(lrpo).
% 1.73/1.93     dependent: set(hyper_res).
% 1.73/1.93     dependent: clear(order_hyper).
% 1.73/1.93  
% 1.73/1.93  ------------> process usable:
% 1.73/1.93  ** KEPT (pick-wt=10): 1 [] -c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.73/1.93  ** KEPT (pick-wt=18): 2 [] -c_Relation_Orefl(A,B,C)| -c_in(D,A,C)|c_in(c_Pair(D,D,C,C),B,tc_prod(C,C)).
% 1.73/1.93  ** KEPT (pick-wt=16): 3 [] -c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))|c_Relation_Orefl(c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(A,B,tc_Product__Type_Ounit),B).
% 1.73/1.93  
% 1.73/1.93  ------------> process sos:
% 1.73/1.93  ** KEPT (pick-wt=3): 4 [] A=A.
% 1.73/1.93  ** KEPT (pick-wt=4): 5 [] c_in(v_x,v_A,t_a).
% 1.73/1.93  ** KEPT (pick-wt=6): 7 [copy,6,flip.1] c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 1.73/1.93  ---> New Demodulator: 8 [new_demod,7] c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 1.73/1.93  ** KEPT (pick-wt=6): 9 [] c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 1.73/1.93  ** KEPT (pick-wt=6): 11 [copy,10,flip.1] c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 1.73/1.93  ---> New Demodulator: 12 [new_demod,11] c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 1.73/1.93    Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.73/1.93  >>>> Starting back demodulation with 8.
% 1.73/1.93  >>>> Starting back demodulation with 12.
% 1.73/1.93  
% 1.73/1.93  ======= end of input processing =======
% 1.73/1.93  
% 1.73/1.93  =========== start of search ===========
% 1.73/1.93  
% 1.73/1.93  -------- PROOF -------- 
% 1.73/1.93  
% 1.73/1.93  ----> UNIT CONFLICT at   0.00 sec ----> 16 [binary,15.1,1.1] $F.
% 1.73/1.93  
% 1.73/1.93  Length of proof is 4.  Level of proof is 3.
% 1.73/1.93  
% 1.73/1.93  ---------------- PROOF ----------------
% 1.73/1.93  % SZS status Unsatisfiable
% 1.73/1.93  % SZS output start Refutation
% See solution above
% 1.73/1.93  ------------ end of proof -------------
% 1.73/1.93  
% 1.73/1.93  
% 1.73/1.93  Search stopped by max_proofs option.
% 1.73/1.93  
% 1.73/1.93  
% 1.73/1.93  Search stopped by max_proofs option.
% 1.73/1.93  
% 1.73/1.93  ============ end of search ============
% 1.73/1.93  
% 1.73/1.93  -------------- statistics -------------
% 1.73/1.93  clauses given                  5
% 1.73/1.93  clauses generated              5
% 1.73/1.93  clauses kept                  11
% 1.73/1.93  clauses forward subsumed       3
% 1.73/1.93  clauses back subsumed          1
% 1.73/1.93  Kbytes malloced              976
% 1.73/1.93  
% 1.73/1.93  ----------- times (seconds) -----------
% 1.73/1.93  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.73/1.93  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.73/1.93  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.73/1.93  
% 1.73/1.93  That finishes the proof of the theorem.
% 1.73/1.93  
% 1.73/1.93  Process 20837 finished Wed Jul 27 08:36:35 2022
% 1.73/1.93  Otter interrupted
% 1.73/1.93  PROOF FOUND
%------------------------------------------------------------------------------