↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n009.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:19 PM UTC 2026

% Result   : Unsatisfiable 3.08s 1.09s
% Output   : Proof 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  11 unt;   0 def)
%            Number of atoms       :  107 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  128 (  61   ~;  67   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   66 (   0 sgn  30   !;   0   ?)

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

fof(f7_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)],[f7]) ).

fof(f7_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)],[f7_nnf]) ).

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

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

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

cnf(f5,negated_conjecture,
    s(c),
    file('/export/starexec/sandbox/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(p83,plain,
    ( r(c,c,c)
    | q(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p55,c5]) ).

cnf(f2,negated_conjecture,
    ( ~ m(X,Y,Z)
    | ~ r(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

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

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

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

cnf(p86,plain,
    ( ~ m(c,c,c)
    | q(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p83,c2]) ).

cnf(f8,negated_conjecture,
    ( n(X,Y,Z)
    | m(X,Y,Z)
    | ~ s(Z)
    | ~ s(Y)
    | ~ s(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

fof(f8_nnf,plain,
    ! [X,Y,Z] :
      ( n(X,Y,Z)
      | m(X,Y,Z)
      | ~ s(Z)
      | ~ s(Y)
      | ~ s(X) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X,Y,Z] :
      ( n(X,Y,Z)
      | m(X,Y,Z)
      | ~ s(Z)
      | ~ s(Y)
      | ~ s(X) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ( n(X0,X1,X2)
    | m(X0,X1,X2)
    | ~ s(X2)
    | ~ s(X1)
    | ~ s(X0) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p9,plain,
    ( n(X0,X0,X1)
    | m(X0,X0,X1)
    | ~ s(X1)
    | ~ s(X0) ),
    inference(factoring,[status(thm)],[c8]) ).

cnf(p15,plain,
    ( n(X0,X0,X0)
    | m(X0,X0,X0)
    | ~ s(X0) ),
    inference(factoring,[status(thm)],[p9]) ).

cnf(p27,plain,
    ( n(c,c,c)
    | m(c,c,c) ),
    inference(resolution,[status(thm)],[p15,c5]) ).

cnf(f6,negated_conjecture,
    ~ n(c,c,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

fof(f6_nnf,plain,
    ~ n(c,c,c),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ~ n(c,c,c),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ~ n(c,c,c),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(p28,plain,
    m(c,c,c),
    inference(resolution,[status(thm)],[p27,c6]) ).

cnf(p89,plain,
    ( q(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p86,p28]) ).

cnf(f1,negated_conjecture,
    ( ~ m(X,Y,Z)
    | ~ q(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

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

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

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

cnf(p90,plain,
    ( ~ m(c,c,c)
    | p(c,c,c) ),
    inference(resolution,[status(thm)],[p89,c1]) ).

cnf(p93,plain,
    p(c,c,c),
    inference(resolution,[status(thm)],[p90,p28]) ).

cnf(f0,negated_conjecture,
    ( ~ m(X,Y,Z)
    | ~ p(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

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

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

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

cnf(p94,plain,
    ~ m(c,c,c),
    inference(resolution,[status(thm)],[p93,c0]) ).

cnf(p95,plain,
    $false,
    inference(resolution,[status(thm)],[p94,p28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN009-4 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.34  % Computer : n009.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Thu Sep 24 23:50:29 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.08/1.09  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.08/1.09  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------