↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n012.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:37:44 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f40,conjecture,
    ? [W0] :
      ( sdtasdt0(xc,W0) = xy
      & aElement0(W0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f40_neg,negated_conjecture,
    ~ ? [W0] :
        ( sdtasdt0(xc,W0) = xy
        & aElement0(W0) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f40_nnf,plain,
    ! [W0] :
      ( sdtasdt0(xc,W0) != xy
      | ~ aElement0(W0) ),
    inference(nnf_transformation,[status(thm)],[f40_neg]) ).

fof(f40_sk,plain,
    ! [W0] :
      ( sdtasdt0(xc,W0) != xy
      | ~ aElement0(W0) ),
    inference(skolemisation,[status(esa)],[f40_nnf]) ).

cnf(c112,plain,
    ( sdtasdt0(xc,X0) != xy
    | ~ aElement0(X0) ),
    inference(cnf_transformation,[status(esa)],[f40_sk]) ).

cnf(hi103,negated_conjecture,
    ifeq(aElement0(X0),true,ifeq(sdtasdt0(xc,X0),xy,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c112]) ).

fof(f38,hypothesis,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xy
        & aElement0(W0) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xx
        & aElement0(W0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).

fof(f38_nnf,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xy
        & aElement0(W0) )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [W0] :
        ( sdtasdt0(xc,W0) = xx
        & aElement0(W0) ) ),
    inference(nnf_transformation,[status(thm)],[f38]) ).

fof(f38_sk,plain,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & sdtasdt0(xc,sk21) = xy
    & aElement0(sk21)
    & aElementOf0(xx,slsdtgt0(xc))
    & sdtasdt0(xc,sk20) = xx
    & aElement0(sk20) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk20,sk21])],[f38_nnf]) ).

cnf(c106,plain,
    aElement0(sk21),
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

cnf(hi96,axiom,
    aElement0(sk21) = true,
    inference(equality_encoding,[status(esa)],[c106]) ).

cnf(c107,plain,
    sdtasdt0(xc,sk21) = xy,
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

cnf(hi97,axiom,
    sdtasdt0(xc,sk21) = xy,
    inference(equality_encoding,[status(esa)],[c107]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi103,hi96,hi97]) ).

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

fof(f17,axiom,
    sz10 != sz00,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mUnNeZr) ).

fof(f17_nnf,plain,
    sz10 != sz00,
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    sz10 != sz00,
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c23,plain,
    sz10 != sz00,
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c23,c112]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : RNG102+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.02/0.29  % Computer : n012.cluster.edu
% 0.02/0.29  % Model    : x86_64 x86_64
% 0.02/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29  % Memory   : 8046.5625MB
% 0.02/0.29  % OS       : Linux 6.8.0-71-generic
% 0.02/0.29  % CPULimit : 300
% 0.02/0.29  % WCLimit  : 300
% 0.02/0.29  % DateTime : Thu Sep 24 08:14:35 UTC 2026
% 0.02/0.29  % CPUTime  : 
% 0.02/0.29  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.17/1.02  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.17/1.02  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------