%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC316+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 : n011.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:31 PM UTC 2026
% Result : Theorem 7.70s 1.47s
% Output : Refutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 148 ( 33 unt; 9 def)
% Number of atoms : 485 ( 126 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 573 ( 236 ~; 242 |; 50 &)
% ( 13 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 94 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',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(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| ( ? [X6] :
( ssList(X6)
& X1 = X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X0) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X0) = X9
& neq(nil,X0) )
& neq(nil,X0) ) ) )
& neq(X0,nil) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| ( ? [X6] :
( ssList(X6)
& X1 = X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X0) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X0) = X9
& neq(nil,X0) )
& neq(nil,X0) ) ) )
& neq(X0,nil) ) )
& ( ~ 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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
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(f128,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
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(f131,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
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] :
( ? [X5] :
( app(cons(X4,nil),X5) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ! [X6] :
( ~ ssList(X6)
| X1 != X6
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| tl(X0) != X7
| app(X7,X8) != X6
| ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(X0) != X9
| ~ neq(nil,X0) )
| ~ neq(nil,X0) ) ) )
| ~ neq(X0,nil) ) )
| ( 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] :
( ? [X5] :
( app(cons(X4,nil),X5) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ! [X6] :
( ~ ssList(X6)
| X1 != X6
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| tl(X0) != X7
| app(X7,X8) != X6
| ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(X0) != X9
| ~ neq(nil,X0) )
| ~ neq(nil,X0) ) ) )
| ~ neq(X0,nil) ) )
| ( 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(f307,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f314,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f315,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| hd(cons(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f128]) ).
fof(f316,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f317,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f394,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f411,plain,
! [X8,X6,X9,X7] :
( ~ neq(sK50,nil)
| ~ neq(sK47,nil)
| ~ neq(nil,sK47)
| hd(sK47) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9)
| app(X7,X8) != X6
| tl(sK47) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK48 != X6
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( ~ neq(sK50,nil)
| sK50 = app(sK52,cons(sK51,nil)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( ~ neq(sK50,nil)
| sK49 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f432,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f425]) ).
fof(f438,plain,
! [X8,X6,X9,X7] :
( ~ neq(sK50,nil)
| ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| hd(sK49) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9)
| app(X7,X8) != X6
| tl(sK49) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK50 != X6
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f411,f424,f424,f424,f424,f425]) ).
fof(f468,plain,
! [X8,X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| cons(hd(sK49),nil) != X8
| ~ ssItem(hd(sK49))
| app(X7,X8) != X6
| tl(sK49) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK50 != X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f438]) ).
fof(f469,plain,
! [X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| app(X7,cons(hd(sK49),nil)) != X6
| tl(sK49) != X7
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X7)
| sK50 != X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f468]) ).
fof(f470,plain,
! [X7] :
( ~ neq(sK50,nil)
| ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| tl(sK49) != X7
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X7)
| sK50 != app(X7,cons(hd(sK49),nil))
| ~ ssList(app(X7,cons(hd(sK49),nil))) ),
inference(equality_resolution,[],[f469]) ).
fof(f471,plain,
( ~ neq(sK50,nil)
| ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| sK50 != app(tl(sK49),cons(hd(sK49),nil))
| ~ ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
inference(equality_resolution,[],[f470]) ).
fof(f479,plain,
ssList(sK52),
inference(forward_subsumption_resolution,[],[f416,f432]) ).
fof(f480,plain,
ssItem(sK51),
inference(forward_subsumption_resolution,[],[f419,f432]) ).
fof(f481,plain,
sK50 = app(sK52,cons(sK51,nil)),
inference(forward_subsumption_resolution,[],[f417,f432]) ).
fof(f482,plain,
sK49 = app(cons(sK51,nil),sK52),
inference(forward_subsumption_resolution,[],[f418,f432]) ).
fof(f483,plain,
( ~ neq(sK49,nil)
| ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| sK50 != app(tl(sK49),cons(hd(sK49),nil))
| ~ ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
inference(forward_subsumption_resolution,[],[f471,f432]) ).
fof(f485,definition,
( spl53_1
<=> ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f487,plain,
( ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
| spl53_1 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f489,definition,
( spl53_2
<=> sK50 = app(tl(sK49),cons(hd(sK49),nil)) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f491,plain,
( sK50 != app(tl(sK49),cons(hd(sK49),nil))
| spl53_2 ),
inference(avatar_component_clause,[],[f489]) ).
fof(f493,definition,
( spl53_3
<=> ssList(tl(sK49)) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f495,plain,
( ~ ssList(tl(sK49))
| spl53_3 ),
inference(avatar_component_clause,[],[f493]) ).
fof(f497,definition,
( spl53_4
<=> ssList(cons(hd(sK49),nil)) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f499,plain,
( ~ ssList(cons(hd(sK49),nil))
| spl53_4 ),
inference(avatar_component_clause,[],[f497]) ).
fof(f501,definition,
( spl53_5
<=> ssItem(hd(sK49)) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f503,plain,
( ~ ssItem(hd(sK49))
| spl53_5 ),
inference(avatar_component_clause,[],[f501]) ).
fof(f505,definition,
( spl53_6
<=> neq(nil,sK49) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f507,plain,
( ~ neq(nil,sK49)
| spl53_6 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f509,definition,
( spl53_7
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f511,plain,
( ~ neq(sK49,nil)
| spl53_7 ),
inference(avatar_component_clause,[],[f509]) ).
fof(f512,plain,
( ~ spl53_1
| ~ spl53_2
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6
| ~ spl53_7 ),
inference(avatar_split_clause,[],[f483,f509,f505,f501,f497,f493,f489,f485]) ).
fof(f567,plain,
( ~ ssList(cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| spl53_1 ),
inference(resolution,[],[f318,f487]) ).
fof(f580,plain,
( ~ spl53_3
| ~ spl53_4
| spl53_1 ),
inference(avatar_split_clause,[],[f567,f485,f497,f493]) ).
fof(f581,plain,
( nil = sK49
| ~ ssList(sK49)
| spl53_3 ),
inference(resolution,[],[f495,f316]) ).
fof(f582,plain,
( nil = sK49
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f581,f426]) ).
fof(f649,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK51,X0) != X0 ),
inference(resolution,[],[f307,f480]) ).
fof(f652,plain,
nil != cons(sK51,nil),
inference(resolution,[],[f649,f306]) ).
fof(f733,plain,
! [X0] :
( ~ ssList(X0)
| sK51 = hd(cons(sK51,X0)) ),
inference(resolution,[],[f315,f480]) ).
fof(f762,plain,
sK51 = hd(cons(sK51,sK52)),
inference(resolution,[],[f733,f479]) ).
fof(f809,plain,
! [X0] :
( ~ ssList(X0)
| tl(cons(sK51,X0)) = X0 ),
inference(resolution,[],[f317,f480]) ).
fof(f847,plain,
sK52 = tl(cons(sK51,sK52)),
inference(resolution,[],[f809,f479]) ).
fof(f1097,plain,
( nil != sK49
| ~ ssList(sK52)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil)) ),
inference(superposition,[],[f394,f482]) ).
fof(f1102,plain,
( ~ ssList(sK52)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f1097,f582]) ).
fof(f1103,plain,
( nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f1102,f479]) ).
fof(f1104,plain,
( ~ ssList(cons(sK51,nil))
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f1103,f652]) ).
fof(f1105,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl53_3 ),
inference(resolution,[],[f1104,f305]) ).
fof(f1106,plain,
( ~ ssList(nil)
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f1105,f480]) ).
fof(f1107,plain,
( $false
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f1106,f306]) ).
fof(f1108,plain,
spl53_3,
inference(avatar_contradiction_clause,[],[f1107]) ).
fof(f1109,plain,
( nil != sK49
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil)) ),
inference(forward_subsumption_resolution,[],[f1097,f479]) ).
fof(f1110,plain,
( nil != sK49
| ~ ssList(cons(sK51,nil)) ),
inference(forward_subsumption_resolution,[],[f1109,f652]) ).
fof(f1123,plain,
( ~ ssItem(hd(sK49))
| ~ ssList(nil)
| spl53_4 ),
inference(resolution,[],[f499,f305]) ).
fof(f1124,plain,
( ~ ssItem(hd(sK49))
| spl53_4 ),
inference(forward_subsumption_resolution,[],[f1123,f306]) ).
fof(f1131,plain,
( ~ spl53_5
| spl53_4 ),
inference(avatar_split_clause,[],[f1124,f497,f501]) ).
fof(f1132,plain,
( nil = sK49
| ~ ssList(sK49)
| spl53_5 ),
inference(resolution,[],[f503,f314]) ).
fof(f1133,plain,
( nil = sK49
| spl53_5 ),
inference(forward_subsumption_resolution,[],[f1132,f426]) ).
fof(f1245,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK51,X0) = app(cons(sK51,nil),X0) ),
inference(resolution,[],[f392,f480]) ).
fof(f1258,plain,
( ~ ssList(cons(sK51,nil))
| spl53_5 ),
inference(forward_subsumption_resolution,[],[f1110,f1133]) ).
fof(f1276,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl53_5 ),
inference(resolution,[],[f1258,f305]) ).
fof(f1277,plain,
( ~ ssList(nil)
| spl53_5 ),
inference(forward_subsumption_resolution,[],[f1276,f480]) ).
fof(f1278,plain,
( $false
| spl53_5 ),
inference(forward_subsumption_resolution,[],[f1277,f306]) ).
fof(f1279,plain,
spl53_5,
inference(avatar_contradiction_clause,[],[f1278]) ).
fof(f1314,definition,
( spl53_13
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_13])],[avatar_definition]) ).
fof(f1316,plain,
( ~ ssList(cons(sK51,nil))
| spl53_13 ),
inference(avatar_component_clause,[],[f1314]) ).
fof(f1318,definition,
( spl53_14
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_14])],[avatar_definition]) ).
fof(f1320,plain,
( nil != sK49
| spl53_14 ),
inference(avatar_component_clause,[],[f1318]) ).
fof(f1321,plain,
( ~ spl53_13
| ~ spl53_14 ),
inference(avatar_split_clause,[],[f1110,f1318,f1314]) ).
fof(f1340,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl53_13 ),
inference(resolution,[],[f1316,f305]) ).
fof(f1341,plain,
( ~ ssList(nil)
| spl53_13 ),
inference(forward_subsumption_resolution,[],[f1340,f480]) ).
fof(f1342,plain,
( $false
| spl53_13 ),
inference(forward_subsumption_resolution,[],[f1341,f306]) ).
fof(f1343,plain,
spl53_13,
inference(avatar_contradiction_clause,[],[f1342]) ).
fof(f3422,plain,
app(cons(sK51,nil),sK52) = cons(sK51,sK52),
inference(resolution,[],[f1245,f479]) ).
fof(f3902,plain,
sK49 = cons(sK51,sK52),
inference(forward_demodulation,[],[f3422,f482]) ).
fof(f3937,plain,
sK52 = tl(sK49),
inference(superposition,[],[f847,f3902]) ).
fof(f3938,plain,
sK51 = hd(sK49),
inference(superposition,[],[f762,f3902]) ).
fof(f4072,plain,
( sK50 != app(tl(sK49),cons(sK51,nil))
| spl53_2 ),
inference(superposition,[],[f491,f3938]) ).
fof(f4087,plain,
( sK50 != app(sK52,cons(sK51,nil))
| spl53_2 ),
inference(forward_demodulation,[],[f4072,f3937]) ).
fof(f4089,plain,
( $false
| spl53_2 ),
inference(forward_subsumption_resolution,[],[f4087,f481]) ).
fof(f4090,plain,
spl53_2,
inference(avatar_contradiction_clause,[],[f4089]) ).
fof(f4094,plain,
( ~ ssList(sK49)
| nil = sK49
| ~ ssList(nil)
| spl53_6 ),
inference(resolution,[],[f507,f303]) ).
fof(f4097,plain,
( nil = sK49
| ~ ssList(nil)
| spl53_6 ),
inference(forward_subsumption_resolution,[],[f4094,f426]) ).
fof(f4098,plain,
( ~ ssList(nil)
| spl53_6
| spl53_14 ),
inference(forward_subsumption_resolution,[],[f4097,f1320]) ).
fof(f4099,plain,
( $false
| spl53_6
| spl53_14 ),
inference(forward_subsumption_resolution,[],[f4098,f306]) ).
fof(f4100,plain,
( spl53_6
| spl53_14 ),
inference(avatar_contradiction_clause,[],[f4099]) ).
fof(f4101,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49)
| spl53_7 ),
inference(resolution,[],[f511,f303]) ).
fof(f4104,plain,
( nil = sK49
| ~ ssList(sK49)
| spl53_7 ),
inference(forward_subsumption_resolution,[],[f4101,f306]) ).
fof(f4105,plain,
( ~ ssList(sK49)
| spl53_7
| spl53_14 ),
inference(forward_subsumption_resolution,[],[f4104,f1320]) ).
fof(f4106,plain,
( $false
| spl53_7
| spl53_14 ),
inference(forward_subsumption_resolution,[],[f4105,f426]) ).
fof(f4107,plain,
( spl53_7
| spl53_14 ),
inference(avatar_contradiction_clause,[],[f4106]) ).
cnf(s1,plain,
( ~ spl53_1
| ~ spl53_2
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6
| ~ spl53_7 ),
inference(sat_conversion,[],[f512]) ).
cnf(s2,plain,
( spl53_1
| ~ spl53_3
| ~ spl53_4 ),
inference(sat_conversion,[],[f580]) ).
cnf(s7,plain,
spl53_3,
inference(sat_conversion,[],[f1108]) ).
cnf(s8,plain,
( spl53_4
| ~ spl53_5 ),
inference(sat_conversion,[],[f1131]) ).
cnf(s9,plain,
spl53_5,
inference(sat_conversion,[],[f1279]) ).
cnf(s10,plain,
( ~ spl53_13
| ~ spl53_14 ),
inference(sat_conversion,[],[f1321]) ).
cnf(s11,plain,
spl53_13,
inference(sat_conversion,[],[f1343]) ).
cnf(s17,plain,
spl53_2,
inference(sat_conversion,[],[f4090]) ).
cnf(s18,plain,
( spl53_6
| spl53_14 ),
inference(sat_conversion,[],[f4100]) ).
cnf(s19,plain,
( spl53_7
| spl53_14 ),
inference(sat_conversion,[],[f4107]) ).
cnf(s20,plain,
~ spl53_14,
inference(rat,[],[s10,s11]) ).
cnf(s21,plain,
spl53_7,
inference(rat,[],[s19,s20]) ).
cnf(s22,plain,
spl53_6,
inference(rat,[],[s18,s20]) ).
cnf(s23,plain,
spl53_4,
inference(rat,[],[s8,s9]) ).
cnf(s26,plain,
spl53_1,
inference(rat,[],[s2,s23,s7]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s1,s21,s22,s9,s23,s7,s17,s26]) ).
fof(f4108,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC316+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n011.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:01:31 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/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
% 7.70/1.47 % (3260502)Will run a generic schedule for satisfiability detection.
% 7.70/1.47 % (3260509)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1594597148:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.70/1.47 % (3260508)% WARNING: option uhcvi not known.
% 7.70/1.47 % (3260507)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2473563298_2999 on theBenchmark for (2999ds/0Mi)
% 7.70/1.47 % (3260510)dis+10_1_sil=32000:sp=arity:random_seed=3489114057:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.70/1.47 % (3260508)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=965863870:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.70/1.47 % (3260511)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2231693304:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.70/1.47 % (3260512)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1274130141:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.70/1.47 % (3260513)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3972920250:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.70/1.47 % TRYING [1]
% 7.70/1.47 % TRYING [2]
% 7.70/1.47 % TRYING [3]
% 7.70/1.47 % TRYING [4]
% 7.70/1.47 % (3260510)Instruction limit reached!
% 7.70/1.47 % (3260510)------------------------------
% 7.70/1.47 % (3260510)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260510)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260510)Termination reason: Instruction limit
% 7.70/1.47 % (3260510)Termination phase: Saturation
% 7.70/1.47 % (3260510)Time elapsed: 0.062 s
% 7.70/1.47 % (3260510)Peak memory usage: 13 MB
% 7.70/1.47 % (3260510)Instructions burned: 103 (million)
% 7.70/1.47 % (3260511)Instruction limit reached!
% 7.70/1.47 % (3260511)------------------------------
% 7.70/1.47 % (3260511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260511)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260511)Termination reason: Instruction limit
% 7.70/1.47 % (3260511)Termination phase: Saturation
% 7.70/1.47 % (3260511)Time elapsed: 0.070 s
% 7.70/1.47 % (3260511)Peak memory usage: 13 MB
% 7.70/1.47 % (3260511)Instructions burned: 117 (million)
% 7.70/1.47 % (3260512)Instruction limit reached!
% 7.70/1.47 % (3260512)------------------------------
% 7.70/1.47 % (3260512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260512)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260512)Termination reason: Instruction limit
% 7.70/1.47 % (3260512)Termination phase: Saturation
% 7.70/1.47 % (3260512)Time elapsed: 0.077 s
% 7.70/1.47 % (3260512)Peak memory usage: 14 MB
% 7.70/1.47 % (3260512)Instructions burned: 131 (million)
% 7.70/1.47 % (3260521)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1218341184:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.70/1.47 % (3260522)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2558753777:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.70/1.47 % (3260523)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=2889507861:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.70/1.47 % TRYING [1]
% 7.70/1.47 % TRYING [2]
% 7.70/1.47 % (3260513)Instruction limit reached!
% 7.70/1.47 % (3260513)------------------------------
% 7.70/1.47 % (3260513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260513)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260513)Termination reason: Instruction limit
% 7.70/1.47 % (3260513)Termination phase: Saturation
% 7.70/1.47 % (3260513)Time elapsed: 0.099 s
% 7.70/1.47 % (3260513)Peak memory usage: 15 MB
% 7.70/1.47 % (3260513)Instructions burned: 160 (million)
% 7.70/1.47 % TRYING [5]
% 7.70/1.47 % TRYING [3]
% 7.70/1.47 % (3260527)ott-21_1_sil=16000:fs=off:random_seed=1097757986:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.70/1.47 % TRYING [4]
% 7.70/1.47 % (3260522)Instruction limit reached!
% 7.70/1.47 % (3260522)------------------------------
% 7.70/1.47 % (3260522)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260522)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260522)Termination reason: Instruction limit
% 7.70/1.47 % (3260522)Termination phase: Saturation
% 7.70/1.47 % (3260522)Time elapsed: 0.071 s
% 7.70/1.47 % (3260522)Peak memory usage: 13 MB
% 7.70/1.47 % (3260522)Instructions burned: 133 (million)
% 7.70/1.47 % TRYING [5]
% 7.70/1.47 % (3260529)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3720275477:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 7.70/1.47 % (3260527)Instruction limit reached!
% 7.70/1.47 % (3260527)------------------------------
% 7.70/1.47 % (3260527)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260527)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260527)Termination reason: Instruction limit
% 7.70/1.47 % (3260527)Termination phase: Saturation
% 7.70/1.47 % (3260527)Time elapsed: 0.092 s
% 7.70/1.47 % (3260527)Peak memory usage: 14 MB
% 7.70/1.47 % (3260527)Instructions burned: 181 (million)
% 7.70/1.47 % (3260531)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2554350372:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.70/1.47 % TRYING [6]
% 7.70/1.47 % TRYING [1]
% 7.70/1.47 % TRYING [2]
% 7.70/1.47 % TRYING [3]
% 7.70/1.47 % TRYING [4]
% 7.70/1.47 % TRYING [6]
% 7.70/1.47 % (3260521)Instruction limit reached!
% 7.70/1.47 % (3260521)------------------------------
% 7.70/1.47 % (3260521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260521)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260521)Termination reason: Instruction limit
% 7.70/1.47 % (3260521)Termination phase: Finite model building constraint generation
% 7.70/1.47 % (3260521)Time elapsed: 0.305 s
% 7.70/1.47 % (3260521)Peak memory usage: 30 MB
% 7.70/1.47 % (3260521)Instructions burned: 717 (million)
% 7.70/1.47 % (3260533)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3777971150:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 7.70/1.47 % TRYING [5]
% 7.70/1.47 % (3260523)Instruction limit reached!
% 7.70/1.47 % (3260523)------------------------------
% 7.70/1.47 % (3260523)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260523)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260523)Termination reason: Instruction limit
% 7.70/1.47 % (3260523)Termination phase: Saturation
% 7.70/1.47 % (3260523)Time elapsed: 0.387 s
% 7.70/1.47 % (3260523)Peak memory usage: 21 MB
% 7.70/1.47 % (3260523)Instructions burned: 685 (million)
% 7.70/1.47 % (3260535)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=402795814:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 7.70/1.47 % (3260529)Instruction limit reached!
% 7.70/1.47 % (3260529)------------------------------
% 7.70/1.47 % (3260529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260529)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260529)Termination reason: Instruction limit
% 7.70/1.47 % (3260529)Termination phase: Saturation
% 7.70/1.47 % (3260529)Time elapsed: 0.330 s
% 7.70/1.47 % (3260529)Peak memory usage: 14 MB
% 7.70/1.47 % (3260529)Instructions burned: 477 (million)
% 7.70/1.47 % (3260537)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3160778067:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 7.70/1.47 % TRYING [7]
% 7.70/1.47 % (3260531)Instruction limit reached!
% 7.70/1.47 % (3260531)------------------------------
% 7.70/1.47 % (3260531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260531)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260531)Termination reason: Instruction limit
% 7.70/1.47 % (3260531)Termination phase: Finite model building SAT solving
% 7.70/1.47 % (3260531)Time elapsed: 0.348 s
% 7.70/1.47 % (3260531)Peak memory usage: 24 MB
% 7.70/1.47 % (3260531)Instructions burned: 866 (million)
% 7.70/1.47 % (3260539)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=304571997:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 7.70/1.47 % TRYING [14]
% 7.70/1.47 % (3260535)Instruction limit reached!
% 7.70/1.47 % (3260535)------------------------------
% 7.70/1.47 % (3260535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260535)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260535)Termination reason: Instruction limit
% 7.70/1.47 % (3260535)Termination phase: Finite model building constraint generation
% 7.70/1.47 % (3260535)Time elapsed: 0.335 s
% 7.70/1.47 % (3260535)Peak memory usage: 74 MB
% 7.70/1.47 % (3260535)Instructions burned: 890 (million)
% 7.70/1.47 % (3260541)fmb+10_1_sil=64000:random_seed=2448040617:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 7.70/1.47 % TRYING [1]
% 7.70/1.47 % TRYING [2]
% 7.70/1.47 % TRYING [3]
% 7.70/1.47 % (3260537)Instruction limit reached!
% 7.70/1.47 % (3260537)------------------------------
% 7.70/1.47 % (3260537)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260537)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260537)Termination reason: Instruction limit
% 7.70/1.47 % (3260537)Termination phase: Saturation
% 7.70/1.47 % (3260537)Time elapsed: 0.369 s
% 7.70/1.47 % (3260537)Peak memory usage: 19 MB
% 7.70/1.47 % (3260537)Instructions burned: 694 (million)
% 7.70/1.47 % (3260543)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2150658832:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 7.70/1.47 % TRYING [20]
% 7.70/1.47 % TRYING [4]
% 7.70/1.47 % (3260533)Instruction limit reached!
% 7.70/1.47 % (3260533)------------------------------
% 7.70/1.47 % (3260533)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260533)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260533)Termination reason: Instruction limit
% 7.70/1.47 % (3260533)Termination phase: Saturation
% 7.70/1.47 % (3260533)Time elapsed: 0.648 s
% 7.70/1.47 % (3260533)Peak memory usage: 29 MB
% 7.70/1.47 % (3260533)Instructions burned: 1180 (million)
% 7.70/1.47 % (3260545)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=322618867:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 7.70/1.47 % TRYING [5]
% 7.70/1.47 % (3260539)Instruction limit reached!
% 7.70/1.47 % (3260539)------------------------------
% 7.70/1.47 % (3260539)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260539)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260539)Termination reason: Instruction limit
% 7.70/1.47 % (3260539)Termination phase: Saturation
% 7.70/1.47 % (3260539)Time elapsed: 0.479 s
% 7.70/1.47 % (3260539)Peak memory usage: 20 MB
% 7.70/1.47 % (3260539)Instructions burned: 879 (million)
% 7.70/1.47 % TRYING [8]
% 7.70/1.47 % (3260547)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2670627198:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 7.70/1.47 % (3260547) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3260502-3260547"...
% 7.70/1.47 % (3260547)...printing done.
% 7.70/1.47 % (3260547)Refutation found. Thanks to Tanya!
% 7.70/1.47 % SZS status Theorem for theBenchmark
% 7.70/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 7.70/1.47 % (3260547)------------------------------
% 7.70/1.47 % (3260547)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.70/1.47 % (3260547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.70/1.47 % (3260547)CaDiCaL version: 2.1.3
% 7.70/1.47 % (3260547)Termination reason: Refutation
% 7.70/1.47 % (3260547)Time elapsed: 0.093 s
% 7.70/1.47 % (3260547)Peak memory usage: 14 MB
% 7.70/1.47 % (3260547)Instructions burned: 165 (million)
% 7.70/1.47 % (3260502)Success in time 1.251 s
% 7.70/1.47 % Vampire exiting
%------------------------------------------------------------------------------