↑ Up

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

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

% Result   : Unsatisfiable 0.09s 15.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   9 unt;   0 def)
%            Number of atoms       :   13 (   2 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  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :    6 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
    c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_1,plain,
    c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

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

cnf(c_2,plain,
    ~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

fof(cls_Message_Oparts__idem_0,axiom,
    ! [VAR_0] : c_Message_Oparts(c_Message_Oparts(VAR_0)) = c_Message_Oparts(VAR_0),
    file('theBenchmark.p',cls_Message_Oparts__idem_0) ).

cnf(c_3,plain,
    c_Message_Oparts(c_Message_Oparts(A)) = c_Message_Oparts(A),
    inference(clausify,[status(thm)],[cls_Message_Oparts__idem_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_4,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]) ).

cnf(c_7,plain,
    c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(c_Message_Oparts(v_H)),tc_set(tc_Message_Omsg)),
    inference(resolve,[status(thm)],[c_4,c_1]) ).

cnf(c_5,plain,
    c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(paramod,[status(thm)],[c_3,c_7]) ).

cnf(c_6,plain,
    $false,
    inference(resolve,[status(thm)],[c_5,c_2]) ).

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