↑ Up

Otter---3.3.UNS-Ref.s

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

% Computer : n006.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:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    response(a,A) != response(odd_bird,A),
    file('COL052-1.p',unknown),
    [] ).

cnf(2,plain,
    response(odd_bird,A) != response(a,A),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
    [iquote('copy,1,flip.1')] ).

cnf(4,axiom,
    response(compose(A,B),C) = response(A,response(B,C)),
    file('COL052-1.p',unknown),
    [] ).

cnf(6,axiom,
    response(c,common_bird(A)) = response(A,common_bird(A)),
    file('COL052-1.p',unknown),
    [] ).

cnf(7,axiom,
    c = compose(a,b),
    file('COL052-1.p',unknown),
    [] ).

cnf(8,plain,
    compose(a,b) = c,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
    [iquote('copy,7,flip.1')] ).

cnf(10,plain,
    response(A,common_bird(A)) = response(c,common_bird(A)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
    [iquote('copy,6,flip.1')] ).

cnf(13,plain,
    response(c,A) = response(a,response(b,A)),
    inference(para_into,[status(thm),theory(equality)],[4,8]),
    [iquote('para_into,4.1.1.1,8.1.1')] ).

cnf(14,plain,
    response(a,response(b,common_bird(compose(A,B)))) = response(A,response(B,common_bird(compose(A,B)))),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[4,10]),13]),
    [iquote('para_into,4.1.1,10.1.1,demod,13')] ).

cnf(18,plain,
    response(A,response(B,common_bird(compose(A,B)))) = response(a,response(b,common_bird(compose(A,B)))),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[14])]),
    [iquote('copy,14,flip.1')] ).

