↑ Up

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

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

% Computer : n010.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:23 AM UTC 2026

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  14 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   57 (  24   ~;  19   |;   6   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  17   !;   3   ?)

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

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

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

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(ceq2,axiom,
    ! [X,Y,Z] :
      ( apart_point_and_line(X,Y)
     => ( apart_point_and_line(X,Z)
        | distinct_lines(Y,Z) ) ),
    file('theBenchmark.p',ceq2) ).

fof(con,conjecture,
    ! [X,Y,Z] :
      ( convergent_lines(X,Y)
     => ( apart_point_and_line(intersection_point(X,Y),Z)
       => ( distinct_lines(Y,Z)
          & distinct_lines(X,Z) ) ) ),
    file('theBenchmark.p',con) ).

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

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

cnf(c_15,plain,
    ~ distinct_lines(A,A),
    inference(clausify,[status(thm)],[apart2]) ).

cnf(c_18,plain,
    ( distinct_lines(B,C)
    | distinct_lines(A,C)
    | ~ distinct_lines(A,B) ),
    inference(clausify,[status(thm)],[apart5]) ).

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_26,plain,
    ( apart_point_and_line(A,C)
    | distinct_lines(B,C)
    | ~ apart_point_and_line(A,B) ),
    inference(clausify,[status(thm)],[ceq2]) ).

fof(nnf_13,plain,
    ? [X,Y,Z] :
      ( ( ~ distinct_lines(Y,Z)
        | ~ distinct_lines(X,Z) )
      & apart_point_and_line(intersection_point(X,Y),Z)
      & convergent_lines(X,Y) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ( ~ distinct_lines(sK1,sK2)
      | ~ distinct_lines(sK0,sK2) )
    & apart_point_and_line(intersection_point(sK0,sK1),sK2)
    & convergent_lines(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_13]) ).

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

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

cnf(c_30,negated_conjecture,
    ( ~ distinct_lines(sK1,sK2)
    | ~ distinct_lines(sK0,sK2) ),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_118,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_35,negated_conjecture,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
    inference(resolve,[status(thm)],[c_118,c_14]) ).

cnf(c_119,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_36,negated_conjecture,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
    inference(resolve,[status(thm)],[c_119,c_14]) ).

cnf(c_37,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),A)
    | distinct_lines(sK2,A) ),
    inference(resolve,[status(thm)],[c_29,c_26]) ).

cnf(c_72,plain,
    distinct_lines(sK2,sK0),
    inference(resolve,[status(thm)],[c_37,c_36]) ).

cnf(c_73,plain,
    distinct_lines(sK2,sK1),
    inference(resolve,[status(thm)],[c_37,c_35]) ).

cnf(c_85,plain,
    ( distinct_lines(sK0,A)
    | distinct_lines(sK2,A) ),
    inference(resolve,[status(thm)],[c_72,c_18]) ).

cnf(c_90,plain,
    distinct_lines(sK0,sK2),
    inference(resolve,[status(thm)],[c_85,c_15]) ).

cnf(c_94,negated_conjecture,
    ~ distinct_lines(sK1,sK2),
    inference(resolve,[status(thm)],[c_90,c_30]) ).

cnf(c_120,plain,
    ( distinct_lines(B,A)
    | ~ distinct_lines(A,B) ),
    inference(resolve,[status(thm)],[c_18,c_15]) ).

cnf(c_121,negated_conjecture,
    ~ distinct_lines(sK2,sK1),
    inference(resolve,[status(thm)],[c_120,c_94]) ).

cnf(c_117,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_73,c_121]) ).

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