↑ Up

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

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

% Computer : n017.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:35:30 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity,conjecture,
    ! [X] : X = X,
    file('theBenchmark.p',reflexivity) ).

fof(reflexivity_neg,negated_conjecture,
    ~ ! [X] : X = X,
    inference(assume_negation,[status(cth)],[reflexivity]) ).

fof(nnf_42,plain,
    ? [X] : X != X,
    inference(fof_nnf,[status(thm)],[reflexivity_neg]) ).

fof(sk_reflexivity_neg,plain,
    sK0 != sK0,
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_42]) ).

cnf(c_64,negated_conjecture,
    sK0 != sK0,
    inference(split_conjunct,[status(thm)],[sk_reflexivity_neg]) ).

cnf(c_65,negated_conjecture,
    $false,
    inference(copy,[status(thm)],[c_64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET055+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.57  % Computer : n017.cluster.edu
% 0.11/0.57  % Model    : x86_64 x86_64
% 0.11/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57  % Memory   : 8046.5625MB
% 0.11/0.57  % OS       : Linux 6.8.0-71-generic
% 0.11/0.57  % CPULimit : 300
% 0.11/0.57  % WCLimit  : 300
% 0.11/0.57  % DateTime : Sat Sep 26 06:55:34 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.58  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.58  % Process 86565 was started by sandbox on n017,
% 0.11/0.58  % Sat Sep 26 06:55:34 2026
% 0.11/0.58  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.59  
% 0.11/0.59  % From the command line: assign(max_seconds, 300).
% 0.11/0.60  
% 0.11/0.60  % SZS status Theorem for theBenchmark
% 0.11/0.60  
% 0.11/0.60  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.60  % Length of proof is 3.
% 0.11/0.60  % Level of proof is 2.
% 0.11/0.60  % Maximum clause weight is 0.000.
% 0.11/0.60  % Given clauses 0.
% 0.11/0.60  
% 0.11/0.60  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------