↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN321-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 : n015.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:20 PM UTC 2026

% Result   : Unsatisfiable 5.01s 1.19s
% Output   : Proof 5.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   4 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   34 (  17   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (   7 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f2,negated_conjecture,
    ( g(a,U)
    | f(a,b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f2_nnf,plain,
    ! [U] :
      ( g(a,U)
      | f(a,b) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [U] :
      ( g(a,U)
      | f(a,b) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

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

cnf(f1,negated_conjecture,
    ( f(U,b)
    | ~ g(U,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

fof(f1_nnf,plain,
    ! [U] :
      ( f(U,b)
      | ~ g(U,U) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [U] :
      ( f(U,b)
      | ~ g(U,U) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

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

cnf(p4,plain,
    ( f(a,b)
    | f(a,b) ),
    inference(resolution,[status(thm)],[c2,c1]) ).

cnf(p5,plain,
    f(a,b),
    inference(factoring,[status(thm)],[p4]) ).

cnf(f3,negated_conjecture,
    ( ~ g(a,d)
    | ~ f(a,b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

fof(f3_nnf,plain,
    ( ~ g(a,d)
    | ~ f(a,b) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ( ~ g(a,d)
    | ~ f(a,b) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ g(a,d)
    | ~ f(a,b) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p7,plain,
    ~ g(a,d),
    inference(resolution,[status(thm)],[p5,c3]) ).

cnf(f0,negated_conjecture,
    ( g(a,U)
    | ~ f(a,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f0_nnf,plain,
    ! [Z,U] :
      ( g(a,U)
      | ~ f(a,Z) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [Z,U] :
      ( g(a,U)
      | ~ f(a,Z) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

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

cnf(p6,plain,
    g(a,X0),
    inference(resolution,[status(thm)],[p5,c0]) ).

cnf(p8,plain,
    $false,
    inference(resolution,[status(thm)],[p7,p6]) ).

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