TSTP Solution File: PUZ130_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : PUZ130_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% 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 : Fri May  3 02:54:56 EDT 2024

% Result   : Theorem 0.78s 1.16s
% Output   : CNFRefutation 0.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   30 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :  104 (  17 equ)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   22 (  12   ~;   7   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   64 (  64 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  13 usr;   8 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   20 (   0 sgn  14   !;   2   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,axiom,
    ! [X0: animal] :
    ? [X1: human] : ( owner_of(X0) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',human_owner) ).

tff(f2,axiom,
    jon = owner_of(cat_to_animal(garfield)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',jon_owns_garfield) ).

tff(f3,axiom,
    jon = owner_of(dog_to_animal(odie)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',jon_owns_odie) ).

tff(f5,axiom,
    ! [X2: cat,X3: dog] :
      ( chased(X3,X2)
     => hates(owner_of(cat_to_animal(X2)),owner_of(dog_to_animal(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dog_chase_cat) ).

tff(f6,axiom,
    chased(odie,garfield),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odie_chased_garfield) ).

tff(f7,conjecture,
    hates(jon,jon),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',jon_hates_jon) ).

tff(f8,negated_conjecture,
    ~ hates(jon,jon),
    inference(negated_conjecture,[],[f7]) ).

tff(f9,plain,
    ! [X0: cat,X1: dog] :
      ( chased(X1,X0)
     => hates(owner_of(cat_to_animal(X0)),owner_of(dog_to_animal(X1))) ),
    inference(rectify,[],[f5]) ).

tff(f10,plain,
    ~ hates(jon,jon),
    inference(flattening,[],[f8]) ).

tff(f13,plain,
    ! [X0: cat,X1: dog] :
      ( hates(owner_of(cat_to_animal(X0)),owner_of(dog_to_animal(X1)))
      | ~ chased(X1,X0) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f14,plain,
    ! [X0: animal] :
      ( ? [X1: human] : ( owner_of(X0) = X1 )
     => ( owner_of(X0) = sK0(X0) ) ),
    introduced(choice_axiom,[]) ).

tff(f15,plain,
    ! [X0: animal] : ( owner_of(X0) = sK0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f14]) ).

tff(f16,plain,
    ! [X0: animal] : ( owner_of(X0) = sK0(X0) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f17,plain,
    jon = owner_of(cat_to_animal(garfield)),
    inference(cnf_transformation,[],[f2]) ).

tff(f18,plain,
    jon = owner_of(dog_to_animal(odie)),
    inference(cnf_transformation,[],[f3]) ).

tff(f20,plain,
    ! [X0: cat,X1: dog] :
      ( hates(owner_of(cat_to_animal(X0)),owner_of(dog_to_animal(X1)))
      | ~ chased(X1,X0) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f21,plain,
    chased(odie,garfield),
    inference(cnf_transformation,[],[f6]) ).

tff(f22,plain,
    ~ hates(jon,jon),
    inference(cnf_transformation,[],[f10]) ).

tff(f23,plain,
    jon = sK0(cat_to_animal(garfield)),
    inference(definition_unfolding,[],[f17,f16]) ).

tff(f24,plain,
    jon = sK0(dog_to_animal(odie)),
    inference(definition_unfolding,[],[f18,f16]) ).

tff(f26,plain,
    ! [X0: cat,X1: dog] :
      ( hates(sK0(cat_to_animal(X0)),sK0(dog_to_animal(X1)))
      | ~ chased(X1,X0) ),
    inference(definition_unfolding,[],[f20,f16,f16]) ).

cnf(c_49,plain,
    sK0(cat_to_animal(garfield)) = jon,
    inference(cnf_transformation,[],[f23]) ).

cnf(c_50,plain,
    sK0(dog_to_animal(odie)) = jon,
    inference(cnf_transformation,[],[f24]) ).

cnf(c_52,plain,
    ( ~ chased(X0_15,X0_14)
    | hates(sK0(cat_to_animal(X0_14)),sK0(dog_to_animal(X0_15))) ),
    inference(cnf_transformation,[],[f26]) ).

cnf(c_53,plain,
    chased(odie,garfield),
    inference(cnf_transformation,[],[f21]) ).

cnf(c_54,negated_conjecture,
    ~ hates(jon,jon),
    inference(cnf_transformation,[],[f22]) ).

cnf(c_83,plain,
    ( X0_14 != garfield
    | X0_15 != odie
    | hates(sK0(cat_to_animal(X0_14)),sK0(dog_to_animal(X0_15))) ),
    inference(resolution_lifted,[status(thm)],[c_52,c_53]) ).

cnf(c_84,plain,
    hates(sK0(cat_to_animal(garfield)),sK0(dog_to_animal(odie))),
    inference(unflattening,[status(thm)],[c_83]) ).

cnf(c_89,plain,
    ( sK0(cat_to_animal(garfield)) != jon
    | sK0(dog_to_animal(odie)) != jon ),
    inference(resolution_lifted,[status(thm)],[c_54,c_84]) ).

cnf(c_90,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_89,c_49,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ130_1 : TPTP v8.1.2. Released v5.5.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 21:03:11 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.78/1.16  % SZS status Started for theBenchmark.p
% 0.78/1.16  % SZS status Theorem for theBenchmark.p
% 0.78/1.16  
% 0.78/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.78/1.16  
% 0.78/1.16  ------  iProver source info
% 0.78/1.16  
% 0.78/1.16  git: date: 2024-05-02 19:28:25 +0000
% 0.78/1.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.78/1.16  git: non_committed_changes: false
% 0.78/1.16  
% 0.78/1.16  ------ Parsing...
% 0.78/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.78/1.16  
% 0.78/1.16  
% 0.78/1.16  ------ Preprocessing... sup_sim: 0  pe_s  pe:1:0s
% 0.78/1.16  
% 0.78/1.16  % SZS status Theorem for theBenchmark.p
% 0.78/1.16  
% 0.78/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.16  
% 0.78/1.16  
%------------------------------------------------------------------------------