%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC005+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 : n026.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:15 PM UTC 2026
% Result : Theorem 14.80s 2.58s
% Output : Refutation 14.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 24
% Syntax : Number of formulae : 193 ( 29 unt; 11 def)
% Number of atoms : 595 ( 128 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 719 ( 317 ~; 321 |; 38 &)
% ( 15 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn 102 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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] :
( ssList(X7)
& X2 != X7
& tl(X3) = X7
& neq(nil,X3) ) )
& ( ~ 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] :
( ssList(X7)
& X2 != X7
& tl(X3) = X7
& neq(nil,X3) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
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(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(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
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(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
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] :
( ~ ssList(X7)
| X2 = X7
| tl(X3) != X7
| ~ neq(nil,X3) ) )
| ( 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] :
( ~ ssList(X7)
| X2 = X7
| tl(X3) != X7
| ~ neq(nil,X3) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f238,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| ~ ssList(X1)
| app(sK6(X0,X1),X1) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f239,plain,
! [X0,X1] :
( ssList(sK6(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f240,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
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(f316,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f389,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
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(f413,plain,
! [X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| tl(sK50) != X7
| sK49 = X7
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f415,f419]) ).
fof(f429,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,f418,f419]) ).
fof(f434,plain,
! [X2,X1] :
( ~ ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X2,X1),X1) ),
inference(equality_resolution,[],[f240]) ).
fof(f444,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f456,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| sK49 = tl(sK50)
| ~ ssList(tl(sK50)) ),
inference(equality_resolution,[],[f413]) ).
fof(f461,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f444]) ).
fof(f464,plain,
( ~ neq(nil,sK50)
| sK49 = tl(sK50)
| ~ ssList(tl(sK50)) ),
inference(forward_subsumption_resolution,[],[f456,f426]) ).
fof(f466,definition,
( spl51_1
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f467,plain,
( ssList(tl(sK50))
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f468,plain,
( ~ ssList(tl(sK50))
| spl51_1 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f470,definition,
( spl51_2
<=> sK49 = tl(sK50) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f472,plain,
( sK49 = tl(sK50)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f474,definition,
( spl51_3
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f476,plain,
( ~ neq(nil,sK50)
| spl51_3 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f477,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f464,f474,f470,f466]) ).
fof(f478,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK49
| ~ neq(X5,nil)
| app(app(X4,X5),X6) != sK50
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(forward_subsumption_resolution,[],[f429,f426]) ).
fof(f500,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f501,plain,
sK50 = app(nil,sK50),
inference(resolution,[],[f320,f417]) ).
fof(f524,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f397,f417]) ).
fof(f525,plain,
! [X0] :
( sK49 != sK49
| ~ neq(X0,nil)
| sK50 != app(app(nil,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(superposition,[],[f478,f500]) ).
fof(f526,plain,
! [X0] :
( ~ neq(X0,nil)
| sK50 != app(app(nil,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f525]) ).
fof(f527,plain,
! [X0] :
( ~ neq(X0,nil)
| sK50 != app(app(nil,X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f526,f420]) ).
fof(f528,plain,
! [X0] :
( sK50 != app(app(nil,X0),sK49)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f527,f306]) ).
fof(f544,plain,
( sK50 != app(sK50,sK49)
| ~ neq(sK50,nil)
| ~ ssList(sK50) ),
inference(superposition,[],[f528,f501]) ).
fof(f545,plain,
( sK50 != app(sK50,sK49)
| ~ ssList(sK50) ),
inference(forward_subsumption_resolution,[],[f544,f426]) ).
fof(f547,plain,
sK50 != app(sK50,sK49),
inference(forward_subsumption_resolution,[],[f545,f417]) ).
fof(f548,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_1 ),
inference(resolution,[],[f316,f468]) ).
fof(f551,plain,
( nil = sK50
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f548,f417]) ).
fof(f553,plain,
( neq(nil,nil)
| spl51_1 ),
inference(superposition,[],[f426,f551]) ).
fof(f565,plain,
( ~ ssList(nil)
| spl51_1 ),
inference(resolution,[],[f553,f461]) ).
fof(f566,plain,
( $false
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f565,f306]) ).
fof(f567,plain,
spl51_1,
inference(avatar_contradiction_clause,[],[f566]) ).
fof(f617,definition,
( spl51_9
<=> sK49 = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f618,plain,
( sK49 = sK50
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f617]) ).
fof(f619,plain,
( sK49 != sK50
| spl51_9 ),
inference(avatar_component_clause,[],[f617]) ).
fof(f635,definition,
( spl51_12
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_12])],[avatar_definition]) ).
fof(f636,plain,
( nil = sK49
| ~ spl51_12 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f637,plain,
( nil != sK49
| spl51_12 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f733,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f303,f476]) ).
fof(f740,plain,
( nil = sK50
| ~ ssList(nil)
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f733,f417]) ).
fof(f743,plain,
( nil = sK50
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f740,f306]) ).
fof(f747,plain,
( neq(nil,nil)
| spl51_3 ),
inference(superposition,[],[f426,f743]) ).
fof(f806,plain,
( ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f747,f461]) ).
fof(f807,plain,
( $false
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f806,f306]) ).
fof(f808,plain,
spl51_3,
inference(avatar_contradiction_clause,[],[f807]) ).
fof(f822,plain,
( sK50 != app(sK50,nil)
| ~ spl51_12 ),
inference(superposition,[],[f547,f636]) ).
fof(f826,plain,
( $false
| ~ spl51_12 ),
inference(forward_subsumption_resolution,[],[f822,f524]) ).
fof(f827,plain,
~ spl51_12,
inference(avatar_contradiction_clause,[],[f826]) ).
fof(f965,definition,
( spl51_15
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_15])],[avatar_definition]) ).
fof(f966,plain,
( nil != sK50
| spl51_15 ),
inference(avatar_component_clause,[],[f965]) ).
fof(f967,plain,
( nil = sK50
| ~ spl51_15 ),
inference(avatar_component_clause,[],[f965]) ).
fof(f982,plain,
( neq(nil,nil)
| ~ spl51_15 ),
inference(superposition,[],[f426,f967]) ).
fof(f1002,plain,
( ~ ssList(nil)
| ~ spl51_15 ),
inference(resolution,[],[f982,f461]) ).
fof(f1003,plain,
( $false
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1002,f306]) ).
fof(f1004,plain,
~ spl51_15,
inference(avatar_contradiction_clause,[],[f1003]) ).
fof(f1016,plain,
! [X0,X1] :
( ~ rearsegP(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| sK6(X1,X0) = app(nil,sK6(X1,X0)) ),
inference(resolution,[],[f239,f320]) ).
fof(f1117,plain,
( nil = sK50
| sK50 = cons(hd(sK50),tl(sK50)) ),
inference(resolution,[],[f389,f417]) ).
fof(f1118,plain,
( sK50 = cons(hd(sK50),tl(sK50))
| spl51_15 ),
inference(forward_subsumption_resolution,[],[f1117,f966]) ).
fof(f1122,plain,
( sK50 = cons(hd(sK50),sK49)
| ~ spl51_2
| spl51_15 ),
inference(forward_demodulation,[],[f1118,f472]) ).
fof(f1165,definition,
( spl51_17
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_17])],[avatar_definition]) ).
fof(f1166,plain,
( ssItem(hd(sK50))
| ~ spl51_17 ),
inference(avatar_component_clause,[],[f1165]) ).
fof(f1167,plain,
( ~ ssItem(hd(sK50))
| spl51_17 ),
inference(avatar_component_clause,[],[f1165]) ).
fof(f1179,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_17 ),
inference(resolution,[],[f1167,f314]) ).
fof(f1180,plain,
( ~ ssList(sK50)
| spl51_15
| spl51_17 ),
inference(forward_subsumption_resolution,[],[f1179,f966]) ).
fof(f1181,plain,
( $false
| spl51_15
| spl51_17 ),
inference(forward_subsumption_resolution,[],[f1180,f417]) ).
fof(f1182,plain,
( spl51_15
| spl51_17 ),
inference(avatar_contradiction_clause,[],[f1181]) ).
fof(f1193,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK50),X0) != X0 )
| ~ spl51_17 ),
inference(resolution,[],[f1166,f307]) ).
fof(f1206,plain,
( ! [X0] :
( ~ ssItem(X0)
| cons(X0,tl(sK50)) = app(cons(X0,nil),tl(sK50)) )
| ~ spl51_1 ),
inference(resolution,[],[f392,f467]) ).
fof(f1256,plain,
( ! [X0] :
( ~ ssItem(X0)
| cons(X0,sK49) = app(cons(X0,nil),sK49) )
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_demodulation,[],[f1206,f472]) ).
fof(f1336,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f434,f318]) ).
fof(f2835,plain,
( cons(hd(sK50),sK49) = app(cons(hd(sK50),nil),sK49)
| ~ spl51_1
| ~ spl51_2
| ~ spl51_17 ),
inference(resolution,[],[f1256,f1166]) ).
fof(f2856,plain,
( sK50 = app(cons(hd(sK50),nil),sK49)
| ~ spl51_1
| ~ spl51_2
| spl51_15
| ~ spl51_17 ),
inference(forward_demodulation,[],[f2835,f1122]) ).
fof(f3159,plain,
( rearsegP(sK50,sK49)
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(sK49)
| ~ spl51_1
| ~ spl51_2
| spl51_15
| ~ spl51_17 ),
inference(superposition,[],[f1336,f2856]) ).
fof(f3160,plain,
( rearsegP(sK50,sK49)
| ~ ssList(cons(hd(sK50),nil))
| ~ spl51_1
| ~ spl51_2
| spl51_15
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f3159,f420]) ).
fof(f3306,definition,
( spl51_28
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_28])],[avatar_definition]) ).
fof(f3308,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_28 ),
inference(avatar_component_clause,[],[f3306]) ).
fof(f3310,definition,
( spl51_29
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_29])],[avatar_definition]) ).
fof(f3312,plain,
( rearsegP(sK50,sK49)
| ~ spl51_29 ),
inference(avatar_component_clause,[],[f3310]) ).
fof(f3313,plain,
( ~ spl51_28
| spl51_29
| ~ spl51_1
| ~ spl51_2
| spl51_15
| ~ spl51_17 ),
inference(avatar_split_clause,[],[f3160,f1165,f965,f470,f466,f3310,f3306]) ).
fof(f3390,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_28 ),
inference(resolution,[],[f3308,f305]) ).
fof(f3391,plain,
( ~ ssList(nil)
| ~ spl51_17
| spl51_28 ),
inference(forward_subsumption_resolution,[],[f3390,f1166]) ).
fof(f3392,plain,
( $false
| ~ spl51_17
| spl51_28 ),
inference(forward_subsumption_resolution,[],[f3391,f306]) ).
fof(f3393,plain,
( ~ spl51_17
| spl51_28 ),
inference(avatar_contradiction_clause,[],[f3392]) ).
fof(f3471,plain,
( ~ ssList(sK49)
| sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_29 ),
inference(resolution,[],[f3312,f238]) ).
fof(f3472,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_29 ),
inference(forward_subsumption_resolution,[],[f3471,f420]) ).
fof(f3473,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ spl51_29 ),
inference(forward_subsumption_resolution,[],[f3472,f417]) ).
fof(f13612,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| sK6(sK50,sK49) = app(nil,sK6(sK50,sK49))
| ~ spl51_29 ),
inference(resolution,[],[f1016,f3312]) ).
fof(f13622,plain,
( ~ ssList(sK49)
| sK6(sK50,sK49) = app(nil,sK6(sK50,sK49))
| ~ spl51_29 ),
inference(forward_subsumption_resolution,[],[f13612,f417]) ).
fof(f13632,plain,
( sK6(sK50,sK49) = app(nil,sK6(sK50,sK49))
| ~ spl51_29 ),
inference(forward_subsumption_resolution,[],[f13622,f420]) ).
fof(f25561,plain,
( sK50 != app(sK6(sK50,sK49),sK49)
| ~ neq(sK6(sK50,sK49),nil)
| ~ ssList(sK6(sK50,sK49))
| ~ spl51_29 ),
inference(superposition,[],[f528,f13632]) ).
fof(f25591,plain,
( ~ neq(sK6(sK50,sK49),nil)
| ~ ssList(sK6(sK50,sK49))
| ~ spl51_29 ),
inference(forward_subsumption_resolution,[],[f25561,f3473]) ).
fof(f26293,definition,
( spl51_50
<=> ssList(tl(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_50])],[avatar_definition]) ).
fof(f26294,plain,
( ssList(tl(sK49))
| ~ spl51_50 ),
inference(avatar_component_clause,[],[f26293]) ).
fof(f26295,plain,
( ~ ssList(tl(sK49))
| spl51_50 ),
inference(avatar_component_clause,[],[f26293]) ).
fof(f26505,plain,
( nil = sK49
| ~ ssList(sK49)
| spl51_50 ),
inference(resolution,[],[f26295,f316]) ).
fof(f26506,plain,
( ~ ssList(sK49)
| spl51_12
| spl51_50 ),
inference(forward_subsumption_resolution,[],[f26505,f637]) ).
fof(f26507,plain,
( $false
| spl51_12
| spl51_50 ),
inference(forward_subsumption_resolution,[],[f26506,f420]) ).
fof(f26508,plain,
( spl51_12
| spl51_50 ),
inference(avatar_contradiction_clause,[],[f26507]) ).
fof(f26747,plain,
( tl(sK49) != cons(hd(sK50),tl(sK49))
| ~ spl51_17
| ~ spl51_50 ),
inference(resolution,[],[f26294,f1193]) ).
fof(f30411,definition,
( spl51_52
<=> ssList(sK6(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_52])],[avatar_definition]) ).
fof(f30412,plain,
( ssList(sK6(sK50,sK49))
| ~ spl51_52 ),
inference(avatar_component_clause,[],[f30411]) ).
fof(f30413,plain,
( ~ ssList(sK6(sK50,sK49))
| spl51_52 ),
inference(avatar_component_clause,[],[f30411]) ).
fof(f30625,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_52 ),
inference(resolution,[],[f30413,f239]) ).
fof(f30626,plain,
( ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_52 ),
inference(forward_subsumption_resolution,[],[f30625,f420]) ).
fof(f30627,plain,
( ~ rearsegP(sK50,sK49)
| spl51_52 ),
inference(forward_subsumption_resolution,[],[f30626,f417]) ).
fof(f30628,plain,
( $false
| ~ spl51_29
| spl51_52 ),
inference(forward_subsumption_resolution,[],[f30627,f3312]) ).
fof(f30629,plain,
( ~ spl51_29
| spl51_52 ),
inference(avatar_contradiction_clause,[],[f30628]) ).
fof(f31718,plain,
( ~ neq(sK6(sK50,sK49),nil)
| ~ spl51_29
| ~ spl51_52 ),
inference(forward_subsumption_resolution,[],[f25591,f30412]) ).
fof(f31913,plain,
( ~ ssList(nil)
| nil = sK6(sK50,sK49)
| ~ ssList(sK6(sK50,sK49))
| ~ spl51_29
| ~ spl51_52 ),
inference(resolution,[],[f31718,f303]) ).
fof(f31915,plain,
( nil = sK6(sK50,sK49)
| ~ ssList(sK6(sK50,sK49))
| ~ spl51_29
| ~ spl51_52 ),
inference(forward_subsumption_resolution,[],[f31913,f306]) ).
fof(f31916,plain,
( nil = sK6(sK50,sK49)
| ~ spl51_29
| ~ spl51_52 ),
inference(forward_subsumption_resolution,[],[f31915,f30412]) ).
fof(f32159,plain,
( sK50 = app(nil,sK49)
| ~ spl51_29
| ~ spl51_52 ),
inference(superposition,[],[f3473,f31916]) ).
fof(f32616,plain,
( sK49 = sK50
| ~ spl51_29
| ~ spl51_52 ),
inference(superposition,[],[f32159,f500]) ).
fof(f32651,plain,
( $false
| spl51_9
| ~ spl51_29
| ~ spl51_52 ),
inference(forward_subsumption_resolution,[],[f32616,f619]) ).
fof(f32652,plain,
( spl51_9
| ~ spl51_29
| ~ spl51_52 ),
inference(avatar_contradiction_clause,[],[f32651]) ).
fof(f33111,plain,
( tl(sK50) != cons(hd(sK50),tl(sK50))
| ~ spl51_9
| ~ spl51_17
| ~ spl51_50 ),
inference(superposition,[],[f26747,f618]) ).
fof(f33141,plain,
( sK49 != cons(hd(sK50),sK49)
| ~ spl51_2
| ~ spl51_9
| ~ spl51_17
| ~ spl51_50 ),
inference(forward_demodulation,[],[f33111,f472]) ).
fof(f33165,plain,
( sK49 != sK50
| ~ spl51_2
| ~ spl51_9
| spl51_15
| ~ spl51_17
| ~ spl51_50 ),
inference(forward_demodulation,[],[f33141,f1122]) ).
fof(f33166,plain,
( $false
| ~ spl51_2
| ~ spl51_9
| spl51_15
| ~ spl51_17
| ~ spl51_50 ),
inference(forward_subsumption_resolution,[],[f33165,f618]) ).
fof(f33167,plain,
( ~ spl51_2
| ~ spl51_9
| spl51_15
| ~ spl51_17
| ~ spl51_50 ),
inference(avatar_contradiction_clause,[],[f33166]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f477]) ).
cnf(s2,plain,
spl51_1,
inference(sat_conversion,[],[f567]) ).
cnf(s10,plain,
spl51_3,
inference(sat_conversion,[],[f808]) ).
cnf(s12,plain,
~ spl51_12,
inference(sat_conversion,[],[f827]) ).
cnf(s14,plain,
~ spl51_15,
inference(sat_conversion,[],[f1004]) ).
cnf(s16,plain,
( spl51_15
| spl51_17 ),
inference(sat_conversion,[],[f1182]) ).
cnf(s24,plain,
( ~ spl51_1
| ~ spl51_2
| spl51_15
| ~ spl51_17
| ~ spl51_28
| spl51_29 ),
inference(sat_conversion,[],[f3313]) ).
cnf(s25,plain,
( ~ spl51_17
| spl51_28 ),
inference(sat_conversion,[],[f3393]) ).
cnf(s47,plain,
( spl51_12
| spl51_50 ),
inference(sat_conversion,[],[f26508]) ).
cnf(s49,plain,
( ~ spl51_29
| spl51_52 ),
inference(sat_conversion,[],[f30629]) ).
cnf(s51,plain,
( spl51_9
| ~ spl51_29
| ~ spl51_52 ),
inference(sat_conversion,[],[f32652]) ).
cnf(s54,plain,
( ~ spl51_2
| ~ spl51_9
| spl51_15
| ~ spl51_17
| ~ spl51_50 ),
inference(sat_conversion,[],[f33167]) ).
cnf(s67,plain,
spl51_17,
inference(rat,[],[s16,s14]) ).
cnf(s69,plain,
spl51_28,
inference(rat,[],[s25,s67]) ).
cnf(s71,plain,
spl51_50,
inference(rat,[],[s47,s12]) ).
cnf(s75,plain,
spl51_2,
inference(rat,[],[s1,s10,s2]) ).
cnf(s76,plain,
~ spl51_9,
inference(rat,[],[s54,s71,s67,s14,s75]) ).
cnf(s79,plain,
spl51_29,
inference(rat,[],[s24,s2,s69,s67,s14,s75]) ).
cnf(s84,plain,
~ spl51_52,
inference(rat,[],[s51,s76,s79]) ).
cnf(s85,plain,
$false,
inference(rat,[],[s49,s84,s79]) ).
fof(f33168,plain,
$false,
inference(avatar_sat_refutation,[],[s85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC005+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.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 07:27:12 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 14.80/2.58 % (3675294)Will run a generic schedule for satisfiability detection.
% 14.80/2.58 % (3675301)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1100042069:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 14.80/2.58 % (3675302)dis+10_1_sil=32000:sp=arity:random_seed=2401124066:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 14.80/2.58 % (3675305)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3146563375:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 14.80/2.58 % (3675303)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=615546820:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 14.80/2.58 % (3675304)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1329204427:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 14.80/2.58 % (3675299)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2759969379_2999 on theBenchmark for (2999ds/0Mi)
% 14.80/2.58 % (3675300)% WARNING: option uhcvi not known.
% 14.80/2.58 % (3675300)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1213413091:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 14.80/2.58 % TRYING [1]
% 14.80/2.58 % TRYING [2]
% 14.80/2.58 % TRYING [3]
% 14.80/2.58 % TRYING [4]
% 14.80/2.58 % (3675302)Instruction limit reached!
% 14.80/2.58 % (3675302)------------------------------
% 14.80/2.58 % (3675302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675302)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675302)Termination reason: Instruction limit
% 14.80/2.58 % (3675302)Termination phase: Saturation
% 14.80/2.58 % (3675302)Time elapsed: 0.061 s
% 14.80/2.58 % (3675302)Peak memory usage: 13 MB
% 14.80/2.58 % (3675302)Instructions burned: 103 (million)
% 14.80/2.58 % (3675303)Instruction limit reached!
% 14.80/2.58 % (3675303)------------------------------
% 14.80/2.58 % (3675303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675303)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675303)Termination reason: Instruction limit
% 14.80/2.58 % (3675303)Termination phase: Saturation
% 14.80/2.58 % (3675303)Time elapsed: 0.071 s
% 14.80/2.58 % (3675303)Peak memory usage: 14 MB
% 14.80/2.58 % (3675303)Instructions burned: 116 (million)
% 14.80/2.58 % (3675304)Instruction limit reached!
% 14.80/2.58 % (3675304)------------------------------
% 14.80/2.58 % (3675304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675304)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675304)Termination reason: Instruction limit
% 14.80/2.58 % (3675304)Termination phase: Saturation
% 14.80/2.58 % (3675304)Time elapsed: 0.079 s
% 14.80/2.58 % (3675304)Peak memory usage: 14 MB
% 14.80/2.58 % (3675304)Instructions burned: 132 (million)
% 14.80/2.58 % (3675313)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2926831605:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 14.80/2.58 % TRYING [5]
% 14.80/2.58 % (3675314)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=856293536:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 14.80/2.58 % TRYING [1]
% 14.80/2.58 % TRYING [2]
% 14.80/2.58 % (3675315)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=287969095:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 14.80/2.58 % TRYING [3]
% 14.80/2.58 % (3675305)Instruction limit reached!
% 14.80/2.58 % (3675305)------------------------------
% 14.80/2.58 % (3675305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675305)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675305)Termination reason: Instruction limit
% 14.80/2.58 % (3675305)Termination phase: Saturation
% 14.80/2.58 % (3675305)Time elapsed: 0.104 s
% 14.80/2.58 % (3675305)Peak memory usage: 15 MB
% 14.80/2.58 % (3675305)Instructions burned: 159 (million)
% 14.80/2.58 % TRYING [4]
% 14.80/2.58 % (3675319)ott-21_1_sil=16000:fs=off:random_seed=314437303:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 14.80/2.58 % (3675314)Instruction limit reached!
% 14.80/2.58 % (3675314)------------------------------
% 14.80/2.58 % (3675314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675314)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675314)Termination reason: Instruction limit
% 14.80/2.58 % (3675314)Termination phase: Saturation
% 14.80/2.58 % (3675314)Time elapsed: 0.071 s
% 14.80/2.58 % (3675314)Peak memory usage: 13 MB
% 14.80/2.58 % (3675314)Instructions burned: 131 (million)
% 14.80/2.58 % TRYING [5]
% 14.80/2.58 % (3675321)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3488437356:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 14.80/2.58 % TRYING [6]
% 14.80/2.58 % (3675319)Instruction limit reached!
% 14.80/2.58 % (3675319)------------------------------
% 14.80/2.58 % (3675319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675319)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675319)Termination reason: Instruction limit
% 14.80/2.58 % (3675319)Termination phase: Saturation
% 14.80/2.58 % (3675319)Time elapsed: 0.093 s
% 14.80/2.58 % (3675319)Peak memory usage: 14 MB
% 14.80/2.58 % (3675319)Instructions burned: 180 (million)
% 14.80/2.58 % (3675323)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2320898974:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 14.80/2.58 % TRYING [1]
% 14.80/2.58 % TRYING [2]
% 14.80/2.58 % TRYING [3]
% 14.80/2.58 % TRYING [4]
% 14.80/2.58 % TRYING [6]
% 14.80/2.58 % (3675313)Instruction limit reached!
% 14.80/2.58 % (3675313)------------------------------
% 14.80/2.58 % (3675313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675313)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675313)Termination reason: Instruction limit
% 14.80/2.58 % (3675313)Termination phase: Finite model building constraint generation
% 14.80/2.58 % (3675313)Time elapsed: 0.289 s
% 14.80/2.58 % (3675313)Peak memory usage: 28 MB
% 14.80/2.58 % (3675313)Instructions burned: 716 (million)
% 14.80/2.58 % (3675325)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=27752069:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 14.80/2.58 % TRYING [5]
% 14.80/2.58 % TRYING [7]
% 14.80/2.58 % (3675315)Instruction limit reached!
% 14.80/2.58 % (3675315)------------------------------
% 14.80/2.58 % (3675315)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675315)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675315)Termination reason: Instruction limit
% 14.80/2.58 % (3675315)Termination phase: Saturation
% 14.80/2.58 % (3675315)Time elapsed: 0.375 s
% 14.80/2.58 % (3675315)Peak memory usage: 22 MB
% 14.80/2.58 % (3675315)Instructions burned: 684 (million)
% 14.80/2.58 % (3675327)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=614167602:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 14.80/2.58 % (3675321)Instruction limit reached!
% 14.80/2.58 % (3675321)------------------------------
% 14.80/2.58 % (3675321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675321)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675321)Termination reason: Instruction limit
% 14.80/2.58 % (3675321)Termination phase: Saturation
% 14.80/2.58 % (3675321)Time elapsed: 0.321 s
% 14.80/2.58 % (3675321)Peak memory usage: 15 MB
% 14.80/2.58 % (3675321)Instructions burned: 477 (million)
% 14.80/2.58 % (3675329)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=2394245407: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)
% 14.80/2.58 % (3675323)Instruction limit reached!
% 14.80/2.58 % (3675323)------------------------------
% 14.80/2.58 % (3675323)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675323)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675323)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675323)Termination reason: Instruction limit
% 14.80/2.58 % (3675323)Termination phase: Finite model building SAT solving
% 14.80/2.58 % (3675323)Time elapsed: 0.348 s
% 14.80/2.58 % (3675323)Peak memory usage: 22 MB
% 14.80/2.58 % (3675323)Instructions burned: 866 (million)
% 14.80/2.58 % TRYING [14]
% 14.80/2.58 % (3675331)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4038562253:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 14.80/2.58 % (3675327)Instruction limit reached!
% 14.80/2.58 % (3675327)------------------------------
% 14.80/2.58 % (3675327)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675327)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675327)Termination reason: Instruction limit
% 14.80/2.58 % (3675327)Termination phase: Finite model building constraint generation
% 14.80/2.58 % (3675327)Time elapsed: 0.324 s
% 14.80/2.58 % (3675327)Peak memory usage: 70 MB
% 14.80/2.58 % (3675327)Instructions burned: 890 (million)
% 14.80/2.58 % (3675333)fmb+10_1_sil=64000:random_seed=2521530607:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 14.80/2.58 % TRYING [1]
% 14.80/2.58 % TRYING [2]
% 14.80/2.58 % (3675329)Instruction limit reached!
% 14.80/2.58 % (3675329)------------------------------
% 14.80/2.58 % (3675329)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675329)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675329)Termination reason: Instruction limit
% 14.80/2.58 % (3675329)Termination phase: Saturation
% 14.80/2.58 % (3675329)Time elapsed: 0.349 s
% 14.80/2.58 % (3675329)Peak memory usage: 23 MB
% 14.80/2.58 % (3675329)Instructions burned: 694 (million)
% 14.80/2.58 % TRYING [3]
% 14.80/2.58 % (3675335)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=442606260:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 14.80/2.58 % TRYING [20]
% 14.80/2.58 % TRYING [4]
% 14.80/2.58 % TRYING [8]
% 14.80/2.58 % (3675325)Instruction limit reached!
% 14.80/2.58 % (3675325)------------------------------
% 14.80/2.58 % (3675325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675325)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675325)Termination reason: Instruction limit
% 14.80/2.58 % (3675325)Termination phase: Saturation
% 14.80/2.58 % (3675325)Time elapsed: 0.649 s
% 14.80/2.58 % (3675325)Peak memory usage: 30 MB
% 14.80/2.58 % (3675325)Instructions burned: 1179 (million)
% 14.80/2.58 % TRYING [5]
% 14.80/2.58 % (3675337)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2428461603:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 14.80/2.58 % (3675331)Instruction limit reached!
% 14.80/2.58 % (3675331)------------------------------
% 14.80/2.58 % (3675331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675331)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675331)Termination reason: Instruction limit
% 14.80/2.58 % (3675331)Termination phase: Saturation
% 14.80/2.58 % (3675331)Time elapsed: 0.467 s
% 14.80/2.58 % (3675331)Peak memory usage: 20 MB
% 14.80/2.58 % (3675331)Instructions burned: 879 (million)
% 14.80/2.58 % TRYING [8]
% 14.80/2.58 % (3675339)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4199482827:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 14.80/2.58 % TRYING [6]
% 14.80/2.58 % (3675337)Instruction limit reached!
% 14.80/2.58 % (3675337)------------------------------
% 14.80/2.58 % (3675337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675337)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675337)Termination reason: Instruction limit
% 14.80/2.58 % (3675337)Termination phase: Finite model building constraint generation
% 14.80/2.58 % (3675337)Time elapsed: 0.344 s
% 14.80/2.58 % (3675337)Peak memory usage: 75 MB
% 14.80/2.58 % (3675337)Instructions burned: 920 (million)
% 14.80/2.58 % (3675341)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2431565360:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 14.80/2.58 % TRYING [9]
% 14.80/2.58 % (3675339) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3675294-3675339"...
% 14.80/2.58 % (3675339)...printing done.
% 14.80/2.58 % (3675339)Refutation found. Thanks to Tanya!
% 14.80/2.58 % SZS status Theorem for theBenchmark
% 14.80/2.58 % SZS output start Proof for theBenchmark
% See solution above
% 14.80/2.58 % (3675339)------------------------------
% 14.80/2.58 % (3675339)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.80/2.58 % (3675339)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.80/2.58 % (3675339)CaDiCaL version: 2.1.3
% 14.80/2.58 % (3675339)Termination reason: Refutation
% 14.80/2.58 % (3675339)Time elapsed: 1.010 s
% 14.80/2.58 % (3675339)Peak memory usage: 26 MB
% 14.80/2.58 % (3675339)Instructions burned: 1872 (million)
% 14.80/2.58 % (3675294)Success in time 2.171 s
% 14.80/2.58 % Vampire exiting
%------------------------------------------------------------------------------