↑ Up

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

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

% Computer : n018.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 09:16:20 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_003,axiom,
    ! [Y] : x2(z,Y) = Y,
    file('theBenchmark.p',axiom_003) ).

fof(goal_005,conjecture,
    ? [X] : x2(X,X) = X,
    file('theBenchmark.p',goal_005) ).

fof(goal_005_neg,negated_conjecture,
    ~ ? [X] : x2(X,X) = X,
    inference(assume_negation,[status(cth)],[goal_005]) ).

cnf(c_8,plain,
    x2(z,A) = A,
    inference(clausify,[status(thm)],[axiom_003]) ).

cnf(c_11,negated_conjecture,
    x2(A,A) != A,
    inference(clausify,[status(thm)],[goal_005_neg]) ).

cnf(c_12,plain,
    $false,
    inference(resolve,[status(thm)],[c_11,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX206+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n018.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 16:57:37 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 930561 was started by sandbox on n018,
% 0.10/0.37  % Sat Sep 26 16:57:37 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.10/0.39  
% 0.10/0.39  % SZS status Theorem for theBenchmark
% 0.10/0.39  
% 0.10/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39  % Length of proof is 5.
% 0.10/0.39  % Level of proof is 2.
% 0.10/0.39  % Maximum clause weight is 5.000.
% 0.10/0.39  % Given clauses 0.
% 0.10/0.39  
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------