↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Message_Omsg__Nonce__supply_0,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ c_lessequals(v_sko__upX(VAR_1),VAR_0,tc_nat)
      | ~ c_in(c_Message_Omsg_ONonce(VAR_0),c_Message_Oparts(c_insert(VAR_1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('theBenchmark.p',cls_Message_Omsg__Nonce__supply_0) ).

cnf(c_1,plain,
    ( ~ c_lessequals(v_sko__upX(B),A,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(B,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    inference(clausify,[status(thm)],[cls_Message_Omsg__Nonce__supply_0]) ).

fof(cls_Nat_Oadd__leE_0,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( c_lessequals(VAR_1,VAR_2,tc_nat)
      | ~ c_lessequals(c_plus(VAR_0,VAR_1,tc_nat),VAR_2,tc_nat) ),
    file('theBenchmark.p',cls_Nat_Oadd__leE_0) ).

cnf(c_2,plain,
    ( c_lessequals(B,C,tc_nat)
    | ~ c_lessequals(c_plus(A,B,tc_nat),C,tc_nat) ),
    inference(clausify,[status(thm)],[cls_Nat_Oadd__leE_0]) ).

fof(cls_Nat_Oadd__leE_1,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( c_lessequals(VAR_0,VAR_2,tc_nat)
      | ~ c_lessequals(c_plus(VAR_0,VAR_1,tc_nat),VAR_2,tc_nat) ),
    file('theBenchmark.p',cls_Nat_Oadd__leE_1) ).

cnf(c_3,plain,
    ( c_lessequals(A,C,tc_nat)
    | ~ c_lessequals(c_plus(A,B,tc_nat),C,tc_nat) ),
    inference(clausify,[status(thm)],[cls_Nat_Oadd__leE_1]) ).

fof(cls_conjecture_0,axiom,
    ! [VAR_0] :
      ( ~ c_lessequals(v_x,VAR_0,tc_nat)
      | ~ c_in(c_Message_Omsg_ONonce(VAR_0),c_Event_Oused(v_list),tc_Message_Omsg) ),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_4,plain,
    ( ~ c_lessequals(v_x,A,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_list),tc_Message_Omsg) ),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_conjecture_4,axiom,
    ! [VAR_0,VAR_1] :
      ( c_lessequals(VAR_1,v_xd(VAR_1),tc_nat)
      | c_lessequals(VAR_0,v_xd(VAR_0),tc_nat) ),
    file('theBenchmark.p',cls_conjecture_4) ).

cnf(c_5,plain,
    ( c_lessequals(B,v_xd(B),tc_nat)
    | c_lessequals(A,v_xd(A),tc_nat) ),
    inference(clausify,[status(thm)],[cls_conjecture_4]) ).

fof(cls_conjecture_9,axiom,
    ! [VAR_0,VAR_1] :
      ( c_in(c_Message_Omsg_ONonce(v_xd(VAR_1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(VAR_1)),c_Event_Oused(v_list),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(VAR_0)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
      | c_in(c_Message_Omsg_ONonce(v_xd(VAR_0)),c_Event_Oused(v_list),tc_Message_Omsg) ),
    file('theBenchmark.p',cls_conjecture_9) ).

cnf(c_6,plain,
    ( c_in(c_Message_Omsg_ONonce(v_xd(B)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(B)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Event_Oused(v_list),tc_Message_Omsg) ),
    inference(clausify,[status(thm)],[cls_conjecture_9]) ).

cnf(c_7,plain,
    c_lessequals(A,v_xd(A),tc_nat),
    inference(factor,[status(thm)],[c_5]) ).

cnf(c_24,plain,
    ( c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Event_Oused(v_list),tc_Message_Omsg) ),
    inference(factor,[status(thm)],[c_6]) ).

cnf(c_8,plain,
    ( c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(A)),c_Event_Oused(v_list),tc_Message_Omsg) ),
    inference(copy,[status(thm)],[c_24]) ).

cnf(c_9,plain,
    c_lessequals(A,v_xd(c_plus(A,B,tc_nat)),tc_nat),
    inference(resolve,[status(thm)],[c_7,c_3]) ).

cnf(c_10,plain,
    c_lessequals(A,v_xd(c_plus(B,A,tc_nat)),tc_nat),
    inference(resolve,[status(thm)],[c_7,c_2]) ).

cnf(c_17,plain,
    ~ c_in(c_Message_Omsg_ONonce(v_xd(c_plus(v_sko__upX(A),B,tc_nat))),c_Message_Oparts(c_insert(A,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),
    inference(resolve,[status(thm)],[c_1,c_9]) ).

cnf(c_19,plain,
    c_in(c_Message_Omsg_ONonce(v_xd(c_plus(v_sko__upX(v_xc),A,tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg),
    inference(resolve,[status(thm)],[c_17,c_8]) ).

cnf(c_22,plain,
    ~ c_in(c_Message_Omsg_ONonce(v_xd(c_plus(A,v_x,tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg),
    inference(resolve,[status(thm)],[c_4,c_10]) ).

cnf(c_23,plain,
    $false,
    inference(resolve,[status(thm)],[c_22,c_19]) ).

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