↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 6.17s 6.29s
% Output   : Proof 6.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  16 unt;   0 def)
%            Number of atoms       :   36 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-4 aty)
%            Number of variables   :   25 (   9 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(h1,plain,
    p1(d,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi108,hi0,hi0]) ).

cnf(f174,axiom,
    ( ~ p1(B,C,A)
    | n2(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).

fof(f174_nnf,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(nnf_transformation,[status(thm)],[f174]) ).

fof(f174_sk,plain,
    ! [A,B,C] :
      ( ~ p1(B,C,A)
      | n2(A) ),
    inference(skolemisation,[status(esa)],[f174_nnf]) ).

cnf(c174,plain,
    ( ~ p1(X1,X2,X0)
    | n2(X0) ),
    inference(cnf_transformation,[status(esa)],[f174_sk]) ).

cnf(hi171,axiom,
    ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
    inference(equality_encoding,[status(esa)],[c174]) ).

cnf(t5,plain,
    n2(d) = true,
    inference(hyper_resolution,[status(thm)],[hi171,h1]) ).

cnf(t351,plain,
    n2(d) = true,
    inference(orient,[status(thm)],[t5]) ).

cnf(f368,negated_conjecture,
    ~ n2(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ n2(d),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ n2(d),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

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

cnf(goal_0,negated_conjecture,
    n2(d) != true,
    inference(equality_encoding,[status(esa)],[c368]) ).

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

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

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