%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR020+1 : TPTP v9.3.1. Bugfixed v3.1.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 09:44:21 AM UTC 2026
% Result : Theorem 0.19s 0.30s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 95 ( 25 unt; 10 def)
% Number of atoms : 335 ( 122 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 372 ( 132 ~; 135 |; 86 &)
% ( 18 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 124 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& terminates(X0,X2,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(f14,axiom,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(f16,axiom,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| ( X0 = push
& X1 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f33,axiom,
~ ? [X0] : less(X0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
fof(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X1 != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
~ holdsAt(spinning,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_2) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(spinning,n2),
inference(flattening,[],[f49]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(flattening,[],[f67]) ).
fof(f73,plain,
! [X0] : ~ less(X0,n0),
inference(ennf_transformation,[],[f33]) ).
fof(f77,definition,
! [X0,X1,X2] :
( sP2(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f78,definition,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) ) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X0,X1,X2] :
( sP4(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f80,definition,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f81,definition,
! [X0,X1,X2] :
( sP6(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f82,definition,
! [X0,X1,X2] :
( sP7(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2) ) ),
introduced(definition,[new_symbols(definition,[sP7])],[predicate_definition_introduction]) ).
fof(f83,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X0,X1,X2) ),
inference(definition_folding,[],[f14,f82,f81,f80,f79,f78,f77]) ).
fof(f84,definition,
! [X0,X1] :
( sP8(X0,X1)
<=> ( X0 = push
& X1 = n2 ) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f85,definition,
! [X0,X1] :
( sP9(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sP9])],[predicate_definition_introduction]) ).
fof(f86,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X0,X1) ),
inference(definition_folding,[],[f16,f85,f84]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(flattening,[],[f97]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) )
| ~ sP2(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f108,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) )
| ~ sP2(X0,X1,X2) ) ),
inference(flattening,[],[f107]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X0,X1,X2) )
& ( sP7(X0,X1,X2)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f110,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f111,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f113,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f112]) ).
fof(f114,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f115,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f116,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) ) ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f118,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f126,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f127,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f126]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f183,plain,
! [X2,X0,X1] :
( sP2(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f108]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f190,plain,
! [X0,X1] :
( n0 = X1
| pull = X0
| pull = X0
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f197,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f199,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| n2 = X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f202,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f204,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f212,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f220,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f116]) ).
fof(f222,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[],[f73]) ).
fof(f224,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f226,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f241,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f248,plain,
holdsAt(spinning,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f265,plain,
! [X2,X1] :
( sP2(pull,X1,X2)
| spinning != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f183]) ).
fof(f266,plain,
! [X2] :
( sP2(pull,spinning,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f265]) ).
fof(f269,plain,
! [X1] :
( sP9(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f197]) ).
fof(f270,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f269]) ).
fof(f275,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f220]) ).
fof(f276,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f241]) ).
fof(f277,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| pull = X0
| sP8(X0,X1)
| n0 = X1 ),
inference(duplicate_literal_removal,[],[f190]) ).
fof(f284,plain,
happens(pull,n1),
inference(resolution,[],[f203,f270]) ).
fof(f288,plain,
less(n0,n1),
inference(resolution,[],[f224,f275]) ).
fof(f292,plain,
less(n1,n2),
inference(resolution,[],[f226,f275]) ).
fof(f388,plain,
! [X0] :
( sP7(pull,spinning,X0)
| happens(push,X0) ),
inference(resolution,[],[f158,f266]) ).
fof(f498,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n1)
| ~ happens(X1,n1)
| ~ holdsAt(X0,n2) ),
inference(superposition,[],[f137,f212]) ).
fof(f709,plain,
! [X0] :
( terminates(pull,spinning,X0)
| happens(push,X0) ),
inference(resolution,[],[f388,f185]) ).
fof(f883,definition,
( spl14_11
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_11])],[avatar_definition]) ).
fof(f885,plain,
( n0 = n1
| ~ spl14_11 ),
inference(avatar_component_clause,[],[f883]) ).
fof(f922,plain,
( happens(push,n1)
| ~ happens(pull,n1)
| ~ holdsAt(spinning,n2) ),
inference(resolution,[],[f709,f498]) ).
fof(f923,plain,
( happens(push,n1)
| ~ holdsAt(spinning,n2) ),
inference(forward_subsumption_resolution,[],[f922,f284]) ).
fof(f924,plain,
happens(push,n1),
inference(forward_subsumption_resolution,[],[f923,f248]) ).
fof(f925,plain,
sP9(push,n1),
inference(resolution,[],[f924,f202]) ).
fof(f933,plain,
( push = pull
| sP8(push,n1)
| n0 = n1 ),
inference(resolution,[],[f925,f277]) ).
fof(f935,plain,
( sP8(push,n1)
| n0 = n1 ),
inference(forward_subsumption_resolution,[],[f933,f204]) ).
fof(f937,definition,
( spl14_12
<=> sP8(push,n1) ),
introduced(definition,[new_symbols(definition,[spl14_12])],[avatar_definition]) ).
fof(f939,plain,
( sP8(push,n1)
| ~ spl14_12 ),
inference(avatar_component_clause,[],[f937]) ).
fof(f940,plain,
( spl14_11
| spl14_12 ),
inference(avatar_split_clause,[],[f935,f937,f883]) ).
fof(f955,plain,
( less(n0,n0)
| ~ spl14_11 ),
inference(superposition,[],[f288,f885]) ).
fof(f997,plain,
( $false
| ~ spl14_11 ),
inference(forward_subsumption_resolution,[],[f955,f222]) ).
fof(f998,plain,
~ spl14_11,
inference(avatar_contradiction_clause,[],[f997]) ).
fof(f1011,plain,
( n1 = n2
| ~ spl14_12 ),
inference(resolution,[],[f939,f199]) ).
fof(f1030,plain,
( less(n1,n1)
| ~ spl14_12 ),
inference(superposition,[],[f292,f1011]) ).
fof(f1060,plain,
( $false
| ~ spl14_12 ),
inference(forward_subsumption_resolution,[],[f1030,f276]) ).
fof(f1061,plain,
~ spl14_12,
inference(avatar_contradiction_clause,[],[f1060]) ).
cnf(s16,plain,
( spl14_11
| spl14_12 ),
inference(sat_conversion,[],[f940]) ).
cnf(s18,plain,
~ spl14_11,
inference(sat_conversion,[],[f998]) ).
cnf(s22,plain,
~ spl14_12,
inference(sat_conversion,[],[f1061]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s16,s22,s18]) ).
fof(f1067,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR020+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n016.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 22:10:34 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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
% 0.19/0.30 % (4089603)Will run a generic schedule for satisfiability detection.
% 0.19/0.30 % (4089608)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3833025650_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30 % (4089609)% WARNING: option uhcvi not known.
% 0.19/0.30 % Detected minimum model sizes of [3]
% 0.19/0.30 % Detected maximum model sizes of [max]
% 0.19/0.30 % TRYING [3]
% 0.19/0.30 % TRYING [4]
% 0.19/0.30 % (4089611)dis+10_1_sil=32000:sp=arity:random_seed=1975021668:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30 % (4089609)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3948215552:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30 % (4089610)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3734905058:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30 % (4089612)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=425587272:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30 % (4089613)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2671996214:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30 % (4089614)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3598491282:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30 % TRYING [5]
% 0.19/0.30 % TRYING [6]
% 0.19/0.30 % (4089611) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4089603-4089611"...
% 0.19/0.30 % (4089613) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4089603-4089613"...
% 0.19/0.30 % (4089609) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4089603-4089609"...
% 0.19/0.30 % (4089612) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4089603-4089612"...
% 0.19/0.30 % (4089611)...printing done.
% 0.19/0.30 % (4089611)Refutation found. Thanks to Tanya!
% 0.19/0.30 % SZS status Theorem for theBenchmark
% 0.19/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.30 % (4089611)------------------------------
% 0.19/0.30 % (4089611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (4089611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (4089611)CaDiCaL version: 2.1.3
% 0.19/0.30 % (4089611)Termination reason: Refutation
% 0.19/0.30 % (4089611)Time elapsed: 0.021 s
% 0.19/0.30 % (4089611)Peak memory usage: 13 MB
% 0.19/0.30 % (4089611)Instructions burned: 31 (million)
% 0.19/0.30 % (4089603)Success in time 0.062 s
% 0.19/0.30 % Vampire exiting
%------------------------------------------------------------------------------