%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC211+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:02:57 PM UTC 2026
% Result : Theorem 2.54s 1.27s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of formulae : 116 ( 20 unt; 7 def)
% Number of atoms : 389 ( 117 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 455 ( 182 ~; 196 |; 42 &)
% ( 11 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 73 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) != X2
& app(cons(X4,nil),X5) = X3 ) )
| neq(X0,nil)
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
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] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) != X2
& app(cons(X4,nil),X5) = X3 ) )
| neq(X0,nil)
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
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(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2
| app(cons(X4,nil),X5) != X3 ) )
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& 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] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2
| app(cons(X4,nil),X5) != X3 ) )
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f292,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = sK55
| app(cons(X4,nil),X5) != sK56 ) )
& ~ neq(sK53,nil)
& ( nil = sK55
| nil != sK56 )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f396,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f397,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f474,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f477,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f480,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK56
| ~ ssList(X5)
| app(X5,cons(X4,nil)) = sK55
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f541,definition,
( spl57_1
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f542,plain,
( nil = sK56
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f543,plain,
( nil != sK56
| spl57_1 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f545,definition,
( spl57_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f547,plain,
( nil = sK55
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f550,definition,
( spl57_3
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f551,plain,
( ssList(nil)
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f583,plain,
spl57_3,
inference(avatar_split_clause,[],[f389,f550]) ).
fof(f584,plain,
~ neq(sK55,nil),
inference(superposition,[],[f501,f504]) ).
fof(f586,plain,
neq(sK56,nil),
inference(superposition,[],[f503,f505]) ).
fof(f633,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55) ),
inference(resolution,[],[f387,f584]) ).
fof(f638,plain,
( nil = sK55
| ~ ssList(sK55)
| ~ spl57_3 ),
inference(forward_subsumption_resolution,[],[f633,f551]) ).
fof(f640,plain,
( nil = sK55
| ~ spl57_3 ),
inference(forward_subsumption_resolution,[],[f638,f498]) ).
fof(f642,plain,
( spl57_2
| ~ spl57_3 ),
inference(avatar_split_clause,[],[f640,f550,f545]) ).
fof(f644,plain,
( ~ neq(nil,nil)
| ~ spl57_2 ),
inference(superposition,[],[f584,f547]) ).
fof(f765,plain,
! [X0,X1] :
( cons(X0,X1) != sK56
| ~ ssList(X1)
| sK55 = app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f502,f477]) ).
fof(f772,plain,
! [X0,X1] :
( cons(X0,X1) != sK56
| ~ ssList(X1)
| sK55 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f765]) ).
fof(f773,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK56
| nil = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl57_2 ),
inference(forward_demodulation,[],[f772,f547]) ).
fof(f775,plain,
( ! [X0] :
( sK56 != X0
| nil = app(tl(X0),cons(hd(X0),nil))
| ~ ssList(tl(X0))
| ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl57_2 ),
inference(superposition,[],[f773,f474]) ).
fof(f778,plain,
( ! [X0] :
( sK56 != X0
| nil = app(tl(X0),cons(hd(X0),nil))
| ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f775,f399]) ).
fof(f781,plain,
( ! [X0] :
( sK56 != X0
| nil = app(tl(X0),cons(hd(X0),nil))
| nil = X0
| ~ ssList(X0) )
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f778,f397]) ).
fof(f789,plain,
( nil = app(tl(sK56),cons(hd(sK56),nil))
| nil = sK56
| ~ ssList(sK56)
| ~ spl57_2 ),
inference(equality_resolution,[],[f781]) ).
fof(f790,plain,
( nil = app(tl(sK56),cons(hd(sK56),nil))
| ~ ssList(sK56)
| spl57_1
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f789,f543]) ).
fof(f791,plain,
( nil = app(tl(sK56),cons(hd(sK56),nil))
| spl57_1
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f790,f499]) ).
fof(f796,plain,
( nil != nil
| nil = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| spl57_1
| ~ spl57_2 ),
inference(superposition,[],[f480,f791]) ).
fof(f800,plain,
( nil = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| spl57_1
| ~ spl57_2 ),
inference(trivial_inequality_removal,[],[f796]) ).
fof(f802,definition,
( spl57_12
<=> ssList(tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_12])],[avatar_definition]) ).
fof(f804,plain,
( ~ ssList(tl(sK56))
| spl57_12 ),
inference(avatar_component_clause,[],[f802]) ).
fof(f806,definition,
( spl57_13
<=> ssList(cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl57_13])],[avatar_definition]) ).
fof(f808,plain,
( ~ ssList(cons(hd(sK56),nil))
| spl57_13 ),
inference(avatar_component_clause,[],[f806]) ).
fof(f815,definition,
( spl57_15
<=> nil = cons(hd(sK56),nil) ),
introduced(definition,[new_symbols(definition,[spl57_15])],[avatar_definition]) ).
fof(f817,plain,
( nil = cons(hd(sK56),nil)
| ~ spl57_15 ),
inference(avatar_component_clause,[],[f815]) ).
fof(f818,plain,
( ~ spl57_12
| ~ spl57_13
| spl57_15
| spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f800,f545,f541,f815,f806,f802]) ).
fof(f819,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_12 ),
inference(resolution,[],[f804,f399]) ).
fof(f820,plain,
( ~ ssList(sK56)
| spl57_1
| spl57_12 ),
inference(forward_subsumption_resolution,[],[f819,f543]) ).
fof(f821,plain,
( $false
| spl57_1
| spl57_12 ),
inference(forward_subsumption_resolution,[],[f820,f499]) ).
fof(f822,plain,
( spl57_1
| spl57_12 ),
inference(avatar_contradiction_clause,[],[f821]) ).
fof(f842,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| spl57_13 ),
inference(resolution,[],[f808,f388]) ).
fof(f843,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_3
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f842,f551]) ).
fof(f845,plain,
( nil = sK56
| ~ ssList(sK56)
| ~ spl57_3
| spl57_13 ),
inference(resolution,[],[f843,f397]) ).
fof(f846,plain,
( ~ ssList(sK56)
| spl57_1
| ~ spl57_3
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f845,f543]) ).
fof(f847,plain,
( $false
| spl57_1
| ~ spl57_3
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f846,f499]) ).
fof(f848,plain,
( spl57_1
| ~ spl57_3
| spl57_13 ),
inference(avatar_contradiction_clause,[],[f847]) ).
fof(f856,plain,
( neq(nil,nil)
| ~ spl57_1 ),
inference(superposition,[],[f586,f542]) ).
fof(f859,plain,
( $false
| ~ spl57_1
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f856,f644]) ).
fof(f860,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(avatar_contradiction_clause,[],[f859]) ).
fof(f926,plain,
( nil != nil
| ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ~ spl57_15 ),
inference(superposition,[],[f396,f817]) ).
fof(f931,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ~ spl57_15 ),
inference(trivial_inequality_removal,[],[f926]) ).
fof(f936,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_3
| ~ spl57_15 ),
inference(forward_subsumption_resolution,[],[f931,f551]) ).
fof(f941,definition,
( spl57_18
<=> ssItem(hd(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_18])],[avatar_definition]) ).
fof(f943,plain,
( ~ ssItem(hd(sK56))
| spl57_18 ),
inference(avatar_component_clause,[],[f941]) ).
fof(f959,plain,
( ~ spl57_18
| ~ spl57_3
| ~ spl57_15 ),
inference(avatar_split_clause,[],[f936,f815,f550,f941]) ).
fof(f974,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_18 ),
inference(resolution,[],[f943,f397]) ).
fof(f975,plain,
( ~ ssList(sK56)
| spl57_1
| spl57_18 ),
inference(forward_subsumption_resolution,[],[f974,f543]) ).
fof(f976,plain,
( $false
| spl57_1
| spl57_18 ),
inference(forward_subsumption_resolution,[],[f975,f499]) ).
fof(f977,plain,
( spl57_1
| spl57_18 ),
inference(avatar_contradiction_clause,[],[f976]) ).
cnf(s10,plain,
spl57_3,
inference(sat_conversion,[],[f583]) ).
cnf(s13,plain,
( spl57_2
| ~ spl57_3 ),
inference(sat_conversion,[],[f642]) ).
cnf(s16,plain,
( spl57_1
| ~ spl57_2
| ~ spl57_12
| ~ spl57_13
| spl57_15 ),
inference(sat_conversion,[],[f818]) ).
cnf(s17,plain,
( spl57_1
| spl57_12 ),
inference(sat_conversion,[],[f822]) ).
cnf(s19,plain,
( spl57_1
| ~ spl57_3
| spl57_13 ),
inference(sat_conversion,[],[f848]) ).
cnf(s21,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f860]) ).
cnf(s25,plain,
( ~ spl57_3
| ~ spl57_15
| ~ spl57_18 ),
inference(sat_conversion,[],[f959]) ).
cnf(s30,plain,
( spl57_1
| spl57_18 ),
inference(sat_conversion,[],[f977]) ).
cnf(s31,plain,
spl57_2,
inference(rat,[],[s13,s10]) ).
cnf(s32,plain,
~ spl57_1,
inference(rat,[],[s21,s31]) ).
cnf(s33,plain,
spl57_18,
inference(rat,[],[s30,s32]) ).
cnf(s35,plain,
spl57_13,
inference(rat,[],[s19,s10,s32]) ).
cnf(s36,plain,
spl57_12,
inference(rat,[],[s17,s32]) ).
cnf(s37,plain,
~ spl57_15,
inference(rat,[],[s25,s10,s33]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s16,s32,s35,s31,s37,s36]) ).
fof(f978,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC211+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 08:30:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.27 % (3229163)Detected formulas, will run a generic FOF schedule.
% 2.54/1.27 % (3229168)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2503297148:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.54/1.27 % (3229169)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3910629334:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.54/1.27 % (3229172)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2927976317:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.54/1.27 % (3229171)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1491249516:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.54/1.27 % (3229170)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3570716920:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.54/1.27 % (3229173)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3498039928:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.54/1.27 % (3229174)dis-21_1_sil=8000:lcm=predicate:random_seed=464435666:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.54/1.27 % (3229173)First to succeed.
% 2.54/1.27 % (3229173)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3229163"
% 2.54/1.27 % (3229172)Instruction limit reached!
% 2.54/1.27 % (3229172)------------------------------
% 2.54/1.27 % (3229172)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.27 % (3229172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.27 % (3229172)CaDiCaL version: 2.1.3
% 2.54/1.27 % (3229172)Termination reason: Instruction limit
% 2.54/1.27 % (3229172)Termination phase: Saturation
% 2.54/1.27 % (3229172)Time elapsed: 0.066 s
% 2.54/1.27 % (3229172)Peak memory usage: 88 MB
% 2.54/1.27 % (3229172)Instructions burned: 119 (million)
% 2.54/1.27 % (3229171)Instruction limit reached!
% 2.54/1.27 % (3229171)------------------------------
% 2.54/1.27 % (3229171)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.27 % (3229171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.27 % (3229171)CaDiCaL version: 2.1.3
% 2.54/1.27 % (3229171)Termination reason: Instruction limit
% 2.54/1.27 % (3229171)Termination phase: Saturation
% 2.54/1.27 % (3229171)Time elapsed: 0.063 s
% 2.54/1.27 % (3229171)Peak memory usage: 89 MB
% 2.54/1.27 % (3229171)Instructions burned: 110 (million)
% 2.54/1.27 % (3229174)Instruction limit reached!
% 2.54/1.27 % (3229174)------------------------------
% 2.54/1.27 % (3229174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.27 % (3229174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.27 % (3229174)CaDiCaL version: 2.1.3
% 2.54/1.27 % (3229174)Termination reason: Instruction limit
% 2.54/1.27 % (3229174)Termination phase: Saturation
% 2.54/1.27 % (3229174)Time elapsed: 0.075 s
% 2.54/1.27 % (3229174)Peak memory usage: 90 MB
% 2.54/1.27 % (3229174)Instructions burned: 130 (million)
% 2.54/1.27 % (3229182)lrs+10_1_sil=8000:sp=occurrence:random_seed=496198229:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.54/1.27 % (3229183)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2744362512:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.54/1.27 % (3229184)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4225520822:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.54/1.27 % (3229184)Also succeeded, but the first one will report.
% 2.54/1.27 % (3229183)Instruction limit reached!
% 2.54/1.27 % (3229183)------------------------------
% 2.54/1.27 % (3229183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.27 % (3229183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.27 % (3229183)CaDiCaL version: 2.1.3
% 2.54/1.27 % (3229183)Termination reason: Instruction limit
% 2.54/1.27 % (3229183)Termination phase: Saturation
% 2.54/1.27 % (3229183)Time elapsed: 0.073 s
% 2.54/1.27 % (3229183)Peak memory usage: 91 MB
% 2.54/1.27 % (3229183)Instructions burned: 158 (million)
% 2.54/1.27 % (3229173)Refutation found. Thanks to Tanya!
% 2.54/1.27 % SZS status Theorem for theBenchmark
% 2.54/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.46 % (3229173)------------------------------
% 3.62/1.46 % (3229173)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.46 % (3229173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.46 % (3229173)CaDiCaL version: 2.1.3
% 3.62/1.46 % (3229173)Termination reason: Refutation
% 3.62/1.46 % (3229173)Time elapsed: 0.022 s
% 3.62/1.46 % (3229173)Peak memory usage: 90 MB
% 3.62/1.46 % (3229173)Instructions burned: 28 (million)
% 3.62/1.46 % (3229173)------------------------------
% 3.62/1.46 % (3229173)------------------------------
% 3.62/1.46 % (3229163)Success in time 0.434 s
% 3.62/1.46 % Vampire exiting
%------------------------------------------------------------------------------