↑ Up

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

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

% Computer : n014.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:16:58 AM UTC 2026

% Result   : Theorem 0.09s 0.42s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   39 (  14 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   34 (   8   ~;   3   |;  23   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   0   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__853,axiom,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xc))
        & aInteger0(W0) )
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) ) ),
    file('theBenchmark.p',m__853) ).

fof(m__,conjecture,
    ? [W0] :
      ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
      & aInteger0(W0) ),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(nnf_21,plain,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xc))
        & aInteger0(W0) )
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(X0) ) ),
    inference(fof_nnf,[status(thm)],[m__853]) ).

fof(sk_m__853,plain,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & sdtasdt0(xq,sK1) = sdtpldt0(xb,smndt0(xc))
    & aInteger0(sK1)
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdtasdt0(xq,sK0) = sdtpldt0(xa,smndt0(xb))
    & aInteger0(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(W0,sK1)],[nnf_21]) ).

cnf(c_68,plain,
    aInteger0(sK0),
    inference(split_conjunct,[status(thm)],[sk_m__853]) ).

cnf(c_69,plain,
    sdtasdt0(xq,sK0) = sdtpldt0(xa,smndt0(xb)),
    inference(split_conjunct,[status(thm)],[sk_m__853]) ).

cnf(c_70,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK0),
    inference(copy,[status(thm)],[c_69]) ).

cnf(c_80,negated_conjecture,
    ( sdtasdt0(xq,A) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(A) ),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_532,negated_conjecture,
    ( sdtasdt0(xq,A) != sdtasdt0(xq,sK0)
    | ~ aInteger0(A) ),
    inference(paramod,[status(thm)],[c_70,c_80]) ).

cnf(c_81,negated_conjecture,
    ( sdtasdt0(xq,sK0) != sdtasdt0(xq,A)
    | ~ aInteger0(A) ),
    inference(copy,[status(thm)],[c_532]) ).

cnf(c_533,negated_conjecture,
    sdtasdt0(xq,sK0) != sdtasdt0(xq,sK0),
    inference(resolve,[status(thm)],[c_81,c_68]) ).

cnf(c_531,negated_conjecture,
    $false,
    inference(copy,[status(thm)],[c_533]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM429+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n014.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 02:41:18 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.38  % Process 1961602 was started by sandbox on n014,
% 0.09/0.38  % Sat Sep 26 02:41:18 2026
% 0.09/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.09/0.42  
% 0.09/0.42  % SZS status Theorem for theBenchmark
% 0.09/0.42  
% 0.09/0.42  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.09/0.42  % Length of proof is 8.
% 0.09/0.42  % Level of proof is 4.
% 0.09/0.42  % Maximum clause weight is 9.000.
% 0.09/0.42  % Given clauses 45.
% 0.09/0.42  
% 0.09/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------