%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC079+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 : n020.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:34 PM UTC 2026
% Result : Theorem 6.82s 1.54s
% Output : Refutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 23
% Syntax : Number of formulae : 163 ( 23 unt; 8 def)
% Number of atoms : 561 ( 95 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 690 ( 292 ~; 305 |; 44 &)
% ( 16 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn 117 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(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(f44,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( X0 = X1
& frontsegP(X2,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax45) ).
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(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)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ? [X5] :
( ssList(X5)
& X2 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& 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)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ? [X5] :
( ssList(X5)
& X2 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& neq(nil,X3) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
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(f125,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(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(f156,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( X0 = X1
& frontsegP(X2,X3) ) )
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f157,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
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(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) )
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ 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)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ neq(nil,X3) ) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f235,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f236,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
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(f313,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
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(f344,plain,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| X0 != X1
| frontsegP(cons(X0,X2),cons(X1,X3)) ),
inference(cnf_transformation,[],[f156]) ).
fof(f345,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f389,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f412,plain,
! [X6,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| hd(sK50) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| sK49 = X5
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
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(f428,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f413,f418,f419]) ).
fof(f435,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(f444,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f446,plain,
! [X2,X3,X1] :
( ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(equality_resolution,[],[f344]) ).
fof(f455,plain,
! [X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X5
| ~ ssItem(hd(sK50))
| sK49 = X5
| ~ ssList(X5) ),
inference(equality_resolution,[],[f412]) ).
fof(f456,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| sK49 = cons(hd(sK50),nil)
| ~ ssList(cons(hd(sK50),nil)) ),
inference(equality_resolution,[],[f455]) ).
fof(f461,plain,
! [X2,X3,X1] :
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f446]) ).
fof(f463,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f444]) ).
fof(f466,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ ssList(X4) ),
inference(forward_subsumption_resolution,[],[f428,f426]) ).
fof(f478,plain,
( ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| sK49 = cons(hd(sK50),nil)
| ~ ssList(cons(hd(sK50),nil)) ),
inference(forward_subsumption_resolution,[],[f456,f426]) ).
fof(f480,definition,
( spl51_3
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f482,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_3 ),
inference(avatar_component_clause,[],[f480]) ).
fof(f484,definition,
( spl51_4
<=> sK49 = cons(hd(sK50),nil) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f486,plain,
( sK49 = cons(hd(sK50),nil)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f484]) ).
fof(f488,definition,
( spl51_5
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f489,plain,
( ssItem(hd(sK50))
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f490,plain,
( ~ ssItem(hd(sK50))
| spl51_5 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f492,definition,
( spl51_6
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f494,plain,
( ~ neq(nil,sK50)
| spl51_6 ),
inference(avatar_component_clause,[],[f492]) ).
fof(f495,plain,
( ~ spl51_3
| spl51_4
| ~ spl51_5
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f478,f492,f488,f484,f480]) ).
fof(f517,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f540,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f397,f420]) ).
fof(f542,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f305,f482]) ).
fof(f545,plain,
( ~ ssItem(hd(sK50))
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f542,f306]) ).
fof(f546,plain,
( ~ spl51_5
| spl51_3 ),
inference(avatar_split_clause,[],[f545,f480,f488]) ).
fof(f549,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_5 ),
inference(resolution,[],[f314,f490]) ).
fof(f550,plain,
( nil = sK50
| spl51_5 ),
inference(forward_subsumption_resolution,[],[f549,f417]) ).
fof(f552,plain,
( neq(nil,nil)
| spl51_5 ),
inference(superposition,[],[f426,f550]) ).
fof(f562,plain,
( ~ ssList(nil)
| spl51_5 ),
inference(resolution,[],[f552,f463]) ).
fof(f563,plain,
( $false
| spl51_5 ),
inference(forward_subsumption_resolution,[],[f562,f306]) ).
fof(f564,plain,
spl51_5,
inference(avatar_contradiction_clause,[],[f563]) ).
fof(f680,definition,
( spl51_8
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).
fof(f681,plain,
( nil != sK50
| spl51_8 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f682,plain,
( nil = sK50
| ~ spl51_8 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f688,plain,
! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sK50,X0)
| ~ segmentP(sK49,X0)
| ~ ssList(X0) ),
inference(resolution,[],[f303,f466]) ).
fof(f691,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f303,f494]) ).
fof(f694,plain,
! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sK50,X0)
| ~ segmentP(sK49,X0) ),
inference(duplicate_literal_removal,[],[f688]) ).
fof(f695,plain,
( nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f691,f417]) ).
fof(f696,plain,
! [X0] :
( ~ segmentP(sK49,X0)
| ~ ssList(X0)
| ~ segmentP(sK50,X0)
| nil = X0 ),
inference(forward_subsumption_resolution,[],[f694,f306]) ).
fof(f697,plain,
( nil = sK50
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f695,f306]) ).
fof(f745,plain,
( spl51_8
| spl51_6 ),
inference(avatar_split_clause,[],[f697,f492,f680]) ).
fof(f794,plain,
( neq(nil,nil)
| ~ spl51_8 ),
inference(superposition,[],[f426,f682]) ).
fof(f808,plain,
( ~ ssList(nil)
| ~ spl51_8 ),
inference(resolution,[],[f794,f463]) ).
fof(f809,plain,
( $false
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f808,f306]) ).
fof(f810,plain,
~ spl51_8,
inference(avatar_contradiction_clause,[],[f809]) ).
fof(f825,plain,
( nil != sK49
| ~ ssItem(hd(sK50))
| ~ ssList(nil)
| ~ spl51_4 ),
inference(superposition,[],[f313,f486]) ).
fof(f827,plain,
( nil != sK49
| ~ ssList(nil)
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f825,f489]) ).
fof(f836,plain,
( nil != sK49
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f827,f306]) ).
fof(f1066,plain,
( nil = sK50
| sK50 = cons(hd(sK50),tl(sK50)) ),
inference(resolution,[],[f389,f417]) ).
fof(f1067,plain,
( sK50 = cons(hd(sK50),tl(sK50))
| spl51_8 ),
inference(forward_subsumption_resolution,[],[f1066,f681]) ).
fof(f1111,definition,
( spl51_10
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f1112,plain,
( ssList(tl(sK50))
| ~ spl51_10 ),
inference(avatar_component_clause,[],[f1111]) ).
fof(f1113,plain,
( ~ ssList(tl(sK50))
| spl51_10 ),
inference(avatar_component_clause,[],[f1111]) ).
fof(f1125,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_10 ),
inference(resolution,[],[f1113,f316]) ).
fof(f1126,plain,
( ~ ssList(sK50)
| spl51_8
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f1125,f681]) ).
fof(f1127,plain,
( $false
| spl51_8
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f1126,f417]) ).
fof(f1128,plain,
( spl51_8
| spl51_10 ),
inference(avatar_contradiction_clause,[],[f1127]) ).
fof(f1942,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ frontsegP(X0,nil)
| ~ ssItem(hd(sK50)) )
| ~ spl51_4 ),
inference(superposition,[],[f461,f486]) ).
fof(f1953,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssItem(hd(sK50)) )
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f1942,f345]) ).
fof(f1966,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssItem(hd(sK50)) )
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f1953,f306]) ).
fof(f1976,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0) )
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f1966,f489]) ).
fof(f2144,plain,
( frontsegP(sK50,sK49)
| ~ ssList(tl(sK50))
| ~ spl51_4
| ~ spl51_5
| spl51_8 ),
inference(superposition,[],[f1976,f1067]) ).
fof(f2145,plain,
( frontsegP(sK50,sK49)
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2144,f1112]) ).
fof(f2160,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(resolution,[],[f2145,f235]) ).
fof(f2161,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2160,f420]) ).
fof(f2162,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f2161,f417]) ).
fof(f2639,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(app(sK49,X0)) ),
inference(superposition,[],[f435,f517]) ).
fof(f2655,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2639,f318]) ).
fof(f2662,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2655,f420]) ).
fof(f2666,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2662,f306]) ).
fof(f2691,plain,
( segmentP(sK49,sK49)
| ~ ssList(nil) ),
inference(superposition,[],[f2666,f540]) ).
fof(f2692,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(superposition,[],[f2666,f2162]) ).
fof(f2694,plain,
segmentP(sK49,sK49),
inference(forward_subsumption_resolution,[],[f2691,f306]) ).
fof(f2714,definition,
( spl51_16
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_16])],[avatar_definition]) ).
fof(f2716,plain,
( ~ ssList(sK5(sK50,sK49))
| spl51_16 ),
inference(avatar_component_clause,[],[f2714]) ).
fof(f2718,definition,
( spl51_17
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_17])],[avatar_definition]) ).
fof(f2720,plain,
( segmentP(sK50,sK49)
| ~ spl51_17 ),
inference(avatar_component_clause,[],[f2718]) ).
fof(f2721,plain,
( ~ spl51_16
| spl51_17
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10 ),
inference(avatar_split_clause,[],[f2692,f1111,f680,f488,f484,f2718,f2714]) ).
fof(f2734,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_16 ),
inference(resolution,[],[f2716,f236]) ).
fof(f2735,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_16 ),
inference(forward_subsumption_resolution,[],[f2734,f420]) ).
fof(f2736,plain,
( ~ frontsegP(sK50,sK49)
| spl51_16 ),
inference(forward_subsumption_resolution,[],[f2735,f417]) ).
fof(f2737,plain,
( $false
| ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10
| spl51_16 ),
inference(forward_subsumption_resolution,[],[f2736,f2145]) ).
fof(f2738,plain,
( ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10
| spl51_16 ),
inference(avatar_contradiction_clause,[],[f2737]) ).
fof(f3328,plain,
( ~ ssList(sK49)
| ~ segmentP(sK50,sK49)
| nil = sK49 ),
inference(resolution,[],[f696,f2694]) ).
fof(f3336,plain,
( ~ segmentP(sK50,sK49)
| nil = sK49 ),
inference(forward_subsumption_resolution,[],[f3328,f420]) ).
fof(f3338,plain,
( nil = sK49
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f3336,f2720]) ).
fof(f3341,plain,
( $false
| ~ spl51_4
| ~ spl51_5
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f3338,f836]) ).
fof(f3342,plain,
( ~ spl51_4
| ~ spl51_5
| ~ spl51_17 ),
inference(avatar_contradiction_clause,[],[f3341]) ).
cnf(s2,plain,
( ~ spl51_3
| spl51_4
| ~ spl51_5
| ~ spl51_6 ),
inference(sat_conversion,[],[f495]) ).
cnf(s3,plain,
( spl51_3
| ~ spl51_5 ),
inference(sat_conversion,[],[f546]) ).
cnf(s4,plain,
spl51_5,
inference(sat_conversion,[],[f564]) ).
cnf(s6,plain,
( spl51_6
| spl51_8 ),
inference(sat_conversion,[],[f745]) ).
cnf(s7,plain,
~ spl51_8,
inference(sat_conversion,[],[f810]) ).
cnf(s9,plain,
( spl51_8
| spl51_10 ),
inference(sat_conversion,[],[f1128]) ).
cnf(s15,plain,
( ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10
| ~ spl51_16
| spl51_17 ),
inference(sat_conversion,[],[f2721]) ).
cnf(s16,plain,
( ~ spl51_4
| ~ spl51_5
| spl51_8
| ~ spl51_10
| spl51_16 ),
inference(sat_conversion,[],[f2738]) ).
cnf(s18,plain,
( ~ spl51_4
| ~ spl51_5
| ~ spl51_17 ),
inference(sat_conversion,[],[f3342]) ).
cnf(s19,plain,
spl51_10,
inference(rat,[],[s9,s7]) ).
cnf(s20,plain,
spl51_6,
inference(rat,[],[s6,s7]) ).
cnf(s22,plain,
spl51_3,
inference(rat,[],[s3,s4]) ).
cnf(s23,plain,
spl51_4,
inference(rat,[],[s2,s20,s4,s22]) ).
cnf(s24,plain,
~ spl51_17,
inference(rat,[],[s18,s4,s23]) ).
cnf(s25,plain,
spl51_16,
inference(rat,[],[s16,s4,s19,s7,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s15,s24,s4,s19,s7,s25,s23]) ).
fof(f3343,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC079+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.36 % Computer : n020.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:46:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 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
% 6.82/1.54 % (21560)Will run a generic schedule for satisfiability detection.
% 6.82/1.54 % (21569)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3537445167:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.82/1.54 % (21566)% WARNING: option uhcvi not known.
% 6.82/1.54 % (21565)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3421869999_2999 on theBenchmark for (2999ds/0Mi)
% 6.82/1.54 % (21567)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3226622106:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.82/1.54 % (21568)dis+10_1_sil=32000:sp=arity:random_seed=2036749360:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.82/1.54 % (21570)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=902590008:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.82/1.54 % (21571)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1495708211:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.82/1.54 % (21566)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1236584100:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.82/1.54 % TRYING [1]
% 6.82/1.54 % TRYING [2]
% 6.82/1.54 % TRYING [3]
% 6.82/1.54 % (21569)Instruction limit reached!
% 6.82/1.54 % (21569)------------------------------
% 6.82/1.54 % (21569)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21569)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21569)Termination reason: Instruction limit
% 6.82/1.54 % (21569)Termination phase: Saturation
% 6.82/1.54 % (21569)Time elapsed: 0.038 s
% 6.82/1.54 % (21569)Peak memory usage: 13 MB
% 6.82/1.54 % (21569)Instructions burned: 116 (million)
% 6.82/1.54 % TRYING [4]
% 6.82/1.54 % (21579)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3278173054:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.82/1.54 % TRYING [1]
% 6.82/1.54 % TRYING [2]
% 6.82/1.54 % TRYING [3]
% 6.82/1.54 % (21568)Instruction limit reached!
% 6.82/1.54 % (21568)------------------------------
% 6.82/1.54 % (21568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21568)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21568)Termination reason: Instruction limit
% 6.82/1.54 % (21568)Termination phase: Saturation
% 6.82/1.54 % (21568)Time elapsed: 0.061 s
% 6.82/1.54 % (21568)Peak memory usage: 13 MB
% 6.82/1.54 % (21568)Instructions burned: 103 (million)
% 6.82/1.54 % TRYING [4]
% 6.82/1.54 % (21570)Instruction limit reached!
% 6.82/1.54 % (21570)------------------------------
% 6.82/1.54 % (21570)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21570)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21570)Termination reason: Instruction limit
% 6.82/1.54 % (21570)Termination phase: Saturation
% 6.82/1.54 % (21570)Time elapsed: 0.079 s
% 6.82/1.54 % (21570)Peak memory usage: 14 MB
% 6.82/1.54 % (21570)Instructions burned: 132 (million)
% 6.82/1.54 % (21581)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=68556155:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.82/1.54 % TRYING [5]
% 6.82/1.54 % TRYING [5]
% 6.82/1.54 % (21582)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=4088222607:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.82/1.54 % (21571)Instruction limit reached!
% 6.82/1.54 % (21571)------------------------------
% 6.82/1.54 % (21571)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21571)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21571)Termination reason: Instruction limit
% 6.82/1.54 % (21571)Termination phase: Saturation
% 6.82/1.54 % (21571)Time elapsed: 0.103 s
% 6.82/1.54 % (21571)Peak memory usage: 15 MB
% 6.82/1.54 % (21571)Instructions burned: 160 (million)
% 6.82/1.54 % (21585)ott-21_1_sil=16000:fs=off:random_seed=2979531568:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.82/1.54 % (21581)Instruction limit reached!
% 6.82/1.54 % (21581)------------------------------
% 6.82/1.54 % (21581)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21581)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21581)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21581)Termination reason: Instruction limit
% 6.82/1.54 % (21581)Termination phase: Saturation
% 6.82/1.54 % (21581)Time elapsed: 0.072 s
% 6.82/1.54 % (21581)Peak memory usage: 13 MB
% 6.82/1.54 % (21581)Instructions burned: 133 (million)
% 6.82/1.54 % (21587)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1681168645:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.82/1.54 % TRYING [6]
% 6.82/1.54 % TRYING [6]
% 6.82/1.54 % (21579)Instruction limit reached!
% 6.82/1.54 % (21579)------------------------------
% 6.82/1.54 % (21579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21579)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21579)Termination reason: Instruction limit
% 6.82/1.54 % (21579)Termination phase: Finite model building constraint generation
% 6.82/1.54 % (21579)Time elapsed: 0.165 s
% 6.82/1.54 % (21579)Peak memory usage: 28 MB
% 6.82/1.54 % (21579)Instructions burned: 719 (million)
% 6.82/1.54 % (21585)Instruction limit reached!
% 6.82/1.54 % (21585)------------------------------
% 6.82/1.54 % (21585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21585)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21585)Termination reason: Instruction limit
% 6.82/1.54 % (21585)Termination phase: Saturation
% 6.82/1.54 % (21585)Time elapsed: 0.092 s
% 6.82/1.54 % (21585)Peak memory usage: 14 MB
% 6.82/1.54 % (21585)Instructions burned: 181 (million)
% 6.82/1.54 % (21589)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2231015277:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.82/1.54 % TRYING [1]
% 6.82/1.54 % TRYING [2]
% 6.82/1.54 % TRYING [3]
% 6.82/1.54 % (21590)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4189398209:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 6.82/1.54 % TRYING [4]
% 6.82/1.54 % TRYING [5]
% 6.82/1.54 % (21589)Instruction limit reached!
% 6.82/1.54 % (21589)------------------------------
% 6.82/1.54 % (21589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21589)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21589)Termination reason: Instruction limit
% 6.82/1.54 % (21589)Termination phase: Finite model building SAT solving
% 6.82/1.54 % (21589)Time elapsed: 0.181 s
% 6.82/1.54 % (21589)Peak memory usage: 23 MB
% 6.82/1.54 % (21589)Instructions burned: 866 (million)
% 6.82/1.54 % (21593)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3418132706:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 6.82/1.54 % TRYING [14]
% 6.82/1.54 % (21582)Instruction limit reached!
% 6.82/1.54 % (21582)------------------------------
% 6.82/1.54 % (21582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21582)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21582)Termination reason: Instruction limit
% 6.82/1.54 % (21582)Termination phase: Saturation
% 6.82/1.54 % (21582)Time elapsed: 0.378 s
% 6.82/1.54 % (21582)Peak memory usage: 23 MB
% 6.82/1.54 % (21582)Instructions burned: 684 (million)
% 6.82/1.54 % TRYING [7]
% 6.82/1.54 % (21595)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=272469207: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)
% 6.82/1.54 % (21587)Instruction limit reached!
% 6.82/1.54 % (21587)------------------------------
% 6.82/1.54 % (21587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21587)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21587)Termination reason: Instruction limit
% 6.82/1.54 % (21587)Termination phase: Saturation
% 6.82/1.54 % (21587)Time elapsed: 0.330 s
% 6.82/1.54 % (21587)Peak memory usage: 14 MB
% 6.82/1.54 % (21587)Instructions burned: 478 (million)
% 6.82/1.54 % (21597)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1449868794:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 6.82/1.54 % (21593)Instruction limit reached!
% 6.82/1.54 % (21593)------------------------------
% 6.82/1.54 % (21593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21593)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21593)Termination reason: Instruction limit
% 6.82/1.54 % (21593)Termination phase: Finite model building constraint generation
% 6.82/1.54 % (21593)Time elapsed: 0.177 s
% 6.82/1.54 % (21593)Peak memory usage: 70 MB
% 6.82/1.54 % (21593)Instructions burned: 895 (million)
% 6.82/1.54 % (21599)fmb+10_1_sil=64000:random_seed=251846193:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 6.82/1.54 % TRYING [1]
% 6.82/1.54 % TRYING [2]
% 6.82/1.54 % TRYING [3]
% 6.82/1.54 % TRYING [4]
% 6.82/1.54 % TRYING [5]
% 6.82/1.54 % (21595)Instruction limit reached!
% 6.82/1.54 % (21595)------------------------------
% 6.82/1.54 % (21595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21595)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21595)Termination reason: Instruction limit
% 6.82/1.54 % (21595)Termination phase: Saturation
% 6.82/1.54 % (21595)Time elapsed: 0.357 s
% 6.82/1.54 % (21595)Peak memory usage: 21 MB
% 6.82/1.54 % (21595)Instructions burned: 694 (million)
% 6.82/1.54 % (21590)Instruction limit reached!
% 6.82/1.54 % (21590)------------------------------
% 6.82/1.54 % (21590)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21590)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21590)Termination reason: Instruction limit
% 6.82/1.54 % (21590)Termination phase: Saturation
% 6.82/1.54 % (21590)Time elapsed: 0.638 s
% 6.82/1.54 % (21590)Peak memory usage: 28 MB
% 6.82/1.54 % (21590)Instructions burned: 1179 (million)
% 6.82/1.54 % TRYING [6]
% 6.82/1.54 % (21601)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3602560566:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 6.82/1.54 % TRYING [20]
% 6.82/1.54 % (21602)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2340276337:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 6.82/1.54 % TRYING [8]
% 6.82/1.54 % TRYING [8]
% 6.82/1.54 % (21597)Instruction limit reached!
% 6.82/1.54 % (21597)------------------------------
% 6.82/1.54 % (21597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21597)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21597)Termination reason: Instruction limit
% 6.82/1.54 % (21597)Termination phase: Saturation
% 6.82/1.54 % (21597)Time elapsed: 0.457 s
% 6.82/1.54 % (21597)Peak memory usage: 21 MB
% 6.82/1.54 % (21597)Instructions burned: 880 (million)
% 6.82/1.54 % (21605)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4123603540:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 6.82/1.54 % (21605) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-21560-21605"...
% 6.82/1.54 % (21605)...printing done.
% 6.82/1.54 % (21605)Refutation found. Thanks to Tanya!
% 6.82/1.54 % SZS status Theorem for theBenchmark
% 6.82/1.54 % SZS output start Proof for theBenchmark
% See solution above
% 6.82/1.54 % (21605)------------------------------
% 6.82/1.54 % (21605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.54 % (21605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.54 % (21605)CaDiCaL version: 2.1.3
% 6.82/1.54 % (21605)Termination reason: Refutation
% 6.82/1.54 % (21605)Time elapsed: 0.073 s
% 6.82/1.54 % (21605)Peak memory usage: 14 MB
% 6.82/1.54 % (21605)Instructions burned: 132 (million)
% 6.82/1.54 % (21560)Success in time 1.132 s
% 6.82/1.54 % Vampire exiting
%------------------------------------------------------------------------------