↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n013.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 01:00:34 PM UTC 2026

% Result   : Unsatisfiable 59.42s 27.96s
% Output   : Proof 59.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (  32 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-4 aty)
%            Number of variables   :   60 (   2 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f12,hypothesis,
    ( X = Z
    | compose(compose(a,b),Z) != Y
    | compose(compose(a,b),X) != Y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monomorphism) ).

fof(f12_nnf,plain,
    ! [X,Y,Z] :
      ( X = Z
      | compose(compose(a,b),Z) != Y
      | compose(compose(a,b),X) != Y ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X,Y,Z] :
      ( X = Z
      | compose(compose(a,b),Z) != Y
      | compose(compose(a,b),X) != Y ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c12,plain,
    ( X0 = X2
    | compose(compose(a,b),X2) != X1
    | compose(compose(a,b),X0) != X1 ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(t15,plain,
    ifeq(compose(compose(a,b),X1),X2,ifeq(compose(compose(a,b),X3),X2,X1,X3),X3) = X3,
    inference(equality_encoding,[status(esa)],[c12]) ).

cnf(t19,plain,
    ifeq(compose(compose(a,b),X1),X2,ifeq(compose(compose(a,b),X3),X2,X1,X3),X3) = X3,
    inference(orient,[status(thm)],[t15]) ).

cnf(f8,axiom,
    compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_compose) ).

fof(f8_nnf,plain,
    ! [X,Y,Z] : compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X,Y,Z] : compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(t10,plain,
    compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3)),
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t51,plain,
    compose(compose(X1,X2),X3) = compose(X1,compose(X2,X3)),
    inference(orient,[status(thm)],[t10]) ).

cnf(t45019,plain,
    ifeq(compose(a,compose(b,X1)),X2,ifeq(compose(compose(a,b),X3),X2,X1,X3),X3) = X3,
    inference(step,[status(thm)],[t19,t51]) ).

cnf(t45020,plain,
    ifeq(compose(a,compose(b,X1)),X2,ifeq(compose(a,compose(b,X3)),X2,X1,X3),X3) = X3,
    inference(step,[status(thm)],[t45019,t51]) ).

cnf(t57,plain,
    ifeq(compose(a,compose(b,X1)),X2,ifeq(compose(a,compose(b,X3)),X2,X1,X3),X3) = X3,
    inference(rw,[status(thm)],[t45020]) ).

cnf(t3234,plain,
    ifeq(compose(a,compose(b,X1)),X2,ifeq(compose(a,compose(b,X3)),X2,X1,X3),X3) = X3,
    inference(orient,[status(thm)],[t57]) ).

cnf(t5,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t18,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t5]) ).

cnf(t3235,plain,
    X1 = ifeq(compose(a,compose(b,X1)),compose(a,compose(b,X2)),X2,X1),
    inference(cp,[status(thm)],[t3234,t18]) ).

cnf(t29756,plain,
    ifeq(compose(a,compose(b,X1)),compose(a,compose(b,X2)),X2,X1) = X1,
    inference(orient,[status(thm)],[t3235]) ).

cnf(f14,hypothesis,
    compose(b,h) = compose(b,g),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bh_equals_bg) ).

fof(f14_nnf,plain,
    compose(b,h) = compose(b,g),
    inference(nnf_transformation,[status(thm)],[f14]) ).

cnf(c14,plain,
    compose(b,h) = compose(b,g),
    inference(cnf_transformation,[status(esa)],[f14_nnf]) ).

cnf(t4,plain,
    compose(b,h) = compose(b,g),
    inference(equality_encoding,[status(esa)],[c14]) ).

cnf(t58,plain,
    compose(b,g) = compose(b,h),
    inference(orient,[status(thm)],[t4]) ).

cnf(t29780,plain,
    g = ifeq(compose(a,compose(b,h)),compose(a,compose(b,X1)),X1,g),
    inference(cp,[status(thm)],[t29756,t58]) ).

cnf(t44961,plain,
    ifeq(compose(a,compose(b,h)),compose(a,compose(b,X1)),X1,g) = g,
    inference(orient,[status(thm)],[t29780]) ).

cnf(t44962,plain,
    g = h,
    inference(cp,[status(thm)],[t44961,t18]) ).

cnf(t45017,plain,
    g = h,
    inference(orient,[status(thm)],[t44962]) ).

cnf(f15,negated_conjecture,
    h != g,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_h_equals_g) ).

fof(f15_nnf,plain,
    h != g,
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    h != g,
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c15,plain,
    h != g,
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(goal_0,negated_conjecture,
    h != g,
    inference(equality_encoding,[status(esa)],[c15]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CAT001-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/20.37  % Computer : n013.cluster.edu
% 0.08/20.37  % Model    : x86_64 x86_64
% 0.08/20.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/20.37  % Memory   : 8046.5625MB
% 0.08/20.37  % OS       : Linux 6.8.0-71-generic
% 0.08/20.37  % CPULimit : 300
% 0.08/20.37  % WCLimit  : 300
% 0.08/20.37  % DateTime : Fri Sep 25 06:50:02 UTC 2026
% 0.08/20.37  % CPUTime  : 
% 0.08/20.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 59.42/27.96  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 59.42/27.96  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------