↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n016.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:49 PM UTC 2026

% Result   : Unsatisfiable 5.33s 1.08s
% Output   : Proof 5.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  34 unt;   0 def)
%            Number of atoms       :   34 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   18 (  18   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-4 aty)
%            Number of variables   :   34 (   4 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f30,negated_conjecture,
    ~ equidistant(v,reflection(u,v),u,v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equidistance) ).

fof(f30_nnf,plain,
    ~ equidistant(v,reflection(u,v),u,v),
    inference(nnf_transformation,[status(thm)],[f30]) ).

fof(f30_sk,plain,
    ~ equidistant(v,reflection(u,v),u,v),
    inference(skolemisation,[status(esa)],[f30_nnf]) ).

cnf(c30,plain,
    ~ equidistant(v,reflection(u,v),u,v),
    inference(cnf_transformation,[status(esa)],[f30_sk]) ).

cnf(u1,axiom,
    equidistant(v,reflection(u,v),u,v) = false,
    inference(equality_encoding,[status(esa)],[c30]) ).

cnf(f18,axiom,
    reflection(U,V) = extension(U,V,U,V),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflection) ).

fof(f18_nnf,plain,
    ! [U,V] : reflection(U,V) = extension(U,V,U,V),
    inference(nnf_transformation,[status(thm)],[f18]) ).

fof(f18_sk,plain,
    ! [U,V] : reflection(U,V) = extension(U,V,U,V),
    inference(skolemisation,[status(esa)],[f18_nnf]) ).

cnf(c18,plain,
    reflection(X0,X1) = extension(X0,X1,X0,X1),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(d0,axiom,
    reflection(X0,X1) = extension(X0,X1,X0,X1),
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(t19,plain,
    equidistant(v,extension(u,v,u,v),u,v) = false,
    inference(definition_unfolding,[status(thm)],[u1,d0]) ).

cnf(f4,axiom,
    equidistant(Y,extension(X,Y,W,V),W,V),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',segment_construction2) ).

fof(f4_nnf,plain,
    ! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t18,plain,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t65,plain,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4) = true,
    inference(orient,[status(thm)],[t18]) ).

cnf(t81,plain,
    true = false,
    inference(step,[status(thm)],[t19,t65]) ).

cnf(t70,plain,
    false = true,
    inference(orient,[status(thm)],[t81]) ).

cnf(f9,axiom,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c9,c10,c11,c30]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO055-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n016.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 10:41:25 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.33/1.08  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.33/1.08  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------