↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n019.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 01:16:34 PM UTC 2026

% Result   : Unsatisfiable 6.75s 16.72s
% Output   : Proof 6.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (  31 unt;   0 def)
%            Number of atoms       :   43 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  28   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :   50 (   2 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,axiom,
    ( equidistant(Z,V,V2,W)
    | ~ equidistant(X,Y,V2,W)
    | ~ equidistant(X,Y,Z,V) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_for_equidistance) ).

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

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

cnf(c1,plain,
    ( equidistant(X2,X3,X4,X5)
    | ~ equidistant(X0,X1,X4,X5)
    | ~ equidistant(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    ifeq(equidistant(X0,X1,X2,X3),true,ifeq(equidistant(X0,X1,X4,X5),true,equidistant(X2,X3,X4,X5),true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f0,axiom,
    equidistant(X,Y,Y,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_for_equidistance) ).

fof(f0_nnf,plain,
    ! [X,Y] : equidistant(X,Y,Y,X),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] : equidistant(X,Y,Y,X),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    equidistant(X0,X1,X1,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    equidistant(X0,X1,X1,X0) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t9,plain,
    equidistant(X1,X2,X1,X2) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0,hi0]) ).

cnf(t149,plain,
    equidistant(X1,X2,X1,X2) = true,
    inference(orient,[status(thm)],[t9]) ).

cnf(t13,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t45,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t13]) ).

cnf(f9,axiom,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_dimension1) ).

fof(f9_nnf,plain,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(f10,axiom,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_dimension2) ).

fof(f10_nnf,plain,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    inference(nnf_transformation,[status(thm)],[f10]) ).

fof(f10_sk,plain,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    inference(skolemisation,[status(esa)],[f10_nnf]) ).

cnf(c10,plain,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(f11,axiom,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_dimension3) ).

fof(f11_nnf,plain,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(f18,negated_conjecture,
    ~ equidistant(u,v,u,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).

fof(f18_nnf,plain,
    ~ equidistant(u,v,u,v),
    inference(nnf_transformation,[status(thm)],[f18]) ).

fof(f18_sk,plain,
    ~ equidistant(u,v,u,v),
    inference(skolemisation,[status(esa)],[f18_nnf]) ).

cnf(c18,plain,
    ~ equidistant(u,v,u,v),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c9,c10,c11,c18]) ).

cnf(g0_0,plain,
    true != ifeq(equidistant(u,v,u,v),true,false,true),
    inference(rw,[status(thm)],[goal_0]) ).

cnf(g0_1,plain,
    true != ifeq(true,true,false,true),
    inference(rw,[status(thm)],[g0_0,t149]) ).

cnf(g0_2,plain,
    true != false,
    inference(rw,[status(thm)],[g0_1,t45]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/15.61  % Computer : n019.cluster.edu
% 0.12/15.61  % Model    : x86_64 x86_64
% 0.12/15.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.61  % Memory   : 8046.5625MB
% 0.12/15.61  % OS       : Linux 6.8.0-71-generic
% 0.12/15.61  % CPULimit : 300
% 0.12/15.61  % WCLimit  : 300
% 0.12/15.61  % DateTime : Wed Sep 23 10:23:51 UTC 2026
% 0.12/15.61  % CPUTime  : 
% 0.12/15.61  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.75/16.72  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.75/16.72  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------