↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO227+1 : TPTP v9.3.1. Bugfixed v6.4.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:36 AM UTC 2026

% Result   : Theorem 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  18   ~;   7   |;  11   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   11 (   0 sgn   6   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(oag8,axiom,
    ! [L,M] :
      ( ( line(M)
        & line(L) )
     => ( unequally_directed_lines(L,reverse_line(M))
        | unequally_directed_lines(L,M) ) ),
    file('theBenchmark.p',oag8) ).

fof(con,conjecture,
    ! [L,M] :
      ( ( line(M)
        & line(L) )
     => ~ ( ~ unequally_directed_lines(L,reverse_line(M))
          & ~ unequally_directed_lines(L,M) ) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [L,M] :
        ( ( line(M)
          & line(L) )
       => ~ ( ~ unequally_directed_lines(L,reverse_line(M))
            & ~ unequally_directed_lines(L,M) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(nnf_32,plain,
    ? [L,M] :
      ( ~ unequally_directed_lines(L,reverse_line(M))
      & ~ unequally_directed_lines(L,M)
      & line(M)
      & line(L) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ~ unequally_directed_lines(sK0,reverse_line(sK1))
    & ~ unequally_directed_lines(sK0,sK1)
    & line(sK1)
    & line(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(L,sK0),skolemize(M,sK1)],[nnf_32]) ).

cnf(c_73,negated_conjecture,
    ~ unequally_directed_lines(sK0,reverse_line(sK1)),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

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

cnf(c_75,negated_conjecture,
    line(sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_76,negated_conjecture,
    line(sK0),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_95,plain,
    ( unequally_directed_lines(A,reverse_line(B))
    | unequally_directed_lines(A,B)
    | ~ line(B)
    | ~ line(A) ),
    inference(clausify,[status(thm)],[oag8]) ).

cnf(c_112,negated_conjecture,
    ( unequally_directed_lines(A,reverse_line(sK1))
    | unequally_directed_lines(A,sK1)
    | ~ line(A) ),
    inference(resolve,[status(thm)],[c_95,c_75]) ).

cnf(c_113,negated_conjecture,
    ( unequally_directed_lines(sK0,reverse_line(sK1))
    | ~ line(sK0) ),
    inference(resolve,[status(thm)],[c_112,c_74]) ).

cnf(c_114,negated_conjecture,
    ~ line(sK0),
    inference(resolve,[status(thm)],[c_113,c_73]) ).

cnf(c_111,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_76,c_114]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO227+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n011.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 13:08:43 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 2087766 was started by sandbox2 on n011,
% 0.08/0.36  % Fri Sep 25 13:08:43 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.38  
% 0.08/0.38  % From the command line: assign(max_seconds, 300).
% 0.14/0.40  
% 0.14/0.40  % SZS status Theorem for theBenchmark
% 0.14/0.40  
% 0.14/0.40  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/0.40  % Length of proof is 8.
% 0.14/0.40  % Level of proof is 2.
% 0.14/0.40  % Maximum clause weight is 11.000.
% 0.14/0.40  % Given clauses 14.
% 0.14/0.40  
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------