TSTP Solution File: COL052-2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n009.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.72s 1.90s
% Output   : Refutation 1.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (  12 unt;   0 nHn;   8 RR)
%            Number of literals    :   18 (  11 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ agreeable(A)
    | response(A,common_bird(B)) = response(B,common_bird(B)) ),
    file('COL052-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( response(A,B) != response(compatible(A),B)
    | agreeable(A) ),
    file('COL052-2.p',unknown),
    [] ).

cnf(3,plain,
    ( response(compatible(A),B) != response(A,B)
    | agreeable(A) ),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2])]),
    [iquote('copy,2,flip.1')] ).

cnf(4,axiom,
    ~ agreeable(a),
    file('COL052-2.p',unknown),
    [] ).

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

cnf(8,axiom,
    agreeable(c),
    file('COL052-2.p',unknown),
    [] ).

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

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

cnf(12,plain,
    response(c,common_bird(A)) = response(A,common_bird(A)),
    inference(hyper,[status(thm)],[8,1]),
    [iquote('hyper,8,1')] ).

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

cnf(16,plain,
    response(c,A) = response(a,response(b,A)),
    inference(para_into,[status(thm),theory(equality)],[6,10]),
    [iquote('para_into,6.1.1.1,10.1.1')] ).

cnf(17,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)],[6,13]),16]),
    [iquote('para_into,6.1.1,13.1.1,demod,16')] ).

cnf(22,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)],[17])]),
    [iquote('copy,17,flip.1')] ).

cnf(50,plain,
    agreeable(a),
    inference(hyper,[status(thm)],[22,3]),
    [iquote('hyper,22,3')] ).

