↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : NUM434+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n016.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 : Fri Sep 25 02:20:01 PM UTC 2026

% Result   : Theorem 1.99s 12.40s
% Output   : Proof 1.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  13 unt;   1 def)
%            Number of atoms       :   87 (  39 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   96 (  37   ~;  17   |;  40   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn  10   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,conjecture,
    ? [W0] :
      ( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
      & aInteger0(W0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

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

fof(f24_nnf,plain,
    ! [W0] :
      ( sdtasdt0(sdtasdt0(xp,xq),W0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(W0) ),
    inference(nnf_transformation,[status(thm)],[f24_neg]) ).

fof(f24_sk,plain,
    ! [W0] :
      ( sdtasdt0(sdtasdt0(xp,xq),W0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(W0) ),
    inference(skolemisation,[status(esa)],[f24_nnf]) ).

cnf(c44,plain,
    ( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X0) ),
    inference(cnf_transformation,[status(esa)],[f24_sk]) ).

cnf(hi43,negated_conjecture,
    ifeq(aInteger0(X0),true,ifeq(sdtasdt0(sdtasdt0(xp,xq),X0),sdtpldt0(xa,smndt0(xb)),false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c44]) ).

fof(f23,hypothesis,
    ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
    & aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    & ? [W0] :
        ( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) )
    & sdtasdt0(xp,xq) != sz00 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1003) ).

fof(f23_nnf,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
    & aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    & ? [W0] :
        ( sdtasdt0(sdtasdt0(xp,xq),W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) )
    & sdtasdt0(xp,xq) != sz00 ),
    inference(nnf_transformation,[status(thm)],[f23]) ).

fof(f23_sk,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
    & aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    & sdtasdt0(sdtasdt0(xp,xq),sk1) = sdtpldt0(xa,smndt0(xb))
    & aInteger0(sk1)
    & sdtasdt0(xp,xq) != sz00 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f23_nnf]) ).

cnf(c40,plain,
    aInteger0(sk1),
    inference(cnf_transformation,[status(esa)],[f23_sk]) ).

cnf(hi35,axiom,
    aInteger0(sk1) = true,
    inference(equality_encoding,[status(esa)],[c40]) ).

cnf(c41,plain,
    sdtasdt0(sdtasdt0(xp,xq),sk1) = sdtpldt0(xa,smndt0(xb)),
    inference(cnf_transformation,[status(esa)],[f23_sk]) ).

cnf(hi36,axiom,
    sdtasdt0(sdtasdt0(xp,xq),sk1) = sdtpldt0(xa,smndt0(xb)),
    inference(equality_encoding,[status(esa)],[c41]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi43,hi35,hi36]) ).

cnf(t2176,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

fof(f17,definition,
    ! [W0] :
      ( aInteger0(W0)
     => ! [W1] :
          ( aDivisorOf0(W1,W0)
        <=> ( ? [W2] :
                ( sdtasdt0(W1,W2) = W0
                & aInteger0(W2) )
            & W1 != sz00
            & aInteger0(W1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).

fof(f17_nnf,plain,
    ! [W0] :
      ( ! [W1] :
          ( ( ! [W2] :
                ( sdtasdt0(W1,W2) != W0
                | ~ aInteger0(W2) )
            | W1 = sz00
            | ~ aInteger0(W1)
            | aDivisorOf0(W1,W0) )
          & ( ( ? [W2] :
                  ( sdtasdt0(W1,W2) = W0
                  & aInteger0(W2) )
              & W1 != sz00
              & aInteger0(W1) )
            | ~ aDivisorOf0(W1,W0) ) )
      | ~ aInteger0(W0) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [W0,W1,W2] :
      ( ( ( sdtasdt0(W1,W2) != W0
          | ~ aInteger0(W2)
          | W1 = sz00
          | ~ aInteger0(W1)
          | aDivisorOf0(W1,W0) )
        & ( ( sdtasdt0(W1,sk0(W0,W1)) = W0
            & aInteger0(sk0(W0,W1))
            & W1 != sz00
            & aInteger0(W1) )
          | ~ aDivisorOf0(W1,W0) ) )
      | ~ aInteger0(W0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f17_nnf]) ).

cnf(c24,plain,
    ( X1 != sz00
    | ~ aDivisorOf0(X1,X0)
    | ~ aInteger0(X0) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

fof(f22,hypothesis,
    ( xq != sz00
    & aInteger0(xq)
    & xp != sz00
    & aInteger0(xp)
    & aInteger0(xb)
    & aInteger0(xa) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).

fof(f22_nnf,plain,
    ( xq != sz00
    & aInteger0(xq)
    & xp != sz00
    & aInteger0(xp)
    & aInteger0(xb)
    & aInteger0(xa) ),
    inference(nnf_transformation,[status(thm)],[f22]) ).

fof(f22_sk,plain,
    ( xq != sz00
    & aInteger0(xq)
    & xp != sz00
    & aInteger0(xp)
    & aInteger0(xb)
    & aInteger0(xa) ),
    inference(skolemisation,[status(esa)],[f22_nnf]) ).

cnf(c36,plain,
    xp != sz00,
    inference(cnf_transformation,[status(esa)],[f22_sk]) ).

cnf(c38,plain,
    xq != sz00,
    inference(cnf_transformation,[status(esa)],[f22_sk]) ).

cnf(c39,plain,
    sdtasdt0(xp,xq) != sz00,
    inference(cnf_transformation,[status(esa)],[f23_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c24,c36,c38,c39,c44]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t2176]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM434+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/10.40  % Computer : n016.cluster.edu
% 0.11/10.40  % Model    : x86_64 x86_64
% 0.11/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.40  % Memory   : 8046.5625MB
% 0.11/10.40  % OS       : Linux 6.8.0-71-generic
% 0.11/10.40  % CPULimit : 300
% 0.11/10.40  % WCLimit  : 300
% 0.11/10.40  % DateTime : Thu Sep 24 04:02:38 UTC 2026
% 0.11/10.40  % CPUTime  : 
% 0.11/10.40  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.99/12.40  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.99/12.40  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------