↑ Up

Otter---3.3.UNS-Ref.s

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

% Computer : n007.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 12:48:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    response(response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark)))) != response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    file('COL058-2.p',unknown),
    [] ).

cnf(3,axiom,
    response(response(lark,A),B) = response(A,response(B,B)),
    file('COL058-2.p',unknown),
    [] ).

cnf(4,plain,
    response(A,response(B,B)) = response(response(lark,A),B),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
    [iquote('copy,3,flip.1')] ).

cnf(6,plain,
    response(response(response(response(lark,response(lark,lark)),response(lark,response(lark,lark))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark)))) != response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    inference(para_from,[status(thm),theory(equality)],[3,1]),
    [iquote('para_from,3.1.1,1.1.1.1')] ).

cnf(11,plain,
    response(A,response(response(B,B),response(B,B))) = response(response(lark,response(lark,A)),B),
    inference(para_into,[status(thm),theory(equality)],[4,3]),
    [iquote('para_into,4.1.1,3.1.1')] ).

cnf(14,plain,
    response(response(lark,response(lark,A)),B) = response(A,response(response(B,B),response(B,B))),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
    [iquote('copy,11,flip.1')] ).

cnf(69,plain,
    response(response(response(response(lark,response(lark,lark)),response(lark,response(lark,lark))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(response(response(lark,response(lark,lark)),response(lark,response(lark,lark))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark))))) != response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    inference(para_into,[status(thm),theory(equality)],[6,3]),
    [iquote('para_into,6.1.1.2,3.1.1')] ).

cnf(248,plain,
    response(response(lark,response(response(lark,response(lark,lark)),A)),B) = response(response(response(A,A),response(A,A)),response(response(B,B),response(B,B))),
    inference(para_into,[status(thm),theory(equality)],[14,11]),
    [iquote('para_into,14.1.1.1.2,11.1.1')] ).

cnf(250,plain,
    response(response(response(A,A),response(A,A)),response(response(B,B),response(B,B))) = response(response(lark,response(response(lark,response(lark,lark)),A)),B),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[248])]),
    [iquote('copy,248,flip.1')] ).

cnf(251,plain,
    $false,
    inference(binary,[status(thm)],[250,69]),
    [iquote('binary,250.1,69.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : COL058-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n007.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 02:10:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.73/1.93  ----- Otter 3.3f, August 2004 -----
% 1.73/1.93  The process was started by sandbox2 on n007.cluster.edu,
% 1.73/1.93  Wed Jul 27 02:10:01 2022
% 1.73/1.93  The command was "./otter".  The process ID is 21500.
% 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 [] response(response(lark,X1),X2)=response(X1,response(X2,X2)).
% 1.73/1.93  0 [] response(response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))))!=response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))).
% 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=1.
% 1.73/1.93  
% 1.73/1.93  All clauses are units, and equality is present; the
% 1.73/1.93  strategy will be Knuth-Bendix with positive clauses in sos.
% 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  
% 1.73/1.93  ------------> process usable:
% 1.73/1.93  ** KEPT (pick-wt=59): 1 [] response(response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))))!=response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))).
% 1.73/1.93  
% 1.73/1.93  ------------> process sos:
% 1.73/1.93  ** KEPT (pick-wt=3): 2 [] A=A.
% 1.73/1.93  ** KEPT (pick-wt=11): 3 [] response(response(lark,A),B)=response(A,response(B,B)).
% 1.73/1.93    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.73/1.93  ** KEPT (pick-wt=11): 4 [copy,3,flip.1] response(A,response(B,B))=response(response(lark,A),B).
% 1.73/1.93    Following clause subsumed by 3 during input processing: 0 [copy,4,flip.1] response(response(lark,A),B)=response(A,response(B,B)).
% 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.02 sec ----> 251 [binary,250.1,69.1] $F.
% 1.73/1.93  
% 1.73/1.93  Length of proof is 7.  Level of proof is 5.
% 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                 13
% 1.73/1.93  clauses generated            228
% 1.73/1.93  clauses kept                 226
% 1.73/1.93  clauses forward subsumed     221
% 1.73/1.93  clauses back subsumed          6
% 1.73/1.93  Kbytes malloced             2929
% 1.73/1.93  
% 1.73/1.93  ----------- times (seconds) -----------
% 1.73/1.93  user CPU time          0.02          (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 21500 finished Wed Jul 27 02:10:02 2022
% 1.73/1.93  Otter interrupted
% 1.73/1.93  PROOF FOUND
%------------------------------------------------------------------------------