↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : RNG104+1 : 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 : n020.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 08:26:39 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mMulComm,axiom,
    ! [W0,W1] :
      ( ( aElement0(W1)
        & aElement0(W0) )
     => sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ),
    file('theBenchmark.p',mMulComm) ).

fof(mMulAsso,axiom,
    ! [W0,W1,W2] :
      ( ( aElement0(W2)
        & aElement0(W1)
        & aElement0(W0) )
     => sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) ),
    file('theBenchmark.p',mMulAsso) ).

fof(m__1933,axiom,
    ( aElement0(xz)
    & aElementOf0(xy,slsdtgt0(xc))
    & aElementOf0(xx,slsdtgt0(xc)) ),
    file('theBenchmark.p',m__1933) ).

fof(m__1956,axiom,
    ( sdtasdt0(xc,xu) = xx
    & aElement0(xu) ),
    file('theBenchmark.p',m__1956) ).

fof(m__,conjecture,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_67,negated_conjecture,
    sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_68,negated_conjecture,
    sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
    inference(copy,[status(thm)],[c_67]) ).

cnf(c_73,plain,
    sdtasdt0(xc,xu) = xx,
    inference(clausify,[status(thm)],[m__1956]) ).

cnf(c_74,plain,
    xx = sdtasdt0(xc,xu),
    inference(copy,[status(thm)],[c_73]) ).

cnf(c_75,plain,
    aElement0(xu),
    inference(clausify,[status(thm)],[m__1956]) ).

cnf(c_76,plain,
    aElement0(xz),
    inference(clausify,[status(thm)],[m__1933]) ).

fof(m__1905,axiom,
    aElement0(xc),
    file('theBenchmark.p',m__1905) ).

cnf(c_80,plain,
    aElement0(xc),
    inference(clausify,[status(thm)],[m__1905]) ).

cnf(c_148,plain,
    ( sdtasdt0(sdtasdt0(A,B),C) = sdtasdt0(A,sdtasdt0(B,C))
    | ~ aElement0(C)
    | ~ aElement0(B)
    | ~ aElement0(A) ),
    inference(clausify,[status(thm)],[mMulAsso]) ).

cnf(c_149,plain,
    ( sdtasdt0(B,A) = sdtasdt0(A,B)
    | ~ aElement0(B)
    | ~ aElement0(A) ),
    inference(clausify,[status(thm)],[mMulComm]) ).

cnf(c_766,negated_conjecture,
    sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,sdtasdt0(xc,xu)),
    inference(paramod,[status(thm)],[c_74,c_68]) ).

cnf(c_177,negated_conjecture,
    sdtasdt0(xz,sdtasdt0(xc,xu)) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(copy,[status(thm)],[c_766]) ).

cnf(c_767,plain,
    ( sdtasdt0(sdtasdt0(xc,A),B) = sdtasdt0(xc,sdtasdt0(A,B))
    | ~ aElement0(B)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_148,c_80]) ).

cnf(c_768,plain,
    ( sdtasdt0(sdtasdt0(xc,xz),A) = sdtasdt0(xc,sdtasdt0(xz,A))
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_767,c_76]) ).

cnf(c_681,plain,
    sdtasdt0(sdtasdt0(xc,xz),xu) = sdtasdt0(xc,sdtasdt0(xz,xu)),
    inference(resolve,[status(thm)],[c_768,c_75]) ).

cnf(c_769,plain,
    ( sdtasdt0(sdtasdt0(xz,A),B) = sdtasdt0(xz,sdtasdt0(A,B))
    | ~ aElement0(B)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_148,c_76]) ).

cnf(c_770,plain,
    ( sdtasdt0(sdtasdt0(xz,xc),A) = sdtasdt0(xz,sdtasdt0(xc,A))
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_769,c_80]) ).

cnf(c_693,plain,
    sdtasdt0(sdtasdt0(xz,xc),xu) = sdtasdt0(xz,sdtasdt0(xc,xu)),
    inference(resolve,[status(thm)],[c_770,c_75]) ).

cnf(c_771,plain,
    ( sdtasdt0(A,xc) = sdtasdt0(xc,A)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_149,c_80]) ).

cnf(c_755,plain,
    sdtasdt0(xz,xc) = sdtasdt0(xc,xz),
    inference(resolve,[status(thm)],[c_771,c_76]) ).

cnf(c_772,plain,
    ( sdtasdt0(A,xz) = sdtasdt0(xz,A)
    | ~ aElement0(A) ),
    inference(resolve,[status(thm)],[c_149,c_76]) ).

cnf(c_773,plain,
    sdtasdt0(xu,xz) = sdtasdt0(xz,xu),
    inference(resolve,[status(thm)],[c_772,c_75]) ).

cnf(c_758,plain,
    sdtasdt0(xz,xu) = sdtasdt0(xu,xz),
    inference(copy,[status(thm)],[c_773]) ).

cnf(c_774,plain,
    sdtasdt0(sdtasdt0(xc,xz),xu) = sdtasdt0(xz,sdtasdt0(xc,xu)),
    inference(paramod,[status(thm)],[c_755,c_693]) ).

cnf(c_775,plain,
    sdtasdt0(xc,sdtasdt0(xz,xu)) = sdtasdt0(xz,sdtasdt0(xc,xu)),
    inference(paramod,[status(thm)],[c_681,c_774]) ).

cnf(c_776,plain,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,sdtasdt0(xc,xu)),
    inference(paramod,[status(thm)],[c_758,c_775]) ).

cnf(c_777,plain,
    sdtasdt0(xz,sdtasdt0(xc,xu)) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(copy,[status(thm)],[c_776]) ).

cnf(c_765,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_177,c_777]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n020.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 06:06:49 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 818677 was started by sandbox2 on n020,
% 0.10/0.37  % Sat Sep 26 06:06:49 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.96/0.60  
% 0.96/0.60  % SZS status Theorem for theBenchmark
% 0.96/0.60  
% 0.96/0.60  % Proof 1 at 0.07 (+ 0.02) seconds.
% 0.96/0.60  % Length of proof is 20.
% 0.96/0.60  % Level of proof is 4.
% 0.96/0.60  % Maximum clause weight is 42.000.
% 0.96/0.60  % Given clauses 76.
% 0.96/0.60  
% 0.96/0.60  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------