↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n004.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:59 PM UTC 2026

% Result   : Unsatisfiable 12.80s 2.12s
% Output   : Proof 12.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   44 (  24 unt;   0 def)
%            Number of atoms       :   64 (  23 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   54 (  34   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   56 (   4 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f2,axiom,
    ( part_of(A,B)
    | ~ incident_c(ax0_sk1(A,B),B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_of_defn_3) ).

fof(f2_nnf,plain,
    ! [A,B] :
      ( part_of(A,B)
      | ~ incident_c(ax0_sk1(A,B),B) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] :
      ( part_of(A,B)
      | ~ incident_c(ax0_sk1(A,B),B) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( part_of(X0,X1)
    | ~ incident_c(ax0_sk1(X0,X1),X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(t24,plain,
    ifeq(incident_c(ax0_sk1(X1,X2),X2),true,part_of(X1,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t79,plain,
    ifeq(incident_c(ax0_sk1(X1,X2),X2),true,part_of(X1,X2),true) = true,
    inference(orient,[status(thm)],[t24]) ).

cnf(f1,axiom,
    ( part_of(A,B)
    | incident_c(ax0_sk1(A,B),A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_of_defn_2) ).

fof(f1_nnf,plain,
    ! [A,B] :
      ( part_of(A,B)
      | incident_c(ax0_sk1(A,B),A) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A,B] :
      ( part_of(A,B)
      | incident_c(ax0_sk1(A,B),A) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( part_of(X0,X1)
    | incident_c(ax0_sk1(X0,X1),X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(t19,plain,
    or(incident_c(ax0_sk1(X1,X2),X1),part_of(X1,X2)) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t105,plain,
    or(incident_c(ax0_sk1(X1,X2),X1),part_of(X1,X2)) = true,
    inference(orient,[status(thm)],[t19]) ).

cnf(f48,negated_conjecture,
    ~ part_of(sk14,sk14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).

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

fof(f48_sk,plain,
    ~ part_of(sk14,sk14),
    inference(skolemisation,[status(esa)],[f48_nnf]) ).

cnf(c48,plain,
    ~ part_of(sk14,sk14),
    inference(cnf_transformation,[status(esa)],[f48_sk]) ).

cnf(t7,plain,
    part_of(sk14,sk14) = false,
    inference(equality_encoding,[status(esa)],[c48]) ).

cnf(t128,plain,
    part_of(sk14,sk14) = false,
    inference(orient,[status(thm)],[t7]) ).

cnf(t129,plain,
    true = or(incident_c(ax0_sk1(sk14,sk14),sk14),false),
    inference(cp,[status(thm)],[t105,t128]) ).

cnf(t3,plain,
    or(X1,false) = X1,
    introduced(definition) ).

cnf(t61,plain,
    or(X1,false) = X1,
    inference(orient,[status(thm)],[t3]) ).

cnf(t227,plain,
    true = incident_c(ax0_sk1(sk14,sk14),sk14),
    inference(step,[status(thm)],[t129,t61]) ).

cnf(t180,plain,
    incident_c(ax0_sk1(sk14,sk14),sk14) = true,
    inference(orient,[status(thm)],[t227]) ).

cnf(t189,plain,
    true = ifeq(true,true,part_of(sk14,sk14),true),
    inference(cp,[status(thm)],[t79,t180]) ).

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

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

cnf(t228,plain,
    true = part_of(sk14,sk14),
    inference(step,[status(thm)],[t189,t58]) ).

cnf(t229,plain,
    true = false,
    inference(step,[status(thm)],[t228,t128]) ).

cnf(t214,plain,
    false = true,
    inference(orient,[status(thm)],[t229]) ).

cnf(f21,axiom,
    ( ~ end_point(A,B)
    | ~ inner_point(A,B) ),
    file('/export/starexec/sandbox2/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/sandbox2/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(f41,axiom,
    ( A != ax0_sk11(A,B)
    | ~ end_point(A,B) ),
    file('/export/starexec/sandbox2/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(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c21,c30,c41,c48]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO080-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n004.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:44:51 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 12.80/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.80/2.12  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------