↑ Up

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

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

% Computer : n018.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 07:07:03 AM UTC 2026

% Result   : Theorem 2.16s 0.89s
% Output   : CNFRefutation 2.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (   8 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   32 (  14   ~;   9   |;   3   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn   7   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax1_64,axiom,
    ! [TERM,INDEPCOL,PRED,DEPCOL] :
      ( ( relationexistsall(PRED,DEPCOL,INDEPCOL)
        & isa(TERM,INDEPCOL) )
     => isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL) ),
    file('theBenchmark.p',ax1_64) ).

fof(ax1_391,axiom,
    ! [TERM] :
      ( shavingrazor_manual(TERM)
     => tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM) ),
    file('theBenchmark.p',ax1_391) ).

fof(ax1_563,axiom,
    ! [X] :
      ( isa(X,c_tptpcol_16_25972)
     => tptpcol_16_25972(X) ),
    file('theBenchmark.p',ax1_563) ).

fof(ax1_913,axiom,
    ! [X] :
      ( shavingrazor_manual(X)
     => isa(X,c_shavingrazor_manual) ),
    file('theBenchmark.p',ax1_913) ).

fof(query116,conjecture,
    ? [X] :
      ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
     => ( tptpcol_16_25972(X)
        & tptp_8_271(X,c_theprototypicalshavingrazor_manual) ) ),
    file('theBenchmark.p',query116) ).

fof(query116_neg,negated_conjecture,
    ~ ? [X] :
        ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
       => ( tptpcol_16_25972(X)
          & tptp_8_271(X,c_theprototypicalshavingrazor_manual) ) ),
    inference(assume_negation,[status(cth)],[query116]) ).

cnf(c_1295,plain,
    ( isa(f_relationexistsallfn(A,C,D,B),D)
    | ~ relationexistsall(C,D,B)
    | ~ isa(A,B) ),
    inference(clausify,[status(thm)],[ax1_64]) ).

fof(ax1_97,axiom,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    file('theBenchmark.p',ax1_97) ).

cnf(c_1312,plain,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    inference(clausify,[status(thm)],[ax1_97]) ).

cnf(c_1491,plain,
    ( tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A)
    | ~ shavingrazor_manual(A) ),
    inference(clausify,[status(thm)],[ax1_391]) ).

fof(ax1_392,axiom,
    relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
    file('theBenchmark.p',ax1_392) ).

cnf(c_1492,plain,
    relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
    inference(clausify,[status(thm)],[ax1_392]) ).

cnf(c_1590,plain,
    ( tptpcol_16_25972(A)
    | ~ isa(A,c_tptpcol_16_25972) ),
    inference(clausify,[status(thm)],[ax1_563]) ).

cnf(c_1811,plain,
    ( isa(A,c_shavingrazor_manual)
    | ~ shavingrazor_manual(A) ),
    inference(clausify,[status(thm)],[ax1_913]) ).

cnf(c_1963,negated_conjecture,
    ( ~ tptpcol_16_25972(A)
    | ~ tptp_8_271(A,c_theprototypicalshavingrazor_manual) ),
    inference(clausify,[status(thm)],[query116_neg]) ).

cnf(c_2134,plain,
    ( ~ tptp_8_271(A,c_theprototypicalshavingrazor_manual)
    | ~ isa(A,c_tptpcol_16_25972) ),
    inference(resolve,[status(thm)],[c_1590,c_1963]) ).

cnf(c_2327,plain,
    ( ~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)
    | ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual) ),
    inference(resolve,[status(thm)],[c_1491,c_2134]) ).

cnf(c_2156,plain,
    ~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
    inference(resolve,[status(thm)],[c_1312,c_2327]) ).

cnf(c_2204,plain,
    isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
    inference(resolve,[status(thm)],[c_1811,c_1312]) ).

cnf(c_2328,plain,
    ( isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,A,B,c_shavingrazor_manual),B)
    | ~ relationexistsall(A,B,c_shavingrazor_manual) ),
    inference(resolve,[status(thm)],[c_1295,c_2204]) ).

cnf(c_2329,plain,
    isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
    inference(resolve,[status(thm)],[c_2328,c_1492]) ).

cnf(c_2326,plain,
    $false,
    inference(resolve,[status(thm)],[c_2156,c_2329]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR066+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n018.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 : Sun Sep 27 00:35:07 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 1765565 was started by sandbox on n018,
% 0.10/0.37  % Sun Sep 27 00:35:07 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.24/0.52  
% 0.24/0.52  % From the command line: assign(max_seconds, 300).
% 0.24/0.52  
% 0.24/0.52  % SInE: 733 to sos, 398 to usable, of 1131 axioms (tolerance 2.00, depth 0 fixpoint).
% 2.16/0.89  
% 2.16/0.89  % SZS status Theorem for theBenchmark
% 2.16/0.89  
% 2.16/0.89  % Proof 1 at 0.26 (+ 0.04) seconds.
% 2.16/0.89  % Length of proof is 16.
% 2.16/0.89  % Level of proof is 4.
% 2.16/0.89  % Maximum clause weight is 124.000.
% 2.16/0.89  % Given clauses 171.
% 2.16/0.89  
% 2.16/0.89  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------