↑ Up

Otter---3.3.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PHI011+1 : TPTP v8.1.0. Released v7.2.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:10:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ( ~ object(A)
    | ~ property(B)
    | ~ object(C)
    | ~ is_the(A,B)
    | A != C
    | exemplifies_property(B,C) ),
    file('PHI011+1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ exemplifies_property(dollar_c3,dollar_c2),
    file('PHI011+1.p',unknown),
    [] ).

cnf(8,axiom,
    A = A,
    file('PHI011+1.p',unknown),
    [] ).

cnf(9,axiom,
    property(dollar_c3),
    file('PHI011+1.p',unknown),
    [] ).

cnf(12,axiom,
    object(dollar_c2),
    file('PHI011+1.p',unknown),
    [] ).

cnf(13,axiom,
    is_the(dollar_c2,dollar_c3),
    file('PHI011+1.p',unknown),
    [] ).

cnf(15,plain,
    exemplifies_property(dollar_c3,dollar_c2),
    inference(hyper,[status(thm)],[13,6,12,9,12,8]),
    [iquote('hyper,13,6,12,9,12,8')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : PHI011+1 : TPTP v8.1.0. Released v7.2.0.
% 0.02/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 02:26:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.56/1.78  ----- Otter 3.3f, August 2004 -----
% 1.56/1.78  The process was started by sandbox on n010.cluster.edu,
% 1.56/1.78  Wed Jul 27 02:26:40 2022
% 1.56/1.78  The command was "./otter".  The process ID is 23809.
% 1.56/1.78  
% 1.56/1.78  set(prolog_style_variables).
% 1.56/1.78  set(auto).
% 1.56/1.78     dependent: set(auto1).
% 1.56/1.78     dependent: set(process_input).
% 1.56/1.78     dependent: clear(print_kept).
% 1.56/1.78     dependent: clear(print_new_demod).
% 1.56/1.78     dependent: clear(print_back_demod).
% 1.56/1.78     dependent: clear(print_back_sub).
% 1.56/1.78     dependent: set(control_memory).
% 1.56/1.78     dependent: assign(max_mem, 12000).
% 1.56/1.78     dependent: assign(pick_given_ratio, 4).
% 1.56/1.78     dependent: assign(stats_level, 1).
% 1.56/1.78     dependent: assign(max_seconds, 10800).
% 1.56/1.78  clear(print_given).
% 1.56/1.78  
% 1.56/1.78  formula_list(usable).
% 1.56/1.78  all A (A=A).
% 1.56/1.78  all X (object(X)-> -property(X)).
% 1.56/1.78  all X F (exemplifies_property(F,X)->property(F)&object(X)).
% 1.56/1.78  all X F (is_the(X,F)->property(F)&object(X)).
% 1.56/1.78  all X F Y (object(X)&property(F)&object(Y)-> (is_the(X,F)&X=Y->exemplifies_property(F,Y))).
% 1.56/1.78  -(all F (property(F)-> ((exists Y (object(Y)&is_the(Y,F)))-> (all Z (object(Z)-> (is_the(Z,F)->exemplifies_property(F,Z))))))).
% 1.56/1.78  end_of_list.
% 1.56/1.78  
% 1.56/1.78  -------> usable clausifies to:
% 1.56/1.78  
% 1.56/1.78  list(usable).
% 1.56/1.78  0 [] A=A.
% 1.56/1.78  0 [] -object(X)| -property(X).
% 1.56/1.78  0 [] -exemplifies_property(F,X)|property(F).
% 1.56/1.78  0 [] -exemplifies_property(F,X)|object(X).
% 1.56/1.78  0 [] -is_the(X,F)|property(F).
% 1.56/1.78  0 [] -is_the(X,F)|object(X).
% 1.56/1.78  0 [] -object(X)| -property(F)| -object(Y)| -is_the(X,F)|X!=Y|exemplifies_property(F,Y).
% 1.56/1.78  0 [] property($c3).
% 1.56/1.78  0 [] object($c1).
% 1.56/1.78  0 [] is_the($c1,$c3).
% 1.56/1.78  0 [] object($c2).
% 1.56/1.78  0 [] is_the($c2,$c3).
% 1.56/1.78  0 [] -exemplifies_property($c3,$c2).
% 1.56/1.78  end_of_list.
% 1.56/1.78  
% 1.56/1.78  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=6.
% 1.56/1.78  
% 1.56/1.78  This is a Horn set with equality.  The strategy will be
% 1.56/1.78  Knuth-Bendix and hyper_res, with positive clauses in
% 1.56/1.78  sos and nonpositive clauses in usable.
% 1.56/1.78  
% 1.56/1.78     dependent: set(knuth_bendix).
% 1.56/1.78     dependent: set(anl_eq).
% 1.56/1.78     dependent: set(para_from).
% 1.56/1.78     dependent: set(para_into).
% 1.56/1.78     dependent: clear(para_from_right).
% 1.56/1.78     dependent: clear(para_into_right).
% 1.56/1.78     dependent: set(para_from_vars).
% 1.56/1.78     dependent: set(eq_units_both_ways).
% 1.56/1.78     dependent: set(dynamic_demod_all).
% 1.56/1.78     dependent: set(dynamic_demod).
% 1.56/1.78     dependent: set(order_eq).
% 1.56/1.78     dependent: set(back_demod).
% 1.56/1.78     dependent: set(lrpo).
% 1.56/1.78     dependent: set(hyper_res).
% 1.56/1.78     dependent: clear(order_hyper).
% 1.56/1.78  
% 1.56/1.78  ------------> process usable:
% 1.56/1.78  ** KEPT (pick-wt=4): 1 [] -object(A)| -property(A).
% 1.56/1.78  ** KEPT (pick-wt=5): 2 [] -exemplifies_property(A,B)|property(A).
% 1.56/1.78  ** KEPT (pick-wt=5): 3 [] -exemplifies_property(A,B)|object(B).
% 1.56/1.78  ** KEPT (pick-wt=5): 4 [] -is_the(A,B)|property(B).
% 1.56/1.78  ** KEPT (pick-wt=5): 5 [] -is_the(A,B)|object(A).
% 1.56/1.78  ** KEPT (pick-wt=15): 6 [] -object(A)| -property(B)| -object(C)| -is_the(A,B)|A!=C|exemplifies_property(B,C).
% 1.56/1.78  ** KEPT (pick-wt=3): 7 [] -exemplifies_property($c3,$c2).
% 1.56/1.78  
% 1.56/1.78  ------------> process sos:
% 1.56/1.78  ** KEPT (pick-wt=3): 8 [] A=A.
% 1.56/1.78  ** KEPT (pick-wt=2): 9 [] property($c3).
% 1.56/1.78  ** KEPT (pick-wt=2): 10 [] object($c1).
% 1.56/1.78  ** KEPT (pick-wt=3): 11 [] is_the($c1,$c3).
% 1.56/1.78  ** KEPT (pick-wt=2): 12 [] object($c2).
% 1.56/1.78  ** KEPT (pick-wt=3): 13 [] is_the($c2,$c3).
% 1.56/1.78    Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.56/1.78  
% 1.56/1.78  ======= end of input processing =======
% 1.56/1.78  
% 1.56/1.78  =========== start of search ===========
% 1.56/1.78  
% 1.56/1.78  -------- PROOF -------- 
% 1.56/1.78  
% 1.56/1.78  ----> UNIT CONFLICT at   0.00 sec ----> 16 [binary,15.1,7.1] $F.
% 1.56/1.78  
% 1.56/1.78  Length of proof is 1.  Level of proof is 1.
% 1.56/1.78  
% 1.56/1.78  ---------------- PROOF ----------------
% 1.56/1.78  % SZS status Theorem
% 1.56/1.78  % SZS output start Refutation
% See solution above
% 1.56/1.78  ------------ end of proof -------------
% 1.56/1.78  
% 1.56/1.78  
% 1.56/1.78  Search stopped by max_proofs option.
% 1.56/1.78  
% 1.56/1.78  
% 1.56/1.78  Search stopped by max_proofs option.
% 1.56/1.78  
% 1.56/1.78  ============ end of search ============
% 1.56/1.78  
% 1.56/1.78  -------------- statistics -------------
% 1.56/1.78  clauses given                  6
% 1.56/1.78  clauses generated              4
% 1.56/1.78  clauses kept                  15
% 1.56/1.78  clauses forward subsumed       3
% 1.56/1.78  clauses back subsumed          0
% 1.56/1.78  Kbytes malloced              976
% 1.56/1.78  
% 1.56/1.78  ----------- times (seconds) -----------
% 1.56/1.78  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.56/1.78  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.56/1.78  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.56/1.78  
% 1.56/1.78  That finishes the proof of the theorem.
% 1.56/1.78  
% 1.56/1.78  Process 23809 finished Wed Jul 27 02:26:41 2022
% 1.56/1.78  Otter interrupted
% 1.56/1.78  PROOF FOUND
%------------------------------------------------------------------------------