↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GEO207+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n018.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:29 PM UTC 2026

% Result   : Theorem 4.17s 0.96s
% Output   : Proof 4.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  32 unt;   0 def)
%            Number of atoms       :   64 (   6 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   69 (  53   ~;  12   |;   0   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   64 (   2 sgn  47   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).

fof(f2_nnf,plain,
    ! [X] : ~ convergent_lines(X,X),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] : ~ convergent_lines(X,X),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi11,axiom,
    ifeq(convergent_lines(X0,X0),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

fof(f17,conjecture,
    ! [X] : ~ convergent_lines(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f17_neg,negated_conjecture,
    ~ ! [X] : ~ convergent_lines(X,X),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f17_nnf,plain,
    ? [X] : convergent_lines(X,X),
    inference(nnf_transformation,[status(thm)],[f17_neg]) ).

fof(f17_sk,plain,
    convergent_lines(sk0,sk0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f17_nnf]) ).

cnf(c17,plain,
    convergent_lines(sk0,sk0),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(hi8,negated_conjecture,
    convergent_lines(sk0,sk0) = true,
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi11,hi8]) ).

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

fof(f0,axiom,
    ! [X] : ~ distinct_points(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart1) ).

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

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

cnf(c0,plain,
    ~ distinct_points(X0,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f1,axiom,
    ! [X] : ~ distinct_lines(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart2) ).

fof(f1_nnf,plain,
    ! [X] : ~ distinct_lines(X,X),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X] : ~ distinct_lines(X,X),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ distinct_lines(X0,X0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

fof(f6,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(X,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci1) ).

fof(f6_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(X,line_connecting(X,Y))
      | ~ distinct_points(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(X,line_connecting(X,Y))
      | ~ distinct_points(X,Y) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ apart_point_and_line(X0,line_connecting(X0,X1))
    | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

fof(f7,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci2) ).

fof(f7_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(Y,line_connecting(X,Y))
      | ~ distinct_points(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(Y,line_connecting(X,Y))
      | ~ distinct_points(X,Y) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ( ~ apart_point_and_line(X1,line_connecting(X0,X1))
    | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

fof(f8,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ apart_point_and_line(intersection_point(X,Y),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci3) ).

fof(f8_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),X)
      | ~ convergent_lines(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),X)
      | ~ convergent_lines(X,Y) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
    | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

fof(f9,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ apart_point_and_line(intersection_point(X,Y),Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci4) ).

fof(f9_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),Y)
      | ~ convergent_lines(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),Y)
      | ~ convergent_lines(X,Y) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
    | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

fof(f14,axiom,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cp1) ).

fof(f14_nnf,plain,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [Y,X] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c14,plain,
    ~ convergent_lines(parallel_through_point(X1,X0),X1),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

fof(f15,axiom,
    ! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cp2) ).

fof(f15_nnf,plain,
    ! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c15,plain,
    ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c0,c1,c2,c6,c7,c8,c9,c14,c15]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO207+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35  % Computer : n018.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Wed Sep 23 11:31:17 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.17/0.96  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.17/0.96  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------