↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MSC006-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 : n017.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 02:13:26 PM UTC 2026

% Result   : Unsatisfiable 6.61s 16.47s
% Output   : Proof 6.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   44 (  15 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   77 (  35   ~;  42   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   69 (   7 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,hypothesis,
    ( q(X,Z)
    | ~ q(Y,Z)
    | ~ q(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_transitivity) ).

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

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

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

cnf(f3,hypothesis,
    ( q(X,Y)
    | p(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_related) ).

fof(f3_nnf,plain,
    ! [X,Y] :
      ( q(X,Y)
      | p(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X,Y] :
      ( q(X,Y)
      | p(X,Y) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( q(X0,X1)
    | p(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(f2,hypothesis,
    ( q(Y,X)
    | ~ q(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_symmetry) ).

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

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

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

cnf(p7,plain,
    ( q(X1,X0)
    | p(X0,X1) ),
    inference(resolution,[status(thm)],[c3,c2]) ).

cnf(p13,plain,
    ( p(X0,X2)
    | q(X2,X1)
    | ~ q(X0,X1) ),
    inference(resolution,[status(thm)],[c1,p7]) ).

cnf(p17,plain,
    ( p(X2,X1)
    | p(X2,X0)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[p13,c3]) ).

cnf(f5,negated_conjecture,
    ~ q(c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_is_total) ).

fof(f5_nnf,plain,
    ~ q(c,d),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ q(c,d),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ~ q(c,d),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p69,plain,
    ( p(X0,d)
    | p(X0,c) ),
    inference(resolution,[status(thm)],[p17,c5]) ).

cnf(f0,hypothesis,
    ( p(X,Z)
    | ~ p(Y,Z)
    | ~ p(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_transitivity) ).

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

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

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

cnf(p76,plain,
    ( p(X0,X1)
    | ~ p(d,X1)
    | p(X0,c) ),
    inference(resolution,[status(thm)],[p69,c0]) ).

cnf(p77,plain,
    ( ~ p(d,c)
    | p(X0,c) ),
    inference(factoring,[status(thm)],[p76]) ).

cnf(p12,plain,
    ( p(X2,X0)
    | q(X2,X1)
    | ~ q(X0,X1) ),
    inference(resolution,[status(thm)],[c1,c3]) ).

cnf(p16,plain,
    ( p(X1,X2)
    | p(X0,X2)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[p12,p7]) ).

cnf(p46,plain,
    ( p(d,X0)
    | p(c,X0) ),
    inference(resolution,[status(thm)],[p16,c5]) ).

cnf(p6,plain,
    p(c,d),
    inference(resolution,[status(thm)],[c3,c5]) ).

cnf(p8,plain,
    ( p(c,X0)
    | ~ p(d,X0) ),
    inference(resolution,[status(thm)],[p6,c0]) ).

cnf(p61,plain,
    ( p(c,X0)
    | p(c,X0) ),
    inference(resolution,[status(thm)],[p46,p8]) ).

cnf(p65,plain,
    p(c,X0),
    inference(factoring,[status(thm)],[p61]) ).

cnf(p9,plain,
    p(d,c),
    inference(resolution,[status(thm)],[p7,c5]) ).

cnf(p10,plain,
    ( p(d,X0)
    | ~ p(c,X0) ),
    inference(resolution,[status(thm)],[p9,c0]) ).

cnf(p75,plain,
    p(d,X0),
    inference(resolution,[status(thm)],[p65,p10]) ).

cnf(p93,plain,
    p(X0,c),
    inference(resolution,[status(thm)],[p77,p75]) ).

cnf(p94,plain,
    ( p(X1,X0)
    | ~ p(c,X0) ),
    inference(resolution,[status(thm)],[p93,c0]) ).

cnf(p98,plain,
    p(X0,X1),
    inference(resolution,[status(thm)],[p94,p65]) ).

cnf(f4,hypothesis,
    ~ p(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_is_not_total) ).

fof(f4_nnf,plain,
    ~ p(a,b),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ~ p(a,b),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ~ p(a,b),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p99,plain,
    $false,
    inference(resolution,[status(thm)],[p98,c4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MSC006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/15.38  % Computer : n017.cluster.edu
% 0.11/15.38  % Model    : x86_64 x86_64
% 0.11/15.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.38  % Memory   : 8046.5625MB
% 0.11/15.38  % OS       : Linux 6.8.0-71-generic
% 0.11/15.38  % CPULimit : 300
% 0.11/15.38  % WCLimit  : 300
% 0.11/15.38  % DateTime : Thu Sep 24 01:22:16 UTC 2026
% 0.11/15.39  % CPUTime  : 
% 0.11/15.39  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.61/16.47  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.61/16.47  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------