↑ Up

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

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

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

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

cnf(c_3991,plain,
    c_lessequals(A,c_Message_Oanalz(A),tc_set(tc_Message_Omsg)),
    inference(clausify,[status(thm)],[cls_Message_Oanalz__increasing_0]) ).

fof(cls_Message_Oparts__mono_0,axiom,
    ! [VAR_0,VAR_1] :
      ( c_lessequals(c_Message_Oparts(VAR_0),c_Message_Oparts(VAR_1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(VAR_0,VAR_1,tc_set(tc_Message_Omsg)) ),
    file('theBenchmark.p',cls_Message_Oparts__mono_0) ).

cnf(c_4011,plain,
    ( c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(A,B,tc_set(tc_Message_Omsg)) ),
    inference(clausify,[status(thm)],[cls_Message_Oparts__mono_0]) ).

fof(cls_conjecture_0,axiom,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_4015,plain,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

cnf(c_10973,plain,
    c_lessequals(c_Message_Oparts(A),c_Message_Oparts(c_Message_Oanalz(A)),tc_set(tc_Message_Omsg)),
    inference(resolve,[status(thm)],[c_4011,c_3991]) ).

cnf(c_10974,plain,
    $false,
    inference(resolve,[status(thm)],[c_10973,c_4015]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV257-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.10/0.37  % Computer : n013.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 13:22:36 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 2836660 was started by sandbox2 on n013,
% 0.10/0.37  % Sat Sep 26 13:22:36 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.45  
% 0.10/0.45  % From the command line: assign(max_seconds, 300).
% 33.63/5.33  
% 33.63/5.33  % given #500 (I,wt=26): 1076 -class_Ring__and__Field_Oidom(A) | -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_uminus(B,A),c_1,A) | c_lessequals(c_uminus(c_1,A),B,A).  [resolve(59,b,50,a)].
% 33.63/5.33  
% 33.63/5.33  % given #1000 (I,wt=24): 1614 c_in(A,c_Inter(B,C),C) | c_in(c_Main_OInterI__1(A,B,C),B,tc_set(C)) # tptp_name(cls_Set_OInterI_0) # clausal_fof(1).  [assumption].
% 33.63/5.33  
% 33.63/5.33  % given #1500 (I,wt=16): 2132 c_Datatype_Ounit_Ounit__rec(A,c_Product__Type_OUnity,B) = A # tptp_name(cls_Datatype_Ounit_Orecs_0) # clausal_fof(1).  [assumption].
% 33.63/5.33  
% 33.63/5.33  % given #2000 (I,wt=18): 2915 -class_Ring__and__Field_Oordered__semidom(A) | c_lessequals(c_0,c_NatArith_Oof__nat(B,A),A) # tptp_name(cls_NatArith_Oof__nat__0__le__iff_0) # clausal_fof(1).  [assumption].
% 33.63/5.33  
% 33.63/5.33  % given #2500 (I,wt=29): 3570 -class_Ring__and__Field_Odivision__by__zero(A) | -class_Ring__and__Field_Oordered__field(A) | -c_less(c_0,B,A) | -c_lessequals(C,B,A) | c_lessequals(c_divide(C,B,A),c_1,A) # tptp_name(cls_Ring__and__Field_Odivide__le__eq__1__pos_1) # clausal_fof(1).  [assumption].
% 33.63/5.33  
% 33.63/5.33  % SZS status Unsatisfiable for theBenchmark
% 33.63/5.33  
% 33.63/5.33  % Proof 1 at 4.55 (+ 0.23) seconds.
% 33.63/5.33  % Length of proof is 5.
% 33.63/5.33  % Level of proof is 2.
% 33.63/5.33  % Maximum clause weight is 23.000.
% 33.63/5.33  % Given clauses 2810.
% 33.63/5.33  
% 33.63/5.33  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------