↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET856-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 : n014.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:09 AM UTC 2026

% Result   : Unsatisfiable 18.67s 8.20s
% Output   : CNFRefutation 18.67s
% 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 :    2 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_5,axiom,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_5) ).

cnf(c_1013,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_5]) ).

fof(cls_conjecture_3,axiom,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_1016,plain,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

cnf(c_1017,plain,
    $false,
    inference(resolve,[status(thm)],[c_1013,c_1016]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET856-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.09/5.39  % Computer : n014.cluster.edu
% 0.09/5.39  % Model    : x86_64 x86_64
% 0.09/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.39  % Memory   : 8046.5625MB
% 0.09/5.39  % OS       : Linux 6.8.0-71-generic
% 0.09/5.39  % CPULimit : 300
% 0.09/5.39  % WCLimit  : 300
% 0.09/5.39  % DateTime : Sat Sep 26 08:21:53 UTC 2026
% 0.09/5.39  % CPUTime  : 
% 0.09/5.39  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.39  % Process 2632501 was started by sandbox on n014,
% 0.09/5.39  % Sat Sep 26 08:21:53 2026
% 0.09/5.39  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/5.41  
% 0.15/5.41  % From the command line: assign(max_seconds, 300).
% 18.67/8.20  
% 18.67/8.20  % SZS status Unsatisfiable for theBenchmark
% 18.67/8.20  
% 18.67/8.20  % Proof 1 at 2.50 (+ 0.01) seconds.
% 18.67/8.20  % Length of proof is 3.
% 18.67/8.20  % Level of proof is 1.
% 18.67/8.20  % Maximum clause weight is 32.000.
% 18.67/8.20  % Given clauses 0.
% 18.67/8.20  
% 18.67/8.20  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------