%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ021-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 12:31:56 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.54s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 105 ( 15 unt; 9 def)
% Number of atoms : 223 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 215 ( 97 ~; 109 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 96 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ a_truth(knave(X0),X1)
| ~ a_truth(knight(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_knight_and_knave) ).
fof(f2,axiom,
! [X0,X1] :
( a_truth(knight(X0),X1)
| a_truth(knave(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knight_or_knave) ).
fof(f3,axiom,
! [X0,X1] :
( ~ a_truth(poor(X0),X1)
| ~ a_truth(rich(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_rich_and_poor) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ a_truth(knight(X0),X1)
| ~ says(X0,X2)
| a_truth(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knights_tell_truth1) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ a_truth(knave(X0),X1)
| ~ says(X0,X2)
| ~ a_truth(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knaves_lie1) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ a_truth(knave(X0),X1)
| says(X0,X2)
| a_truth(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knaves_lie2) ).
fof(f9,axiom,
! [X2,X0,X1] :
( ~ a_truth(and(X0,X1),X2)
| a_truth(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjunction1) ).
fof(f10,axiom,
! [X2,X0,X1] :
( ~ a_truth(and(X0,X1),X2)
| a_truth(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjunction2) ).
fof(f12,negated_conjecture,
! [X0] :
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_statement_exists1) ).
fof(f13,negated_conjecture,
! [X0] :
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_statement_exists2) ).
fof(f15,definition,
( spl0_1
<=> ! [X0] : ~ says(me,X0) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f16,plain,
( ! [X0] : ~ says(me,X0)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f18,definition,
( spl0_2
<=> ! [X0] : ~ a_truth(and(knave(me),rich(me)),X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f19,plain,
( ! [X0] : ~ a_truth(and(knave(me),rich(me)),X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f78,definition,
( spl0_10
<=> ! [X2,X1] : ~ a_truth(X2,X1) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f79,plain,
( ! [X2,X1] : ~ a_truth(X2,X1)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f81,definition,
( spl0_11
<=> ! [X0] : says(me,X0) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f82,plain,
( ! [X0] : says(me,X0)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f87,plain,
! [X0] :
( a_truth(knave(me),X0)
| says(me,X0) ),
inference(resolution,[],[f13,f9]) ).
fof(f111,plain,
! [X0] :
( a_truth(rich(me),X0)
| says(me,X0) ),
inference(resolution,[],[f10,f13]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ says(X0,X1)
| a_truth(X1,X2)
| a_truth(knave(X0),X2) ),
inference(resolution,[],[f5,f2]) ).
fof(f134,plain,
( ! [X0,X1] : a_truth(knave(X0),X1)
| ~ spl0_10 ),
inference(resolution,[],[f79,f2]) ).
fof(f141,plain,
( $false
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f134,f79]) ).
fof(f142,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f177,plain,
( ! [X0,X1] :
( a_truth(X0,X1)
| a_truth(knave(me),X1) )
| ~ spl0_11 ),
inference(resolution,[],[f129,f82]) ).
fof(f179,definition,
( spl0_18
<=> ! [X1] : a_truth(knave(me),X1) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f180,plain,
( ! [X1] : a_truth(knave(me),X1)
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f185,plain,
( ! [X0,X1] :
( a_truth(knave(me),X1)
| ~ a_truth(knight(X0),X1) )
| ~ spl0_11 ),
inference(resolution,[],[f177,f1]) ).
fof(f199,plain,
( ! [X1] : a_truth(knave(me),X1)
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f185,f177]) ).
fof(f203,plain,
( ! [X1] : a_truth(knave(me),X1)
| ~ spl0_11 ),
inference(global_subsumption,[],[f199]) ).
fof(f209,plain,
( ! [X0,X1] :
( ~ says(me,X0)
| ~ a_truth(X0,X1) )
| ~ spl0_18 ),
inference(resolution,[],[f180,f7]) ).
fof(f237,plain,
( ! [X0,X1] : ~ a_truth(X0,X1)
| ~ spl0_11
| ~ spl0_18 ),
inference(resolution,[],[f82,f209]) ).
fof(f239,plain,
( spl0_10
| ~ spl0_11
| ~ spl0_18 ),
inference(avatar_split_clause,[],[f237,f179,f81,f78]) ).
fof(f245,plain,
( ! [X1] : a_truth(knave(me),X1)
| ~ spl0_11 ),
inference(global_subsumption,[],[f203]) ).
fof(f246,plain,
( spl0_18
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f245,f81,f179]) ).
fof(f247,plain,
! [X0,X1] :
( says(me,X0)
| says(me,X1)
| a_truth(X1,X0) ),
inference(resolution,[],[f87,f8]) ).
fof(f248,plain,
! [X0,X1] :
( ~ says(me,X1)
| says(me,X0)
| ~ a_truth(X1,X0) ),
inference(resolution,[],[f87,f7]) ).
fof(f249,plain,
! [X0] :
( ~ a_truth(knight(me),X0)
| says(me,X0) ),
inference(resolution,[],[f87,f1]) ).
fof(f262,plain,
! [X0] :
( says(me,X0)
| a_truth(X0,X0) ),
inference(factoring,[],[f247]) ).
fof(f264,definition,
( spl0_20
<=> ! [X0] : a_truth(X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f265,plain,
( ! [X0] : a_truth(X0,X0)
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
! [X0,X1] :
( a_truth(X0,X0)
| a_truth(X0,X1)
| a_truth(knave(me),X1) ),
inference(resolution,[],[f262,f129]) ).
fof(f273,plain,
! [X0] :
( ~ a_truth(rich(X0),poor(X0))
| says(me,poor(X0)) ),
inference(resolution,[],[f262,f3]) ).
fof(f361,plain,
( says(me,knight(me))
| says(me,knight(me)) ),
inference(resolution,[],[f249,f262]) ).
fof(f362,plain,
says(me,knight(me)),
inference(duplicate_literal_removal,[],[f361]) ).
fof(f364,plain,
says(me,knight(me)),
inference(global_subsumption,[],[f362]) ).
fof(f375,plain,
! [X0,X1] :
( ~ a_truth(X1,X0)
| says(me,X0)
| a_truth(X1,X1) ),
inference(resolution,[],[f248,f262]) ).
fof(f400,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f16,f364]) ).
fof(f401,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f400]) ).
fof(f411,plain,
( ! [X0,X1] :
( says(me,X0)
| a_truth(X0,X1) )
| ~ spl0_18 ),
inference(resolution,[],[f180,f8]) ).
fof(f491,plain,
( ! [X0] :
( says(me,and(knave(me),rich(me)))
| ~ says(me,X0) )
| ~ spl0_18 ),
inference(resolution,[],[f411,f12]) ).
fof(f913,definition,
( spl0_31
<=> says(me,and(knave(me),rich(me))) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f914,plain,
( ~ says(me,and(knave(me),rich(me)))
| spl0_31 ),
inference(avatar_component_clause,[],[f913]) ).
fof(f915,plain,
( says(me,and(knave(me),rich(me)))
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f913]) ).
fof(f916,plain,
( spl0_1
| spl0_31
| ~ spl0_18 ),
inference(avatar_split_clause,[],[f491,f179,f913,f15]) ).
fof(f918,plain,
( ! [X0] :
( says(me,X0)
| ~ a_truth(and(knave(me),rich(me)),X0) )
| ~ spl0_31 ),
inference(resolution,[],[f915,f248]) ).
fof(f921,plain,
( ! [X0] : ~ a_truth(and(knave(me),rich(me)),X0)
| ~ spl0_31 ),
inference(forward_subsumption_resolution,[],[f918,f12]) ).
fof(f923,plain,
( ! [X0] : says(me,X0)
| ~ spl0_2 ),
inference(resolution,[],[f19,f13]) ).
fof(f930,plain,
( spl0_11
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f923,f18,f81]) ).
fof(f932,plain,
( spl0_2
| ~ spl0_31 ),
inference(avatar_split_clause,[],[f921,f913,f18]) ).
fof(f967,plain,
( says(me,poor(me))
| says(me,poor(me)) ),
inference(resolution,[],[f273,f111]) ).
fof(f970,plain,
says(me,poor(me)),
inference(duplicate_literal_removal,[],[f967]) ).
fof(f1185,plain,
! [X0] :
( a_truth(poor(me),X0)
| a_truth(knave(me),X0) ),
inference(resolution,[],[f970,f129]) ).
fof(f1221,plain,
! [X0] :
( ~ a_truth(rich(me),X0)
| a_truth(knave(me),X0) ),
inference(resolution,[],[f1185,f3]) ).
fof(f1251,plain,
! [X0] :
( says(me,X0)
| a_truth(rich(me),rich(me))
| says(me,X0) ),
inference(resolution,[],[f375,f111]) ).
fof(f1256,plain,
! [X0] :
( says(me,X0)
| a_truth(rich(me),rich(me)) ),
inference(duplicate_literal_removal,[],[f1251]) ).
fof(f1263,definition,
( spl0_39
<=> a_truth(rich(me),rich(me)) ),
introduced(definition,[new_symbols(definition,[spl0_39])],[avatar_definition]) ).
fof(f1265,plain,
( a_truth(rich(me),rich(me))
| ~ spl0_39 ),
inference(avatar_component_clause,[],[f1263]) ).
fof(f1266,plain,
( spl0_39
| spl0_11 ),
inference(avatar_split_clause,[],[f1256,f81,f1263]) ).
fof(f1283,plain,
( a_truth(knave(me),rich(me))
| ~ spl0_39 ),
inference(resolution,[],[f1265,f1221]) ).
fof(f1285,plain,
( ! [X0] :
( a_truth(X0,rich(me))
| says(me,X0) )
| ~ spl0_39 ),
inference(resolution,[],[f1283,f8]) ).
fof(f1558,definition,
( spl0_42
<=> ! [X0] : a_truth(X0,rich(me)) ),
introduced(definition,[new_symbols(definition,[spl0_42])],[avatar_definition]) ).
fof(f1559,plain,
( ! [X0] : a_truth(X0,rich(me))
| ~ spl0_42 ),
inference(avatar_component_clause,[],[f1558]) ).
fof(f1578,plain,
( ! [X0,X1] :
( says(me,and(X0,X1))
| a_truth(X0,rich(me)) )
| ~ spl0_39 ),
inference(resolution,[],[f1285,f9]) ).
fof(f1614,plain,
( ! [X0] : ~ a_truth(rich(X0),rich(me))
| ~ spl0_42 ),
inference(resolution,[],[f1559,f3]) ).
fof(f1623,plain,
( $false
| ~ spl0_42 ),
inference(forward_subsumption_resolution,[],[f1614,f1559]) ).
fof(f1624,plain,
~ spl0_42,
inference(avatar_contradiction_clause,[],[f1623]) ).
fof(f3702,plain,
! [X0] :
( a_truth(X0,X0)
| a_truth(knave(me),X0) ),
inference(factoring,[],[f266]) ).
fof(f3780,plain,
! [X0,X1] :
( a_truth(X0,X0)
| says(me,X1)
| a_truth(X1,X0) ),
inference(resolution,[],[f3702,f8]) ).
fof(f3991,plain,
! [X0] :
( a_truth(X0,X0)
| says(me,and(knave(me),rich(me)))
| ~ says(me,X0) ),
inference(resolution,[],[f3780,f12]) ).
fof(f4022,plain,
! [X0] :
( a_truth(X0,X0)
| says(me,and(knave(me),rich(me))) ),
inference(forward_subsumption_resolution,[],[f3991,f262]) ).
fof(f4026,plain,
( ! [X0] : a_truth(X0,X0)
| spl0_31 ),
inference(forward_subsumption_resolution,[],[f4022,f914]) ).
fof(f4030,plain,
( spl0_20
| spl0_31 ),
inference(avatar_split_clause,[],[f4026,f913,f264]) ).
fof(f4051,plain,
( ! [X0,X1] : a_truth(X0,and(X1,X0))
| ~ spl0_20 ),
inference(resolution,[],[f265,f10]) ).
fof(f4089,plain,
( ! [X2,X0,X1] :
( ~ a_truth(X1,and(X2,knave(X0)))
| ~ says(X0,X1) )
| ~ spl0_20 ),
inference(resolution,[],[f4051,f7]) ).
fof(f4112,plain,
( ! [X0,X1] : ~ says(X0,and(X1,knave(X0)))
| ~ spl0_20 ),
inference(resolution,[],[f4089,f265]) ).
fof(f4166,plain,
( ! [X0] : a_truth(X0,rich(me))
| ~ spl0_20
| ~ spl0_39 ),
inference(resolution,[],[f4112,f1578]) ).
fof(f4176,plain,
( spl0_42
| ~ spl0_20
| ~ spl0_39 ),
inference(avatar_split_clause,[],[f4166,f1263,f264,f1558]) ).
cnf(s126,plain,
~ spl0_10,
inference(sat_conversion,[],[f142]) ).
cnf(s228,plain,
( spl0_10
| ~ spl0_11
| ~ spl0_18 ),
inference(sat_conversion,[],[f239]) ).
cnf(s239,plain,
( ~ spl0_11
| spl0_18 ),
inference(sat_conversion,[],[f246]) ).
cnf(s369,plain,
~ spl0_1,
inference(sat_conversion,[],[f401]) ).
cnf(s743,plain,
( spl0_1
| ~ spl0_18
| spl0_31 ),
inference(sat_conversion,[],[f916]) ).
cnf(s758,plain,
( ~ spl0_2
| spl0_11 ),
inference(sat_conversion,[],[f930]) ).
cnf(s775,plain,
( spl0_2
| ~ spl0_31 ),
inference(sat_conversion,[],[f932]) ).
cnf(s984,plain,
( spl0_11
| spl0_39 ),
inference(sat_conversion,[],[f1266]) ).
cnf(s1151,plain,
~ spl0_42,
inference(sat_conversion,[],[f1624]) ).
cnf(s2006,plain,
( spl0_20
| spl0_31 ),
inference(sat_conversion,[],[f4030]) ).
cnf(s2109,plain,
( ~ spl0_20
| ~ spl0_39
| spl0_42 ),
inference(sat_conversion,[],[f4176]) ).
cnf(s2110,plain,
spl0_31,
inference(rat,[],[s984,s239,s2109,s743,s2006,s1151,s369]) ).
cnf(s2111,plain,
spl0_2,
inference(rat,[],[s775,s2110]) ).
cnf(s2112,plain,
spl0_11,
inference(rat,[],[s758,s2111]) ).
cnf(s2113,plain,
spl0_18,
inference(rat,[],[s239,s2112]) ).
cnf(s2114,plain,
$false,
inference(rat,[],[s228,s126,s2113,s2112]) ).
fof(f4177,plain,
$false,
inference(avatar_sat_refutation,[],[s2114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ021-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:33:06 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.54 % (3953267)Will run a generic schedule for satisfiability detection.
% 0.16/0.54 % (3953272)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3175802290_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.54 % TRYING [1]
% 0.16/0.54 % TRYING [2]
% 0.16/0.54 % TRYING [3]
% 0.16/0.54 % TRYING [4]
% 0.16/0.54 % TRYING [5]
% 0.16/0.54 % (3953273)% WARNING: option uhcvi not known.
% 0.16/0.54 % TRYING [6]
% 0.16/0.54 % (3953274)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3001235670:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.54 % (3953273)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1252963467:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.54 % (3953275)dis+10_1_sil=32000:sp=arity:random_seed=2283494609:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.54 % (3953276)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3107782618:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.54 % (3953277)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2222512153:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.54 % (3953278)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3155334590:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.54 % TRYING [7]
% 0.16/0.54 % TRYING [8]
% 0.16/0.54 % TRYING [9]
% 0.16/0.54 % TRYING [10]
% 0.16/0.54 % TRYING [11]
% 0.16/0.54 % (3953275)Instruction limit reached!
% 0.16/0.54 % (3953275)------------------------------
% 0.16/0.54 % (3953275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (3953275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (3953275)CaDiCaL version: 2.1.3
% 0.16/0.54 % (3953275)Termination reason: Instruction limit
% 0.16/0.54 % (3953275)Termination phase: Saturation
% 0.16/0.54 % (3953275)Time elapsed: 0.062 s
% 0.16/0.54 % (3953275)Peak memory usage: 11 MB
% 0.16/0.54 % (3953275)Instructions burned: 103 (million)
% 0.16/0.54 % TRYING [12]
% 0.16/0.54 % (3953276)Instruction limit reached!
% 0.16/0.54 % (3953276)------------------------------
% 0.16/0.54 % (3953276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (3953276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (3953276)CaDiCaL version: 2.1.3
% 0.16/0.54 % (3953276)Termination reason: Instruction limit
% 0.16/0.54 % (3953276)Termination phase: Saturation
% 0.16/0.54 % (3953276)Time elapsed: 0.067 s
% 0.16/0.54 % (3953276)Peak memory usage: 11 MB
% 0.16/0.54 % (3953276)Instructions burned: 116 (million)
% 0.16/0.54 % (3953277)Instruction limit reached!
% 0.16/0.54 % (3953277)------------------------------
% 0.16/0.54 % (3953277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (3953277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (3953277)CaDiCaL version: 2.1.3
% 0.16/0.54 % (3953277)Termination reason: Instruction limit
% 0.16/0.54 % (3953277)Termination phase: Saturation
% 0.16/0.54 % (3953277)Time elapsed: 0.073 s
% 0.16/0.54 % (3953277)Peak memory usage: 11 MB
% 0.16/0.54 % (3953277)Instructions burned: 131 (million)
% 0.16/0.54 % (3953274) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3953267-3953274"...
% 0.16/0.54 % (3953274)...printing done.
% 0.16/0.54 % (3953286)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3311683811:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/0.54 % (3953274)Refutation found. Thanks to Tanya!
% 0.16/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.55 % (3953274)------------------------------
% 0.16/0.55 % (3953274)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.55 % (3953274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.55 % (3953274)CaDiCaL version: 2.1.3
% 0.16/0.55 % (3953274)Termination reason: Refutation
% 0.16/0.55 % (3953274)Time elapsed: 0.080 s
% 0.16/0.55 % (3953274)Peak memory usage: 13 MB
% 0.16/0.55 % (3953274)Instructions burned: 129 (million)
% 0.16/0.55 % (3953267)Success in time 0.118 s
% 0.16/0.55 % Vampire exiting
%------------------------------------------------------------------------------