%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV284-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 : n019.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.08s 0.36s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 1 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 : 33 ( 9 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
! [VAR_0] : c_lessequals(VAR_0,v_x(VAR_0),tc_nat),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1,plain,
c_lessequals(A,v_x(A),tc_nat),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
! [VAR_0] :
( ~ c_lessequals(v_N,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_1) ).
cnf(c_2,plain,
( ~ c_lessequals(v_N,A,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_list),tc_Message_Omsg) ),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_conjecture_2,axiom,
! [VAR_0] :
( c_in(c_Message_Omsg_ONonce(v_x(VAR_0)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_x(VAR_0)),c_Event_Oused(v_list),tc_Message_Omsg) ),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_3,plain,
( c_in(c_Message_Omsg_ONonce(v_x(A)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_x(A)),c_Event_Oused(v_list),tc_Message_Omsg) ),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
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_4,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_5,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_6,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]) ).
cnf(c_8,plain,
( c_in(c_Message_Omsg_ONonce(v_x(A)),c_Event_Oused(v_list),tc_Message_Omsg)
| ~ c_lessequals(v_sko__upX(v_msg),v_x(A),tc_nat) ),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_10,plain,
c_lessequals(A,v_x(c_plus(B,A,tc_nat)),tc_nat),
inference(resolve,[status(thm)],[c_5,c_1]) ).
cnf(c_11,plain,
c_lessequals(A,v_x(c_plus(A,B,tc_nat)),tc_nat),
inference(resolve,[status(thm)],[c_6,c_1]) ).
cnf(c_13,plain,
c_lessequals(A,v_x(c_plus(B,c_plus(A,C,tc_nat),tc_nat)),tc_nat),
inference(resolve,[status(thm)],[c_10,c_6]) ).
cnf(c_20,plain,
~ c_in(c_Message_Omsg_ONonce(v_x(c_plus(v_N,A,tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_2,c_11]) ).
cnf(c_26,plain,
c_in(c_Message_Omsg_ONonce(v_x(c_plus(A,c_plus(v_sko__upX(v_msg),B,tc_nat),tc_nat))),c_Event_Oused(v_list),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_8,c_13]) ).
cnf(c_27,plain,
$false,
inference(resolve,[status(thm)],[c_26,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV284-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n019.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 13:27:33 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 1428913 was started by sandbox2 on n019,
% 0.08/0.35 % Sat Sep 26 13:27:33 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.08/0.36
% 0.08/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.36
% 0.08/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.36 % Length of proof is 13.
% 0.08/0.36 % Level of proof is 4.
% 0.08/0.36 % Maximum clause weight is 17.000.
% 0.08/0.36 % Given clauses 13.
% 0.08/0.36
% 0.08/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------