%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV241-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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 : Tue Sep 29 01:20:33 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.26s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 11 unt; 1 def)
% Number of atoms : 51 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 16 ~; 22 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( c_in(X0,c_Message_Oanalz(X1),tc_Message_Omsg)
| ~ c_in(X0,X1,tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz_OInj_0) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_in(X0,c_Message_Oanalz(X1),tc_Message_Omsg)
| c_in(X0,c_Message_Oanalz(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__trans_0) ).
fof(f3,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_insert(X1,X2,X3),X3)
| c_in(X0,X2,X3)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
fof(f4,axiom,
! [X2,X0,X1] :
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
fof(f6,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f7,negated_conjecture,
c_in(v_X,c_Message_Oanalz(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f8,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f10,plain,
! [X0,X1] :
( ~ c_in(c_Main_OsubsetI__1(X0,c_Message_Oanalz(X1),tc_Message_Omsg),X1,tc_Message_Omsg)
| c_lessequals(X0,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)) ),
inference(resolution,[],[f5,f1]) ).
fof(f13,plain,
! [X2,X3,X0,X1] :
( 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
| c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2)) ),
inference(resolution,[],[f3,f4]) ).
fof(f22,plain,
! [X0,X1] :
( c_Main_OsubsetI__1(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg) = X0
| c_lessequals(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| c_lessequals(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)) ),
inference(resolution,[],[f13,f10]) ).
fof(f25,plain,
! [X0,X1] :
( c_lessequals(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| c_Main_OsubsetI__1(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg) = X0 ),
inference(duplicate_literal_removal,[],[f22]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ c_in(X2,c_Message_Oanalz(c_insert(X0,X1,tc_Message_Omsg)),tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(X0,X1,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg) = X0
| c_in(X2,c_Message_Oanalz(X1),tc_Message_Omsg) ),
inference(resolution,[],[f25,f2]) ).
fof(f69,plain,
( v_X = c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_Message_Omsg)
| c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg) ),
inference(resolution,[],[f34,f6]) ).
fof(f73,plain,
v_X = c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_Message_Omsg),
inference(forward_subsumption_resolution,[],[f69,f8]) ).
fof(f75,plain,
( ~ c_in(v_X,c_Message_Oanalz(v_H),tc_Message_Omsg)
| c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)) ),
inference(superposition,[],[f5,f73]) ).
fof(f78,definition,
( spl0_1
<=> c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f80,plain,
( c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f86,plain,
c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)),
inference(forward_subsumption_resolution,[],[f75,f7]) ).
fof(f92,plain,
spl0_1,
inference(avatar_split_clause,[],[f86,f78]) ).
fof(f98,plain,
( ! [X0] :
( ~ c_in(X0,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(X0,c_Message_Oanalz(v_H),tc_Message_Omsg) )
| ~ spl0_1 ),
inference(resolution,[],[f80,f2]) ).
fof(f114,plain,
( c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg)
| ~ spl0_1 ),
inference(resolution,[],[f98,f6]) ).
fof(f118,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f114,f8]) ).
fof(f119,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f118]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f92]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f119]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s3,s4]) ).
fof(f120,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV241-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 10:15:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.26 % (3908184)Will run a generic schedule for satisfiability detection.
% 0.18/0.26 % (3908192)dis+10_1_sil=32000:sp=arity:random_seed=1100072120:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.26 % (3908192) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3908184-3908192"...
% 0.18/0.26 % (3908190)% WARNING: option uhcvi not known.
% 0.18/0.26 % (3908192)...printing done.
% 0.18/0.26 % (3908192)Refutation found. Thanks to Tanya!
% 0.18/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26 % (3908192)------------------------------
% 0.18/0.26 % (3908192)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26 % (3908192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26 % (3908192)CaDiCaL version: 2.1.3
% 0.18/0.26 % (3908192)Termination reason: Refutation
% 0.18/0.26 % (3908192)Time elapsed: 0.003 s
% 0.18/0.26 % (3908192)Peak memory usage: 12 MB
% 0.18/0.26 % (3908192)Instructions burned: 6 (million)
% 0.18/0.26 % (3908184)Success in time 0.031 s
% 0.18/0.26 % Vampire exiting
%------------------------------------------------------------------------------