↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n010.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:06:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ e_q(p1,p2),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ latin(A,B,C)
    | ~ latin(A,B,D)
    | e_q(D,C) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ greek(A,B,C)
    | ~ greek(A,B,D)
    | e_q(D,C) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ greek(A,B,C)
    | ~ latin(A,B,D)
    | ~ greek(E,F,C)
    | ~ latin(E,F,D)
    | e_q(F,B)
    | e_q(E,A) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(16,plain,
    ( ~ greek(A,A,B)
    | ~ latin(A,A,C)
    | ~ greek(D,D,B)
    | ~ latin(D,D,C)
    | e_q(D,A) ),
    inference(factor,[status(thm)],[9]),
    [iquote('factor,9.5.6')] ).

cnf(19,axiom,
    ( latin(A,p1,B)
    | latin(A,p2,B) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(20,axiom,
    ( latin(p1,A,B)
    | latin(p2,A,B) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(22,axiom,
    ( greek(A,p1,B)
    | greek(A,p2,B) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(23,axiom,
    ( greek(p1,A,B)
    | greek(p2,A,B) ),
    file('MSC008-2.002.p',unknown),
    [] ).

cnf(517,plain,
    ( greek(p2,p1,A)
    | latin(p1,p2,B) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[23,16,22,20,19]),1])])]),
    [iquote('hyper,23,16,22,20,19,unit_del,1,factor_simp,factor_simp')] ).

cnf(937,plain,
    ( greek(p2,p1,A)
    | e_q(B,C) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[517,3,517])]),
    [iquote('hyper,517,3,517,factor_simp')] ).

cnf(938,plain,
    greek(p2,p1,A),
    inference(hyper,[status(thm)],[937,1]),
    [iquote('hyper,937,1')] ).

cnf(1047,plain,
    e_q(A,B),
    inference(hyper,[status(thm)],[938,6,938]),
    [iquote('hyper,938,6,938')] ).

