%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC003+1 : TPTP v9.3.1. Released v2.4.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:04:14 PM UTC 2026
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 104 ( 23 unt; 11 def)
% Number of atoms : 371 ( 60 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 460 ( 193 ~; 185 |; 48 &)
% ( 15 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 12 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 54 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& neq(X5,nil) ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2
| ? [X10] :
( ssItem(X10)
& X7 != X10
& memberP(X3,X10)
& geq(X10,X7) ) ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& neq(X5,nil) ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2
| ? [X10] :
( ssItem(X10)
& X7 != X10
& memberP(X3,X10)
& geq(X10,X7) ) ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0
| ~ neq(X5,nil) ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0
| ~ neq(X5,nil) ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f234,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f337,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f413,plain,
! [X6,X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(X5,nil)
| app(X4,X6) != sK47
| app(app(X4,X5),X6) != sK48
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| ssList(sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| sK49 = app(sK52,sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( ~ neq(sK50,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f436,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f425,f429]) ).
fof(f443,plain,
! [X6,X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(X5,nil)
| app(X4,X6) != sK49
| app(app(X4,X5),X6) != sK50
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f413,f428,f429]) ).
fof(f447,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f234]) ).
fof(f478,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(consistent_polarity_flipping,[],[f447]) ).
fof(f517,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ssItem(X1)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f590,plain,
( ~ neq(sK50,nil)
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f423]) ).
fof(f604,definition,
( spl54_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f610,definition,
( spl54_3
<=> ! [X6,X4,X5] :
( ~ neq(X5,nil)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK50
| app(X4,X6) != sK49 ) ),
introduced(definition,[new_symbols(definition,[spl54_3])],[avatar_definition]) ).
fof(f611,plain,
( ! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK50
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ neq(X5,nil)
| app(X4,X6) != sK49 )
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f612,plain,
( spl54_3
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f443,f604,f610]) ).
fof(f615,definition,
( spl54_4
<=> ssList(sK53) ),
introduced(definition,[new_symbols(definition,[spl54_4])],[avatar_definition]) ).
fof(f617,plain,
( ssList(sK53)
| ~ spl54_4 ),
inference(avatar_component_clause,[],[f615]) ).
fof(f618,plain,
( spl54_4
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f415,f604,f615]) ).
fof(f620,definition,
( spl54_5
<=> sK49 = app(sK52,sK53) ),
introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).
fof(f622,plain,
( sK49 = app(sK52,sK53)
| ~ spl54_5 ),
inference(avatar_component_clause,[],[f620]) ).
fof(f623,plain,
( spl54_5
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f416,f604,f620]) ).
fof(f625,definition,
( spl54_6
<=> sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).
fof(f627,plain,
( sK50 = app(app(sK52,cons(sK51,nil)),sK53)
| ~ spl54_6 ),
inference(avatar_component_clause,[],[f625]) ).
fof(f628,plain,
( spl54_6
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f417,f604,f625]) ).
fof(f633,definition,
( spl54_7
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).
fof(f635,plain,
( ssList(sK52)
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f633]) ).
fof(f637,plain,
( spl54_7
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f422,f604,f633]) ).
fof(f639,definition,
( spl54_8
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_8])],[avatar_definition]) ).
fof(f641,plain,
( ~ ssItem(sK51)
| spl54_8 ),
inference(avatar_component_clause,[],[f639]) ).
fof(f642,plain,
( ~ spl54_8
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f590,f604,f639]) ).
fof(f644,plain,
spl54_2,
inference(avatar_split_clause,[],[f436,f604]) ).
fof(f650,definition,
( spl54_10
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl54_10])],[avatar_definition]) ).
fof(f651,plain,
( ssList(nil)
| ~ spl54_10 ),
inference(avatar_component_clause,[],[f650]) ).
fof(f679,plain,
spl54_10,
inference(avatar_split_clause,[],[f306,f650]) ).
fof(f682,plain,
( sK50 != sK50
| ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_6 ),
inference(superposition,[],[f611,f627]) ).
fof(f683,plain,
( ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_6 ),
inference(trivial_inequality_removal,[],[f682]) ).
fof(f684,plain,
( ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_6
| ~ spl54_7 ),
inference(forward_subsumption_resolution,[],[f683,f635]) ).
fof(f687,plain,
( ~ ssList(cons(sK51,nil))
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_6
| ~ spl54_7 ),
inference(forward_subsumption_resolution,[],[f684,f617]) ).
fof(f701,plain,
( ~ ssList(cons(sK51,nil))
| ~ neq(cons(sK51,nil),nil)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6
| ~ spl54_7 ),
inference(forward_subsumption_resolution,[],[f687,f622]) ).
fof(f707,definition,
( spl54_20
<=> neq(cons(sK51,nil),nil) ),
introduced(definition,[new_symbols(definition,[spl54_20])],[avatar_definition]) ).
fof(f709,plain,
( ~ neq(cons(sK51,nil),nil)
| spl54_20 ),
inference(avatar_component_clause,[],[f707]) ).
fof(f711,definition,
( spl54_21
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl54_21])],[avatar_definition]) ).
fof(f712,plain,
( ssList(cons(sK51,nil))
| ~ spl54_21 ),
inference(avatar_component_clause,[],[f711]) ).
fof(f713,plain,
( ~ ssList(cons(sK51,nil))
| spl54_21 ),
inference(avatar_component_clause,[],[f711]) ).
fof(f714,plain,
( ~ spl54_20
| ~ spl54_21
| ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6
| ~ spl54_7 ),
inference(avatar_split_clause,[],[f701,f633,f625,f620,f615,f610,f711,f707]) ).
fof(f825,plain,
( ssItem(sK51)
| ~ ssList(nil)
| spl54_21 ),
inference(resolution,[],[f517,f713]) ).
fof(f828,plain,
( ~ ssList(nil)
| spl54_8
| spl54_21 ),
inference(forward_subsumption_resolution,[],[f825,f641]) ).
fof(f829,plain,
( $false
| spl54_8
| ~ spl54_10
| spl54_21 ),
inference(forward_subsumption_resolution,[],[f828,f651]) ).
fof(f830,plain,
( spl54_8
| ~ spl54_10
| spl54_21 ),
inference(avatar_contradiction_clause,[],[f829]) ).
fof(f849,plain,
( ~ ssList(nil)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| spl54_20 ),
inference(resolution,[],[f303,f709]) ).
fof(f858,plain,
( nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| ~ spl54_10
| spl54_20 ),
inference(forward_subsumption_resolution,[],[f849,f651]) ).
fof(f862,plain,
( nil = cons(sK51,nil)
| ~ spl54_10
| spl54_20
| ~ spl54_21 ),
inference(forward_subsumption_resolution,[],[f858,f712]) ).
fof(f927,definition,
( spl54_33
<=> nil = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_33])],[avatar_definition]) ).
fof(f929,plain,
( nil = cons(sK51,nil)
| ~ spl54_33 ),
inference(avatar_component_clause,[],[f927]) ).
fof(f1970,plain,
( spl54_33
| ~ spl54_10
| spl54_20
| ~ spl54_21 ),
inference(avatar_split_clause,[],[f862,f711,f707,f650,f927]) ).
fof(f2072,plain,
( singletonP(nil)
| ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_33 ),
inference(superposition,[],[f478,f929]) ).
fof(f2094,plain,
( ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_33 ),
inference(forward_subsumption_resolution,[],[f2072,f337]) ).
fof(f2103,plain,
( ~ ssList(nil)
| spl54_8
| ~ spl54_33 ),
inference(forward_subsumption_resolution,[],[f2094,f641]) ).
fof(f2107,plain,
( $false
| spl54_8
| ~ spl54_10
| ~ spl54_33 ),
inference(forward_subsumption_resolution,[],[f2103,f651]) ).
fof(f2108,plain,
( spl54_8
| ~ spl54_10
| ~ spl54_33 ),
inference(avatar_contradiction_clause,[],[f2107]) ).
cnf(s3,plain,
( ~ spl54_2
| spl54_3 ),
inference(sat_conversion,[],[f612]) ).
cnf(s5,plain,
( ~ spl54_2
| spl54_4 ),
inference(sat_conversion,[],[f618]) ).
cnf(s6,plain,
( ~ spl54_2
| spl54_5 ),
inference(sat_conversion,[],[f623]) ).
cnf(s7,plain,
( ~ spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f628]) ).
cnf(s12,plain,
( ~ spl54_2
| spl54_7 ),
inference(sat_conversion,[],[f637]) ).
cnf(s13,plain,
( ~ spl54_2
| ~ spl54_8 ),
inference(sat_conversion,[],[f642]) ).
cnf(s15,plain,
spl54_2,
inference(sat_conversion,[],[f644]) ).
cnf(s24,plain,
spl54_10,
inference(sat_conversion,[],[f679]) ).
cnf(s27,plain,
( ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6
| ~ spl54_7
| ~ spl54_20
| ~ spl54_21 ),
inference(sat_conversion,[],[f714]) ).
cnf(s30,plain,
( spl54_8
| ~ spl54_10
| spl54_21 ),
inference(sat_conversion,[],[f830]) ).
cnf(s75,plain,
( ~ spl54_10
| spl54_20
| ~ spl54_21
| spl54_33 ),
inference(sat_conversion,[],[f1970]) ).
cnf(s80,plain,
( spl54_8
| ~ spl54_10
| ~ spl54_33 ),
inference(sat_conversion,[],[f2108]) ).
cnf(s91,plain,
~ spl54_8,
inference(rat,[],[s13,s15]) ).
cnf(s92,plain,
~ spl54_33,
inference(rat,[],[s80,s24,s91]) ).
cnf(s93,plain,
spl54_21,
inference(rat,[],[s30,s24,s91]) ).
cnf(s98,plain,
spl54_20,
inference(rat,[],[s75,s92,s24,s93]) ).
cnf(s99,plain,
spl54_7,
inference(rat,[],[s12,s15]) ).
cnf(s100,plain,
spl54_6,
inference(rat,[],[s7,s15]) ).
cnf(s101,plain,
spl54_5,
inference(rat,[],[s6,s15]) ).
cnf(s102,plain,
spl54_4,
inference(rat,[],[s5,s15]) ).
cnf(s103,plain,
~ spl54_3,
inference(rat,[],[s27,s93,s98,s99,s100,s101,s102]) ).
cnf(s104,plain,
$false,
inference(rat,[],[s3,s103,s15]) ).
fof(f2109,plain,
$false,
inference(avatar_sat_refutation,[],[s104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC003+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 % Computer : n010.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Mon Sep 28 07:24:48 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 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.18/0.52 % (1738519)Will run a generic schedule for satisfiability detection.
% 0.18/0.52 % (1738528)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2442633682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.52 % (1738525)% WARNING: option uhcvi not known.
% 0.18/0.52 % (1738525)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3055559260:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.52 % (1738524)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3812786256_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.52 % (1738526)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2755959236:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.52 % (1738527)dis+10_1_sil=32000:sp=arity:random_seed=1653237182:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.52 % (1738529)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1168287677:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.52 % (1738530)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3011363555:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.52 % TRYING [1]
% 0.18/0.52 % TRYING [2]
% 0.18/0.52 % TRYING [3]
% 0.18/0.52 % (1738528)Instruction limit reached!
% 0.18/0.52 % (1738528)------------------------------
% 0.18/0.52 % (1738528)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.52 % (1738528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.52 % (1738528)CaDiCaL version: 2.1.3
% 0.18/0.52 % (1738528)Termination reason: Instruction limit
% 0.18/0.52 % (1738528)Termination phase: Saturation
% 0.18/0.52 % (1738528)Time elapsed: 0.038 s
% 0.18/0.52 % (1738528)Peak memory usage: 13 MB
% 0.18/0.52 % (1738528)Instructions burned: 118 (million)
% 0.18/0.52 % (1738525) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1738519-1738525"...
% 0.18/0.52 % TRYING [4]
% 0.18/0.52 % (1738525)...printing done.
% 0.18/0.52 % (1738525)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (1738525)------------------------------
% 0.18/0.52 % (1738525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.52 % (1738525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.52 % (1738525)CaDiCaL version: 2.1.3
% 0.18/0.52 % (1738525)Termination reason: Refutation
% 0.18/0.52 % (1738525)Time elapsed: 0.042 s
% 0.18/0.52 % (1738525)Peak memory usage: 13 MB
% 0.18/0.52 % (1738525)Instructions burned: 66 (million)
% 0.18/0.52 % (1738519)Success in time 0.084 s
% 0.18/0.52 % Vampire exiting
%------------------------------------------------------------------------------