↑ Up

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

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

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

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

cnf(c_1,plain,
    c_lessequals(c_Message_Oanalz(A),c_Message_Oparts(A),tc_set(tc_Message_Omsg)),
    inference(clausify,[status(thm)],[cls_Message_Oanalz__subset__parts_0]) ).

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

cnf(c_2,plain,
    ( c_lessequals(c_Message_OkeysFor(A),c_Message_OkeysFor(B),tc_set(tc_nat))
    | ~ c_lessequals(A,B,tc_set(tc_Message_Omsg)) ),
    inference(clausify,[status(thm)],[cls_Message_OkeysFor__mono_0]) ).

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_3,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_2,axiom,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(c_4,plain,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    inference(clausify,[status(thm)],[cls_conjecture_2]) ).

fof(cls_conjecture_3,axiom,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_5,plain,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

cnf(c_6,plain,
    c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(A)),c_Message_OkeysFor(c_Message_Oparts(A)),tc_set(tc_nat)),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_9,plain,
    ( c_in(v_K,A,tc_nat)
    | ~ c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(v_H)),A,tc_set(tc_nat)) ),
    inference(resolve,[status(thm)],[c_3,c_5]) ).

cnf(c_7,plain,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    inference(resolve,[status(thm)],[c_9,c_6]) ).

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

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