↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 15.15s 2.39s
% Output   : Proof 15.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   43 (  43 unt;   0 def)
%            Number of atoms       :   43 (  30 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   19 (  19   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(t61,axiom,
    sF1 = ifeq(u,v,false,true),
    introduced(definition) ).

cnf(t60,axiom,
    sF0 = eq(u,v),
    introduced(definition) ).

cnf(f49,negated_conjecture,
    u != v,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_u_is_v) ).

fof(f49_nnf,plain,
    u != v,
    inference(nnf_transformation,[status(thm)],[f49]) ).

fof(f49_sk,plain,
    u != v,
    inference(skolemisation,[status(esa)],[f49_nnf]) ).

cnf(c49,plain,
    u != v,
    inference(cnf_transformation,[status(esa)],[f49_sk]) ).

cnf(t1,plain,
    eq(u,v) = false,
    inference(equality_encoding,[status(esa)],[c49]) ).

cnf(t63,plain,
    eq(u,v) = false,
    inference(orient,[status(thm)],[t1]) ).

cnf(t9801,plain,
    sF0 = false,
    inference(step,[status(thm)],[t60,t63]) ).

cnf(t68,plain,
    false = sF0,
    inference(orient,[status(thm)],[t9801]) ).

cnf(t9811,plain,
    sF1 = ifeq(u,v,sF0,true),
    inference(step,[status(thm)],[t61,t68]) ).

cnf(t19,plain,
    ifeq(u,v,false,true) = true,
    inference(equality_encoding,[status(esa)],[c49]) ).

cnf(t9810,plain,
    ifeq(u,v,sF0,true) = true,
    inference(step,[status(thm)],[t19,t68]) ).

cnf(t89,plain,
    ifeq(u,v,sF0,true) = true,
    inference(orient,[status(thm)],[t9810]) ).

cnf(t9812,plain,
    sF1 = true,
    inference(step,[status(thm)],[t9811,t89]) ).

cnf(t90,plain,
    true = sF1,
    inference(orient,[status(thm)],[t9812]) ).

cnf(t9802,plain,
    eq(u,v) = sF0,
    inference(step,[status(thm)],[t63,t68]) ).

cnf(t69,plain,
    eq(u,v) = sF0,
    inference(orient,[status(thm)],[t9802]) ).

cnf(t9185,plain,
    eq(v,v) = sF0,
    inference(rw,[status(thm)],[t69]) ).

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

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

cnf(t9813,plain,
    eq(X1,X1) = sF1,
    inference(step,[status(thm)],[t62,t90]) ).

cnf(t91,plain,
    eq(X1,X1) = sF1,
    inference(orient,[status(thm)],[t9813]) ).

cnf(t10530,plain,
    sF1 = sF0,
    inference(step,[status(thm)],[t9185,t91]) ).

cnf(t9463,plain,
    sF1 = sF0,
    inference(orient,[status(thm)],[t10530]) ).

cnf(t10543,plain,
    true = sF0,
    inference(step,[status(thm)],[t90,t9463]) ).

cnf(t9476,plain,
    true = sF0,
    inference(orient,[status(thm)],[t10543]) ).

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,c49]) ).

cnf(g0_0,plain,
    sF0 != false,
    inference(rw,[status(thm)],[goal_0,t9476]) ).

cnf(g0_1,plain,
    sF0 != sF0,
    inference(rw,[status(thm)],[g0_0,t68]) ).

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

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