↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n004.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:34:27 PM UTC 2026

% Result   : Unsatisfiable 4.14s 1.11s
% Output   : Proof 4.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   5 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   55 (  24   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f5,negated_conjecture,
    ( ~ f(X,Y)
    | ~ f(Y,z(X,Y))
    | ~ f(a,z(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

fof(f5_nnf,plain,
    ! [X,Y] :
      ( ~ f(X,Y)
      | ~ f(Y,z(X,Y))
      | ~ f(a,z(X,Y)) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X,Y] :
      ( ~ f(X,Y)
      | ~ f(Y,z(X,Y))
      | ~ f(a,z(X,Y)) ),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ( ~ f(X0,X1)
    | ~ f(X1,z(X0,X1))
    | ~ f(a,z(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p28,plain,
    ( ~ f(X0,a)
    | ~ f(a,z(X0,a)) ),
    inference(factoring,[status(thm)],[c5]) ).

cnf(f2,negated_conjecture,
    ( f(X,z(X,Y))
    | f(Y,z(X,Y))
    | f(a,z(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f2_nnf,plain,
    ! [X,Y] :
      ( f(X,z(X,Y))
      | f(Y,z(X,Y))
      | f(a,z(X,Y)) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y] :
      ( f(X,z(X,Y))
      | f(Y,z(X,Y))
      | f(a,z(X,Y)) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( f(X0,z(X0,X1))
    | f(X1,z(X0,X1))
    | f(a,z(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p7,plain,
    ( f(X0,z(X0,a))
    | f(a,z(X0,a)) ),
    inference(factoring,[status(thm)],[c2]) ).

cnf(p13,plain,
    f(a,z(a,a)),
    inference(factoring,[status(thm)],[p7]) ).

cnf(f0,negated_conjecture,
    ( f(z(X,Y),a)
    | ~ f(a,z(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( f(z(X,Y),a)
      | ~ f(a,z(X,Y)) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( f(z(X,Y),a)
      | ~ f(a,z(X,Y)) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( f(z(X0,X1),a)
    | ~ f(a,z(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p16,plain,
    f(z(a,a),a),
    inference(resolution,[status(thm)],[p13,c0]) ).

cnf(f4,negated_conjecture,
    ( ~ f(X,Y)
    | f(Y,z(X,Y))
    | f(a,z(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

fof(f4_nnf,plain,
    ! [X,Y] :
      ( ~ f(X,Y)
      | f(Y,z(X,Y))
      | f(a,z(X,Y)) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X,Y] :
      ( ~ f(X,Y)
      | f(Y,z(X,Y))
      | f(a,z(X,Y)) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( ~ f(X0,X1)
    | f(X1,z(X0,X1))
    | f(a,z(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p6,plain,
    ( ~ f(X0,a)
    | f(a,z(X0,a)) ),
    inference(factoring,[status(thm)],[c4]) ).

cnf(p18,plain,
    f(a,z(z(a,a),a)),
    inference(resolution,[status(thm)],[p16,p6]) ).

cnf(p31,plain,
    ~ f(z(a,a),a),
    inference(resolution,[status(thm)],[p28,p18]) ).

cnf(p33,plain,
    $false,
    inference(resolution,[status(thm)],[p31,p16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN350-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep 25 00:56:22 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.14/1.11  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.14/1.11  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------