%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV252-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:36 PM UTC 2026
% Result : Unsatisfiable 3.00s 0.79s
% Output : Refutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 50 ( 27 unt; 0 def)
% Number of atoms : 82 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 38 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 106 ( 106 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
file('/export/starexec/sandbox2/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_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f6,axiom,
! [X0] : c_Message_Oparts(c_Message_Oanalz(X0)) = c_Message_Oparts(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__analz_0) ).
fof(f7,plain,
! [X0] : c_Message_Oparts(X0) = c_Message_Oparts(c_Message_Oanalz(X0)),
inference(reorient_equations,[],[f6]) ).
fof(f8,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_0) ).
fof(f9,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(f10,axiom,
! [X0] : c_Message_Oparts(c_Message_Osynth(X0)) = c_union(c_Message_Oparts(X0),c_Message_Osynth(X0),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__synth_0) ).
fof(f11,axiom,
! [X0,X1] :
( c_lessequals(X1,X1,X0)
| ~ class_Orderings_Oorder(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
fof(f12,axiom,
! [X2,X0,X1] : c_union(c_minus(X0,X1,tc_set(X2)),X1,X2) = c_union(X0,X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel2_0) ).
fof(f13,axiom,
! [X2,X0,X1] : c_union(X0,c_minus(X1,X0,tc_set(X2)),X2) = c_union(X0,X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel_0) ).
fof(f14,plain,
! [X2,X0,X1] : c_union(X0,X1,X2) = c_union(X0,c_minus(X1,X0,tc_set(X2)),X2),
inference(reorient_equations,[],[f13]) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
| c_lessequals(X0,X3,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_0) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( ~ c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
| c_lessequals(X1,X3,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_1) ).
fof(f17,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(c_union(X3,X0,X2),X1,tc_set(X2))
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_2) ).
fof(f18,axiom,
! [X2,X3,X0,X1] :
( ~ c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2))
| c_in(X0,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_0) ).
fof(f19,axiom,
! [X2,X3,X0,X1] :
( ~ c_lessequals(c_insert(X0,X1,X2),X3,tc_set(X2))
| c_lessequals(X1,X3,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_1) ).
fof(f20,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/theBenchmark.p',cls_Set_Oinsert__subset_2) ).
fof(f21,axiom,
! [X2,X0,X1] :
( ~ c_lessequals(X0,X1,tc_set(X2))
| ~ c_lessequals(X1,X0,tc_set(X2))
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2))
| X0 = X1 ),
inference(reorient_equations,[],[f21]) ).
fof(f23,axiom,
! [X0] : class_Orderings_Oorder(tc_set(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_set_2) ).
fof(f26,plain,
! [X0] : c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X0))) = c_union(c_Message_Oparts(X0),c_Message_Osynth(c_Message_Oanalz(X0)),tc_Message_Omsg),
inference(superposition,[],[f10,f7]) ).
fof(f63,plain,
! [X0] :
( c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg))
| ~ class_Orderings_Oorder(tc_set(tc_Message_Omsg)) ),
inference(resolution,[],[f8,f11]) ).
fof(f66,plain,
! [X0] : c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
inference(forward_subsumption_resolution,[],[f63,f23]) ).
fof(f68,plain,
! [X0,X1] : c_in(X0,c_Message_Oparts(c_insert(X0,X1,tc_Message_Omsg)),tc_Message_Omsg),
inference(resolution,[],[f66,f18]) ).
fof(f304,plain,
! [X2,X0,X1] :
( c_lessequals(X0,c_union(X0,X1,X2),tc_set(X2))
| ~ class_Orderings_Oorder(tc_set(X2)) ),
inference(resolution,[],[f15,f11]) ).
fof(f330,plain,
! [X2,X0,X1] : c_lessequals(X0,c_union(X0,X1,X2),tc_set(X2)),
inference(forward_subsumption_resolution,[],[f304,f23]) ).
fof(f350,plain,
! [X0] : c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X0))),tc_set(tc_Message_Omsg)),
inference(superposition,[],[f330,f26]) ).
fof(f393,plain,
! [X0] : c_lessequals(X0,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X0))),tc_set(tc_Message_Omsg)),
inference(resolution,[],[f350,f8]) ).
fof(f410,plain,
! [X2,X0,X1] :
( c_lessequals(X0,c_union(X1,X0,X2),tc_set(X2))
| ~ class_Orderings_Oorder(tc_set(X2)) ),
inference(resolution,[],[f16,f11]) ).
fof(f442,plain,
! [X2,X0,X1] : c_lessequals(X0,c_union(X1,X0,X2),tc_set(X2)),
inference(forward_subsumption_resolution,[],[f410,f23]) ).
fof(f466,plain,
! [X2,X0,X1] : c_lessequals(c_minus(X1,X0,tc_set(X2)),c_union(X0,X1,X2),tc_set(X2)),
inference(superposition,[],[f442,f14]) ).
fof(f659,plain,
! [X2,X0,X1] :
( c_lessequals(X0,c_insert(X1,X0,X2),tc_set(X2))
| ~ class_Orderings_Oorder(tc_set(X2)) ),
inference(resolution,[],[f19,f11]) ).
fof(f704,plain,
! [X2,X0,X1] : c_lessequals(X0,c_insert(X1,X0,X2),tc_set(X2)),
inference(forward_subsumption_resolution,[],[f659,f23]) ).
fof(f761,plain,
! [X2,X3,X0,X1] :
( ~ c_lessequals(X1,c_insert(X3,X0,X2),tc_set(X2))
| ~ c_in(X3,X1,X2)
| ~ c_lessequals(X0,X1,tc_set(X2))
| c_insert(X3,X0,X2) = X1 ),
inference(resolution,[],[f20,f22]) ).
fof(f1008,plain,
! [X2,X3,X0,X1] :
( ~ c_lessequals(c_minus(X0,X1,tc_set(X2)),X3,tc_set(X2))
| c_lessequals(c_union(X0,X1,X2),X3,tc_set(X2))
| ~ c_lessequals(X1,X3,tc_set(X2)) ),
inference(superposition,[],[f17,f12]) ).
fof(f3388,plain,
! [X2,X0,X1] :
( c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2))
| ~ c_lessequals(X1,c_union(X1,X0,X2),tc_set(X2)) ),
inference(resolution,[],[f1008,f466]) ).
fof(f3536,plain,
! [X2,X0,X1] : c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2)),
inference(forward_subsumption_resolution,[],[f3388,f330]) ).
fof(f3576,plain,
! [X2,X0,X1] :
( ~ c_lessequals(c_union(X0,X1,X2),c_union(X1,X0,X2),tc_set(X2))
| c_union(X0,X1,X2) = c_union(X1,X0,X2) ),
inference(resolution,[],[f3536,f22]) ).
fof(f3591,plain,
! [X2,X0,X1] : c_union(X0,X1,X2) = c_union(X1,X0,X2),
inference(forward_subsumption_resolution,[],[f3576,f3536]) ).
fof(f3770,plain,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_H),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(superposition,[],[f2,f3591]) ).
fof(f3816,plain,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(forward_demodulation,[],[f3770,f26]) ).
fof(f3818,plain,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(resolution,[],[f3816,f9]) ).
fof(f3819,plain,
( ~ c_lessequals(v_H,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg))
| ~ c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg) ),
inference(resolution,[],[f3818,f20]) ).
fof(f3820,plain,
~ c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg),
inference(forward_subsumption_resolution,[],[f3819,f393]) ).
fof(f4320,plain,
! [X2,X0,X1] :
( ~ c_lessequals(X1,X1,tc_set(X2))
| ~ c_in(X0,X1,X2)
| c_insert(X0,X1,X2) = X1 ),
inference(resolution,[],[f761,f704]) ).
fof(f8031,plain,
! [X2,X0,X1] :
( ~ c_in(X0,X1,X2)
| c_insert(X0,X1,X2) = X1
| ~ class_Orderings_Oorder(tc_set(X2)) ),
inference(resolution,[],[f4320,f11]) ).
fof(f8045,plain,
! [X2,X0,X1] :
( ~ c_in(X0,X1,X2)
| c_insert(X0,X1,X2) = X1 ),
inference(forward_subsumption_resolution,[],[f8031,f23]) ).
fof(f8049,plain,
c_Message_Osynth(c_Message_Oanalz(v_H)) = c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
inference(resolution,[],[f8045,f1]) ).
fof(f8126,plain,
c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg),
inference(superposition,[],[f68,f8049]) ).
fof(f8208,plain,
$false,
inference(forward_subsumption_resolution,[],[f8126,f3820]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV252-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 % Computer : n016.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Mon Sep 28 10:23:33 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.27 Running first-order model finding
% 0.25/0.27 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.00/0.79 % (3531765)Will run a generic schedule for satisfiability detection.
% 3.00/0.79 % (3531772)% WARNING: option uhcvi not known.
% 3.00/0.79 % (3531772)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3180559391:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 3.00/0.79 % (3531773)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2563715588:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 3.00/0.79 % (3531771)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1806167642_3000 on theBenchmark for (3000ds/0Mi)
% 3.00/0.79 % TRYING [1]
% 3.00/0.79 % TRYING [2]
% 3.00/0.79 % (3531778)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=827484987:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 3.00/0.79 % (3531776)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2276155952:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 3.00/0.79 % (3531777)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2061851835:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 3.00/0.79 % TRYING [3]
% 3.00/0.79 % (3531774)dis+10_1_sil=32000:sp=arity:random_seed=1909839008:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 3.00/0.79 % TRYING [4]
% 3.00/0.79 % TRYING [5]
% 3.00/0.79 % TRYING [6]
% 3.00/0.79 % (3531776)Instruction limit reached!
% 3.00/0.79 % (3531776)------------------------------
% 3.00/0.79 % (3531776)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531776)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531776)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531776)Termination reason: Instruction limit
% 3.00/0.79 % (3531776)Termination phase: Saturation
% 3.00/0.79 % (3531776)Time elapsed: 0.107 s
% 3.00/0.79 % (3531776)Peak memory usage: 12 MB
% 3.00/0.79 % (3531776)Instructions burned: 116 (million)
% 3.00/0.79 % (3531774)Instruction limit reached!
% 3.00/0.79 % (3531774)------------------------------
% 3.00/0.79 % (3531774)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531774)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531774)Termination reason: Instruction limit
% 3.00/0.79 % (3531774)Termination phase: Saturation
% 3.00/0.79 % (3531774)Time elapsed: 0.105 s
% 3.00/0.79 % (3531774)Peak memory usage: 12 MB
% 3.00/0.79 % (3531774)Instructions burned: 104 (million)
% 3.00/0.79 % (3531777)Instruction limit reached!
% 3.00/0.79 % (3531777)------------------------------
% 3.00/0.79 % (3531777)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531777)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531777)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531777)Termination reason: Instruction limit
% 3.00/0.79 % (3531777)Termination phase: Saturation
% 3.00/0.79 % (3531777)Time elapsed: 0.125 s
% 3.00/0.79 % (3531777)Peak memory usage: 12 MB
% 3.00/0.79 % (3531777)Instructions burned: 132 (million)
% 3.00/0.79 % (3531788)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1782661381:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 3.00/0.79 % (3531789)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2482148191:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.00/0.79 % TRYING [1]
% 3.00/0.79 % TRYING [2]
% 3.00/0.79 % TRYING [3]
% 3.00/0.79 % (3531778)Instruction limit reached!
% 3.00/0.79 % (3531778)------------------------------
% 3.00/0.79 % (3531778)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531778)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531778)Termination reason: Instruction limit
% 3.00/0.79 % (3531778)Termination phase: Saturation
% 3.00/0.79 % (3531778)Time elapsed: 0.149 s
% 3.00/0.79 % (3531778)Peak memory usage: 14 MB
% 3.00/0.79 % (3531778)Instructions burned: 160 (million)
% 3.00/0.79 % (3531790)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2047990883:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.00/0.79 % (3531793)ott-21_1_sil=16000:fs=off:random_seed=2560533157:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.00/0.79 % TRYING [7]
% 3.00/0.79 % TRYING [4]
% 3.00/0.79 % (3531789)Instruction limit reached!
% 3.00/0.79 % (3531789)------------------------------
% 3.00/0.79 % (3531789)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531789)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531789)Termination reason: Instruction limit
% 3.00/0.79 % (3531789)Termination phase: Saturation
% 3.00/0.79 % (3531789)Time elapsed: 0.147 s
% 3.00/0.79 % (3531789)Peak memory usage: 13 MB
% 3.00/0.79 % (3531789)Instructions burned: 131 (million)
% 3.00/0.79 % (3531799)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3322015110:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.00/0.79 % (3531793)Instruction limit reached!
% 3.00/0.79 % (3531793)------------------------------
% 3.00/0.79 % (3531793)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531793)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531793)Termination reason: Instruction limit
% 3.00/0.79 % (3531793)Termination phase: Saturation
% 3.00/0.79 % (3531793)Time elapsed: 0.137 s
% 3.00/0.79 % (3531793)Peak memory usage: 11 MB
% 3.00/0.79 % (3531793)Instructions burned: 180 (million)
% 3.00/0.79 % TRYING [8]
% 3.00/0.79 % (3531801)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2258636353:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 3.00/0.79 % TRYING [1]
% 3.00/0.79 % TRYING [2]
% 3.00/0.79 % TRYING [3]
% 3.00/0.79 % TRYING [4]
% 3.00/0.79 % TRYING [5]
% 3.00/0.79 % (3531790) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3531765-3531790"...
% 3.00/0.79 % (3531790)...printing done.
% 3.00/0.79 % (3531790)Refutation found. Thanks to Tanya!
% 3.00/0.79 % SZS status Unsatisfiable for theBenchmark
% 3.00/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 3.00/0.79 % (3531790)------------------------------
% 3.00/0.79 % (3531790)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.79 % (3531790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.79 % (3531790)CaDiCaL version: 2.1.3
% 3.00/0.79 % (3531790)Termination reason: Refutation
% 3.00/0.79 % (3531790)Time elapsed: 0.301 s
% 3.00/0.79 % (3531790)Peak memory usage: 15 MB
% 3.00/0.79 % (3531790)Instructions burned: 335 (million)
% 3.00/0.79 % (3531765)Success in time 0.507 s
% 3.00/0.79 % Vampire exiting
%------------------------------------------------------------------------------