cnf(19,plain,
    $false,
    inference(binary,[status(thm)],[18,2]),
    [iquote('binary,18.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : COL052-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n006.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:21:02 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.91/2.11  ----- Otter 3.3f, August 2004 -----
% 1.91/2.11  The process was started by sandbox on n006.cluster.edu,
% 1.91/2.11  Wed Jul 27 02:21:02 2022
% 1.91/2.11  The command was "./otter".  The process ID is 14423.
% 1.91/2.11  
% 1.91/2.11  set(prolog_style_variables).
% 1.91/2.11  set(auto).
% 1.91/2.11     dependent: set(auto1).
% 1.91/2.11     dependent: set(process_input).
% 1.91/2.11     dependent: clear(print_kept).
% 1.91/2.11     dependent: clear(print_new_demod).
% 1.91/2.11     dependent: clear(print_back_demod).
% 1.91/2.11     dependent: clear(print_back_sub).
% 1.91/2.11     dependent: set(control_memory).
% 1.91/2.11     dependent: assign(max_mem, 12000).
% 1.91/2.11     dependent: assign(pick_given_ratio, 4).
% 1.91/2.11     dependent: assign(stats_level, 1).
% 1.91/2.11     dependent: assign(max_seconds, 10800).
% 1.91/2.11  clear(print_given).
% 1.91/2.11  
% 1.91/2.11  list(usable).
% 1.91/2.11  0 [] A=A.
% 1.91/2.11  0 [] response(compose(X,Y),W)=response(X,response(Y,W)).
% 1.91/2.11  0 [] response(c,common_bird(X))=response(X,common_bird(X)).
% 1.91/2.11  0 [] response(a,V)!=response(odd_bird,V).
% 1.91/2.11  0 [] c=compose(a,b).
% 1.91/2.11  end_of_list.
% 1.91/2.11  
% 1.91/2.11  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.91/2.11  
% 1.91/2.11  All clauses are units, and equality is present; the
% 1.91/2.11  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.91/2.11  
% 1.91/2.11     dependent: set(knuth_bendix).
% 1.91/2.11     dependent: set(anl_eq).
% 1.91/2.11     dependent: set(para_from).
% 1.91/2.11     dependent: set(para_into).
% 1.91/2.11     dependent: clear(para_from_right).
% 1.91/2.11     dependent: clear(para_into_right).
% 1.91/2.11     dependent: set(para_from_vars).
% 1.91/2.11     dependent: set(eq_units_both_ways).
% 1.91/2.11     dependent: set(dynamic_demod_all).
% 1.91/2.11     dependent: set(dynamic_demod).
% 1.91/2.11     dependent: set(order_eq).
% 1.91/2.11     dependent: set(back_demod).
% 1.91/2.11     dependent: set(lrpo).
% 1.91/2.11  
% 1.91/2.11  ------------> process usable:
% 1.91/2.11  ** KEPT (pick-wt=7): 2 [copy,1,flip.1] response(odd_bird,A)!=response(a,A).
% 1.91/2.11  
% 1.91/2.11  ------------> process sos:
% 1.91/2.11  ** KEPT (pick-wt=3): 3 [] A=A.
% 1.91/2.11  ** KEPT (pick-wt=11): 4 [] response(compose(A,B),C)=response(A,response(B,C)).
% 1.91/2.11  ---> New Demodulator: 5 [new_demod,4] response(compose(A,B),C)=response(A,response(B,C)).
% 1.91/2.11  ** KEPT (pick-wt=9): 6 [] response(c,common_bird(A))=response(A,common_bird(A)).
% 1.91/2.11  ** KEPT (pick-wt=5): 8 [copy,7,flip.1] compose(a,b)=c.
% 1.91/2.11  ---> New Demodulator: 9 [new_demod,8] compose(a,b)=c.
% 1.91/2.11    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.91/2.11  >>>> Starting back demodulation with 5.
% 1.91/2.11  ** KEPT (pick-wt=9): 10 [copy,6,flip.1] response(A,common_bird(A))=response(c,common_bird(A)).
% 1.91/2.11  >>>> Starting back demodulation with 9.
% 1.91/2.11    Following clause subsumed by 6 during input processing: 0 [copy,10,flip.1] response(c,common_bird(A))=response(A,common_bird(A)).
% 1.91/2.11  
% 1.91/2.11  ======= end of input processing =======
% 1.91/2.11  
% 1.91/2.11  =========== start of search ===========
% 1.91/2.11  
% 1.91/2.11  -------- PROOF -------- 
% 1.91/2.11  
% 1.91/2.11  ----> UNIT CONFLICT at   0.00 sec ----> 19 [binary,18.1,2.1] $F.
% 1.91/2.11  
% 1.91/2.11  Length of proof is 6.  Level of proof is 4.
% 1.91/2.11  
% 1.91/2.11  ---------------- PROOF ----------------
% 1.91/2.11  % SZS status Unsatisfiable
% 1.91/2.11  % SZS output start Refutation
% See solution above
% 1.91/2.11  ------------ end of proof -------------
% 1.91/2.11  
% 1.91/2.11  
% 1.91/2.11  Search stopped by max_proofs option.
% 1.91/2.11  
% 1.91/2.11  
% 1.91/2.11  Search stopped by max_proofs option.
% 1.91/2.11  
% 1.91/2.11  ============ end of search ============
% 1.91/2.11  
% 1.91/2.11  -------------- statistics -------------
% 1.91/2.11  clauses given                  6
% 1.91/2.11  clauses generated             13
% 1.91/2.11  clauses kept                  13
% 1.91/2.11  clauses forward subsumed      12
% 1.91/2.11  clauses back subsumed          0
% 1.91/2.11  Kbytes malloced              976
% 1.91/2.11  
% 1.91/2.11  ----------- times (seconds) -----------
% 1.91/2.11  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.91/2.11  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.91/2.11  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.91/2.11  
% 1.91/2.11  That finishes the proof of the theorem.
% 1.91/2.11  
% 1.91/2.11  Process 14423 finished Wed Jul 27 02:21:03 2022
% 1.91/2.11  Otter interrupted
% 1.91/2.11  PROOF FOUND
%------------------------------------------------------------------------------