↑ Up

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

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

% Computer : n006.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:44:55 AM UTC 2026

% Result   : Theorem 4.42s 1.03s
% Output   : CNFRefutation 4.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   41 (  13 unt;   0 def)
%            Number of atoms       :  108 (  37 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  116 (  49   ~;  40   |;  14   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   23 (   1 sgn  10   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(dt_k2_funct_1,axiom,
    ! [A] :
      ( ( function(A)
        & relation(A) )
     => ( function(function_inverse(A))
        & relation(function_inverse(A)) ) ),
    file('theBenchmark.p',dt_k2_funct_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [A,B] : subset(A,A),
    file('theBenchmark.p',reflexivity_r1_tarski) ).

fof(t46_relat_1,axiom,
    ! [A] :
      ( relation(A)
     => ! [B] :
          ( relation(B)
         => ( subset(relation_rng(A),relation_dom(B))
           => relation_dom(relation_composition(A,B)) = relation_dom(A) ) ) ),
    file('theBenchmark.p',t46_relat_1) ).

fof(t47_relat_1,axiom,
    ! [A] :
      ( relation(A)
     => ! [B] :
          ( relation(B)
         => ( subset(relation_dom(A),relation_rng(B))
           => relation_rng(relation_composition(B,A)) = relation_rng(A) ) ) ),
    file('theBenchmark.p',t47_relat_1) ).

fof(t55_funct_1,axiom,
    ! [A] :
      ( ( function(A)
        & relation(A) )
     => ( one_to_one(A)
       => ( relation_dom(A) = relation_rng(function_inverse(A))
          & relation_rng(A) = relation_dom(function_inverse(A)) ) ) ),
    file('theBenchmark.p',t55_funct_1) ).

fof(t59_funct_1,conjecture,
    ! [A] :
      ( ( function(A)
        & relation(A) )
     => ( one_to_one(A)
       => ( relation_rng(relation_composition(function_inverse(A),A)) = relation_rng(A)
          & relation_dom(relation_composition(function_inverse(A),A)) = relation_rng(A) ) ) ),
    file('theBenchmark.p',t59_funct_1) ).

fof(t59_funct_1_neg,negated_conjecture,
    ~ ! [A] :
        ( ( function(A)
          & relation(A) )
       => ( one_to_one(A)
         => ( relation_rng(relation_composition(function_inverse(A),A)) = relation_rng(A)
            & relation_dom(relation_composition(function_inverse(A),A)) = relation_rng(A) ) ) ),
    inference(assume_negation,[status(cth)],[t59_funct_1]) ).

cnf(c_41,plain,
    ( relation_rng(A) = relation_dom(function_inverse(A))
    | ~ one_to_one(A)
    | ~ function(A)
    | ~ relation(A) ),
    inference(clausify,[status(thm)],[t55_funct_1]) ).

cnf(c_44,plain,
    ( relation_rng(function_inverse(A)) = relation_dom(A)
    | ~ one_to_one(A)
    | ~ function(A)
    | ~ relation(A) ),
    inference(clausify,[status(thm)],[t55_funct_1]) ).

fof(nnf_40,plain,
    ? [A] :
      ( ( relation_rng(relation_composition(function_inverse(A),A)) != relation_rng(A)
        | relation_rng(A) != relation_dom(relation_composition(function_inverse(A),A)) )
      & one_to_one(A)
      & function(A)
      & relation(A) ),
    inference(fof_nnf,[status(thm)],[t59_funct_1_neg]) ).

fof(sk_t59_funct_1_neg,plain,
    ( ( relation_rng(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0)
      | relation_rng(sK0) != relation_dom(relation_composition(function_inverse(sK0),sK0)) )
    & one_to_one(sK0)
    & function(sK0)
    & relation(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_40]) ).

cnf(c_45,negated_conjecture,
    one_to_one(sK0),
    inference(split_conjunct,[status(thm)],[sk_t59_funct_1_neg]) ).

cnf(c_49,plain,
    ( relation(function_inverse(A))
    | ~ function(A)
    | ~ relation(A) ),
    inference(clausify,[status(thm)],[dt_k2_funct_1]) ).

cnf(c_85,plain,
    subset(A,A),
    inference(clausify,[status(thm)],[reflexivity_r1_tarski]) ).

cnf(c_90,plain,
    ( relation_dom(relation_composition(A,B)) = relation_dom(A)
    | ~ subset(relation_rng(A),relation_dom(B))
    | ~ relation(B)
    | ~ relation(A) ),
    inference(clausify,[status(thm)],[t46_relat_1]) ).

cnf(c_91,plain,
    ( relation_rng(relation_composition(B,A)) = relation_rng(A)
    | ~ subset(relation_dom(A),relation_rng(B))
    | ~ relation(B)
    | ~ relation(A) ),
    inference(clausify,[status(thm)],[t47_relat_1]) ).

cnf(c_97,negated_conjecture,
    relation(sK0),
    inference(split_conjunct,[status(thm)],[sk_t59_funct_1_neg]) ).

cnf(c_98,negated_conjecture,
    function(sK0),
    inference(split_conjunct,[status(thm)],[sk_t59_funct_1_neg]) ).

cnf(c_99,negated_conjecture,
    ( relation_rng(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0)
    | relation_rng(sK0) != relation_dom(relation_composition(function_inverse(sK0),sK0)) ),
    inference(split_conjunct,[status(thm)],[sk_t59_funct_1_neg]) ).

cnf(c_100,negated_conjecture,
    ( relation_rng(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0)
    | relation_dom(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0) ),
    inference(copy,[status(thm)],[c_99]) ).

cnf(c_109,negated_conjecture,
    ( relation_rng(function_inverse(sK0)) = relation_dom(sK0)
    | ~ function(sK0)
    | ~ relation(sK0) ),
    inference(resolve,[status(thm)],[c_45,c_44]) ).

cnf(c_2150,negated_conjecture,
    ( relation_rng(function_inverse(sK0)) = relation_dom(sK0)
    | ~ function(sK0) ),
    inference(resolve,[status(thm)],[c_97,c_109]) ).

cnf(c_110,negated_conjecture,
    relation_rng(function_inverse(sK0)) = relation_dom(sK0),
    inference(resolve,[status(thm)],[c_98,c_2150]) ).

cnf(c_111,negated_conjecture,
    ( relation_rng(sK0) = relation_dom(function_inverse(sK0))
    | ~ function(sK0)
    | ~ relation(sK0) ),
    inference(resolve,[status(thm)],[c_45,c_41]) ).

cnf(c_2151,negated_conjecture,
    ( relation_dom(function_inverse(sK0)) = relation_rng(sK0)
    | ~ function(sK0)
    | ~ relation(sK0) ),
    inference(copy,[status(thm)],[c_111]) ).

cnf(c_2152,negated_conjecture,
    ( relation_dom(function_inverse(sK0)) = relation_rng(sK0)
    | ~ function(sK0) ),
    inference(resolve,[status(thm)],[c_97,c_2151]) ).

cnf(c_112,negated_conjecture,
    relation_dom(function_inverse(sK0)) = relation_rng(sK0),
    inference(resolve,[status(thm)],[c_98,c_2152]) ).

cnf(c_2153,negated_conjecture,
    ( relation(function_inverse(sK0))
    | ~ relation(sK0) ),
    inference(resolve,[status(thm)],[c_98,c_49]) ).

cnf(c_223,negated_conjecture,
    relation(function_inverse(sK0)),
    inference(resolve,[status(thm)],[c_97,c_2153]) ).

cnf(c_2154,plain,
    ( relation_dom(relation_composition(function_inverse(sK0),A)) = relation_dom(function_inverse(sK0))
    | ~ subset(relation_dom(sK0),relation_dom(A))
    | ~ relation(A)
    | ~ relation(function_inverse(sK0)) ),
    inference(paramod,[status(thm)],[c_110,c_90]) ).

cnf(c_2155,plain,
    ( relation_dom(relation_composition(function_inverse(sK0),A)) = relation_rng(sK0)
    | ~ subset(relation_dom(sK0),relation_dom(A))
    | ~ relation(A)
    | ~ relation(function_inverse(sK0)) ),
    inference(paramod,[status(thm)],[c_112,c_2154]) ).

cnf(c_233,plain,
    ( relation_dom(relation_composition(function_inverse(sK0),A)) = relation_rng(sK0)
    | ~ subset(relation_dom(sK0),relation_dom(A))
    | ~ relation(A) ),
    inference(resolve,[status(thm)],[c_223,c_2155]) ).

cnf(c_2156,plain,
    ( relation_dom(relation_composition(function_inverse(sK0),sK0)) = relation_rng(sK0)
    | ~ relation(sK0) ),
    inference(resolve,[status(thm)],[c_233,c_85]) ).

cnf(c_2146,negated_conjecture,
    relation_dom(relation_composition(function_inverse(sK0),sK0)) = relation_rng(sK0),
    inference(resolve,[status(thm)],[c_97,c_2156]) ).

cnf(c_2157,negated_conjecture,
    ( relation_rng(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0)
    | relation_rng(sK0) != relation_rng(sK0) ),
    inference(paramod,[status(thm)],[c_2146,c_100]) ).

cnf(c_2148,negated_conjecture,
    relation_rng(relation_composition(function_inverse(sK0),sK0)) != relation_rng(sK0),
    inference(copy,[status(thm)],[c_2157]) ).

cnf(c_2158,negated_conjecture,
    ( relation_rng(relation_composition(A,sK0)) = relation_rng(sK0)
    | ~ subset(relation_dom(sK0),relation_rng(A))
    | ~ relation(A) ),
    inference(resolve,[status(thm)],[c_91,c_97]) ).

cnf(c_2159,negated_conjecture,
    ( relation_rng(relation_composition(function_inverse(sK0),sK0)) = relation_rng(sK0)
    | ~ subset(relation_dom(sK0),relation_rng(function_inverse(sK0))) ),
    inference(resolve,[status(thm)],[c_2158,c_223]) ).

cnf(c_2160,negated_conjecture,
    ~ subset(relation_dom(sK0),relation_rng(function_inverse(sK0))),
    inference(resolve,[status(thm)],[c_2159,c_2148]) ).

cnf(c_2161,negated_conjecture,
    ~ subset(relation_dom(sK0),relation_dom(sK0)),
    inference(paramod,[status(thm)],[c_110,c_2160]) ).

cnf(c_2149,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_85,c_2161]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU026+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.43  % Computer : n006.cluster.edu
% 0.15/0.43  % Model    : x86_64 x86_64
% 0.15/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43  % Memory   : 8046.5625MB
% 0.15/0.43  % OS       : Linux 6.8.0-71-generic
% 0.15/0.43  % CPULimit : 300
% 0.15/0.43  % WCLimit  : 300
% 0.15/0.43  % DateTime : Sat Sep 26 08:31:10 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.43  % Process 822594 was started by sandbox on n006,
% 0.15/0.43  % Sat Sep 26 08:31:10 2026
% 0.15/0.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.45  
% 0.15/0.45  % From the command line: assign(max_seconds, 300).
% 4.42/1.03  
% 4.42/1.03  % SZS status Theorem for theBenchmark
% 4.42/1.03  
% 4.42/1.03  % Proof 1 at 0.41 (+ 0.12) seconds.
% 4.42/1.03  % Length of proof is 26.
% 4.42/1.03  % Level of proof is 7.
% 4.42/1.03  % Maximum clause weight is 16.000.
% 4.42/1.03  % Given clauses 382.
% 4.42/1.03  
% 4.42/1.03  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------