↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO201+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n013.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 : Sun Sep 27 07:17:26 AM UTC 2026

% Result   : Theorem 0.15s 5.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   38 (  14 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   73 (  28   ~;  35   |;   3   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  18   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(apart1,axiom,
    ! [X] : ~ distinct_points(X,X),
    file('theBenchmark.p',apart1) ).

fof(apart3,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('theBenchmark.p',apart3) ).

fof(apart6,axiom,
    ! [X,Y,Z] :
      ( convergent_lines(X,Y)
     => ( convergent_lines(Y,Z)
        | convergent_lines(X,Z) ) ),
    file('theBenchmark.p',apart6) ).

fof(con2,axiom,
    ! [X,Y,Z] :
      ( convergent_lines(X,Y)
     => ( ( apart_point_and_line(Z,Y)
          | apart_point_and_line(Z,X) )
       => distinct_points(Z,intersection_point(X,Y)) ) ),
    file('theBenchmark.p',con2) ).

fof(cu1,axiom,
    ! [X,Y,U,V] :
      ( ( distinct_lines(U,V)
        & distinct_points(X,Y) )
     => ( apart_point_and_line(Y,V)
        | apart_point_and_line(Y,U)
        | apart_point_and_line(X,V)
        | apart_point_and_line(X,U) ) ),
    file('theBenchmark.p',cu1) ).

fof(ceq3,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => distinct_lines(X,Y) ),
    file('theBenchmark.p',ceq3) ).

fof(con,conjecture,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ distinct_points(intersection_point(X,Y),intersection_point(Y,X)) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [X,Y] :
        ( convergent_lines(X,Y)
       => ~ distinct_points(intersection_point(X,Y),intersection_point(Y,X)) ),
    inference(assume_negation,[status(cth)],[con]) ).

cnf(c_14,plain,
    ~ distinct_points(A,A),
    inference(clausify,[status(thm)],[apart1]) ).

cnf(c_16,plain,
    ~ convergent_lines(A,A),
    inference(clausify,[status(thm)],[apart3]) ).

cnf(c_19,plain,
    ( convergent_lines(B,C)
    | convergent_lines(A,C)
    | ~ convergent_lines(A,B) ),
    inference(clausify,[status(thm)],[apart6]) ).

cnf(c_22,plain,
    ( distinct_points(C,intersection_point(A,B))
    | ~ apart_point_and_line(C,A)
    | ~ convergent_lines(A,B) ),
    inference(clausify,[status(thm)],[con2]) ).

cnf(c_23,plain,
    ( distinct_points(C,intersection_point(A,B))
    | ~ apart_point_and_line(C,B)
    | ~ convergent_lines(A,B) ),
    inference(clausify,[status(thm)],[con2]) ).

cnf(c_24,plain,
    ( apart_point_and_line(B,D)
    | apart_point_and_line(B,C)
    | apart_point_and_line(A,D)
    | apart_point_and_line(A,C)
    | ~ distinct_lines(C,D)
    | ~ distinct_points(A,B) ),
    inference(clausify,[status(thm)],[cu1]) ).

cnf(c_27,plain,
    ( distinct_lines(A,B)
    | ~ convergent_lines(A,B) ),
    inference(clausify,[status(thm)],[ceq3]) ).

fof(nnf_13,plain,
    ? [X,Y] :
      ( distinct_points(intersection_point(X,Y),intersection_point(Y,X))
      & convergent_lines(X,Y) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0))
    & convergent_lines(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_13]) ).

cnf(c_28,negated_conjecture,
    convergent_lines(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_29,negated_conjecture,
    distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0)),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_30,plain,
    distinct_lines(sK0,sK1),
    inference(resolve,[status(thm)],[c_28,c_27]) ).

cnf(c_33,plain,
    ( convergent_lines(sK1,A)
    | convergent_lines(sK0,A) ),
    inference(resolve,[status(thm)],[c_28,c_19]) ).

cnf(c_58,negated_conjecture,
    ( distinct_points(A,intersection_point(sK0,sK1))
    | ~ apart_point_and_line(A,sK1) ),
    inference(resolve,[status(thm)],[c_23,c_28]) ).

cnf(c_34,negated_conjecture,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
    inference(resolve,[status(thm)],[c_58,c_14]) ).

