%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV244-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:07 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.55s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 28 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1,plain,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_2,plain,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_Message_Oanalz_OInj_0,axiom,
! [VAR_0,VAR_1] :
( c_in(VAR_0,c_Message_Oanalz(VAR_1),tc_Message_Omsg)
| ~ c_in(VAR_0,VAR_1,tc_Message_Omsg) ),
file('theBenchmark.p',cls_Message_Oanalz_OInj_0) ).
cnf(c_3,plain,
( c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)
| ~ c_in(A,B,tc_Message_Omsg) ),
inference(clausify,[status(thm)],[cls_Message_Oanalz_OInj_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_4,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_5,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_OUnE_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_in(VAR_0,VAR_1,VAR_3)
| c_in(VAR_0,VAR_2,VAR_3)
| ~ c_in(VAR_0,c_union(VAR_1,VAR_2,VAR_3),VAR_3) ),
file('theBenchmark.p',cls_Set_OUnE_0) ).
cnf(c_6,plain,
( c_in(A,B,D)
| c_in(A,C,D)
| ~ c_in(A,c_union(B,C,D),D) ),
inference(clausify,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_10,plain,
~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_4,c_2]) ).
cnf(c_12,plain,
~ c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_5,c_2]) ).
cnf(c_35,plain,
( c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(v_X,v_H,tc_Message_Omsg) ),
inference(resolve,[status(thm)],[c_6,c_1]) ).
cnf(c_13,plain,
c_in(v_X,v_H,tc_Message_Omsg),
inference(resolve,[status(thm)],[c_10,c_35]) ).
cnf(c_25,plain,
~ c_in(v_X,c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(resolve,[status(thm)],[c_3,c_12]) ).
cnf(c_36,plain,
~ c_in(v_X,v_H,tc_Message_Omsg),
inference(resolve,[status(thm)],[c_4,c_25]) ).
cnf(c_34,plain,
$false,
inference(resolve,[status(thm)],[c_13,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV244-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.53 % Computer : n018.cluster.edu
% 0.10/0.53 % Model : x86_64 x86_64
% 0.10/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.53 % Memory : 8046.5625MB
% 0.10/0.53 % OS : Linux 6.8.0-71-generic
% 0.10/0.53 % CPULimit : 300
% 0.10/0.53 % WCLimit : 300
% 0.10/0.53 % DateTime : Sat Sep 26 13:24:22 UTC 2026
% 0.10/0.53 % CPUTime :
% 0.10/0.54 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.54 % Process 548296 was started by sandbox on n018,
% 0.10/0.54 % Sat Sep 26 13:24:22 2026
% 0.10/0.54 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.54
% 0.10/0.54 % From the command line: assign(max_seconds, 300).
% 0.10/0.55
% 0.10/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.55
% 0.10/0.55 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.55 % Length of proof is 11.
% 0.10/0.55 % Level of proof is 3.
% 0.10/0.55 % Maximum clause weight is 15.000.
% 0.10/0.55 % Given clauses 11.
% 0.10/0.55
% 0.10/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------