↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET819-1 : TPTP v9.3.1. Released v3.2.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:37:01 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_1,axiom,
    ! [VAR_0] : c_in(v_x(VAR_0),VAR_0,tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_790,plain,
    c_in(v_x(A),A,tc_set(t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

fof(cls_Set_OemptyE_0,axiom,
    ! [VAR_0,VAR_1] : ~ c_in(VAR_0,c_emptyset,VAR_1),
    file('theBenchmark.p',cls_Set_OemptyE_0) ).

cnf(c_1426,plain,
    ~ c_in(A,c_emptyset,B),
    inference(clausify,[status(thm)],[cls_Set_OemptyE_0]) ).

cnf(c_1427,plain,
    $false,
    inference(resolve,[status(thm)],[c_1426,c_790]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET819-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n003.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep 26 08:19:53 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35  % Process 2424326 was started by sandbox on n003,
% 0.07/0.35  % Sat Sep 26 08:19:53 2026
% 0.07/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.40  
% 0.13/0.40  % From the command line: assign(max_seconds, 300).
% 18.97/2.89  
% 18.97/2.89  % SZS status Unsatisfiable for theBenchmark
% 18.97/2.89  
% 18.97/2.89  % Proof 1 at 2.30 (+ 0.02) seconds.
% 18.97/2.89  % Length of proof is 3.
% 18.97/2.89  % Level of proof is 1.
% 18.97/2.89  % Maximum clause weight is 16.000.
% 18.97/2.89  % Given clauses 0.
% 18.97/2.89  
% 18.97/2.89  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------