↑ Up

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

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

% Computer : n014.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 06:49:38 AM UTC 2026

% Result   : Theorem 0.65s 1.01s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :  124 ( 123 equ)
%            Maximal formula atoms :   50 (   8 avg)
%            Number of connectives :  175 (  65   ~;   8   |; 102   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax5,axiom,
    ( e3 != e4
    & e2 != e4
    & e2 != e3
    & e1 != e4
    & e1 != e3
    & e1 != e2
    & e0 != e4
    & e0 != e3
    & e0 != e2
    & e0 != e1 ),
    file('theBenchmark.p',ax5) ).

fof(ax6,axiom,
    ( e3 = op(op(e4,op(e4,e4)),op(e4,op(e4,e4)))
    & e2 = op(op(e4,op(e4,e4)),op(e4,e4))
    & e1 = op(e4,e4)
    & e0 = op(e4,op(e4,e4)) ),
    file('theBenchmark.p',ax6) ).

fof(co1,conjecture,
    ~ ( op(e4,op(e4,e4)) = e4
      & op(e4,op(e4,e3)) = e3
      & op(e4,op(e4,e2)) = e2
      & op(e4,op(e4,e1)) = e1
      & op(e4,op(e4,e0)) = e0
      & op(e3,op(e3,e4)) = e4
      & op(e3,op(e3,e3)) = e3
      & op(e3,op(e3,e2)) = e2
      & op(e3,op(e3,e1)) = e1
      & op(e3,op(e3,e0)) = e0
      & op(e2,op(e2,e4)) = e4
      & op(e2,op(e2,e3)) = e3
      & op(e2,op(e2,e2)) = e2
      & op(e2,op(e2,e1)) = e1
      & op(e2,op(e2,e0)) = e0
      & op(e1,op(e1,e4)) = e4
      & op(e1,op(e1,e3)) = e3
      & op(e1,op(e1,e2)) = e2
      & op(e1,op(e1,e1)) = e1
      & op(e1,op(e1,e0)) = e0
      & op(e0,op(e0,e4)) = e4
      & op(e0,op(e0,e3)) = e3
      & op(e0,op(e0,e2)) = e2
      & op(e0,op(e0,e1)) = e1
      & op(e0,op(e0,e0)) = e0
      & ( ( op(e4,e4) != e4
          & op(e3,e4) != e3
          & op(e2,e4) != e2
          & op(e1,e4) != e1
          & op(e0,e4) != e0 )
        | ( op(e4,e3) != e4
          & op(e3,e3) != e3
          & op(e2,e3) != e2
          & op(e1,e3) != e1
          & op(e0,e3) != e0 )
        | ( op(e4,e2) != e4
          & op(e3,e2) != e3
          & op(e2,e2) != e2
          & op(e1,e2) != e1
          & op(e0,e2) != e0 )
        | ( op(e4,e1) != e4
          & op(e3,e1) != e3
          & op(e2,e1) != e2
          & op(e1,e1) != e1
          & op(e0,e1) != e0 )
        | ( op(e4,e0) != e4
          & op(e3,e0) != e3
          & op(e2,e0) != e2
          & op(e1,e0) != e1
          & op(e0,e0) != e0 ) ) ),
    file('theBenchmark.p',co1) ).

fof(co1_neg,negated_conjecture,
    ~ ~ ( op(e4,op(e4,e4)) = e4
        & op(e4,op(e4,e3)) = e3
        & op(e4,op(e4,e2)) = e2
        & op(e4,op(e4,e1)) = e1
        & op(e4,op(e4,e0)) = e0
        & op(e3,op(e3,e4)) = e4
        & op(e3,op(e3,e3)) = e3
        & op(e3,op(e3,e2)) = e2
        & op(e3,op(e3,e1)) = e1
        & op(e3,op(e3,e0)) = e0
        & op(e2,op(e2,e4)) = e4
        & op(e2,op(e2,e3)) = e3
        & op(e2,op(e2,e2)) = e2
        & op(e2,op(e2,e1)) = e1
        & op(e2,op(e2,e0)) = e0
        & op(e1,op(e1,e4)) = e4
        & op(e1,op(e1,e3)) = e3
        & op(e1,op(e1,e2)) = e2
        & op(e1,op(e1,e1)) = e1
        & op(e1,op(e1,e0)) = e0
        & op(e0,op(e0,e4)) = e4
        & op(e0,op(e0,e3)) = e3
        & op(e0,op(e0,e2)) = e2
        & op(e0,op(e0,e1)) = e1
        & op(e0,op(e0,e0)) = e0
        & ( ( op(e4,e4) != e4
            & op(e3,e4) != e3
            & op(e2,e4) != e2
            & op(e1,e4) != e1
            & op(e0,e4) != e0 )
          | ( op(e4,e3) != e4
            & op(e3,e3) != e3
            & op(e2,e3) != e2
            & op(e1,e3) != e1
            & op(e0,e3) != e0 )
          | ( op(e4,e2) != e4
            & op(e3,e2) != e3
            & op(e2,e2) != e2
            & op(e1,e2) != e1
            & op(e0,e2) != e0 )
          | ( op(e4,e1) != e4
            & op(e3,e1) != e3
            & op(e2,e1) != e2
            & op(e1,e1) != e1
            & op(e0,e1) != e0 )
          | ( op(e4,e0) != e4
            & op(e3,e0) != e3
            & op(e2,e0) != e2
            & op(e1,e0) != e1
            & op(e0,e0) != e0 ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

cnf(c_284,plain,
    e4 != e0,
    inference(clausify,[status(thm)],[ax5]) ).

cnf(c_285,plain,
    e0 != e4,
    inference(copy,[status(thm)],[c_284]) ).

cnf(c_295,plain,
    op(e4,op(e4,e4)) = e0,
    inference(clausify,[status(thm)],[ax6]) ).

cnf(c_296,plain,
    op(e4,e4) = e1,
    inference(clausify,[status(thm)],[ax6]) ).

cnf(c_950,negated_conjecture,
    op(e4,op(e4,e4)) = e4,
    inference(clausify,[status(thm)],[co1_neg]) ).

cnf(c_951,negated_conjecture,
    op(e4,e1) = e4,
    inference(paramod,[status(thm)],[c_296,c_950]) ).

cnf(c_958,plain,
    op(e4,e1) = e0,
    inference(paramod,[status(thm)],[c_296,c_295]) ).

cnf(c_959,plain,
    e4 = e0,
    inference(paramod,[status(thm)],[c_951,c_958]) ).

cnf(c_960,plain,
    e0 = e4,
    inference(copy,[status(thm)],[c_959]) ).

cnf(c_957,plain,
    $false,
    inference(resolve,[status(thm)],[c_285,c_960]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG171+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n014.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 21:21:17 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 4127420 was started by sandbox2 on n014,
% 0.10/0.37  % Sat Sep 26 21:21:17 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.65/0.94  
% 0.65/0.94  % From the command line: assign(max_seconds, 300).
% 0.65/1.01  
% 0.65/1.01  % SZS status Theorem for theBenchmark
% 0.65/1.01  
% 0.65/1.01  % Proof 1 at 0.04 (+ 0.01) seconds.
% 0.65/1.01  % Length of proof is 10.
% 0.65/1.01  % Level of proof is 3.
% 0.65/1.01  % Maximum clause weight is 27.000.
% 0.65/1.01  % Given clauses 0.
% 0.65/1.01  
% 0.65/1.01  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------