%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV261-2 : 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 : n012.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 3.81s 1.16s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 55 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 71 ( 0 sgn 71 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,axiom,
! [X0,X1] : c_lessequals(c_Message_Oparts(c_union(X0,X1,tc_Message_Omsg)),c_union(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).
fof(f4,axiom,
! [X0,X1] :
( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X0,X1,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).
fof(f5,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_union(X3,X1,X2),X2)
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_union(X1,X3,X2),X2)
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( X0 = X1
| c_in(X0,X2,X3)
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
fof(f8,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f9,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
tcf(c_59,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : c_lessequals(c_Message_Oparts(c_union(X0,X1,tc_Message_Omsg)),c_union(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X0,X1,tc_set(tc_Message_Omsg)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_union(X3,X1,X2),X2)
| ~ c_in(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_union(X1,X3,X2),X2)
| ~ c_in(X0,X1,X2) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,X2,X3)
| ( X0 = X1 )
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2))
| c_in(c_Main_OsubsetI__1(c_insert(X0,X1,X2),X3,X2),X1,X2)
| ( c_Main_OsubsetI__1(c_insert(X0,X1,X2),X3,X2) = X0 ) ),
inference(superposition,[status(thm)],[c_66,c_65]) ).
tcf(c_327,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X0,c_union(X1,X2,X3),tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X0,c_union(X1,X2,X3),X3),X2,X3) ),
inference(superposition,[status(thm)],[c_63,c_67]) ).
tcf(c_328,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X0,c_union(X1,X2,X3),tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X0,c_union(X1,X2,X3),X3),X1,X3) ),
inference(superposition,[status(thm)],[c_64,c_67]) ).
tcf(c_340,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X0,c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(superposition,[status(thm)],[c_61,c_68]) ).
tcf(c_372,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(c_insert(X0,X1,X2),c_union(X3,X1,X2),tc_set(X2))
| ( c_Main_OsubsetI__1(c_insert(X0,X1,X2),c_union(X3,X1,X2),X2) = X0 ) ),
inference(superposition,[status(thm)],[c_319,c_327]) ).
tcf(c_423,plain,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(superposition,[status(thm)],[c_340,c_60]) ).
tcf(c_437,plain,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(superposition,[status(thm)],[c_62,c_423]) ).
tcf(c_619,plain,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X,
inference(superposition,[status(thm)],[c_372,c_437]) ).
tcf(c_629,plain,
( c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_in(v_X,v_G,tc_Message_Omsg) ),
inference(superposition,[status(thm)],[c_619,c_328]) ).
tcf(c_633,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_629,c_437,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV261-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n012.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 : Thu Sep 24 18:55:20 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 3.81/1.16 % SZS status Started for theBenchmark.p
% 3.81/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.16
% 3.81/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.81/1.16
% 3.81/1.16 % ------ iProver source info
% 3.81/1.16
% 3.81/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 3.81/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.81/1.16 % git: non_committed_changes: false
% 3.81/1.16
% 3.81/1.16 % ------ Parsing...% successful
% 3.81/1.16
% 3.81/1.16
% 3.81/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.81/1.16
% 3.81/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.81/1.16
% 3.81/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.81/1.16
% 3.81/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.81/1.16 % ------ Proving...
% 3.81/1.16 % ------ Problem Properties
% 3.81/1.16
% 3.81/1.16 %
% 3.81/1.16 % clauses 10
% 3.81/1.16 % conjectures 2
% 3.81/1.16 % EPR 1
% 3.81/1.16 % Horn 8
% 3.81/1.16 % unary 3
% 3.81/1.16 % binary 5
% 3.81/1.16 % lits 19
% 3.81/1.16 % lits eq 1
% 3.81/1.16 % fd_pure 0
% 3.81/1.16 % fd_pseudo 0
% 3.81/1.16 % fd_cond 0
% 3.81/1.16 % fd_pseudo_cond 1
% 3.81/1.16 % AC symbols 0
% 3.81/1.16
% 3.81/1.16 % ------ Input Options Time Limit: Unbounded
% 3.81/1.16
% 3.81/1.16
% 3.81/1.16 % ------
% 3.81/1.16 % Current options:
% 3.81/1.16 % ------
% 3.81/1.16
% 3.81/1.16
% 3.81/1.16 %
% 3.81/1.16
% 3.81/1.16 % ------ Proving...
% 3.81/1.16 %
% 3.81/1.16
% 3.81/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.16
% 3.81/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.16
% 3.81/1.16
%------------------------------------------------------------------------------