↑ Up

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

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

% Computer : n011.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:34 AM UTC 2026

% Result   : Theorem 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  16   ~;   5   |;   7   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  13   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(couo1,axiom,
    ! [L,M,N] :
      ( ( ~ unorthogonal_lines(L,N)
        & ~ unorthogonal_lines(L,M) )
     => ~ convergent_lines(M,N) ),
    file('theBenchmark.p',couo1) ).

fof(a3,axiom,
    ! [X,Y] :
      ( parallel_lines(X,Y)
    <=> ~ convergent_lines(X,Y) ),
    file('theBenchmark.p',a3) ).

fof(a5,axiom,
    ! [X,Y] :
      ( orthogonal_lines(X,Y)
    <=> ~ unorthogonal_lines(X,Y) ),
    file('theBenchmark.p',a5) ).

fof(con,conjecture,
    ! [L,M,N] :
      ( ( orthogonal_lines(L,N)
        & orthogonal_lines(L,M) )
     => parallel_lines(M,N) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [L,M,N] :
        ( ( orthogonal_lines(L,N)
          & orthogonal_lines(L,M) )
       => parallel_lines(M,N) ),
    inference(assume_negation,[status(cth)],[con]) ).

cnf(c_41,plain,
    ( convergent_lines(A,B)
    | parallel_lines(A,B) ),
    inference(clausify,[status(thm)],[a3]) ).

fof(nnf_36,plain,
    ? [L,M,N] :
      ( ~ parallel_lines(M,N)
      & orthogonal_lines(L,N)
      & orthogonal_lines(L,M) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ~ parallel_lines(sK0,sK1)
    & orthogonal_lines(sK2,sK1)
    & orthogonal_lines(sK2,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK0,sK1]),skolemize(L,sK2),skolemize(M,sK0),skolemize(N,sK1)],[nnf_36]) ).

cnf(c_43,negated_conjecture,
    ~ parallel_lines(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_47,plain,
    ( ~ unorthogonal_lines(A,B)
    | ~ orthogonal_lines(A,B) ),
    inference(clausify,[status(thm)],[a5]) ).

cnf(c_48,negated_conjecture,
    orthogonal_lines(sK2,sK0),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_49,negated_conjecture,
    orthogonal_lines(sK2,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_50,negated_conjecture,
    ~ unorthogonal_lines(sK2,sK1),
    inference(resolve,[status(thm)],[c_49,c_47]) ).

cnf(c_51,negated_conjecture,
    ~ unorthogonal_lines(sK2,sK0),
    inference(resolve,[status(thm)],[c_48,c_47]) ).

cnf(c_52,negated_conjecture,
    convergent_lines(sK0,sK1),
    inference(resolve,[status(thm)],[c_43,c_41]) ).

cnf(c_57,plain,
    ( ~ convergent_lines(B,C)
    | unorthogonal_lines(A,C)
    | unorthogonal_lines(A,B) ),
    inference(clausify,[status(thm)],[couo1]) ).

cnf(c_90,negated_conjecture,
    ( ~ convergent_lines(sK0,A)
    | unorthogonal_lines(sK2,A) ),
    inference(resolve,[status(thm)],[c_57,c_51]) ).

cnf(c_91,negated_conjecture,
    ~ convergent_lines(sK0,sK1),
    inference(resolve,[status(thm)],[c_90,c_50]) ).

cnf(c_89,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_52,c_91]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GEO220+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n011.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Fri Sep 25 13:07:43 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.45  % Process 2084088 was started by sandbox2 on n011,
% 0.19/0.45  % Fri Sep 25 13:07:43 2026
% 0.19/0.45  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.47  
% 0.19/0.47  % From the command line: assign(max_seconds, 300).
% 0.19/0.48  
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  
% 0.19/0.48  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.19/0.48  % Length of proof is 14.
% 0.19/0.48  % Level of proof is 3.
% 0.19/0.48  % Maximum clause weight is 9.000.
% 0.19/0.48  % Given clauses 8.
% 0.19/0.48  
% 0.19/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------