↑ Up

FindProof---0.1.THM-Prf.s

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

% 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 : Fri Sep 25 03:32:04 PM UTC 2026

% Result   : Theorem 17.22s 2.95s
% Output   : Proof 17.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   43 (  43 unt;   0 def)
%            Number of atoms       :   43 (  42 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    9 (   9   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   2 con; 0-2 aty)
%            Number of variables   :   63 (  11 sgn  35   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f49,axiom,
    ! [E] : opt(x(n(z),E)) = E,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_050) ).

fof(f49_nnf,plain,
    ! [E] : opt(x(n(z),E)) = E,
    inference(nnf_transformation,[status(thm)],[f49]) ).

fof(f49_sk,plain,
    ! [E] : opt(x(n(z),E)) = E,
    inference(skolemisation,[status(esa)],[f49_nnf]) ).

cnf(c49,plain,
    opt(x(n(z),X0)) = X0,
    inference(cnf_transformation,[status(esa)],[f49_sk]) ).

fof(f38,axiom,
    ! [Y] : d(n(Y)) = n(z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_039) ).

fof(f38_nnf,plain,
    ! [Y] : d(n(Y)) = n(z),
    inference(nnf_transformation,[status(thm)],[f38]) ).

fof(f38_sk,plain,
    ! [Y] : d(n(Y)) = n(z),
    inference(skolemisation,[status(esa)],[f38_nnf]) ).

cnf(c38,plain,
    d(n(X0)) = n(z),
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

fof(f39,axiom,
    ! [F,G] : d(x(F,G)) = x(d(F),d(G)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_040) ).

fof(f39_nnf,plain,
    ! [F,G] : d(x(F,G)) = x(d(F),d(G)),
    inference(nnf_transformation,[status(thm)],[f39]) ).

fof(f39_sk,plain,
    ! [F,G] : d(x(F,G)) = x(d(F),d(G)),
    inference(skolemisation,[status(esa)],[f39_nnf]) ).

cnf(c39,plain,
    d(x(X0,X1)) = x(d(X0),d(X1)),
    inference(cnf_transformation,[status(esa)],[f39_sk]) ).

cnf(p138,plain,
    d(x(n(X0),X1)) = x(n(z),d(X1)),
    inference(superposition,[status(thm)],[c38,c39]) ).

fof(f53,conjecture,
    ? [E] : opt(d(E)) != opt(d(opt(E))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_054) ).

fof(f53_neg,negated_conjecture,
    ~ ? [E] : opt(d(E)) != opt(d(opt(E))),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f53_nnf,plain,
    ! [E] : opt(d(E)) = opt(d(opt(E))),
    inference(nnf_transformation,[status(thm)],[f53_neg]) ).

fof(f53_sk,plain,
    ! [E] : opt(d(E)) = opt(d(opt(E))),
    inference(skolemisation,[status(esa)],[f53_nnf]) ).

cnf(c53,plain,
    opt(d(X0)) = opt(d(opt(X0))),
    inference(cnf_transformation,[status(esa)],[f53_sk]) ).

cnf(p96,plain,
    opt(d(x(n(z),X0))) = opt(d(X0)),
    inference(superposition,[status(thm)],[c49,c53]) ).

cnf(p139,plain,
    opt(x(n(z),d(X0))) = opt(d(X0)),
    inference(demodulation,[status(thm)],[p138,p96]) ).

cnf(p248,plain,
    opt(d(X0)) = d(X0),
    inference(superposition,[status(thm)],[p139,c49]) ).

fof(f22,axiom,
    ! [X5,E2] : fail4(X5,E2) = y(opt(X5),opt(E2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).

fof(f22_nnf,plain,
    ! [X5,E2] : fail4(X5,E2) = y(opt(X5),opt(E2)),
    inference(nnf_transformation,[status(thm)],[f22]) ).

fof(f22_sk,plain,
    ! [X5,E2] : fail4(X5,E2) = y(opt(X5),opt(E2)),
    inference(skolemisation,[status(esa)],[f22_nnf]) ).

cnf(c22,plain,
    fail4(X0,X1) = y(opt(X0),opt(X1)),
    inference(cnf_transformation,[status(esa)],[f22_sk]) ).

fof(f5,axiom,
    ! [X,X2] : proj12(y(X,X2)) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).

fof(f5_nnf,plain,
    ! [X,X2] : proj12(y(X,X2)) = X,
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X,X2] : proj12(y(X,X2)) = X,
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    proj12(y(X0,X1)) = X0,
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p100,plain,
    proj12(fail4(X0,X1)) = opt(X0),
    inference(superposition,[status(thm)],[c22,c5]) ).

cnf(p118,plain,
    opt(d(opt(X0))) = opt(d(X0)),
    inference(superposition,[status(thm)],[c53,p100]) ).

cnf(p257,plain,
    d(opt(X0)) = d(X0),
    inference(demodulation,[status(thm)],[p248,p118]) ).

cnf(p293,plain,
    d(X0) = d(x(n(z),X0)),
    inference(superposition,[status(thm)],[c49,p257]) ).

fof(f41,axiom,
    d(x2) = n(s(z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_042) ).

fof(f41_nnf,plain,
    d(x2) = n(s(z)),
    inference(nnf_transformation,[status(thm)],[f41]) ).

cnf(c41,plain,
    d(x2) = n(s(z)),
    inference(cnf_transformation,[status(esa)],[f41_nnf]) ).

fof(f7,axiom,
    ! [X,X2,X3] : n(X) != x(X2,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).

fof(f7_nnf,plain,
    ! [X,X2,X3] : n(X) != x(X2,X3),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,X2,X3] : n(X) != x(X2,X3),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    n(X0) != x(X1,X2),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p56,plain,
    d(x2) != x(X0,X1),
    inference(superposition,[status(thm)],[c41,c7]) ).

cnf(p143,plain,
    d(x2) != d(x(X0,X1)),
    inference(superposition,[status(thm)],[c39,p56]) ).

cnf(p306,plain,
    $false,
    inference(resolution,[status(thm)],[p293,p143]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.37  % Computer : n006.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Thu Sep 24 23:32:42 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 17.22/2.95  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.22/2.95  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------