%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC089+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 : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:04:37 PM UTC 2026
% Result : Theorem 21.89s 3.60s
% Output : Refutation 22.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 20
% Syntax : Number of formulae : 146 ( 18 unt; 7 def)
% Number of atoms : 556 ( 115 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 720 ( 310 ~; 317 |; 54 &)
% ( 11 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 102 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/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)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) ) ) ) ) ) ) ) ),
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] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
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)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| X3 = X5
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| tl(X2) != X6
| app(X6,X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(X2) != X8
| ~ neq(nil,X2) )
| ~ neq(nil,X2) ) ) ) ) )
& 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)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| X3 = X5
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| tl(X2) != X6
| app(X6,X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(X2) != X8
| ~ neq(nil,X2) )
| ~ neq(nil,X2) ) ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
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,
! [X8,X6,X7,X5] :
( ~ neq(nil,sK49)
| hd(sK49) != X8
| cons(X8,nil) != X7
| ~ ssItem(X8)
| app(X6,X7) != X5
| tl(sK49) != X6
| ~ ssList(X7)
| ~ ssList(X6)
| sK50 = X5
| ~ ssList(X5)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK49,nil)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f416,f418]) ).
fof(f425,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f412,f417,f418]) ).
fof(f431,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f241]) ).
fof(f440,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f451,plain,
! [X6,X7,X5] :
( ~ neq(nil,sK49)
| cons(hd(sK49),nil) != X7
| ~ ssItem(hd(sK49))
| app(X6,X7) != X5
| tl(sK49) != X6
| ~ ssList(X7)
| ~ ssList(X6)
| sK50 = X5
| ~ ssList(X5)
| ~ neq(sK50,nil) ),
inference(equality_resolution,[],[f411]) ).
fof(f452,plain,
! [X6,X5] :
( ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| app(X6,cons(hd(sK49),nil)) != X5
| tl(sK49) != X6
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X6)
| sK50 = X5
| ~ ssList(X5)
| ~ neq(sK50,nil) ),
inference(equality_resolution,[],[f451]) ).
fof(f453,plain,
! [X6] :
( ~ neq(nil,sK49)
| ~ ssItem(hd(sK49))
| tl(sK49) != X6
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X6)
| sK50 = app(X6,cons(hd(sK49),nil))
| ~ ssList(app(X6,cons(hd(sK49),nil)))
| ~ neq(sK50,nil) ),
inference(equality_resolution,[],[f452]) ).
fof(f454,plain,
( ~ 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)))
| ~ neq(sK50,nil) ),
inference(equality_resolution,[],[f453]) ).
fof(f459,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f440]) ).
fof(f462,plain,
neq(sK49,nil),
inference(forward_subsumption_resolution,[],[f413,f424]) ).
fof(f464,definition,
( spl51_1
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f465,plain,
( nil != sK49
| spl51_1 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f466,plain,
( nil = sK49
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f494,plain,
( ~ 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,[],[f454,f424]) ).
fof(f496,definition,
( spl51_7
<=> ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f497,plain,
( ssList(app(tl(sK49),cons(hd(sK49),nil)))
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f498,plain,
( ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
| spl51_7 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f500,definition,
( spl51_8
<=> sK50 = app(tl(sK49),cons(hd(sK49),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).
fof(f502,plain,
( sK50 = app(tl(sK49),cons(hd(sK49),nil))
| ~ spl51_8 ),
inference(avatar_component_clause,[],[f500]) ).
fof(f504,definition,
( spl51_9
<=> ssList(tl(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f505,plain,
( ssList(tl(sK49))
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f504]) ).
fof(f506,plain,
( ~ ssList(tl(sK49))
| spl51_9 ),
inference(avatar_component_clause,[],[f504]) ).
fof(f508,definition,
( spl51_10
<=> ssList(cons(hd(sK49),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f509,plain,
( ssList(cons(hd(sK49),nil))
| ~ spl51_10 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f510,plain,
( ~ ssList(cons(hd(sK49),nil))
| spl51_10 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f512,definition,
( spl51_11
<=> ssItem(hd(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_11])],[avatar_definition]) ).
fof(f513,plain,
( ssItem(hd(sK49))
| ~ spl51_11 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f514,plain,
( ~ ssItem(hd(sK49))
| spl51_11 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f516,definition,
( spl51_12
<=> neq(nil,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_12])],[avatar_definition]) ).
fof(f518,plain,
( ~ neq(nil,sK49)
| spl51_12 ),
inference(avatar_component_clause,[],[f516]) ).
fof(f519,plain,
( ~ spl51_7
| spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11
| ~ spl51_12 ),
inference(avatar_split_clause,[],[f494,f516,f512,f508,f504,f500,f496]) ).
fof(f575,plain,
( ~ ssList(cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| spl51_7 ),
inference(resolution,[],[f318,f498]) ).
fof(f584,plain,
( ~ spl51_9
| ~ spl51_10
| spl51_7 ),
inference(avatar_split_clause,[],[f575,f496,f508,f504]) ).
fof(f585,plain,
( nil = sK49
| ~ ssList(sK49)
| spl51_9 ),
inference(resolution,[],[f506,f316]) ).
fof(f586,plain,
( nil = sK49
| spl51_9 ),
inference(forward_subsumption_resolution,[],[f585,f419]) ).
fof(f587,plain,
( spl51_1
| spl51_9 ),
inference(avatar_split_clause,[],[f586,f504,f464]) ).
fof(f590,plain,
( ~ ssItem(hd(sK49))
| ~ ssList(nil)
| spl51_10 ),
inference(resolution,[],[f510,f305]) ).
fof(f591,plain,
( ~ ssItem(hd(sK49))
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f590,f306]) ).
fof(f596,plain,
( ~ spl51_11
| spl51_10 ),
inference(avatar_split_clause,[],[f591,f508,f512]) ).
fof(f597,plain,
( nil = sK49
| ~ ssList(sK49)
| spl51_11 ),
inference(resolution,[],[f514,f314]) ).
fof(f598,plain,
( nil = sK49
| spl51_11 ),
inference(forward_subsumption_resolution,[],[f597,f419]) ).
fof(f599,plain,
( spl51_1
| spl51_11 ),
inference(avatar_split_clause,[],[f598,f512,f464]) ).
fof(f601,plain,
( neq(nil,nil)
| ~ spl51_1 ),
inference(superposition,[],[f462,f466]) ).
fof(f613,plain,
( ~ ssList(nil)
| ~ spl51_1 ),
inference(resolution,[],[f601,f459]) ).
fof(f614,plain,
( $false
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f613,f306]) ).
fof(f615,plain,
~ spl51_1,
inference(avatar_contradiction_clause,[],[f614]) ).
fof(f619,plain,
( cons(hd(sK49),nil) = app(nil,cons(hd(sK49),nil))
| ~ spl51_10 ),
inference(resolution,[],[f509,f320]) ).
fof(f620,plain,
( app(tl(sK49),cons(hd(sK49),nil)) = app(app(tl(sK49),cons(hd(sK49),nil)),nil)
| ~ spl51_7 ),
inference(resolution,[],[f497,f397]) ).
fof(f667,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK49),X0) != X0 )
| ~ spl51_11 ),
inference(resolution,[],[f307,f513]) ).
fof(f691,plain,
( nil != cons(hd(sK49),nil)
| ~ spl51_11 ),
inference(resolution,[],[f667,f306]) ).
fof(f734,plain,
! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sK50,X0)
| ~ segmentP(sK49,X0)
| ~ ssList(X0) ),
inference(resolution,[],[f303,f425]) ).
fof(f737,plain,
( ~ ssList(sK49)
| nil = sK49
| ~ ssList(nil)
| spl51_12 ),
inference(resolution,[],[f303,f518]) ).
fof(f740,plain,
! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sK50,X0)
| ~ segmentP(sK49,X0) ),
inference(duplicate_literal_removal,[],[f734]) ).
fof(f741,plain,
( nil = sK49
| ~ ssList(nil)
| spl51_12 ),
inference(forward_subsumption_resolution,[],[f737,f419]) ).
fof(f742,plain,
! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| nil = X0
| ~ segmentP(sK49,X0) ),
inference(forward_subsumption_resolution,[],[f740,f306]) ).
fof(f743,plain,
( ~ ssList(nil)
| spl51_1
| spl51_12 ),
inference(forward_subsumption_resolution,[],[f741,f465]) ).
fof(f744,plain,
( $false
| spl51_1
| spl51_12 ),
inference(forward_subsumption_resolution,[],[f743,f306]) ).
fof(f745,plain,
( spl51_1
| spl51_12 ),
inference(avatar_contradiction_clause,[],[f744]) ).
fof(f1143,plain,
( nil = sK49
| sK49 = cons(hd(sK49),tl(sK49)) ),
inference(resolution,[],[f389,f419]) ).
fof(f1146,plain,
( sK49 = cons(hd(sK49),tl(sK49))
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f1143,f465]) ).
fof(f1229,plain,
( ! [X0] :
( ~ ssItem(X0)
| cons(X0,tl(sK49)) = app(cons(X0,nil),tl(sK49)) )
| ~ spl51_9 ),
inference(resolution,[],[f392,f505]) ).
fof(f2708,plain,
( ! [X0] :
( segmentP(app(cons(hd(sK49),nil),X0),cons(hd(sK49),nil))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(app(cons(hd(sK49),nil),X0)) )
| ~ spl51_10 ),
inference(superposition,[],[f431,f619]) ).
fof(f2720,plain,
( segmentP(app(tl(sK49),cons(hd(sK49),nil)),cons(hd(sK49),nil))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(nil)
| ~ ssList(tl(sK49))
| ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
| ~ spl51_7 ),
inference(superposition,[],[f431,f620]) ).
fof(f2729,plain,
( segmentP(app(tl(sK49),cons(hd(sK49),nil)),cons(hd(sK49),nil))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(nil)
| ~ ssList(tl(sK49))
| ~ spl51_7 ),
inference(forward_subsumption_resolution,[],[f2720,f318]) ).
fof(f2737,plain,
( ! [X0] :
( segmentP(app(cons(hd(sK49),nil),X0),cons(hd(sK49),nil))
| ~ ssList(cons(hd(sK49),nil))
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2708,f318]) ).
fof(f2742,plain,
( segmentP(app(tl(sK49),cons(hd(sK49),nil)),cons(hd(sK49),nil))
| ~ ssList(nil)
| ~ ssList(tl(sK49))
| ~ spl51_7
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2729,f509]) ).
fof(f2749,plain,
( ! [X0] :
( segmentP(app(cons(hd(sK49),nil),X0),cons(hd(sK49),nil))
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2737,f509]) ).
fof(f2750,plain,
( segmentP(app(tl(sK49),cons(hd(sK49),nil)),cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| ~ spl51_7
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2742,f306]) ).
fof(f2755,plain,
( ! [X0] :
( segmentP(app(cons(hd(sK49),nil),X0),cons(hd(sK49),nil))
| ~ ssList(X0) )
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2749,f306]) ).
fof(f2756,plain,
( segmentP(app(tl(sK49),cons(hd(sK49),nil)),cons(hd(sK49),nil))
| ~ spl51_7
| ~ spl51_9
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2750,f505]) ).
fof(f2758,plain,
( segmentP(sK50,cons(hd(sK49),nil))
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10 ),
inference(forward_demodulation,[],[f2756,f502]) ).
fof(f3088,plain,
( ~ ssList(cons(hd(sK49),nil))
| nil = cons(hd(sK49),nil)
| ~ segmentP(sK49,cons(hd(sK49),nil))
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10 ),
inference(resolution,[],[f742,f2758]) ).
fof(f3098,plain,
( nil = cons(hd(sK49),nil)
| ~ segmentP(sK49,cons(hd(sK49),nil))
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f3088,f509]) ).
fof(f3099,plain,
( ~ segmentP(sK49,cons(hd(sK49),nil))
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f3098,f691]) ).
fof(f3633,plain,
( cons(hd(sK49),tl(sK49)) = app(cons(hd(sK49),nil),tl(sK49))
| ~ spl51_9
| ~ spl51_11 ),
inference(resolution,[],[f1229,f513]) ).
fof(f3653,plain,
( sK49 = app(cons(hd(sK49),nil),tl(sK49))
| spl51_1
| ~ spl51_9
| ~ spl51_11 ),
inference(forward_demodulation,[],[f3633,f1146]) ).
fof(f67309,plain,
( segmentP(sK49,cons(hd(sK49),nil))
| ~ ssList(tl(sK49))
| spl51_1
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(superposition,[],[f2755,f3653]) ).
fof(f67314,plain,
( ~ ssList(tl(sK49))
| spl51_1
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f67309,f3099]) ).
fof(f67362,plain,
( $false
| spl51_1
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f67314,f505]) ).
fof(f67363,plain,
( spl51_1
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(avatar_contradiction_clause,[],[f67362]) ).
cnf(s4,plain,
( ~ spl51_7
| spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11
| ~ spl51_12 ),
inference(sat_conversion,[],[f519]) ).
cnf(s6,plain,
( spl51_7
| ~ spl51_9
| ~ spl51_10 ),
inference(sat_conversion,[],[f584]) ).
cnf(s7,plain,
( spl51_1
| spl51_9 ),
inference(sat_conversion,[],[f587]) ).
cnf(s8,plain,
( spl51_10
| ~ spl51_11 ),
inference(sat_conversion,[],[f596]) ).
cnf(s9,plain,
( spl51_1
| spl51_11 ),
inference(sat_conversion,[],[f599]) ).
cnf(s10,plain,
~ spl51_1,
inference(sat_conversion,[],[f615]) ).
cnf(s12,plain,
( spl51_1
| spl51_12 ),
inference(sat_conversion,[],[f745]) ).
cnf(s76,plain,
( spl51_1
| ~ spl51_7
| ~ spl51_8
| ~ spl51_9
| ~ spl51_10
| ~ spl51_11 ),
inference(sat_conversion,[],[f67363]) ).
cnf(s91,plain,
spl51_12,
inference(rat,[],[s12,s10]) ).
cnf(s93,plain,
spl51_11,
inference(rat,[],[s9,s10]) ).
cnf(s95,plain,
spl51_10,
inference(rat,[],[s8,s93]) ).
cnf(s96,plain,
spl51_9,
inference(rat,[],[s7,s10]) ).
cnf(s101,plain,
spl51_7,
inference(rat,[],[s6,s95,s96]) ).
cnf(s102,plain,
~ spl51_8,
inference(rat,[],[s76,s93,s95,s96,s10,s101]) ).
cnf(s103,plain,
$false,
inference(rat,[],[s4,s91,s93,s95,s96,s102,s101]) ).
fof(f67411,plain,
$false,
inference(avatar_sat_refutation,[],[s103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC089+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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % 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:54:33 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 21.89/3.54 % (195835)Will run a generic schedule for satisfiability detection.
% 21.89/3.54 % (195843)dis+10_1_sil=32000:sp=arity:random_seed=1934926606:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 21.89/3.54 % (195841)% WARNING: option uhcvi not known.
% 21.89/3.54 % (195840)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2804229726_2999 on theBenchmark for (2999ds/0Mi)
% 21.89/3.54 % (195842)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=913565324:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 21.89/3.54 % (195844)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=113601913:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 21.89/3.54 % (195845)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1712125538:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 21.89/3.54 % (195846)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1755630725:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 21.89/3.54 % (195841)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2827475762:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 21.89/3.54 % TRYING [1]
% 21.89/3.54 % TRYING [2]
% 21.89/3.54 % TRYING [3]
% 21.89/3.54 % (195843)Instruction limit reached!
% 21.89/3.54 % (195843)------------------------------
% 21.89/3.54 % (195843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.54 % (195843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.54 % (195843)CaDiCaL version: 2.1.3
% 21.89/3.54 % (195843)Termination reason: Instruction limit
% 21.89/3.54 % (195843)Termination phase: Saturation
% 21.89/3.54 % (195843)Time elapsed: 0.035 s
% 21.89/3.54 % (195843)Peak memory usage: 13 MB
% 21.89/3.54 % (195843)Instructions burned: 103 (million)
% 21.89/3.54 % TRYING [4]
% 21.89/3.54 % (195854)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4215380694:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 21.89/3.54 % TRYING [1]
% 21.89/3.54 % TRYING [2]
% 21.89/3.54 % TRYING [3]
% 21.89/3.54 % TRYING [4]
% 21.89/3.54 % (195844)Instruction limit reached!
% 21.89/3.54 % (195844)------------------------------
% 21.89/3.54 % (195844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.54 % (195844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.54 % (195844)CaDiCaL version: 2.1.3
% 21.89/3.54 % (195844)Termination reason: Instruction limit
% 21.89/3.54 % (195844)Termination phase: Saturation
% 21.89/3.54 % (195844)Time elapsed: 0.071 s
% 21.89/3.54 % (195844)Peak memory usage: 13 MB
% 21.89/3.54 % (195844)Instructions burned: 117 (million)
% 21.89/3.54 % (195845)Instruction limit reached!
% 21.89/3.54 % (195845)------------------------------
% 21.89/3.54 % (195845)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.54 % (195845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.54 % (195845)CaDiCaL version: 2.1.3
% 21.89/3.54 % (195845)Termination reason: Instruction limit
% 21.89/3.54 % (195845)Termination phase: Saturation
% 21.89/3.54 % (195845)Time elapsed: 0.077 s
% 21.89/3.54 % (195845)Peak memory usage: 14 MB
% 21.89/3.54 % (195845)Instructions burned: 131 (million)
% 21.89/3.54 % TRYING [5]
% 21.89/3.54 % TRYING [5]
% 21.89/3.54 % (195856)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=65827449:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 21.89/3.54 % (195857)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=3454733402:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 21.89/3.54 % (195846)Instruction limit reached!
% 21.89/3.54 % (195846)------------------------------
% 21.89/3.54 % (195846)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.54 % (195846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.54 % (195846)CaDiCaL version: 2.1.3
% 21.89/3.54 % (195846)Termination reason: Instruction limit
% 21.89/3.54 % (195846)Termination phase: Saturation
% 21.89/3.54 % (195846)Time elapsed: 0.105 s
% 21.89/3.54 % (195846)Peak memory usage: 15 MB
% 21.89/3.54 % (195846)Instructions burned: 160 (million)
% 21.89/3.54 % (195860)ott-21_1_sil=16000:fs=off:random_seed=3105298601:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 21.89/3.54 % (195856)Instruction limit reached!
% 21.89/3.54 % (195856)------------------------------
% 21.89/3.54 % (195856)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.54 % (195856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195856)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195856)Termination reason: Instruction limit
% 21.89/3.60 % (195856)Termination phase: Saturation
% 21.89/3.60 % (195856)Time elapsed: 0.074 s
% 21.89/3.60 % (195856)Peak memory usage: 13 MB
% 21.89/3.60 % (195856)Instructions burned: 132 (million)
% 21.89/3.60 % TRYING [6]
% 21.89/3.60 % (195862)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3608468571:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 21.89/3.60 % (195854)Instruction limit reached!
% 21.89/3.60 % (195854)------------------------------
% 21.89/3.60 % (195854)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195854)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195854)Termination reason: Instruction limit
% 21.89/3.60 % (195854)Termination phase: Finite model building constraint generation
% 21.89/3.60 % (195854)Time elapsed: 0.155 s
% 21.89/3.60 % (195854)Peak memory usage: 28 MB
% 21.89/3.60 % (195854)Instructions burned: 720 (million)
% 21.89/3.60 % (195864)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2938788617:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 21.89/3.60 % TRYING [6]
% 21.89/3.60 % TRYING [1]
% 21.89/3.60 % TRYING [2]
% 21.89/3.60 % TRYING [3]
% 21.89/3.60 % (195860)Instruction limit reached!
% 21.89/3.60 % (195860)------------------------------
% 21.89/3.60 % (195860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195860)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195860)Termination reason: Instruction limit
% 21.89/3.60 % (195860)Termination phase: Saturation
% 21.89/3.60 % (195860)Time elapsed: 0.094 s
% 21.89/3.60 % (195860)Peak memory usage: 13 MB
% 21.89/3.60 % (195860)Instructions burned: 182 (million)
% 21.89/3.60 % TRYING [4]
% 21.89/3.60 % (195866)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1926298764:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 21.89/3.60 % TRYING [5]
% 21.89/3.60 % (195864)Instruction limit reached!
% 21.89/3.60 % (195864)------------------------------
% 21.89/3.60 % (195864)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195864)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195864)Termination reason: Instruction limit
% 21.89/3.60 % (195864)Termination phase: Finite model building SAT solving
% 21.89/3.60 % (195864)Time elapsed: 0.183 s
% 21.89/3.60 % (195864)Peak memory usage: 22 MB
% 21.89/3.60 % (195864)Instructions burned: 867 (million)
% 21.89/3.60 % (195868)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=76873560:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 21.89/3.60 % TRYING [14]
% 21.89/3.60 % TRYING [7]
% 21.89/3.60 % (195857)Instruction limit reached!
% 21.89/3.60 % (195857)------------------------------
% 21.89/3.60 % (195857)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195857)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195857)Termination reason: Instruction limit
% 21.89/3.60 % (195857)Termination phase: Saturation
% 21.89/3.60 % (195857)Time elapsed: 0.403 s
% 21.89/3.60 % (195857)Peak memory usage: 20 MB
% 21.89/3.60 % (195857)Instructions burned: 686 (million)
% 21.89/3.60 % (195862)Instruction limit reached!
% 21.89/3.60 % (195862)------------------------------
% 21.89/3.60 % (195862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195862)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195862)Termination reason: Instruction limit
% 21.89/3.60 % (195862)Termination phase: Saturation
% 21.89/3.60 % (195862)Time elapsed: 0.325 s
% 21.89/3.60 % (195862)Peak memory usage: 15 MB
% 21.89/3.60 % (195862)Instructions burned: 477 (million)
% 21.89/3.60 % (195870)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=770781371: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)
% 21.89/3.60 % (195871)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2600018591:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 21.89/3.60 % (195868)Instruction limit reached!
% 21.89/3.60 % (195868)------------------------------
% 21.89/3.60 % (195868)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195868)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195868)Termination reason: Instruction limit
% 21.89/3.60 % (195868)Termination phase: Finite model building constraint generation
% 21.89/3.60 % (195868)Time elapsed: 0.178 s
% 21.89/3.60 % (195868)Peak memory usage: 70 MB
% 21.89/3.60 % (195868)Instructions burned: 891 (million)
% 21.89/3.60 % (195874)fmb+10_1_sil=64000:random_seed=987067127:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 21.89/3.60 % TRYING [1]
% 21.89/3.60 % TRYING [2]
% 21.89/3.60 % TRYING [3]
% 21.89/3.60 % TRYING [4]
% 21.89/3.60 % TRYING [5]
% 21.89/3.60 % TRYING [6]
% 21.89/3.60 % (195866)Instruction limit reached!
% 21.89/3.60 % (195866)------------------------------
% 21.89/3.60 % (195866)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195866)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195866)Termination reason: Instruction limit
% 21.89/3.60 % (195866)Termination phase: Saturation
% 21.89/3.60 % (195866)Time elapsed: 0.648 s
% 21.89/3.60 % (195866)Peak memory usage: 31 MB
% 21.89/3.60 % (195866)Instructions burned: 1179 (million)
% 21.89/3.60 % (195870)Instruction limit reached!
% 21.89/3.60 % (195870)------------------------------
% 21.89/3.60 % (195870)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195870)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195870)Termination reason: Instruction limit
% 21.89/3.60 % (195870)Termination phase: Saturation
% 21.89/3.60 % (195870)Time elapsed: 0.372 s
% 21.89/3.60 % (195870)Peak memory usage: 28 MB
% 21.89/3.60 % (195870)Instructions burned: 692 (million)
% 21.89/3.60 % (195876)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=206491264:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 21.89/3.60 % (195877)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3553907480:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 21.89/3.60 % TRYING [20]
% 21.89/3.60 % TRYING [8]
% 21.89/3.60 % (195871)Instruction limit reached!
% 21.89/3.60 % (195871)------------------------------
% 21.89/3.60 % (195871)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195871)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195871)Termination reason: Instruction limit
% 21.89/3.60 % (195871)Termination phase: Saturation
% 21.89/3.60 % (195871)Time elapsed: 0.458 s
% 21.89/3.60 % (195871)Peak memory usage: 22 MB
% 21.89/3.60 % (195871)Instructions burned: 879 (million)
% 21.89/3.60 % (195880)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1461798981:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 21.89/3.60 % TRYING [8]
% 21.89/3.60 % TRYING [7]
% 21.89/3.60 % (195877)Instruction limit reached!
% 21.89/3.60 % (195877)------------------------------
% 21.89/3.60 % (195877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195877)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195877)Termination reason: Instruction limit
% 21.89/3.60 % (195877)Termination phase: Finite model building constraint generation
% 21.89/3.60 % (195877)Time elapsed: 0.340 s
% 21.89/3.60 % (195877)Peak memory usage: 69 MB
% 21.89/3.60 % (195877)Instructions burned: 920 (million)
% 21.89/3.60 % (195882)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3402105931:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 21.89/3.60 % (195882)Instruction limit reached!
% 21.89/3.60 % (195882)------------------------------
% 21.89/3.60 % (195882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.89/3.60 % (195882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.89/3.60 % (195882)CaDiCaL version: 2.1.3
% 21.89/3.60 % (195882)Termination reason: Instruction limit
% 21.89/3.60 % (195882)Termination phase: Saturation
% 21.89/3.60 % (195882)Time elapsed: 0.707 s
% 21.89/3.60 % (195882)Peak memory usage: 23 MB
% 21.89/3.60 % (195882)Instructions burned: 1474 (million)
% 21.89/3.60 % (195885)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=143479366:i=6324_2979 on theBenchmark for (2979ds/6324Mi)
% 21.89/3.60 % TRYING [77]
% 21.89/3.60 % TRYING [8]
% 21.89/3.60 % TRYING [9]
% 21.89/3.60 % (195880) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-195835-195880"...
% 21.89/3.60 % (195880)...printing done.
% 21.89/3.60 % (195880)Refutation found. Thanks to Tanya!
% 21.89/3.60 % SZS status Theorem for theBenchmark
% 21.89/3.60 % SZS output start Proof for theBenchmark
% See solution above
% 22.45/3.60 % (195880)------------------------------
% 22.45/3.60 % (195880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.45/3.60 % (195880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.45/3.60 % (195880)CaDiCaL version: 2.1.3
% 22.45/3.60 % (195880)Termination reason: Refutation
% 22.45/3.60 % (195880)Time elapsed: 2.073 s
% 22.45/3.60 % (195880)Peak memory usage: 40 MB
% 22.45/3.60 % (195880)Instructions burned: 3778 (million)
% 22.45/3.60 % (195835)Success in time 3.188 s
% 22.45/3.60 % Vampire exiting
%------------------------------------------------------------------------------