%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC004+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 : n001.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.16s 0.56s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 117 ( 16 unt; 10 def)
% Number of atoms : 384 ( 65 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 460 ( 193 ~; 197 |; 38 &)
% ( 12 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 56 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
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(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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 ) ) ) ) )
& ( ~ 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 ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f125,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
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
& 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
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f313,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f411,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(f412,plain,
! [X6,X4,X5] :
( neq(sK48,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(f413,plain,
( ~ neq(sK50,nil)
| ssList(sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| sK49 = app(sK52,sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( neq(sK48,nil)
| ssList(sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( neq(sK48,nil)
| sK49 = app(sK52,sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( neq(sK48,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( neq(sK48,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
( neq(sK48,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f435,plain,
( neq(sK50,nil)
| ssItem(sK51) ),
inference(definition_unfolding,[],[f422,f427]) ).
fof(f436,plain,
( neq(sK50,nil)
| ssList(sK52) ),
inference(definition_unfolding,[],[f419,f427]) ).
fof(f437,plain,
( neq(sK50,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(definition_unfolding,[],[f418,f427]) ).
fof(f438,plain,
( neq(sK50,nil)
| sK49 = app(sK52,sK53) ),
inference(definition_unfolding,[],[f417,f427]) ).
fof(f439,plain,
( neq(sK50,nil)
| ssList(sK53) ),
inference(definition_unfolding,[],[f416,f427]) ).
fof(f440,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,[],[f412,f427,f426,f427]) ).
fof(f441,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,[],[f411,f426,f427]) ).
fof(f475,definition,
( spl54_1
<=> ! [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_1])],[avatar_definition]) ).
fof(f476,plain,
( ! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK50
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ neq(X5,nil)
| app(X4,X6) != sK49 )
| ~ spl54_1 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,definition,
( spl54_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f481,plain,
( spl54_1
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f441,f478,f475]) ).
fof(f482,plain,
( spl54_1
| spl54_2 ),
inference(avatar_split_clause,[],[f440,f478,f475]) ).
fof(f484,definition,
( spl54_3
<=> ssList(sK53) ),
introduced(definition,[new_symbols(definition,[spl54_3])],[avatar_definition]) ).
fof(f486,plain,
( ssList(sK53)
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f484]) ).
fof(f487,plain,
( spl54_3
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f413,f478,f484]) ).
fof(f489,definition,
( spl54_4
<=> sK49 = app(sK52,sK53) ),
introduced(definition,[new_symbols(definition,[spl54_4])],[avatar_definition]) ).
fof(f491,plain,
( sK49 = app(sK52,sK53)
| ~ spl54_4 ),
inference(avatar_component_clause,[],[f489]) ).
fof(f492,plain,
( spl54_4
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f414,f478,f489]) ).
fof(f494,definition,
( spl54_5
<=> sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).
fof(f496,plain,
( sK50 = app(app(sK52,cons(sK51,nil)),sK53)
| ~ spl54_5 ),
inference(avatar_component_clause,[],[f494]) ).
fof(f497,plain,
( spl54_5
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f415,f478,f494]) ).
fof(f498,plain,
( spl54_3
| spl54_2 ),
inference(avatar_split_clause,[],[f439,f478,f484]) ).
fof(f499,plain,
( spl54_4
| spl54_2 ),
inference(avatar_split_clause,[],[f438,f478,f489]) ).
fof(f500,plain,
( spl54_5
| spl54_2 ),
inference(avatar_split_clause,[],[f437,f478,f494]) ).
fof(f502,definition,
( spl54_6
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).
fof(f504,plain,
( ssList(sK52)
| ~ spl54_6 ),
inference(avatar_component_clause,[],[f502]) ).
fof(f505,plain,
( spl54_6
| spl54_2 ),
inference(avatar_split_clause,[],[f436,f478,f502]) ).
fof(f506,plain,
( spl54_6
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f420,f478,f502]) ).
fof(f508,definition,
( spl54_7
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).
fof(f510,plain,
( ssItem(sK51)
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f511,plain,
( spl54_7
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f421,f478,f508]) ).
fof(f512,plain,
( spl54_7
| spl54_2 ),
inference(avatar_split_clause,[],[f435,f478,f508]) ).
fof(f547,plain,
( sK50 != sK50
| ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_1
| ~ spl54_5 ),
inference(superposition,[],[f476,f496]) ).
fof(f548,plain,
( ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_1
| ~ spl54_5 ),
inference(trivial_inequality_removal,[],[f547]) ).
fof(f549,plain,
( ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_1
| ~ spl54_5
| ~ spl54_6 ),
inference(forward_subsumption_resolution,[],[f548,f504]) ).
fof(f552,plain,
( ~ ssList(cons(sK51,nil))
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_1
| ~ spl54_3
| ~ spl54_5
| ~ spl54_6 ),
inference(forward_subsumption_resolution,[],[f549,f486]) ).
fof(f566,plain,
( ~ ssList(cons(sK51,nil))
| ~ neq(cons(sK51,nil),nil)
| ~ spl54_1
| ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6 ),
inference(forward_subsumption_resolution,[],[f552,f491]) ).
fof(f572,definition,
( spl54_19
<=> neq(cons(sK51,nil),nil) ),
introduced(definition,[new_symbols(definition,[spl54_19])],[avatar_definition]) ).
fof(f574,plain,
( ~ neq(cons(sK51,nil),nil)
| spl54_19 ),
inference(avatar_component_clause,[],[f572]) ).
fof(f576,definition,
( spl54_20
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl54_20])],[avatar_definition]) ).
fof(f577,plain,
( ssList(cons(sK51,nil))
| ~ spl54_20 ),
inference(avatar_component_clause,[],[f576]) ).
fof(f578,plain,
( ~ ssList(cons(sK51,nil))
| spl54_20 ),
inference(avatar_component_clause,[],[f576]) ).
fof(f579,plain,
( ~ spl54_19
| ~ spl54_20
| ~ spl54_1
| ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6 ),
inference(avatar_split_clause,[],[f566,f502,f494,f489,f484,f475,f576,f572]) ).
fof(f653,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl54_20 ),
inference(resolution,[],[f305,f578]) ).
fof(f656,plain,
( ~ ssList(nil)
| ~ spl54_7
| spl54_20 ),
inference(forward_subsumption_resolution,[],[f653,f510]) ).
fof(f657,plain,
( $false
| ~ spl54_7
| spl54_20 ),
inference(forward_subsumption_resolution,[],[f656,f306]) ).
fof(f658,plain,
( ~ spl54_7
| spl54_20 ),
inference(avatar_contradiction_clause,[],[f657]) ).
fof(f691,definition,
( spl54_29
<=> nil = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_29])],[avatar_definition]) ).
fof(f692,plain,
( nil != cons(sK51,nil)
| spl54_29 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f693,plain,
( nil = cons(sK51,nil)
| ~ spl54_29 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f712,plain,
( nil != nil
| ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_29 ),
inference(superposition,[],[f313,f693]) ).
fof(f716,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_29 ),
inference(trivial_inequality_removal,[],[f712]) ).
fof(f718,plain,
( ~ ssList(nil)
| ~ spl54_7
| ~ spl54_29 ),
inference(forward_subsumption_resolution,[],[f716,f510]) ).
fof(f723,plain,
( $false
| ~ spl54_7
| ~ spl54_29 ),
inference(forward_subsumption_resolution,[],[f718,f306]) ).
fof(f724,plain,
( ~ spl54_7
| ~ spl54_29 ),
inference(avatar_contradiction_clause,[],[f723]) ).
fof(f727,plain,
( ~ ssList(nil)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| spl54_19 ),
inference(resolution,[],[f303,f574]) ).
fof(f730,plain,
( nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| spl54_19 ),
inference(forward_subsumption_resolution,[],[f727,f306]) ).
fof(f731,plain,
( ~ ssList(cons(sK51,nil))
| spl54_19
| spl54_29 ),
inference(forward_subsumption_resolution,[],[f730,f692]) ).
fof(f732,plain,
( $false
| spl54_19
| ~ spl54_20
| spl54_29 ),
inference(forward_subsumption_resolution,[],[f731,f577]) ).
fof(f733,plain,
( spl54_19
| ~ spl54_20
| spl54_29 ),
inference(avatar_contradiction_clause,[],[f732]) ).
cnf(s1,plain,
( spl54_1
| ~ spl54_2 ),
inference(sat_conversion,[],[f481]) ).
cnf(s2,plain,
( spl54_1
| spl54_2 ),
inference(sat_conversion,[],[f482]) ).
cnf(s3,plain,
( ~ spl54_2
| spl54_3 ),
inference(sat_conversion,[],[f487]) ).
cnf(s4,plain,
( ~ spl54_2
| spl54_4 ),
inference(sat_conversion,[],[f492]) ).
cnf(s5,plain,
( ~ spl54_2
| spl54_5 ),
inference(sat_conversion,[],[f497]) ).
cnf(s6,plain,
( spl54_2
| spl54_3 ),
inference(sat_conversion,[],[f498]) ).
cnf(s7,plain,
( spl54_2
| spl54_4 ),
inference(sat_conversion,[],[f499]) ).
cnf(s8,plain,
( spl54_2
| spl54_5 ),
inference(sat_conversion,[],[f500]) ).
cnf(s9,plain,
( spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f505]) ).
cnf(s10,plain,
( ~ spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f506]) ).
cnf(s11,plain,
( ~ spl54_2
| spl54_7 ),
inference(sat_conversion,[],[f511]) ).
cnf(s12,plain,
( spl54_2
| spl54_7 ),
inference(sat_conversion,[],[f512]) ).
cnf(s21,plain,
( ~ spl54_1
| ~ spl54_3
| ~ spl54_4
| ~ spl54_5
| ~ spl54_6
| ~ spl54_19
| ~ spl54_20 ),
inference(sat_conversion,[],[f579]) ).
cnf(s26,plain,
( ~ spl54_7
| spl54_20 ),
inference(sat_conversion,[],[f658]) ).
cnf(s29,plain,
( ~ spl54_7
| ~ spl54_29 ),
inference(sat_conversion,[],[f724]) ).
cnf(s30,plain,
( spl54_19
| ~ spl54_20
| spl54_29 ),
inference(sat_conversion,[],[f733]) ).
cnf(s31,plain,
spl54_1,
inference(rat,[],[s1,s2]) ).
cnf(s32,plain,
~ spl54_2,
inference(rat,[],[s30,s21,s26,s29,s3,s4,s5,s10,s11,s31]) ).
cnf(s33,plain,
spl54_7,
inference(rat,[],[s12,s32]) ).
cnf(s34,plain,
spl54_6,
inference(rat,[],[s9,s32]) ).
cnf(s35,plain,
spl54_5,
inference(rat,[],[s8,s32]) ).
cnf(s36,plain,
spl54_4,
inference(rat,[],[s7,s32]) ).
cnf(s37,plain,
spl54_3,
inference(rat,[],[s6,s32]) ).
cnf(s38,plain,
~ spl54_29,
inference(rat,[],[s29,s33]) ).
cnf(s39,plain,
spl54_20,
inference(rat,[],[s26,s33]) ).
cnf(s40,plain,
~ spl54_19,
inference(rat,[],[s21,s39,s36,s34,s35,s31,s37]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s30,s38,s39,s40]) ).
fof(f734,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC004+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.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 07:30:03 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/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.56 % (186598)Will run a generic schedule for satisfiability detection.
% 0.16/0.56 % (186609)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=970169238:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.56 % (186605)% WARNING: option uhcvi not known.
% 0.16/0.56 % (186604)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2301566086_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.56 % (186605)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3848065222:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.56 % (186607)dis+10_1_sil=32000:sp=arity:random_seed=619732263:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.56 % (186606)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4282264336:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.56 % (186608)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3158695148:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.56 % (186610)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2302150211:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.56 % TRYING [1]
% 0.16/0.56 % TRYING [2]
% 0.16/0.56 % TRYING [3]
% 0.16/0.56 % (186609)Instruction limit reached!
% 0.16/0.56 % (186609)------------------------------
% 0.16/0.56 % (186609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.56 % (186609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.56 % (186609)CaDiCaL version: 2.1.3
% 0.16/0.56 % (186609)Termination reason: Instruction limit
% 0.16/0.56 % (186609)Termination phase: Saturation
% 0.16/0.56 % (186609)Time elapsed: 0.042 s
% 0.16/0.56 % (186609)Peak memory usage: 14 MB
% 0.16/0.56 % (186609)Instructions burned: 131 (million)
% 0.16/0.56 % TRYING [4]
% 0.16/0.56 % (186618)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3218899033:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/0.56 % TRYING [1]
% 0.16/0.56 % TRYING [2]
% 0.16/0.56 % TRYING [3]
% 0.16/0.56 % (186607)Instruction limit reached!
% 0.16/0.56 % (186607)------------------------------
% 0.16/0.56 % (186607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.56 % (186607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.56 % (186607)CaDiCaL version: 2.1.3
% 0.16/0.56 % (186607)Termination reason: Instruction limit
% 0.16/0.56 % (186607)Termination phase: Saturation
% 0.16/0.56 % (186607)Time elapsed: 0.061 s
% 0.16/0.56 % (186607)Peak memory usage: 13 MB
% 0.16/0.56 % (186607)Instructions burned: 103 (million)
% 0.16/0.56 % TRYING [4]
% 0.16/0.56 % (186608)Instruction limit reached!
% 0.16/0.56 % (186608)------------------------------
% 0.16/0.56 % (186608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.56 % (186608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.56 % (186608)CaDiCaL version: 2.1.3
% 0.16/0.56 % (186608)Termination reason: Instruction limit
% 0.16/0.56 % (186608)Termination phase: Saturation
% 0.16/0.56 % (186608)Time elapsed: 0.068 s
% 0.16/0.56 % (186608)Peak memory usage: 13 MB
% 0.16/0.56 % (186608)Instructions burned: 117 (million)
% 0.16/0.56 % (186620)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4099079729:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.56 % (186621)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=152647382:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.16/0.56 % TRYING [5]
% 0.16/0.56 % (186621) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-186598-186621"...
% 0.16/0.56 % (186621)...printing done.
% 0.16/0.56 % TRYING [5]
% 0.16/0.56 % (186621)Refutation found. Thanks to Tanya!
% 0.16/0.56 % SZS status Theorem for theBenchmark
% 0.16/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.56 % (186621)------------------------------
% 0.16/0.56 % (186621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.56 % (186621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.56 % (186621)CaDiCaL version: 2.1.3
% 0.16/0.56 % (186621)Termination reason: Refutation
% 0.16/0.56 % (186621)Time elapsed: 0.013 s
% 0.16/0.56 % (186621)Peak memory usage: 13 MB
% 0.16/0.56 % (186621)Instructions burned: 18 (million)
% 0.16/0.56 % (186598)Success in time 0.129 s
% 0.16/0.56 % Vampire exiting
%------------------------------------------------------------------------------