↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET832-1 : 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 : 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 08:37:04 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Set_OsubsetD_0,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( c_in(VAR_0,VAR_3,VAR_2)
      | ~ c_lessequals(VAR_1,VAR_3,tc_set(VAR_2))
      | ~ c_in(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',cls_Set_OsubsetD_0) ).

cnf(c_1232,plain,
    ( c_in(A,D,C)
    | ~ c_lessequals(B,D,tc_set(C))
    | ~ c_in(A,B,C) ),
    inference(clausify,[status(thm)],[cls_Set_OsubsetD_0]) ).

fof(cls_conjecture_0,axiom,
    c_lessequals(v_Y,v_V,tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_1574,plain,
    c_lessequals(v_Y,v_V,tc_set(t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_conjecture_2,axiom,
    c_in(v_x,v_Y,t_a),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(c_1576,plain,
    c_in(v_x,v_Y,t_a),
    inference(clausify,[status(thm)],[cls_conjecture_2]) ).

fof(cls_conjecture_3,axiom,
    ~ c_in(v_x,v_V,t_a),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_1577,plain,
    ~ c_in(v_x,v_V,t_a),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

cnf(c_2731,plain,
    ( c_in(A,v_V,t_a)
    | ~ c_in(A,v_Y,t_a) ),
    inference(resolve,[status(thm)],[c_1574,c_1232]) ).

cnf(c_3232,plain,
    c_in(v_x,v_V,t_a),
    inference(resolve,[status(thm)],[c_2731,c_1576]) ).

cnf(c_3231,plain,
    $false,
    inference(resolve,[status(thm)],[c_1577,c_3232]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET832-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n013.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 08:18:51 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 2314482 was started by sandbox2 on n013,
% 0.09/0.37  % Sat Sep 26 08:18:51 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.41  
% 0.14/0.41  % From the command line: assign(max_seconds, 300).
% 20.82/3.13  
% 20.82/3.13  % given #500 (I,wt=23): 1155 c_lessequals(c_uminus(c_IntDef_Oint(A),tc_IntDef_Oint),c_IntDef_Oint(B),tc_IntDef_Oint) # tptp_name(cls_IntDef_Onegative__zle_0) # clausal_fof(1).  [assumption].
% 20.82/3.13  
% 20.82/3.13  % given #1000 (I,wt=11): 1667 -class_Ring__and__Field_Opordered__comm__ring(A) | c_lessequals(B,B,A).  [resolve(33,b,2,a)].
% 20.82/3.13  
% 20.82/3.13  % SZS status Unsatisfiable for theBenchmark
% 20.82/3.13  
% 20.82/3.13  % Proof 1 at 2.54 (+ 0.11) seconds.
% 20.82/3.13  % Length of proof is 6.
% 20.82/3.13  % Level of proof is 2.
% 20.82/3.13  % Maximum clause weight is 23.000.
% 20.82/3.13  % Given clauses 1289.
% 20.82/3.13  
% 20.82/3.13  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------