↑ Up

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

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

% Computer : n010.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:08 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Set_Osubset__refl_0,axiom,
    ! [VAR_0,VAR_1] : c_lessequals(VAR_0,VAR_0,tc_set(VAR_1)),
    file('theBenchmark.p',cls_Set_Osubset__refl_0) ).

cnf(c_1,plain,
    c_lessequals(A,A,tc_set(B)),
    inference(clausify,[status(thm)],[cls_Set_Osubset__refl_0]) ).

fof(cls_Zorn_OTFin__UnionI_0,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( c_in(c_Union(VAR_0,tc_set(VAR_2)),c_Zorn_OTFin(VAR_1,VAR_2),tc_set(tc_set(VAR_2)))
      | ~ c_lessequals(VAR_0,c_Zorn_OTFin(VAR_1,VAR_2),tc_set(tc_set(tc_set(VAR_2)))) ),
    file('theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).

cnf(c_2,plain,
    ( c_in(c_Union(A,tc_set(C)),c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | ~ c_lessequals(A,c_Zorn_OTFin(B,C),tc_set(tc_set(tc_set(C)))) ),
    inference(clausify,[status(thm)],[cls_Zorn_OTFin__UnionI_0]) ).

fof(cls_Zorn_Oequal__succ__Union_1,axiom,
    ! [VAR_0,VAR_1] :
      ( c_Union(c_Zorn_OTFin(VAR_0,VAR_1),tc_set(VAR_1)) = c_Zorn_Osucc(VAR_0,c_Union(c_Zorn_OTFin(VAR_0,VAR_1),tc_set(VAR_1)),VAR_1)
      | ~ c_in(c_Union(c_Zorn_OTFin(VAR_0,VAR_1),tc_set(VAR_1)),c_Zorn_OTFin(VAR_0,VAR_1),tc_set(tc_set(VAR_1))) ),
    file('theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).

cnf(c_3,plain,
    ( c_Union(c_Zorn_OTFin(A,B),tc_set(B)) = c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B)
    | ~ c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))) ),
    inference(clausify,[status(thm)],[cls_Zorn_Oequal__succ__Union_1]) ).

cnf(c_4,plain,
    ( c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B) = c_Union(c_Zorn_OTFin(A,B),tc_set(B))
    | ~ c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))) ),
    inference(copy,[status(thm)],[c_3]) ).

fof(cls_conjecture_1,axiom,
    c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_5,plain,
    c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

cnf(c_6,plain,
    c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_7,plain,
    ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    inference(resolve,[status(thm)],[c_4,c_5]) ).

cnf(c_8,plain,
    $false,
    inference(resolve,[status(thm)],[c_7,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET849-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.78  % Computer : n010.cluster.edu
% 0.12/0.78  % Model    : x86_64 x86_64
% 0.12/0.78  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.78  % Memory   : 8046.5625MB
% 0.12/0.78  % OS       : Linux 6.8.0-71-generic
% 0.12/0.78  % CPULimit : 300
% 0.12/0.78  % WCLimit  : 300
% 0.12/0.78  % DateTime : Sat Sep 26 08:21:48 UTC 2026
% 0.12/0.79  % CPUTime  : 
% 0.12/0.79  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.79  % Process 2892583 was started by sandbox2 on n010,
% 0.12/0.79  % Sat Sep 26 08:21:48 2026
% 0.12/0.79  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.79  
% 0.12/0.79  % From the command line: assign(max_seconds, 300).
% 0.15/0.80  
% 0.15/0.80  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.80  
% 0.15/0.80  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.80  % Length of proof is 8.
% 0.15/0.80  % Level of proof is 3.
% 0.15/0.80  % Maximum clause weight is 29.000.
% 0.15/0.80  % Given clauses 4.
% 0.15/0.80  
% 0.15/0.80  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------