%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV258-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n001.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:50 PM UTC 2026
% Result : Unsatisfiable 10.30s 2.26s
% Output : CNFRefutation 10.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f131,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
fof(f3259,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(c_insert(X0,X3,X2),X1,tc_set(X2))
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_2) ).
fof(f3378,axiom,
! [X0,X1] :
( c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).
fof(f3379,axiom,
! [X0,X1] :
( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).
fof(f3380,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f3381,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
tcf(c_2938,plain,
! [X0: $i,X1: $i] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[],[f131]) ).
tcf(c_4924,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(c_insert(X3,X0,X2),X1,tc_set(X2))
| ~ c_in(X3,X1,X2)
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f3259]) ).
tcf(c_5009,plain,
! [X0: $i,X1: $i] :
( c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
inference(cnf_transformation,[],[f3378]) ).
tcf(c_5010,plain,
! [X0: $i,X1: $i] :
( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X0,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)) ),
inference(cnf_transformation,[],[f3379]) ).
tcf(c_5011,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
inference(cnf_transformation,[],[f3380]) ).
tcf(c_5012,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f3381]) ).
tcf(c_5312,plain,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(superposition,[status(thm)],[c_5010,c_5012]) ).
tcf(c_5322,plain,
! [X0: $i] : c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
inference(superposition,[status(thm)],[c_2938,c_5009]) ).
tcf(c_5770,plain,
( ~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg)
| ~ c_lessequals(v_H,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ),
inference(superposition,[status(thm)],[c_4924,c_5312]) ).
tcf(c_10229,plain,
~ c_lessequals(v_H,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(global_subsumption_just,[status(thm)],[c_5770,c_5011,c_5770]) ).
tcf(c_10231,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10229,c_5322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV258-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.36 % Computer : n001.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.04/0.36 % DateTime : Thu Sep 24 19:00:24 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.39 Running first-order theorem proving
% 0.04/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/0.41
% 0.04/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.41
% 0.04/0.41 % Detected problem language: tptp
% 0.04/0.42 % Proving...
% 10.30/2.26 % SZS status Started for theBenchmark.p
% 10.30/2.26 % SZS status Unsatisfiable for theBenchmark.p
% 10.30/2.26
% 10.30/2.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.30/2.26
% 10.30/2.26 % ------ iProver source info
% 10.30/2.26
% 10.30/2.26 % git: date: 2026-07-19 20:42:38 +0200
% 10.30/2.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.30/2.26 % git: non_committed_changes: false
% 10.30/2.26
% 10.30/2.26 % ------ Parsing...% successful
% 10.30/2.26
% 10.30/2.26
% 10.30/2.26 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.30/2.26 % ------ Proving...
% 10.30/2.26 % ------ Problem Properties
% 10.30/2.26
% 10.30/2.26 %
% 10.30/2.26 % clauses 2185
% 10.30/2.26 % conjectures 2
% 10.30/2.26 % EPR 668
% 10.30/2.26 % Horn 1997
% 10.30/2.26 % unary 644
% 10.30/2.26 % binary 1097
% 10.30/2.26 % lits 4398
% 10.30/2.26 % lits eq 1212
% 10.30/2.26 % fd_pure 0
% 10.30/2.26 % fd_pseudo 0
% 10.30/2.26 % fd_cond 118
% 10.30/2.26 % fd_pseudo_cond 77
% 10.30/2.26 % AC symbols 0
% 10.30/2.26
% 10.30/2.26 % ------ Input Options Time Limit: Unbounded
% 10.30/2.26
% 10.30/2.26
% 10.30/2.26 % ------
% 10.30/2.26 % Current options:
% 10.30/2.26 % ------
% 10.30/2.26
% 10.30/2.26
% 10.30/2.26 %
% 10.30/2.26
% 10.30/2.26 % ------ Proving...
% 10.30/2.26 %
% 10.30/2.26
% 10.30/2.26 % SZS status Unsatisfiable for theBenchmark.p
% 10.30/2.26
% 10.30/2.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.30/2.26
% 10.30/2.26
%------------------------------------------------------------------------------