↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n008.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:18 PM UTC 2026

% Result   : Unsatisfiable 0.14s 10.80s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  17 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   57 (  27   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   39 (  12 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,negated_conjecture,
    ( r(X,Y,Z)
    | q(X,Y,Z)
    | p(X,Y,Z)
    | ~ s(Z)
    | ~ s(Y)
    | ~ s(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

fof(f6_nnf,plain,
    ! [X,Y,Z] :
      ( r(X,Y,Z)
      | q(X,Y,Z)
      | p(X,Y,Z)
      | ~ s(Z)
      | ~ s(Y)
      | ~ s(X) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Y,Z] :
      ( r(X,Y,Z)
      | q(X,Y,Z)
      | p(X,Y,Z)
      | ~ s(Z)
      | ~ s(Y)
      | ~ s(X) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( r(X0,X1,X2)
    | q(X0,X1,X2)
    | p(X0,X1,X2)
    | ~ s(X2)
    | ~ s(X1)
    | ~ s(X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(p7,plain,
    ( r(X0,X0,X1)
    | q(X0,X0,X1)
    | p(X0,X0,X1)
    | ~ s(X1)
    | ~ s(X0) ),
    inference(factoring,[status(thm)],[c6]) ).

cnf(p13,plain,
    ( r(X0,X0,X0)
    | q(X0,X0,X0)
    | p(X0,X0,X0)
    | ~ s(X0) ),
    inference(factoring,[status(thm)],[p7]) ).

cnf(f5,negated_conjecture,
    s(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f5_nnf,plain,
    s(c),
    inference(nnf_transformation,[status(thm)],[f5]) ).

cnf(c5,plain,
    s(c),
    inference(cnf_transformation,[status(esa)],[f5_nnf]) ).

cnf(p19,plain,
    ( r(c,c,c)
    | q(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p13,c5]) ).

cnf(f2,negated_conjecture,
    ~ r(X,Y,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f2_nnf,plain,
    ! [X,Y] : ~ r(X,Y,c),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y] : ~ r(X,Y,c),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ r(X0,X1,c),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p23,plain,
    ( q(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p19,c2]) ).

cnf(f1,negated_conjecture,
    ~ q(X,c,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f1_nnf,plain,
    ! [X,Y] : ~ q(X,c,Y),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y] : ~ q(X,c,Y),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ q(X0,c,X1),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p24,plain,
    p(c,c,c),
    inference(resolution,[status(thm)],[p23,c1]) ).

cnf(f0,negated_conjecture,
    ~ p(c,X,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f0_nnf,plain,
    ! [X,Y] : ~ p(c,X,Y),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] : ~ p(c,X,Y),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ~ p(c,X0,X1),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p28,plain,
    $false,
    inference(resolution,[status(thm)],[p24,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/10.38  % Computer : n008.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Thu Sep 24 23:51:08 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/10.80  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/10.80  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------