↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : PUZ130+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:23:21 AM UTC 2026

% Result   : Theorem 0.10s 0.40s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  23 unt;   0 def)
%            Number of atoms       :   62 (   8 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   44 (  19   ~;  17   |;   2   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   15 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(dog_pet_type,axiom,
    ! [A] :
      ( dog(A)
     => pet(A) ),
    file('theBenchmark.p',dog_pet_type) ).

fof(cat_pet_type,axiom,
    ! [A] :
      ( cat(A)
     => pet(A) ),
    file('theBenchmark.p',cat_pet_type) ).

fof(cat_chase_axiom,axiom,
    ! [X,Y] :
      ( ( dog(Y)
        & cat(X) )
     => ( chased(Y,X)
       => hates(owner_of(X),owner_of(Y)) ) ),
    file('theBenchmark.p',cat_chase_axiom) ).

fof(owner_def,axiom,
    ! [X,Y] :
      ( ( pet(Y)
        & human(X) )
     => ( owner(X,Y)
      <=> X = owner_of(Y) ) ),
    file('theBenchmark.p',owner_def) ).

fof(jon_conjecture,conjecture,
    hates(jon,jon),
    file('theBenchmark.p',jon_conjecture) ).

fof(jon_conjecture_neg,negated_conjecture,
    ~ hates(jon,jon),
    inference(assume_negation,[status(cth)],[jon_conjecture]) ).

cnf(c_14,plain,
    ( pet(A)
    | ~ cat(A) ),
    inference(clausify,[status(thm)],[cat_pet_type]) ).

fof(garfield_type,axiom,
    cat(garfield),
    file('theBenchmark.p',garfield_type) ).

cnf(c_15,plain,
    cat(garfield),
    inference(clausify,[status(thm)],[garfield_type]) ).

cnf(c_18,plain,
    ( hates(owner_of(A),owner_of(B))
    | ~ chased(B,A)
    | ~ dog(B)
    | ~ cat(A) ),
    inference(clausify,[status(thm)],[cat_chase_axiom]) ).

cnf(c_21,plain,
    ( hates(owner_of(garfield),owner_of(A))
    | ~ chased(A,garfield)
    | ~ dog(A) ),
    inference(resolve,[status(thm)],[c_18,c_15]) ).

cnf(c_23,plain,
    ( pet(A)
    | ~ dog(A) ),
    inference(clausify,[status(thm)],[dog_pet_type]) ).

fof(odie_type,axiom,
    dog(odie),
    file('theBenchmark.p',odie_type) ).

cnf(c_24,plain,
    dog(odie),
    inference(clausify,[status(thm)],[odie_type]) ).

cnf(c_29,plain,
    pet(odie),
    inference(resolve,[status(thm)],[c_24,c_23]) ).

cnf(c_33,plain,
    ( owner_of(B) = A
    | ~ owner(A,B)
    | ~ pet(B)
    | ~ human(A) ),
    inference(clausify,[status(thm)],[owner_def]) ).

cnf(c_35,plain,
    pet(garfield),
    inference(resolve,[status(thm)],[c_14,c_15]) ).

cnf(c_48,plain,
    ( owner_of(garfield) = A
    | ~ owner(A,garfield)
    | ~ human(A) ),
    inference(resolve,[status(thm)],[c_35,c_33]) ).

cnf(c_55,plain,
    ( owner_of(odie) = A
    | ~ owner(A,odie)
    | ~ human(A) ),
    inference(resolve,[status(thm)],[c_33,c_29]) ).

fof(jon_type,axiom,
    human(jon),
    file('theBenchmark.p',jon_type) ).

cnf(c_66,plain,
    human(jon),
    inference(clausify,[status(thm)],[jon_type]) ).

cnf(c_92,plain,
    ( owner_of(garfield) = jon
    | ~ owner(jon,garfield) ),
    inference(resolve,[status(thm)],[c_66,c_48]) ).

cnf(c_100,plain,
    ( owner_of(odie) = jon
    | ~ owner(jon,odie) ),
    inference(resolve,[status(thm)],[c_66,c_55]) ).

cnf(c_471,plain,
    ( hates(owner_of(garfield),owner_of(odie))
    | ~ chased(odie,garfield) ),
    inference(resolve,[status(thm)],[c_24,c_21]) ).

fof(jon_o_owner_axiom,axiom,
    owner(jon,odie),
    file('theBenchmark.p',jon_o_owner_axiom) ).

cnf(c_480,plain,
    owner(jon,odie),
    inference(clausify,[status(thm)],[jon_o_owner_axiom]) ).

fof(jon_g_owner_axiom,axiom,
    owner(jon,garfield),
    file('theBenchmark.p',jon_g_owner_axiom) ).

cnf(c_481,plain,
    owner(jon,garfield),
    inference(clausify,[status(thm)],[jon_g_owner_axiom]) ).

fof(odie_chase_axiom,axiom,
    chased(odie,garfield),
    file('theBenchmark.p',odie_chase_axiom) ).

cnf(c_486,plain,
    chased(odie,garfield),
    inference(clausify,[status(thm)],[odie_chase_axiom]) ).

cnf(c_487,negated_conjecture,
    ~ hates(jon,jon),
    inference(clausify,[status(thm)],[jon_conjecture_neg]) ).

cnf(c_503,plain,
    owner_of(odie) = jon,
    inference(resolve,[status(thm)],[c_480,c_100]) ).

cnf(c_504,plain,
    owner_of(garfield) = jon,
    inference(resolve,[status(thm)],[c_481,c_92]) ).

cnf(c_505,plain,
    hates(owner_of(garfield),owner_of(odie)),
    inference(resolve,[status(thm)],[c_486,c_471]) ).

cnf(c_551,plain,
    hates(owner_of(garfield),jon),
    inference(paramod,[status(thm)],[c_503,c_505]) ).

cnf(c_554,plain,
    hates(jon,jon),
    inference(paramod,[status(thm)],[c_504,c_551]) ).

cnf(c_553,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_487,c_554]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ130+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n015.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 05:21:13 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 3207177 was started by sandbox on n015,
% 0.10/0.37  % Sat Sep 26 05:21:13 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.10/0.40  
% 0.10/0.40  % SZS status Theorem for theBenchmark
% 0.10/0.40  
% 0.10/0.40  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/0.40  % Length of proof is 29.
% 0.10/0.40  % Level of proof is 7.
% 0.10/0.40  % Maximum clause weight is 18.000.
% 0.10/0.40  % Given clauses 250.
% 0.10/0.40  
% 0.10/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------