↑ Up

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

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

% Computer : n003.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:28 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(clause_1,axiom,
    ! [VAR_0] :
      ( ~ element(VAR_0,VAR_0)
      | ~ element(VAR_0,a) ),
    file('theBenchmark.p',clause_1) ).

cnf(c_1,plain,
    ( ~ element(A,A)
    | ~ element(A,a) ),
    inference(clausify,[status(thm)],[clause_1]) ).

fof(clause_2,axiom,
    ! [VAR_0] :
      ( element(VAR_0,a)
      | element(VAR_0,VAR_0) ),
    file('theBenchmark.p',clause_2) ).

cnf(c_2,plain,
    ( element(A,a)
    | element(A,A) ),
    inference(clausify,[status(thm)],[clause_2]) ).

cnf(c_3,plain,
    ~ element(a,a),
    inference(factor,[status(thm)],[c_1]) ).

cnf(c_5,plain,
    element(a,a),
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_4,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET043-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n003.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 07:00:38 UTC 2026
% 0.02/0.37  % CPUTime  : 
% 0.02/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.38  % Process 2268098 was started by sandbox on n003,
% 0.02/0.38  % Sat Sep 26 07:00:38 2026
% 0.02/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.02/0.38  
% 0.02/0.38  % From the command line: assign(max_seconds, 300).
% 0.02/0.39  
% 0.02/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.02/0.39  
% 0.02/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.02/0.39  % Length of proof is 4.
% 0.02/0.39  % Level of proof is 2.
% 0.02/0.39  % Maximum clause weight is 6.000.
% 0.02/0.39  % Given clauses 0.
% 0.02/0.39  
% 0.02/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------