↑ Up

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

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

% Computer : n013.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:56:00 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_c1_equals_c2,axiom,
    c2 != c1,
    file('theBenchmark.p',prove_c1_equals_c2) ).

cnf(c_12,plain,
    c2 != c1,
    inference(clausify,[status(thm)],[prove_c1_equals_c2]) ).

fof(equality_to_c1_and_c2_2,axiom,
    ! [VAR_0] :
      ( c1 != VAR_0
      | c2 = VAR_0 ),
    file('theBenchmark.p',equality_to_c1_and_c2_2) ).

cnf(c_13,plain,
    ( c1 != A
    | c2 = A ),
    inference(clausify,[status(thm)],[equality_to_c1_and_c2_2]) ).

cnf(c_28,plain,
    c2 = c1,
    inference(xxres,[status(thm)],[c_13]) ).

cnf(c_29,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT019-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n013.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 22:50:06 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 3736906 was started by sandbox2 on n013,
% 0.10/0.37  % Sat Sep 26 22:50:06 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.15/0.39  
% 0.15/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39  
% 0.15/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.39  % Length of proof is 4.
% 0.15/0.39  % Level of proof is 2.
% 0.15/0.39  % Maximum clause weight is 6.000.
% 0.15/0.39  % Given clauses 8.
% 0.15/0.39  
% 0.15/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------