cnf(c_59,negated_conjecture,
    ( distinct_points(A,intersection_point(sK0,sK1))
    | ~ apart_point_and_line(A,sK0) ),
    inference(resolve,[status(thm)],[c_22,c_28]) ).

cnf(c_35,negated_conjecture,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
    inference(resolve,[status(thm)],[c_59,c_14]) ).

cnf(c_46,plain,
    ( convergent_lines(A,B)
    | convergent_lines(sK1,B)
    | convergent_lines(sK0,A) ),
    inference(resolve,[status(thm)],[c_33,c_19]) ).

cnf(c_60,plain,
    ( convergent_lines(sK1,sK0)
    | convergent_lines(sK0,sK0) ),
    inference(factor,[status(thm)],[c_46]) ).

cnf(c_47,plain,
    convergent_lines(sK1,sK0),
    inference(resolve,[status(thm)],[c_16,c_60]) ).

cnf(c_61,plain,
    ( distinct_points(A,intersection_point(sK1,sK0))
    | ~ apart_point_and_line(A,sK0) ),
    inference(resolve,[status(thm)],[c_23,c_47]) ).

cnf(c_51,plain,
    ~ apart_point_and_line(intersection_point(sK1,sK0),sK0),
    inference(resolve,[status(thm)],[c_61,c_14]) ).

cnf(c_62,plain,
    ( distinct_points(A,intersection_point(sK1,sK0))
    | ~ apart_point_and_line(A,sK1) ),
    inference(resolve,[status(thm)],[c_22,c_47]) ).

cnf(c_52,plain,
    ~ apart_point_and_line(intersection_point(sK1,sK0),sK1),
    inference(resolve,[status(thm)],[c_62,c_14]) ).

cnf(c_63,plain,
    ( apart_point_and_line(B,sK1)
    | apart_point_and_line(B,sK0)
    | apart_point_and_line(A,sK1)
    | apart_point_and_line(A,sK0)
    | ~ distinct_points(A,B) ),
    inference(resolve,[status(thm)],[c_24,c_30]) ).

cnf(c_64,plain,
    ( apart_point_and_line(A,sK1)
    | apart_point_and_line(A,sK0)
    | apart_point_and_line(intersection_point(sK0,sK1),sK1)
    | ~ distinct_points(intersection_point(sK0,sK1),A) ),
    inference(resolve,[status(thm)],[c_63,c_35]) ).

cnf(c_65,plain,
    ( apart_point_and_line(A,sK1)
    | apart_point_and_line(A,sK0)
    | ~ distinct_points(intersection_point(sK0,sK1),A) ),
    inference(resolve,[status(thm)],[c_64,c_34]) ).

cnf(c_66,plain,
    ( apart_point_and_line(intersection_point(sK1,sK0),sK1)
    | ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0)) ),
    inference(resolve,[status(thm)],[c_65,c_51]) ).

cnf(c_67,plain,
    ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0)),
    inference(resolve,[status(thm)],[c_66,c_52]) ).

cnf(c_57,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_29,c_67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GEO201+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.41  % Computer : n013.cluster.edu
% 0.15/5.41  % Model    : x86_64 x86_64
% 0.15/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.41  % Memory   : 8046.5625MB
% 0.15/5.41  % OS       : Linux 6.8.0-71-generic
% 0.15/5.42  % CPULimit : 300
% 0.15/5.42  % WCLimit  : 300
% 0.15/5.42  % DateTime : Fri Sep 25 13:04:42 UTC 2026
% 0.15/5.42  % CPUTime  : 
% 0.15/5.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/5.42  % Process 487149 was started by sandbox2 on n013,
% 0.15/5.42  % Fri Sep 25 13:04:42 2026
% 0.15/5.42  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.42  
% 0.15/5.42  % From the command line: assign(max_seconds, 300).
% 0.15/5.43  
% 0.15/5.43  % SZS status Theorem for theBenchmark
% 0.15/5.43  
% 0.15/5.43  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.43  % Length of proof is 25.
% 0.15/5.43  % Level of proof is 6.
% 0.15/5.43  % Maximum clause weight is 18.000.
% 0.15/5.43  % Given clauses 28.
% 0.15/5.43  
% 0.15/5.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------