%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV255-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n008.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 : Fri Sep 25 03:16:49 PM UTC 2026
% Result : Unsatisfiable 6.30s 2.29s
% Output : CNFRefutation 6.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3389,axiom,
! [X2,X0,X1] :
( c_lessequals(X1,X2,tc_nat)
| ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_0) ).
fof(f3390,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X2,tc_nat)
| ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_1) ).
fof(f3391,negated_conjecture,
! [X0] : c_lessequals(X0,v_xb(X0),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f3392,negated_conjecture,
! [X0] :
( ~ c_lessequals(v_x,X0,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3393,negated_conjecture,
! [X0] :
( ~ c_lessequals(v_xa,X0,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f3394,negated_conjecture,
! [X0] :
( c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
tcf(c_2840,negated_conjecture,
! [X0: $i] : c_lessequals(X0,v_xb(X0),tc_nat),
inference(cnf_transformation,[],[f3391]) ).
tcf(c_2841,negated_conjecture,
! [X0: $i] :
( ~ c_lessequals(v_x,X0,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(cnf_transformation,[],[f3392]) ).
tcf(c_2842,negated_conjecture,
! [X0: $i] :
( ~ c_lessequals(v_xa,X0,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X0),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(cnf_transformation,[],[f3393]) ).
tcf(c_2843,negated_conjecture,
! [X0: $i] :
( c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(cnf_transformation,[],[f3394]) ).
tcf(c_2966,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X2,tc_nat)
| ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat) ),
inference(cnf_transformation,[],[f3390]) ).
tcf(c_2967,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X1,X2,tc_nat)
| ~ c_lessequals(c_plus(X0,X1,tc_nat),X2,tc_nat) ),
inference(cnf_transformation,[],[f3389]) ).
tcf(c_25885,plain,
! [X0: $i] :
( c_in(c_Message_Omsg_ONonce(v_xb(X0)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_lessequals(v_xa,v_xb(X0),tc_nat) ),
inference(superposition,[status(thm)],[c_2843,c_2842]) ).
tcf(c_25893,plain,
! [X0: $i] :
( ~ c_lessequals(v_xa,v_xb(X0),tc_nat)
| ~ c_lessequals(v_x,v_xb(X0),tc_nat) ),
inference(superposition,[status(thm)],[c_25885,c_2841]) ).
tcf(c_26843,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,v_xb(c_plus(X0,X1,tc_nat)),tc_nat),
inference(superposition,[status(thm)],[c_2840,c_2966]) ).
tcf(c_26872,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,v_xb(c_plus(X1,X0,tc_nat)),tc_nat),
inference(superposition,[status(thm)],[c_2840,c_2967]) ).
tcf(c_26906,plain,
! [X0: $i] : ~ c_lessequals(v_x,v_xb(c_plus(v_xa,X0,tc_nat)),tc_nat),
inference(superposition,[status(thm)],[c_26843,c_25893]) ).
tcf(c_26920,plain,
$false,
inference(superposition,[status(thm)],[c_26872,c_26906]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV255-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 18:55:26 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 6.30/2.29 % SZS status Started for theBenchmark.p
% 6.30/2.29 % SZS status Unsatisfiable for theBenchmark.p
% 6.30/2.29
% 6.30/2.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.30/2.29
% 6.30/2.29 % ------ iProver source info
% 6.30/2.29
% 6.30/2.29 % git: date: 2026-07-19 20:42:38 +0200
% 6.30/2.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.30/2.29 % git: non_committed_changes: false
% 6.30/2.29
% 6.30/2.29 % ------ Parsing...% successful
% 6.30/2.29
% 6.30/2.29
% 6.30/2.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.30/2.29
% 6.30/2.29 % ------ Preprocessing... sup_sim: 34 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 12 sf_s rm: 7 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e %
% 6.30/2.29
% 6.30/2.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.30/2.29
% 6.30/2.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.30/2.29 % ------ Proving...
% 6.30/2.29 % ------ Problem Properties
% 6.30/2.29
% 6.30/2.29 %
% 6.30/2.29 % clauses 456
% 6.30/2.29 % conjectures 4
% 6.30/2.29 % EPR 22
% 6.30/2.29 % Horn 403
% 6.30/2.29 % unary 174
% 6.30/2.29 % binary 203
% 6.30/2.29 % lits 819
% 6.30/2.29 % lits eq 322
% 6.30/2.29 % fd_pure 0
% 6.30/2.29 % fd_pseudo 0
% 6.30/2.29 % fd_cond 28
% 6.30/2.29 % fd_pseudo_cond 28
% 6.30/2.29 % AC symbols 0
% 6.30/2.29
% 6.30/2.29 % ------ Schedule dynamic 5 is on
% 6.30/2.29
% 6.30/2.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.30/2.29
% 6.30/2.29
% 6.30/2.29 % ------
% 6.30/2.29 % Current options:
% 6.30/2.29 % ------
% 6.30/2.29
% 6.30/2.29
% 6.30/2.29 %
% 6.30/2.29
% 6.30/2.29 % ------ Proving...
% 6.30/2.29 %
% 6.30/2.29
% 6.30/2.29 % SZS status Unsatisfiable for theBenchmark.p
% 6.30/2.29
% 6.30/2.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.30/2.29
% 6.30/2.29
%------------------------------------------------------------------------------