↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n004.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:11 PM UTC 2026

% Result   : Unsatisfiable 3.64s 0.94s
% Output   : Proof 3.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  21 unt;   0 def)
%            Number of atoms       :   33 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-4 aty)
%            Number of variables   :   24 (  11 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
    ~ p1(X,Y,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ! [X,Y] : ~ p1(X,Y,d),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ! [X,Y] : ~ p1(X,Y,d),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ p1(X0,X1,d),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

cnf(t9,plain,
    eq(p1(X1,X2,d),true) = efalse,
    inference(equality_encoding,[status(esa)],[c368]) ).

cnf(t76,plain,
    eq(p1(X1,X2,d),true) = efalse,
    inference(orient,[status(thm)],[t9]) ).

cnf(f109,axiom,
    ( ~ s0(F)
    | ~ s0(G)
    | p1(F,F,F) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_072) ).

fof(f109_nnf,plain,
    ! [F,G] :
      ( ~ s0(F)
      | ~ s0(G)
      | p1(F,F,F) ),
    inference(nnf_transformation,[status(thm)],[f109]) ).

fof(f109_sk,plain,
    ! [F,G] :
      ( ~ s0(F)
      | ~ s0(G)
      | p1(F,F,F) ),
    inference(skolemisation,[status(esa)],[f109_nnf]) ).

cnf(c109,plain,
    ( ~ s0(X0)
    | ~ s0(X1)
    | p1(X0,X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f109_sk]) ).

cnf(hi108,axiom,
    ifeq(s0(X0),true,ifeq(s0(X1),true,p1(X1,X1,X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c109]) ).

cnf(f0,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f0_nnf,plain,
    s0(d),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    s0(d),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    s0(d) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t6,plain,
    p1(d,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi108,hi0,hi0]) ).

cnf(t71,plain,
    p1(d,d,d) = true,
    inference(orient,[status(thm)],[t6]) ).

cnf(t77,plain,
    efalse = eq(true,true),
    inference(cp,[status(thm)],[t76,t71]) ).

cnf(t0,plain,
    eq(X1,X1) = etrue,
    introduced(definition) ).

cnf(t75,plain,
    eq(X1,X1) = etrue,
    inference(orient,[status(thm)],[t0]) ).

cnf(t85,plain,
    efalse = etrue,
    inference(step,[status(thm)],[t77,t75]) ).

cnf(t78,plain,
    efalse = etrue,
    inference(orient,[status(thm)],[t85]) ).

cnf(goal_0,negated_conjecture,
    etrue != efalse,
    introduced(definition) ).

cnf(g0_0,plain,
    etrue != etrue,
    inference(rw,[status(thm)],[goal_0,t78]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN258-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.38  % Computer : n004.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Fri Sep 25 00:39:36 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.64/0.94  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.64/0.94  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------