%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:05:19 PM UTC 2026
% Result : Theorem 0.49s 0.35s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 100 ( 25 unt; 7 def)
% Number of atoms : 316 ( 20 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 371 ( 155 ~; 170 |; 9 &)
% ( 15 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 80 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f110,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f111,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f113,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f216,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& strictorderedP(X2)
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f272,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK28(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f274,plain,
! [X0] :
( ~ ssList(X0)
| ~ leq(sK24(X0),sK25(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f275,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK27(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f276,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK26(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f277,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK25(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f278,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK24(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f279,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2)
| ~ strictorderedP(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f405,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| leq(X0,X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f216]) ).
fof(f410,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
strictorderedP(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
ssList(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
ssList(sK49),
inference(definition_unfolding,[],[f417,f412]) ).
fof(f420,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f410,f412]) ).
fof(f431,plain,
! [X2,X3,X1,X4,X5] :
( ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(equality_resolution,[],[f279]) ).
fof(f490,plain,
! [X0] :
( ssItem(sK24(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f278]) ).
fof(f491,plain,
! [X0] :
( ssItem(sK25(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f277]) ).
fof(f492,plain,
! [X0] :
( ~ ssList(sK26(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f276]) ).
fof(f493,plain,
! [X0] :
( ~ ssList(sK27(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f275]) ).
fof(f494,plain,
! [X0] :
( ~ leq(sK24(X0),sK25(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f274]) ).
fof(f495,plain,
! [X0] :
( ~ totalorderedP(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f273]) ).
fof(f496,plain,
! [X0] :
( ~ ssList(sK28(X0))
| ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f272]) ).
fof(f505,plain,
! [X2,X3,X1,X4,X5] :
( strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| ssList(X3)
| ssList(X4)
| ssList(X5)
| lt(X1,X2)
| ssList(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(consistent_polarity_flipping,[],[f431]) ).
fof(f616,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f418]) ).
fof(f620,plain,
~ strictorderedP(sK49),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f621,plain,
totalorderedP(sK49),
inference(consistent_polarity_flipping,[],[f420]) ).
fof(f2180,plain,
( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
| ssList(sK49) ),
inference(resolution,[],[f495,f621]) ).
fof(f2187,plain,
sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
inference(forward_subsumption_resolution,[],[f2180,f616]) ).
fof(f3091,plain,
( strictorderedP(sK49)
| ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ssList(sK26(sK49))
| ssList(sK27(sK49))
| ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| ssList(sK49) ),
inference(superposition,[],[f505,f2187]) ).
fof(f3170,definition,
( spl51_78
<=> ssList(sK28(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_78])],[avatar_definition]) ).
fof(f3172,plain,
( ssList(sK28(sK49))
| ~ spl51_78 ),
inference(avatar_component_clause,[],[f3170]) ).
fof(f3174,definition,
( spl51_79
<=> ssItem(sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_79])],[avatar_definition]) ).
fof(f3175,plain,
( ssItem(sK25(sK49))
| ~ spl51_79 ),
inference(avatar_component_clause,[],[f3174]) ).
fof(f3176,plain,
( ~ ssItem(sK25(sK49))
| spl51_79 ),
inference(avatar_component_clause,[],[f3174]) ).
fof(f3202,definition,
( spl51_86
<=> ssList(sK26(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_86])],[avatar_definition]) ).
fof(f3204,plain,
( ssList(sK26(sK49))
| ~ spl51_86 ),
inference(avatar_component_clause,[],[f3202]) ).
fof(f3210,plain,
( ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ssList(sK26(sK49))
| ssList(sK27(sK49))
| ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f3091,f620]) ).
fof(f3223,plain,
( ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ssList(sK26(sK49))
| ssList(sK27(sK49))
| ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49)) ),
inference(forward_subsumption_resolution,[],[f3210,f616]) ).
fof(f3225,definition,
( spl51_90
<=> leq(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_90])],[avatar_definition]) ).
fof(f3227,plain,
( leq(sK24(sK49),sK25(sK49))
| ~ spl51_90 ),
inference(avatar_component_clause,[],[f3225]) ).
fof(f3233,definition,
( spl51_92
<=> ssList(sK27(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_92])],[avatar_definition]) ).
fof(f3235,plain,
( ssList(sK27(sK49))
| ~ spl51_92 ),
inference(avatar_component_clause,[],[f3233]) ).
fof(f3237,definition,
( spl51_93
<=> ssItem(sK24(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_93])],[avatar_definition]) ).
fof(f3238,plain,
( ssItem(sK24(sK49))
| ~ spl51_93 ),
inference(avatar_component_clause,[],[f3237]) ).
fof(f3239,plain,
( ~ ssItem(sK24(sK49))
| spl51_93 ),
inference(avatar_component_clause,[],[f3237]) ).
fof(f3246,definition,
( spl51_95
<=> lt(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_95])],[avatar_definition]) ).
fof(f3248,plain,
( lt(sK24(sK49),sK25(sK49))
| ~ spl51_95 ),
inference(avatar_component_clause,[],[f3246]) ).
fof(f3258,plain,
( spl51_95
| spl51_78
| spl51_92
| spl51_86
| ~ spl51_79
| ~ spl51_93 ),
inference(avatar_split_clause,[],[f3223,f3237,f3174,f3202,f3233,f3170,f3246]) ).
fof(f3259,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| spl51_79 ),
inference(resolution,[],[f3176,f491]) ).
fof(f3260,plain,
( ~ totalorderedP(sK49)
| spl51_79 ),
inference(forward_subsumption_resolution,[],[f3259,f616]) ).
fof(f3261,plain,
( $false
| spl51_79 ),
inference(forward_subsumption_resolution,[],[f3260,f621]) ).
fof(f3262,plain,
spl51_79,
inference(avatar_contradiction_clause,[],[f3261]) ).
fof(f3493,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| spl51_93 ),
inference(resolution,[],[f3239,f490]) ).
fof(f3494,plain,
( ~ totalorderedP(sK49)
| spl51_93 ),
inference(forward_subsumption_resolution,[],[f3493,f616]) ).
fof(f3495,plain,
( $false
| spl51_93 ),
inference(forward_subsumption_resolution,[],[f3494,f621]) ).
fof(f3496,plain,
spl51_93,
inference(avatar_contradiction_clause,[],[f3495]) ).
fof(f3577,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_78 ),
inference(resolution,[],[f3172,f496]) ).
fof(f3578,plain,
( ~ totalorderedP(sK49)
| ~ spl51_78 ),
inference(forward_subsumption_resolution,[],[f3577,f616]) ).
fof(f3579,plain,
( $false
| ~ spl51_78 ),
inference(forward_subsumption_resolution,[],[f3578,f621]) ).
fof(f3580,plain,
~ spl51_78,
inference(avatar_contradiction_clause,[],[f3579]) ).
fof(f3894,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_86 ),
inference(resolution,[],[f3204,f492]) ).
fof(f3895,plain,
( ~ totalorderedP(sK49)
| ~ spl51_86 ),
inference(forward_subsumption_resolution,[],[f3894,f616]) ).
fof(f3896,plain,
( $false
| ~ spl51_86 ),
inference(forward_subsumption_resolution,[],[f3895,f621]) ).
fof(f3897,plain,
~ spl51_86,
inference(avatar_contradiction_clause,[],[f3896]) ).
fof(f3999,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_92 ),
inference(resolution,[],[f3235,f493]) ).
fof(f4000,plain,
( ~ totalorderedP(sK49)
| ~ spl51_92 ),
inference(forward_subsumption_resolution,[],[f3999,f616]) ).
fof(f4001,plain,
( $false
| ~ spl51_92 ),
inference(forward_subsumption_resolution,[],[f4000,f621]) ).
fof(f4002,plain,
~ spl51_92,
inference(avatar_contradiction_clause,[],[f4001]) ).
fof(f4294,plain,
( ~ ssItem(sK25(sK49))
| leq(sK24(sK49),sK25(sK49))
| ~ ssItem(sK24(sK49))
| ~ spl51_95 ),
inference(resolution,[],[f3248,f405]) ).
fof(f4297,plain,
( leq(sK24(sK49),sK25(sK49))
| ~ ssItem(sK24(sK49))
| ~ spl51_79
| ~ spl51_95 ),
inference(forward_subsumption_resolution,[],[f4294,f3175]) ).
fof(f4302,plain,
( leq(sK24(sK49),sK25(sK49))
| ~ spl51_79
| ~ spl51_93
| ~ spl51_95 ),
inference(forward_subsumption_resolution,[],[f4297,f3238]) ).
fof(f4307,plain,
( spl51_90
| ~ spl51_79
| ~ spl51_93
| ~ spl51_95 ),
inference(avatar_split_clause,[],[f4302,f3246,f3237,f3174,f3225]) ).
fof(f4312,plain,
( ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_90 ),
inference(resolution,[],[f3227,f494]) ).
fof(f4320,plain,
( ~ totalorderedP(sK49)
| ~ spl51_90 ),
inference(forward_subsumption_resolution,[],[f4312,f616]) ).
fof(f4324,plain,
( $false
| ~ spl51_90 ),
inference(forward_subsumption_resolution,[],[f4320,f621]) ).
fof(f4325,plain,
~ spl51_90,
inference(avatar_contradiction_clause,[],[f4324]) ).
cnf(s93,plain,
( spl51_78
| ~ spl51_79
| spl51_86
| spl51_92
| ~ spl51_93
| spl51_95 ),
inference(sat_conversion,[],[f3258]) ).
cnf(s94,plain,
spl51_79,
inference(sat_conversion,[],[f3262]) ).
cnf(s110,plain,
spl51_93,
inference(sat_conversion,[],[f3496]) ).
cnf(s117,plain,
~ spl51_78,
inference(sat_conversion,[],[f3580]) ).
cnf(s134,plain,
~ spl51_86,
inference(sat_conversion,[],[f3897]) ).
cnf(s145,plain,
~ spl51_92,
inference(sat_conversion,[],[f4002]) ).
cnf(s159,plain,
( ~ spl51_79
| spl51_90
| ~ spl51_93
| ~ spl51_95 ),
inference(sat_conversion,[],[f4307]) ).
cnf(s160,plain,
~ spl51_90,
inference(sat_conversion,[],[f4325]) ).
cnf(s163,plain,
( ~ spl51_79
| ~ spl51_93
| ~ spl51_95 ),
inference(rat,[],[s159,s160]) ).
cnf(s164,plain,
~ spl51_95,
inference(rat,[],[s163,s110,s94]) ).
cnf(s165,plain,
$false,
inference(rat,[],[s93,s164,s110,s145,s134,s94,s117]) ).
fof(f4335,plain,
$false,
inference(avatar_sat_refutation,[],[s165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.18 % Computer : n014.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Mon Sep 28 08:46:16 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21 Running first-order model finding
% 0.11/0.21 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.49/0.35 % (1640426)Will run a generic schedule for satisfiability detection.
% 0.49/0.35 % (1640435)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2446843781:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.49/0.35 % (1640432)% WARNING: option uhcvi not known.
% 0.49/0.35 % (1640431)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=555883167_2999 on theBenchmark for (2999ds/0Mi)
% 0.49/0.35 % (1640434)dis+10_1_sil=32000:sp=arity:random_seed=1359576747:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.49/0.35 % (1640432)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2492062435:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.49/0.35 % (1640433)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1669986524:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.49/0.35 % (1640436)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3463222350:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.49/0.35 % (1640437)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2632711697:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.49/0.35 % TRYING [1]
% 0.49/0.35 % TRYING [2]
% 0.49/0.35 % TRYING [3]
% 0.49/0.35 % (1640435)Instruction limit reached!
% 0.49/0.35 % (1640435)------------------------------
% 0.49/0.35 % (1640435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.35 % (1640435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.35 % (1640435)CaDiCaL version: 2.1.3
% 0.49/0.35 % (1640435)Termination reason: Instruction limit
% 0.49/0.35 % (1640435)Termination phase: Saturation
% 0.49/0.35 % (1640435)Time elapsed: 0.036 s
% 0.49/0.35 % (1640435)Peak memory usage: 13 MB
% 0.49/0.35 % (1640435)Instructions burned: 118 (million)
% 0.49/0.35 % TRYING [4]
% 0.49/0.35 % (1640445)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1886723084:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.49/0.35 % TRYING [1]
% 0.49/0.35 % TRYING [2]
% 0.49/0.35 % TRYING [3]
% 0.49/0.35 % TRYING [4]
% 0.49/0.35 % (1640434)Instruction limit reached!
% 0.49/0.35 % (1640434)------------------------------
% 0.49/0.35 % (1640434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.35 % (1640434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.35 % (1640434)CaDiCaL version: 2.1.3
% 0.49/0.35 % (1640434)Termination reason: Instruction limit
% 0.49/0.35 % (1640434)Termination phase: Saturation
% 0.49/0.35 % (1640434)Time elapsed: 0.060 s
% 0.49/0.35 % (1640434)Peak memory usage: 13 MB
% 0.49/0.35 % (1640434)Instructions burned: 103 (million)
% 0.49/0.35 % (1640436)Instruction limit reached!
% 0.49/0.35 % (1640436)------------------------------
% 0.49/0.35 % (1640436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.35 % (1640436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.35 % (1640436)CaDiCaL version: 2.1.3
% 0.49/0.35 % (1640436)Termination reason: Instruction limit
% 0.49/0.35 % (1640436)Termination phase: Saturation
% 0.49/0.35 % (1640436)Time elapsed: 0.075 s
% 0.49/0.35 % (1640436)Peak memory usage: 14 MB
% 0.49/0.35 % (1640436)Instructions burned: 131 (million)
% 0.49/0.35 % (1640447)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2826823559:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.49/0.35 % TRYING [5]
% 0.49/0.35 % TRYING [5]
% 0.49/0.35 % (1640432) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1640426-1640432"...
% 0.49/0.35 % (1640432)...printing done.
% 0.49/0.35 % (1640432)Refutation found. Thanks to Tanya!
% 0.49/0.35 % SZS status Theorem for theBenchmark
% 0.49/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.49/0.35 % (1640432)------------------------------
% 0.49/0.35 % (1640432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.35 % (1640432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.35 % (1640432)CaDiCaL version: 2.1.3
% 0.49/0.35 % (1640432)Termination reason: Refutation
% 0.49/0.35 % (1640432)Time elapsed: 0.089 s
% 0.49/0.35 % (1640432)Peak memory usage: 15 MB
% 0.49/0.35 % (1640432)Instructions burned: 155 (million)
% 0.49/0.35 % (1640426)Success in time 0.127 s
% 0.49/0.35 % Vampire exiting
%------------------------------------------------------------------------------