cnf(1048,plain,
    $false,
    inference(binary,[status(thm)],[1047,1]),
    [iquote('binary,1047.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n010.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 08:52:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.88/2.10  ----- Otter 3.3f, August 2004 -----
% 1.88/2.10  The process was started by sandbox on n010.cluster.edu,
% 1.88/2.10  Wed Jul 27 08:52:24 2022
% 1.88/2.10  The command was "./otter".  The process ID is 20751.
% 1.88/2.10  
% 1.88/2.10  set(prolog_style_variables).
% 1.88/2.10  set(auto).
% 1.88/2.10     dependent: set(auto1).
% 1.88/2.10     dependent: set(process_input).
% 1.88/2.10     dependent: clear(print_kept).
% 1.88/2.10     dependent: clear(print_new_demod).
% 1.88/2.10     dependent: clear(print_back_demod).
% 1.88/2.10     dependent: clear(print_back_sub).
% 1.88/2.10     dependent: set(control_memory).
% 1.88/2.10     dependent: assign(max_mem, 12000).
% 1.88/2.10     dependent: assign(pick_given_ratio, 4).
% 1.88/2.10     dependent: assign(stats_level, 1).
% 1.88/2.10     dependent: assign(max_seconds, 10800).
% 1.88/2.10  clear(print_given).
% 1.88/2.10  
% 1.88/2.10  list(usable).
% 1.88/2.10  0 [] -e_q(p1,p2).
% 1.88/2.10  0 [] e_q(A,A).
% 1.88/2.10  0 [] -e_q(A,B)|e_q(B,A).
% 1.88/2.10  0 [] -latin(A,B,C)| -latin(A,B,D)|e_q(D,C).
% 1.88/2.10  0 [] -latin(A,B,C)| -latin(A,D,C)|e_q(D,B).
% 1.88/2.10  0 [] -latin(A,B,C)| -latin(D,B,C)|e_q(D,A).
% 1.88/2.10  0 [] -greek(A,B,C)| -greek(A,B,D)|e_q(D,C).
% 1.88/2.10  0 [] -greek(A,B,C)| -greek(A,D,C)|e_q(D,B).
% 1.88/2.10  0 [] -greek(A,B,C)| -greek(D,B,C)|e_q(D,A).
% 1.88/2.10  0 [] latin(E,F,p1)|latin(E,F,p2).
% 1.88/2.10  0 [] latin(G,p1,H)|latin(G,p2,H).
% 1.88/2.10  0 [] latin(p1,I,J)|latin(p2,I,J).
% 1.88/2.10  0 [] greek(K,L,p1)|greek(K,L,p2).
% 1.88/2.10  0 [] greek(M,p1,N)|greek(M,p2,N).
% 1.88/2.10  0 [] greek(p1,O,P)|greek(p2,O,P).
% 1.88/2.10  0 [] -greek(A,B,C)| -latin(A,B,D)| -greek(E,F,C)| -latin(E,F,D)|e_q(F,B)|e_q(E,A).
% 1.88/2.10  end_of_list.
% 1.88/2.10  
% 1.88/2.10  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.88/2.10  
% 1.88/2.10  This is a non-Horn set without equality.  The strategy will
% 1.88/2.10  be ordered hyper_res, unit deletion, and factoring, with
% 1.88/2.10  satellites in sos and with nuclei in usable.
% 1.88/2.10  
% 1.88/2.10     dependent: set(hyper_res).
% 1.88/2.10     dependent: set(factor).
% 1.88/2.10     dependent: set(unit_deletion).
% 1.88/2.10  
% 1.88/2.10  ------------> process usable:
% 1.88/2.10  ** KEPT (pick-wt=3): 1 [] -e_q(p1,p2).
% 1.88/2.10  ** KEPT (pick-wt=6): 2 [] -e_q(A,B)|e_q(B,A).
% 1.88/2.10  ** KEPT (pick-wt=11): 3 [] -latin(A,B,C)| -latin(A,B,D)|e_q(D,C).
% 1.88/2.10  ** KEPT (pick-wt=11): 4 [] -latin(A,B,C)| -latin(A,D,C)|e_q(D,B).
% 1.88/2.10  ** KEPT (pick-wt=11): 5 [] -latin(A,B,C)| -latin(D,B,C)|e_q(D,A).
% 1.88/2.10  ** KEPT (pick-wt=11): 6 [] -greek(A,B,C)| -greek(A,B,D)|e_q(D,C).
% 1.88/2.10  ** KEPT (pick-wt=11): 7 [] -greek(A,B,C)| -greek(A,D,C)|e_q(D,B).
% 1.88/2.10  ** KEPT (pick-wt=11): 8 [] -greek(A,B,C)| -greek(D,B,C)|e_q(D,A).
% 1.88/2.10  ** KEPT (pick-wt=22): 9 [] -greek(A,B,C)| -latin(A,B,D)| -greek(E,F,C)| -latin(E,F,D)|e_q(F,B)|e_q(E,A).
% 1.88/2.10  
% 1.88/2.10  ------------> process sos:
% 1.88/2.10  ** KEPT (pick-wt=3): 17 [] e_q(A,A).
% 1.88/2.10  ** KEPT (pick-wt=8): 18 [] latin(A,B,p1)|latin(A,B,p2).
% 1.88/2.10  ** KEPT (pick-wt=8): 19 [] latin(A,p1,B)|latin(A,p2,B).
% 1.88/2.10  ** KEPT (pick-wt=8): 20 [] latin(p1,A,B)|latin(p2,A,B).
% 1.88/2.10  ** KEPT (pick-wt=8): 21 [] greek(A,B,p1)|greek(A,B,p2).
% 1.88/2.10  ** KEPT (pick-wt=8): 22 [] greek(A,p1,B)|greek(A,p2,B).
% 1.88/2.10  ** KEPT (pick-wt=8): 23 [] greek(p1,A,B)|greek(p2,A,B).
% 1.88/2.10  17 back subsumes 15.
% 1.88/2.10  17 back subsumes 14.
% 1.88/2.10  17 back subsumes 13.
% 1.88/2.10  17 back subsumes 12.
% 1.88/2.10  17 back subsumes 11.
% 1.88/2.10  17 back subsumes 10.
% 1.88/2.10  
% 1.88/2.10  ======= end of input processing =======
% 1.88/2.10  
% 1.88/2.10  =========== start of search ===========
% 1.88/2.10  
% 1.88/2.10  -------- PROOF -------- 
% 1.88/2.10  
% 1.88/2.10  ----> UNIT CONFLICT at   0.24 sec ----> 1048 [binary,1047.1,1.1] $F.
% 1.88/2.10  
% 1.88/2.10  Length of proof is 5.  Level of proof is 5.
% 1.88/2.10  
% 1.88/2.10  ---------------- PROOF ----------------
% 1.88/2.10  % SZS status Unsatisfiable
% 1.88/2.10  % SZS output start Refutation
% See solution above
% 1.88/2.10  ------------ end of proof -------------
% 1.88/2.10  
% 1.88/2.10  
% 1.88/2.10  Search stopped by max_proofs option.
% 1.88/2.10  
% 1.88/2.10  
% 1.88/2.10  Search stopped by max_proofs option.
% 1.88/2.10  
% 1.88/2.10  ============ end of search ============
% 1.88/2.10  
% 1.88/2.10  -------------- statistics -------------
% 1.88/2.10  clauses given                 10
% 1.88/2.10  clauses generated           3554
% 1.88/2.10  clauses kept                1047
% 1.88/2.10  clauses forward subsumed    2523
% 1.88/2.10  clauses back subsumed        306
% 1.88/2.10  Kbytes malloced              976
% 1.88/2.10  
% 1.88/2.10  ----------- times (seconds) -----------
% 1.88/2.10  user CPU time          0.24          (0 hr, 0 min, 0 sec)
% 1.88/2.10  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.88/2.10  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.88/2.10  
% 1.88/2.10  That finishes the proof of the theorem.
% 1.88/2.10  
% 1.88/2.10  Process 20751 finished Wed Jul 27 08:52:26 2022
% 1.88/2.10  Otter interrupted
% 1.88/2.10  PROOF FOUND
%------------------------------------------------------------------------------