%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV261-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 : n020.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:11 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 51 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% 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 : 55 ( 2 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
c_in(v_X,v_G,tc_Message_Omsg),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1,plain,
c_in(v_X,v_G,tc_Message_Omsg),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
~ 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('theBenchmark.p',cls_conjecture_1) ).
cnf(c_2,plain,
~ 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(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_Message_Oparts__Un__subset2_0,axiom,
! [VAR_0,VAR_1] : c_lessequals(c_Message_Oparts(c_union(VAR_0,VAR_1,tc_Message_Omsg)),c_union(c_Message_Oparts(VAR_0),c_Message_Oparts(VAR_1),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).
cnf(c_3,plain,
c_lessequals(c_Message_Oparts(c_union(A,B,tc_Message_Omsg)),c_union(c_Message_Oparts(A),c_Message_Oparts(B),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(clausify,[status(thm)],[cls_Message_Oparts__Un__subset2_0]) ).
fof(cls_Message_Oparts__mono_0,axiom,
! [VAR_0,VAR_1] :
( c_lessequals(c_Message_Oparts(VAR_0),c_Message_Oparts(VAR_1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(VAR_0,VAR_1,tc_set(tc_Message_Omsg)) ),
file('theBenchmark.p',cls_Message_Oparts__mono_0) ).
cnf(c_4,plain,
( c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg))
| ~ c_lessequals(A,B,tc_set(tc_Message_Omsg)) ),
inference(clausify,[status(thm)],[cls_Message_Oparts__mono_0]) ).
fof(cls_Set_OUnCI_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_in(VAR_0,c_union(VAR_3,VAR_1,VAR_2),VAR_2)
| ~ c_in(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',cls_Set_OUnCI_0) ).
cnf(c_5,plain,
( c_in(A,c_union(D,B,C),C)
| ~ c_in(A,B,C) ),
inference(clausify,[status(thm)],[cls_Set_OUnCI_0]) ).
fof(cls_Set_OUnCI_1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_in(VAR_0,c_union(VAR_1,VAR_3,VAR_2),VAR_2)
| ~ c_in(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',cls_Set_OUnCI_1) ).
cnf(c_6,plain,
( c_in(A,c_union(B,D,C),C)
| ~ c_in(A,B,C) ),
inference(clausify,[status(thm)],[cls_Set_OUnCI_1]) ).
fof(cls_Set_OinsertE_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( VAR_0 = VAR_1
| c_in(VAR_0,VAR_2,VAR_3)
| ~ c_in(VAR_0,c_insert(VAR_1,VAR_2,VAR_3),VAR_3) ),
file('theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(c_7,plain,
( A = B
| c_in(A,C,D)
| ~ c_in(A,c_insert(B,C,D),D) ),
inference(clausify,[status(thm)],[cls_Set_OinsertE_0]) ).
fof(cls_Set_OsubsetI_0,axiom,
! [VAR_0,VAR_1,VAR_2] :
( c_lessequals(VAR_0,VAR_1,tc_set(VAR_2))
| c_in(c_Main_OsubsetI__1(VAR_0,VAR_1,VAR_2),VAR_0,VAR_2) ),
file('theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(c_8,plain,
( c_lessequals(A,B,tc_set(C))
| c_in(c_Main_OsubsetI__1(A,B,C),A,C) ),
inference(clausify,[status(thm)],[cls_Set_OsubsetI_0]) ).
fof(cls_Set_OsubsetI_1,axiom,
! [VAR_0,VAR_1,VAR_2] :
( c_lessequals(VAR_0,VAR_1,tc_set(VAR_2))
| ~ c_in(c_Main_OsubsetI__1(VAR_0,VAR_1,VAR_2),VAR_1,VAR_2) ),
file('theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(c_9,plain,
( c_lessequals(A,B,tc_set(C))
| ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C) ),
inference(clausify,[status(thm)],[cls_Set_OsubsetI_1]) ).
fof(cls_Set_Osubset__trans_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_lessequals(VAR_3,VAR_1,tc_set(VAR_2))
| ~ c_lessequals(VAR_3,VAR_0,tc_set(VAR_2))
| ~ c_lessequals(VAR_0,VAR_1,tc_set(VAR_2)) ),
file('theBenchmark.p',cls_Set_Osubset__trans_0) ).
cnf(c_10,plain,
( c_lessequals(D,B,tc_set(C))
| ~ c_lessequals(D,A,tc_set(C))
| ~ c_lessequals(A,B,tc_set(C)) ),
inference(clausify,[status(thm)],[cls_Set_Osubset__trans_0]) ).
cnf(c_77,plain,
( c_lessequals(A,c_union(c_Message_Oparts(B),c_Message_Oparts(C),tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_lessequals(A,c_Message_Oparts(c_union(B,C,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(resolve,[status(thm)],[c_10,c_3]) ).
cnf(c_21,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(resolve,[status(thm)],[c_77,c_2]) ).
cnf(c_27,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(resolve,[status(thm)],[c_4,c_21]) ).
cnf(c_28,plain,
c_in(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),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_27,c_8]) ).
cnf(c_29,plain,
~ c_in(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),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_9,c_27]) ).
cnf(c_30,plain,
~ c_in(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_G,tc_Message_Omsg),
inference(resolve,[status(thm)],[c_6,c_29]) ).
cnf(c_31,plain,
~ c_in(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_H,tc_Message_Omsg),
inference(resolve,[status(thm)],[c_5,c_29]) ).
cnf(c_78,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
| c_in(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_H,tc_Message_Omsg) ),
inference(resolve,[status(thm)],[c_28,c_7]) ).
cnf(c_72,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(resolve,[status(thm)],[c_31,c_78]) ).
cnf(c_79,plain,
~ c_in(v_X,v_G,tc_Message_Omsg),
inference(paramod,[status(thm)],[c_72,c_30]) ).
cnf(c_76,plain,
$false,
inference(resolve,[status(thm)],[c_1,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV261-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.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 13:25:03 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 1682395 was started by sandbox2 on n020,
% 0.09/0.36 % Sat Sep 26 13:25:03 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 18.
% 0.13/0.38 % Level of proof is 6.
% 0.13/0.38 % Maximum clause weight is 16.000.
% 0.13/0.38 % Given clauses 38.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------