↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN002-1.007.008 : TPTP v9.3.1. Released v1.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 03:33:17 PM UTC 2026

% Result   : Unsatisfiable 2.72s 0.81s
% Output   : Proof 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   24 (   3 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   35 (  14   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :   18 (   6 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   23 (   2 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
    ( ~ p(f(f(f(f(f(f(f(f(X)))))))))
    | ~ p(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative) ).

fof(f1_nnf,plain,
    ! [X] :
      ( ~ p(f(f(f(f(f(f(f(f(X)))))))))
      | ~ p(X) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X] :
      ( ~ p(f(f(f(f(f(f(f(f(X)))))))))
      | ~ p(X) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ p(f(f(f(f(f(f(f(f(X0)))))))))
    | ~ p(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f0,negated_conjecture,
    ( p(f(f(f(f(f(f(f(X))))))))
    | p(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',positive) ).

fof(f0_nnf,plain,
    ! [X] :
      ( p(f(f(f(f(f(f(f(X))))))))
      | p(X) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] :
      ( p(f(f(f(f(f(f(f(X))))))))
      | p(X) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( p(f(f(f(f(f(f(f(X0))))))))
    | p(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p2,plain,
    ( p(X0)
    | ~ p(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(X0)))))))))))))))) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(p3,plain,
    ( p(f(f(f(f(f(f(f(f(X0)))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p2,c0]) ).

cnf(p4,plain,
    ( ~ p(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(X0)))))))))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p3,c1]) ).

cnf(p5,plain,
    ( p(f(f(f(f(f(f(f(f(f(X0))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p4,c0]) ).

cnf(p7,plain,
    ( p(X0)
    | p(f(f(f(f(f(f(X0))))))) ),
    inference(resolution,[status(thm)],[p5,p2]) ).

cnf(p8,plain,
    ( ~ p(f(f(f(f(f(f(f(f(f(f(f(f(f(f(X0)))))))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p7,c1]) ).

cnf(p6,plain,
    ( ~ p(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(X0))))))))))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p5,c1]) ).

cnf(p9,plain,
    ( p(X0)
    | p(f(f(f(f(f(f(f(f(f(f(X0))))))))))) ),
    inference(resolution,[status(thm)],[p7,p4]) ).

cnf(p11,plain,
    ( p(X0)
    | p(f(f(f(f(f(X0)))))) ),
    inference(resolution,[status(thm)],[p9,p2]) ).

cnf(p14,plain,
    ( p(f(f(f(f(f(f(f(f(f(f(f(f(X0)))))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p6,p11]) ).

cnf(p23,plain,
    ( p(f(f(X0)))
    | p(X0) ),
    inference(resolution,[status(thm)],[p8,p14]) ).

cnf(p24,plain,
    ( ~ p(f(f(f(f(f(f(f(f(f(f(X0)))))))))))
    | p(X0) ),
    inference(resolution,[status(thm)],[p23,c1]) ).

cnf(p27,plain,
    ( p(X0)
    | p(X0) ),
    inference(resolution,[status(thm)],[p24,p9]) ).

cnf(p28,plain,
    p(X0),
    inference(factoring,[status(thm)],[p27]) ).

cnf(p29,plain,
    ~ p(f(f(f(f(f(f(f(f(X0))))))))),
    inference(resolution,[status(thm)],[p28,c1]) ).

cnf(p30,plain,
    $false,
    inference(resolution,[status(thm)],[p29,p28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN002-1.007.008 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 23:54:27 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.72/0.81  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.72/0.81  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------