↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GEO085-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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 01:17:00 PM UTC 2026

% Result   : Unsatisfiable 4.29s 0.97s
% Output   : Proof 4.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  16 unt;   0 def)
%            Number of atoms       :   68 (  20 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   70 (  42   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-4 aty)
%            Number of variables   :   51 (   2 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f32,axiom,
    ( end_point(ax0_sk7(A),A)
    | ~ open(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',open_defn_33) ).

fof(f32_nnf,plain,
    ! [A] :
      ( end_point(ax0_sk7(A),A)
      | ~ open(A) ),
    inference(nnf_transformation,[status(thm)],[f32]) ).

fof(f32_sk,plain,
    ! [A] :
      ( end_point(ax0_sk7(A),A)
      | ~ open(A) ),
    inference(skolemisation,[status(esa)],[f32_nnf]) ).

cnf(c32,plain,
    ( end_point(ax0_sk7(X0),X0)
    | ~ open(X0) ),
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

cnf(hi27,axiom,
    ifeq(open(X0),true,end_point(ax0_sk7(X0),X0),true) = true,
    inference(equality_encoding,[status(esa)],[c32]) ).

cnf(f48,negated_conjecture,
    open(sk14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_1_67) ).

fof(f48_nnf,plain,
    open(sk14),
    inference(nnf_transformation,[status(thm)],[f48]) ).

cnf(c48,plain,
    open(sk14),
    inference(cnf_transformation,[status(esa)],[f48_nnf]) ).

cnf(hi40,negated_conjecture,
    open(sk14) = true,
    inference(equality_encoding,[status(esa)],[c48]) ).

cnf(h0,plain,
    end_point(ax0_sk7(sk14),sk14) = true,
    inference(hyper_resolution,[status(thm)],[hi27,hi40]) ).

cnf(f40,axiom,
    ( end_point(ax0_sk11(A,B),B)
    | ~ end_point(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c6_41) ).

fof(f40_nnf,plain,
    ! [A,B] :
      ( end_point(ax0_sk11(A,B),B)
      | ~ end_point(A,B) ),
    inference(nnf_transformation,[status(thm)],[f40]) ).

fof(f40_sk,plain,
    ! [A,B] :
      ( end_point(ax0_sk11(A,B),B)
      | ~ end_point(A,B) ),
    inference(skolemisation,[status(esa)],[f40_nnf]) ).

cnf(c40,plain,
    ( end_point(ax0_sk11(X0,X1),X1)
    | ~ end_point(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f40_sk]) ).

cnf(hi35,axiom,
    ifeq(end_point(X0,X1),true,end_point(ax0_sk11(X0,X1),X1),true) = true,
    inference(equality_encoding,[status(esa)],[c40]) ).

cnf(h4,plain,
    end_point(ax0_sk11(ax0_sk7(sk14),sk14),sk14) = true,
    inference(hyper_resolution,[status(thm)],[hi35,h0]) ).

cnf(f49,negated_conjecture,
    ( ~ end_point(B,sk14)
    | ~ end_point(A,sk14)
    | A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_1_68) ).

fof(f49_nnf,plain,
    ! [A,B] :
      ( ~ end_point(B,sk14)
      | ~ end_point(A,sk14)
      | A = B ),
    inference(nnf_transformation,[status(thm)],[f49]) ).

fof(f49_sk,plain,
    ! [A,B] :
      ( ~ end_point(B,sk14)
      | ~ end_point(A,sk14)
      | A = B ),
    inference(skolemisation,[status(esa)],[f49_nnf]) ).

cnf(c49,plain,
    ( ~ end_point(X1,sk14)
    | ~ end_point(X0,sk14)
    | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f49_sk]) ).

cnf(hi41,negated_conjecture,
    ifeq(end_point(X0,sk14),true,ifeq(end_point(X1,sk14),true,X0,X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c49]) ).

cnf(h41,plain,
    ax0_sk7(sk14) = ax0_sk11(ax0_sk7(sk14),sk14),
    inference(hyper_resolution,[status(thm)],[hi41,h0,h4]) ).

cnf(f41,axiom,
    ( A != ax0_sk11(A,B)
    | ~ end_point(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c6_42) ).

fof(f41_nnf,plain,
    ! [A,B] :
      ( A != ax0_sk11(A,B)
      | ~ end_point(A,B) ),
    inference(nnf_transformation,[status(thm)],[f41]) ).

fof(f41_sk,plain,
    ! [A,B] :
      ( A != ax0_sk11(A,B)
      | ~ end_point(A,B) ),
    inference(skolemisation,[status(esa)],[f41_nnf]) ).

cnf(c41,plain,
    ( X0 != ax0_sk11(X0,X1)
    | ~ end_point(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f41_sk]) ).

cnf(hi44,axiom,
    ifeq(end_point(X0,X1),true,ifeq(X0,ax0_sk11(X0,X1),false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c41]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi44,h0,h41]) ).

cnf(t724,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(f21,axiom,
    ( ~ end_point(A,B)
    | ~ inner_point(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inner_point_defn_22) ).

fof(f21_nnf,plain,
    ! [A,B] :
      ( ~ end_point(A,B)
      | ~ inner_point(A,B) ),
    inference(nnf_transformation,[status(thm)],[f21]) ).

fof(f21_sk,plain,
    ! [A,B] :
      ( ~ end_point(A,B)
      | ~ inner_point(A,B) ),
    inference(skolemisation,[status(esa)],[f21_nnf]) ).

cnf(c21,plain,
    ( ~ end_point(X0,X1)
    | ~ inner_point(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f21_sk]) ).

cnf(f30,axiom,
    ( ~ end_point(B,A)
    | ~ closed(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',closed_defn_31) ).

fof(f30_nnf,plain,
    ! [A,B] :
      ( ~ end_point(B,A)
      | ~ closed(A) ),
    inference(nnf_transformation,[status(thm)],[f30]) ).

fof(f30_sk,plain,
    ! [A,B] :
      ( ~ end_point(B,A)
      | ~ closed(A) ),
    inference(skolemisation,[status(esa)],[f30_nnf]) ).

cnf(c30,plain,
    ( ~ end_point(X1,X0)
    | ~ closed(X0) ),
    inference(cnf_transformation,[status(esa)],[f30_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c21,c30,c41]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO085-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.34  % Computer : n001.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Wed Sep 23 10:52:21 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.29/0.97  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.29/0.97  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------