↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n026.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:28 PM UTC 2026

% Result   : Unsatisfiable 4.34s 6.38s
% Output   : Proof 4.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   77 (  36   ~;  41   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   2 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f3,negated_conjecture,
    ( f(b,Y2)
    | ~ f(Y1,Y2)
    | ~ g(Y2,z(Y1,Y2))
    | ~ g(b,z(Y1,Y2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

fof(f3_nnf,plain,
    ! [Y1,Y2] :
      ( f(b,Y2)
      | ~ f(Y1,Y2)
      | ~ g(Y2,z(Y1,Y2))
      | ~ g(b,z(Y1,Y2)) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [Y1,Y2] :
      ( f(b,Y2)
      | ~ f(Y1,Y2)
      | ~ g(Y2,z(Y1,Y2))
      | ~ g(b,z(Y1,Y2)) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( f(b,X1)
    | ~ f(X0,X1)
    | ~ g(X1,z(X0,X1))
    | ~ g(b,z(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p13,plain,
    ( f(b,b)
    | ~ f(X0,b)
    | ~ g(b,z(X0,b)) ),
    inference(factoring,[status(thm)],[c3]) ).

cnf(f2,negated_conjecture,
    ( f(b,Y2)
    | ~ f(Y1,Y2)
    | g(Y2,z(Y1,Y2))
    | g(b,z(Y1,Y2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

fof(f2_nnf,plain,
    ! [Y1,Y2] :
      ( f(b,Y2)
      | ~ f(Y1,Y2)
      | g(Y2,z(Y1,Y2))
      | g(b,z(Y1,Y2)) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [Y1,Y2] :
      ( f(b,Y2)
      | ~ f(Y1,Y2)
      | g(Y2,z(Y1,Y2))
      | g(b,z(Y1,Y2)) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

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

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

cnf(f0,negated_conjecture,
    f(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

fof(f0_nnf,plain,
    f(a,b),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    f(a,b),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(p14,plain,
    ( f(b,b)
    | g(b,z(a,b)) ),
    inference(resolution,[status(thm)],[p7,c0]) ).

cnf(p16,plain,
    ( f(b,b)
    | f(b,b)
    | ~ f(a,b) ),
    inference(resolution,[status(thm)],[p13,p14]) ).

cnf(p17,plain,
    ( f(b,b)
    | ~ f(a,b) ),
    inference(factoring,[status(thm)],[p16]) ).

cnf(p18,plain,
    f(b,b),
    inference(resolution,[status(thm)],[p17,c0]) ).

cnf(f6,negated_conjecture,
    ( ~ f(Y1,Y2)
    | ~ f(b,Y1)
    | ~ f(a,Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

fof(f6_nnf,plain,
    ! [Y1,Y2] :
      ( ~ f(Y1,Y2)
      | ~ f(b,Y1)
      | ~ f(a,Y1) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [Y1,Y2] :
      ( ~ f(Y1,Y2)
      | ~ f(b,Y1)
      | ~ f(a,Y1) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ f(X0,X1)
    | ~ f(b,X0)
    | ~ f(a,X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(p10,plain,
    ( ~ f(b,b)
    | ~ f(a,b) ),
    inference(factoring,[status(thm)],[c6]) ).

cnf(p12,plain,
    ~ f(b,b),
    inference(resolution,[status(thm)],[p10,c0]) ).

cnf(p19,plain,
    $false,
    inference(resolution,[status(thm)],[p18,p12]) ).

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