cnf(51,plain,
    $false,
    inference(binary,[status(thm)],[50,4]),
    [iquote('binary,50.1,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13  % Command  : otter-tptp-script %s
% 0.14/0.33  % Computer : n009.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Wed Jul 27 02:21:51 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 1.72/1.90  ----- Otter 3.3f, August 2004 -----
% 1.72/1.90  The process was started by sandbox on n009.cluster.edu,
% 1.72/1.90  Wed Jul 27 02:21:51 2022
% 1.72/1.90  The command was "./otter".  The process ID is 26528.
% 1.72/1.90  
% 1.72/1.90  set(prolog_style_variables).
% 1.72/1.90  set(auto).
% 1.72/1.90     dependent: set(auto1).
% 1.72/1.90     dependent: set(process_input).
% 1.72/1.90     dependent: clear(print_kept).
% 1.72/1.90     dependent: clear(print_new_demod).
% 1.72/1.90     dependent: clear(print_back_demod).
% 1.72/1.90     dependent: clear(print_back_sub).
% 1.72/1.90     dependent: set(control_memory).
% 1.72/1.90     dependent: assign(max_mem, 12000).
% 1.72/1.90     dependent: assign(pick_given_ratio, 4).
% 1.72/1.90     dependent: assign(stats_level, 1).
% 1.72/1.90     dependent: assign(max_seconds, 10800).
% 1.72/1.90  clear(print_given).
% 1.72/1.90  
% 1.72/1.90  list(usable).
% 1.72/1.90  0 [] A=A.
% 1.72/1.90  0 [] response(compose(X,Y),W)=response(X,response(Y,W)).
% 1.72/1.90  0 [] -agreeable(X)|response(X,common_bird(Y))=response(Y,common_bird(Y)).
% 1.72/1.90  0 [] response(X,Z)!=response(compatible(X),Z)|agreeable(X).
% 1.72/1.90  0 [] agreeable(c).
% 1.72/1.90  0 [] -agreeable(a).
% 1.72/1.90  0 [] c=compose(a,b).
% 1.72/1.90  end_of_list.
% 1.72/1.90  
% 1.72/1.90  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.72/1.90  
% 1.72/1.90  This is a Horn set with equality.  The strategy will be
% 1.72/1.90  Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.90  sos and nonpositive clauses in usable.
% 1.72/1.90  
% 1.72/1.90     dependent: set(knuth_bendix).
% 1.72/1.90     dependent: set(anl_eq).
% 1.72/1.90     dependent: set(para_from).
% 1.72/1.90     dependent: set(para_into).
% 1.72/1.90     dependent: clear(para_from_right).
% 1.72/1.90     dependent: clear(para_into_right).
% 1.72/1.90     dependent: set(para_from_vars).
% 1.72/1.90     dependent: set(eq_units_both_ways).
% 1.72/1.90     dependent: set(dynamic_demod_all).
% 1.72/1.90     dependent: set(dynamic_demod).
% 1.72/1.90     dependent: set(order_eq).
% 1.72/1.90     dependent: set(back_demod).
% 1.72/1.90     dependent: set(lrpo).
% 1.72/1.90     dependent: set(hyper_res).
% 1.72/1.90     dependent: clear(order_hyper).
% 1.72/1.90  
% 1.72/1.90  ------------> process usable:
% 1.72/1.90  ** KEPT (pick-wt=11): 1 [] -agreeable(A)|response(A,common_bird(B))=response(B,common_bird(B)).
% 1.72/1.90  ** KEPT (pick-wt=10): 3 [copy,2,flip.1] response(compatible(A),B)!=response(A,B)|agreeable(A).
% 1.72/1.90  ** KEPT (pick-wt=2): 4 [] -agreeable(a).
% 1.72/1.90  
% 1.72/1.90  ------------> process sos:
% 1.72/1.90  ** KEPT (pick-wt=3): 5 [] A=A.
% 1.72/1.90  ** KEPT (pick-wt=11): 6 [] response(compose(A,B),C)=response(A,response(B,C)).
% 1.72/1.90  ---> New Demodulator: 7 [new_demod,6] response(compose(A,B),C)=response(A,response(B,C)).
% 1.72/1.90  ** KEPT (pick-wt=2): 8 [] agreeable(c).
% 1.72/1.90  ** KEPT (pick-wt=5): 10 [copy,9,flip.1] compose(a,b)=c.
% 1.72/1.90  ---> New Demodulator: 11 [new_demod,10] compose(a,b)=c.
% 1.72/1.90    Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.72/1.90  >>>> Starting back demodulation with 7.
% 1.72/1.90  >>>> Starting back demodulation with 11.
% 1.72/1.90  
% 1.72/1.90  ======= end of input processing =======
% 1.72/1.90  
% 1.72/1.90  =========== start of search ===========
% 1.72/1.90  
% 1.72/1.90  -------- PROOF -------- 
% 1.72/1.90  
% 1.72/1.90  ----> UNIT CONFLICT at   0.00 sec ----> 51 [binary,50.1,4.1] $F.
% 1.72/1.90  
% 1.72/1.90  Length of proof is 8.  Level of proof is 5.
% 1.72/1.90  
% 1.72/1.90  ---------------- PROOF ----------------
% 1.72/1.90  % SZS status Unsatisfiable
% 1.72/1.90  % SZS output start Refutation
% See solution above
% 1.72/1.90  ------------ end of proof -------------
% 1.72/1.90  
% 1.72/1.90  
% 1.72/1.90  Search stopped by max_proofs option.
% 1.72/1.90  
% 1.72/1.90  
% 1.72/1.90  Search stopped by max_proofs option.
% 1.72/1.90  
% 1.72/1.90  ============ end of search ============
% 1.72/1.90  
% 1.72/1.90  -------------- statistics -------------
% 1.72/1.90  clauses given                 16
% 1.72/1.90  clauses generated             97
% 1.72/1.90  clauses kept                  44
% 1.72/1.90  clauses forward subsumed      70
% 1.72/1.90  clauses back subsumed          0
% 1.72/1.90  Kbytes malloced              976
% 1.72/1.90  
% 1.72/1.90  ----------- times (seconds) -----------
% 1.72/1.90  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.72/1.90  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.72/1.90  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.72/1.90  
% 1.72/1.90  That finishes the proof of the theorem.
% 1.72/1.90  
% 1.72/1.90  Process 26528 finished Wed Jul 27 02:21:52 2022
% 1.72/1.90  Otter interrupted
% 1.72/1.90  PROOF FOUND
%------------------------------------------------------------------------------