%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV401+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:21:10 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 97 ( 15 unt; 7 def)
% Number of atoms : 221 ( 30 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 207 ( 83 ~; 93 |; 13 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn 132 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax29) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax30) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& less_than(X3,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l37_co) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& less_than(X3,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f24,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f24]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f32,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f33,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ) ),
inference(flattening,[],[f32]) ).
fof(f35,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f37,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4] :
( X3 != X4
| X1 != X2
| pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ),
inference(cnf_transformation,[],[f11]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X3 = X4 ),
inference(cnf_transformation,[],[f11]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X1 = X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f49,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f11]) ).
fof(f55,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f56,plain,
! [X2,X3,X0,X1] :
( ~ less_than(X2,X3)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f57,plain,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f33]) ).
fof(f58,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f33]) ).
fof(f59,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2),
inference(cnf_transformation,[],[f33]) ).
fof(f60,plain,
! [X2,X3,X1] :
( ~ less_than(X3,X2)
| ~ pair_in_list(sK0,X1,X2)
| pair_in_list(update_slb(sK0,X3),X1,X2) ),
inference(cnf_transformation,[],[f33]) ).
fof(f62,plain,
! [X2,X0,X1,X4] :
( X1 != X2
| pair_in_list(insert_slb(X0,pair(X1,X4)),X2,X4) ),
inference(equality_resolution,[],[f46]) ).
fof(f63,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f62]) ).
fof(f65,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f67,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| less_than(X0,X1)
| ~ strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(consistent_polarity_flipping,[],[f55]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( less_than(X2,X3)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
inference(consistent_polarity_flipping,[],[f56]) ).
fof(f73,plain,
! [X2,X3,X1] :
( pair_in_list(update_slb(sK0,X3),X1,X2)
| ~ pair_in_list(sK0,X1,X2)
| less_than(X3,X2) ),
inference(consistent_polarity_flipping,[],[f60]) ).
fof(f74,plain,
~ less_than(sK3,sK2),
inference(consistent_polarity_flipping,[],[f57]) ).
fof(f75,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f67,f65]) ).
fof(f78,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f47,f58]) ).
fof(f82,definition,
( spl6_1
<=> sK2 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f84,plain,
( sK2 = sK5
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f86,definition,
( spl6_2
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f88,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f89,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f78,f86,f82]) ).
fof(f90,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f48,f58]) ).
fof(f94,definition,
( spl6_3
<=> sK1 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f96,plain,
( sK1 = sK4
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f97,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f90,f86,f94]) ).
fof(f101,plain,
! [X2,X3,X0,X1] :
( ~ less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3)) ),
inference(resolution,[],[f71,f75]) ).
fof(f102,plain,
! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK2)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK2)),
inference(resolution,[],[f72,f74]) ).
fof(f110,plain,
! [X2,X3,X0,X1,X4,X5] :
( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
| update_slb(insert_slb(X4,pair(X5,X2)),X3) = insert_slb(update_slb(X4,X3),pair(X5,X2)) ),
inference(resolution,[],[f101,f72]) ).
fof(f276,plain,
! [X0,X1] :
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3) ),
inference(superposition,[],[f59,f110]) ).
fof(f284,definition,
( spl6_8
<=> ! [X0,X1] : insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f285,plain,
( ! [X0,X1] : insert_slb(update_slb(X0,sK3),pair(X1,sK3)) = update_slb(insert_slb(X0,pair(X1,sK5)),sK3)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f287,definition,
( spl6_9
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f288,plain,
( pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f289,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| spl6_9 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f290,plain,
( spl6_8
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f276,f287,f284]) ).
fof(f295,definition,
( spl6_11
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f297,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| spl6_11 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f372,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_9 ),
inference(resolution,[],[f289,f49]) ).
fof(f373,plain,
( ~ pair_in_list(sK0,sK1,sK2)
| less_than(sK3,sK2)
| spl6_9 ),
inference(resolution,[],[f372,f73]) ).
fof(f374,plain,
( less_than(sK3,sK2)
| ~ spl6_2
| spl6_9 ),
inference(forward_subsumption_resolution,[],[f373,f88]) ).
fof(f375,plain,
( $false
| ~ spl6_2
| spl6_9 ),
inference(forward_subsumption_resolution,[],[f374,f74]) ).
fof(f376,plain,
( ~ spl6_2
| spl6_9 ),
inference(avatar_contradiction_clause,[],[f375]) ).
fof(f392,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| sK1 = sK4
| ~ spl6_9 ),
inference(resolution,[],[f288,f48]) ).
fof(f393,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| sK2 = sK5
| ~ spl6_9 ),
inference(resolution,[],[f288,f47]) ).
fof(f395,definition,
( spl6_13
<=> pair_in_list(update_slb(sK0,sK3),sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).
fof(f397,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| ~ spl6_13 ),
inference(avatar_component_clause,[],[f395]) ).
fof(f399,plain,
( spl6_3
| spl6_13
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f392,f287,f395,f94]) ).
fof(f403,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,sK5)),sK3),sK1,sK2)
| ~ spl6_3 ),
inference(superposition,[],[f59,f96]) ).
fof(f406,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,sK2)),sK3),sK1,sK2)
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f403,f84]) ).
fof(f407,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK2)),sK1,sK2)
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f406,f102]) ).
fof(f408,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f407,f63]) ).
fof(f409,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f408]) ).
fof(f411,plain,
( spl6_1
| spl6_13
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f393,f287,f395,f82]) ).
fof(f454,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| ~ spl6_8 ),
inference(superposition,[],[f59,f285]) ).
fof(f471,plain,
( ~ spl6_11
| ~ spl6_8 ),
inference(avatar_split_clause,[],[f454,f284,f295]) ).
fof(f474,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_11 ),
inference(resolution,[],[f297,f49]) ).
fof(f475,plain,
( $false
| spl6_11
| ~ spl6_13 ),
inference(forward_subsumption_resolution,[],[f474,f397]) ).
fof(f476,plain,
( spl6_11
| ~ spl6_13 ),
inference(avatar_contradiction_clause,[],[f475]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f89]) ).
cnf(s2,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f97]) ).
cnf(s6,plain,
( spl6_8
| ~ spl6_9 ),
inference(sat_conversion,[],[f290]) ).
cnf(s11,plain,
( ~ spl6_2
| spl6_9 ),
inference(sat_conversion,[],[f376]) ).
cnf(s13,plain,
( spl6_3
| ~ spl6_9
| spl6_13 ),
inference(sat_conversion,[],[f399]) ).
cnf(s14,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f409]) ).
cnf(s15,plain,
( spl6_1
| ~ spl6_9
| spl6_13 ),
inference(sat_conversion,[],[f411]) ).
cnf(s30,plain,
( ~ spl6_8
| ~ spl6_11 ),
inference(sat_conversion,[],[f471]) ).
cnf(s31,plain,
( spl6_11
| ~ spl6_13 ),
inference(sat_conversion,[],[f476]) ).
cnf(s32,plain,
( ~ spl6_9
| spl6_1 ),
inference(rat,[],[s30,s31,s6,s15]) ).
cnf(s33,plain,
spl6_1,
inference(rat,[],[s32,s11,s1]) ).
cnf(s34,plain,
~ spl6_3,
inference(rat,[],[s14,s33]) ).
cnf(s35,plain,
spl6_2,
inference(rat,[],[s2,s34]) ).
cnf(s36,plain,
spl6_9,
inference(rat,[],[s11,s35]) ).
cnf(s38,plain,
spl6_13,
inference(rat,[],[s13,s34,s36]) ).
cnf(s40,plain,
spl6_8,
inference(rat,[],[s6,s36]) ).
cnf(s42,plain,
spl6_11,
inference(rat,[],[s31,s38]) ).
cnf(s44,plain,
$false,
inference(rat,[],[s30,s42,s40]) ).
fof(f477,plain,
$false,
inference(avatar_sat_refutation,[],[s44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV401+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17 % Computer : n010.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 10:51:02 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 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.09/0.25 % (1844337)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1844343)% WARNING: option uhcvi not known.
% 0.09/0.25 % (1844343)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=78609701:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25 % (1844346)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2699379087:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.25 % (1844344)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3313493893:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25 % (1844348)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=956758866:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.25 % (1844345)dis+10_1_sil=32000:sp=arity:random_seed=2189789026:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25 % (1844347)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=453193347:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.25 % (1844343) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1844337-1844343"...
% 0.09/0.25 % (1844342)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=363828367_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.25 % (1844343)...printing done.
% 0.09/0.25 % (1844343)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (1844343)------------------------------
% 0.09/0.26 % (1844343)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (1844343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (1844343)CaDiCaL version: 2.1.3
% 0.09/0.26 % (1844343)Termination reason: Refutation
% 0.09/0.26 % (1844343)Time elapsed: 0.012 s
% 0.09/0.26 % (1844343)Peak memory usage: 13 MB
% 0.09/0.26 % (1844343)Instructions burned: 31 (million)
% 0.09/0.26 % (1844337)Success in time 0.043 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------