%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC354+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 : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:05:41 PM UTC 2026
% Result : Theorem 7.19s 1.36s
% Output : Refutation 7.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of formulae : 135 ( 20 unt; 6 def)
% Number of atoms : 467 ( 79 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 566 ( 234 ~; 250 |; 38 &)
% ( 14 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 100 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/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/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(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(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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5
& neq(nil,X3) ) )
| segmentP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5
& neq(nil,X3) ) )
| segmentP(X1,X0) )
& ( ~ 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(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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X4
| hd(X3) != X5
| ~ neq(nil,X3) ) )
& ~ segmentP(X1,X0) )
| ( 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)
| X2 = X4
| ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X4
| hd(X3) != X5
| ~ neq(nil,X3) ) )
& ~ segmentP(X1,X0) )
| ( 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(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(f412,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| hd(sK50) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK49 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| ~ segmentP(sK48,sK47) ),
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)
| ~ segmentP(sK50,sK49) ),
inference(definition_unfolding,[],[f415,f419,f418]) ).
fof(f427,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f414,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,
! [X4] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X4
| ~ ssItem(hd(sK50))
| sK49 = X4
| ~ ssList(X4) ),
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,
~ segmentP(sK50,sK49),
inference(forward_subsumption_resolution,[],[f426,f427]) ).
fof(f467,plain,
( ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| sK49 = cons(hd(sK50),nil)
| ~ ssList(cons(hd(sK50),nil)) ),
inference(forward_subsumption_resolution,[],[f456,f427]) ).
fof(f469,definition,
( spl51_1
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f471,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_1 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f473,definition,
( spl51_2
<=> sK49 = cons(hd(sK50),nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f475,plain,
( sK49 = cons(hd(sK50),nil)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f473]) ).
fof(f477,definition,
( spl51_3
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f478,plain,
( ssItem(hd(sK50))
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f479,plain,
( ~ ssItem(hd(sK50))
| spl51_3 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f481,definition,
( spl51_4
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f483,plain,
( ~ neq(nil,sK50)
| spl51_4 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f484,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f467,f481,f477,f473,f469]) ).
fof(f506,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f531,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_1 ),
inference(resolution,[],[f305,f471]) ).
fof(f534,plain,
( ~ ssItem(hd(sK50))
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f531,f306]) ).
fof(f535,plain,
( ~ spl51_3
| spl51_1 ),
inference(avatar_split_clause,[],[f534,f469,f477]) ).
fof(f538,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_3 ),
inference(resolution,[],[f314,f479]) ).
fof(f539,plain,
( nil = sK50
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f538,f417]) ).
fof(f541,plain,
( neq(nil,nil)
| spl51_3 ),
inference(superposition,[],[f427,f539]) ).
fof(f550,plain,
( ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f541,f463]) ).
fof(f551,plain,
( $false
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f550,f306]) ).
fof(f552,plain,
spl51_3,
inference(avatar_contradiction_clause,[],[f551]) ).
fof(f665,definition,
( spl51_6
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f666,plain,
( nil != sK50
| spl51_6 ),
inference(avatar_component_clause,[],[f665]) ).
fof(f667,plain,
( nil = sK50
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f665]) ).
fof(f675,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| spl51_4 ),
inference(resolution,[],[f303,f483]) ).
fof(f678,plain,
( nil = sK50
| ~ ssList(nil)
| spl51_4 ),
inference(forward_subsumption_resolution,[],[f675,f417]) ).
fof(f679,plain,
( nil = sK50
| spl51_4 ),
inference(forward_subsumption_resolution,[],[f678,f306]) ).
fof(f727,plain,
( spl51_6
| spl51_4 ),
inference(avatar_split_clause,[],[f679,f481,f665]) ).
fof(f776,plain,
( neq(nil,nil)
| ~ spl51_6 ),
inference(superposition,[],[f427,f667]) ).
fof(f789,plain,
( ~ ssList(nil)
| ~ spl51_6 ),
inference(resolution,[],[f776,f463]) ).
fof(f790,plain,
( $false
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f789,f306]) ).
fof(f791,plain,
~ spl51_6,
inference(avatar_contradiction_clause,[],[f790]) ).
fof(f1045,plain,
( nil = sK50
| sK50 = cons(hd(sK50),tl(sK50)) ),
inference(resolution,[],[f389,f417]) ).
fof(f1046,plain,
( sK50 = cons(hd(sK50),tl(sK50))
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f1045,f666]) ).
fof(f1090,definition,
( spl51_8
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).
fof(f1091,plain,
( ssList(tl(sK50))
| ~ spl51_8 ),
inference(avatar_component_clause,[],[f1090]) ).
fof(f1092,plain,
( ~ ssList(tl(sK50))
| spl51_8 ),
inference(avatar_component_clause,[],[f1090]) ).
fof(f1104,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_8 ),
inference(resolution,[],[f1092,f316]) ).
fof(f1105,plain,
( ~ ssList(sK50)
| spl51_6
| spl51_8 ),
inference(forward_subsumption_resolution,[],[f1104,f666]) ).
fof(f1106,plain,
( $false
| spl51_6
| spl51_8 ),
inference(forward_subsumption_resolution,[],[f1105,f417]) ).
fof(f1107,plain,
( spl51_6
| spl51_8 ),
inference(avatar_contradiction_clause,[],[f1106]) ).
fof(f1921,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ frontsegP(X0,nil)
| ~ ssItem(hd(sK50)) )
| ~ spl51_2 ),
inference(superposition,[],[f461,f475]) ).
fof(f1932,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssItem(hd(sK50)) )
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f1921,f345]) ).
fof(f1945,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0)
| ~ ssItem(hd(sK50)) )
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f1932,f306]) ).
fof(f1955,plain,
( ! [X0] :
( frontsegP(cons(hd(sK50),X0),sK49)
| ~ ssList(X0) )
| ~ spl51_2
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f1945,f478]) ).
fof(f2123,plain,
( frontsegP(sK50,sK49)
| ~ ssList(tl(sK50))
| ~ spl51_2
| ~ spl51_3
| spl51_6 ),
inference(superposition,[],[f1955,f1046]) ).
fof(f2124,plain,
( frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2123,f1091]) ).
fof(f2139,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(resolution,[],[f2124,f235]) ).
fof(f2140,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2139,f420]) ).
fof(f2141,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2140,f417]) ).
fof(f2618,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(app(sK49,X0)) ),
inference(superposition,[],[f435,f506]) ).
fof(f2634,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2618,f318]) ).
fof(f2641,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2634,f420]) ).
fof(f2645,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2641,f306]) ).
fof(f2669,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(superposition,[],[f2645,f2141]) ).
fof(f2671,plain,
( ~ ssList(sK5(sK50,sK49))
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2669,f466]) ).
fof(f2688,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(resolution,[],[f2671,f236]) ).
fof(f2689,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2688,f420]) ).
fof(f2690,plain,
( ~ frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2689,f417]) ).
fof(f2691,plain,
( $false
| ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f2690,f2124]) ).
fof(f2692,plain,
( ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(avatar_contradiction_clause,[],[f2691]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4 ),
inference(sat_conversion,[],[f484]) ).
cnf(s2,plain,
( spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f535]) ).
cnf(s3,plain,
spl51_3,
inference(sat_conversion,[],[f552]) ).
cnf(s5,plain,
( spl51_4
| spl51_6 ),
inference(sat_conversion,[],[f727]) ).
cnf(s6,plain,
~ spl51_6,
inference(sat_conversion,[],[f791]) ).
cnf(s8,plain,
( spl51_6
| spl51_8 ),
inference(sat_conversion,[],[f1107]) ).
cnf(s13,plain,
( ~ spl51_2
| ~ spl51_3
| spl51_6
| ~ spl51_8 ),
inference(sat_conversion,[],[f2692]) ).
cnf(s14,plain,
spl51_8,
inference(rat,[],[s8,s6]) ).
cnf(s15,plain,
spl51_4,
inference(rat,[],[s5,s6]) ).
cnf(s16,plain,
~ spl51_2,
inference(rat,[],[s13,s14,s6,s3]) ).
cnf(s18,plain,
spl51_1,
inference(rat,[],[s2,s3]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s1,s15,s3,s16,s18]) ).
fof(f2693,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC354+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n008.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 09:15:25 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.19/1.36 % (2118558)Will run a generic schedule for satisfiability detection.
% 7.19/1.36 % (2118568)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4114054127:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.19/1.36 % (2118564)% WARNING: option uhcvi not known.
% 7.19/1.36 % (2118563)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=286012783_2999 on theBenchmark for (2999ds/0Mi)
% 7.19/1.36 % (2118565)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3078670413:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.19/1.36 % (2118566)dis+10_1_sil=32000:sp=arity:random_seed=1917135452:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.19/1.36 % (2118564)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=163683670:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.19/1.36 % (2118567)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2787504882:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.19/1.36 % (2118569)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1814044253:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.19/1.36 % TRYING [1]
% 7.19/1.36 % TRYING [2]
% 7.19/1.36 % TRYING [3]
% 7.19/1.36 % (2118568)Instruction limit reached!
% 7.19/1.36 % (2118568)------------------------------
% 7.19/1.36 % (2118568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118568)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118568)Termination reason: Instruction limit
% 7.19/1.36 % (2118568)Termination phase: Saturation
% 7.19/1.36 % (2118568)Time elapsed: 0.043 s
% 7.19/1.36 % (2118568)Peak memory usage: 14 MB
% 7.19/1.36 % (2118568)Instructions burned: 131 (million)
% 7.19/1.36 % TRYING [4]
% 7.19/1.36 % (2118577)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=262821023:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.19/1.36 % TRYING [1]
% 7.19/1.36 % TRYING [2]
% 7.19/1.36 % TRYING [3]
% 7.19/1.36 % (2118566)Instruction limit reached!
% 7.19/1.36 % (2118566)------------------------------
% 7.19/1.36 % (2118566)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118566)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118566)Termination reason: Instruction limit
% 7.19/1.36 % (2118566)Termination phase: Saturation
% 7.19/1.36 % (2118566)Time elapsed: 0.060 s
% 7.19/1.36 % (2118566)Peak memory usage: 13 MB
% 7.19/1.36 % (2118566)Instructions burned: 103 (million)
% 7.19/1.36 % TRYING [4]
% 7.19/1.36 % (2118567)Instruction limit reached!
% 7.19/1.36 % (2118567)------------------------------
% 7.19/1.36 % (2118567)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118567)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118567)Termination reason: Instruction limit
% 7.19/1.36 % (2118567)Termination phase: Saturation
% 7.19/1.36 % (2118567)Time elapsed: 0.069 s
% 7.19/1.36 % (2118567)Peak memory usage: 13 MB
% 7.19/1.36 % (2118567)Instructions burned: 117 (million)
% 7.19/1.36 % (2118579)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1123685185:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.19/1.36 % TRYING [5]
% 7.19/1.36 % (2118580)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=3335961511:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.19/1.36 % TRYING [5]
% 7.19/1.36 % (2118569)Instruction limit reached!
% 7.19/1.36 % (2118569)------------------------------
% 7.19/1.36 % (2118569)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118569)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118569)Termination reason: Instruction limit
% 7.19/1.36 % (2118569)Termination phase: Saturation
% 7.19/1.36 % (2118569)Time elapsed: 0.105 s
% 7.19/1.36 % (2118569)Peak memory usage: 16 MB
% 7.19/1.36 % (2118569)Instructions burned: 161 (million)
% 7.19/1.36 % (2118583)ott-21_1_sil=16000:fs=off:random_seed=1753926866:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.19/1.36 % (2118579)Instruction limit reached!
% 7.19/1.36 % (2118579)------------------------------
% 7.19/1.36 % (2118579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118579)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118579)Termination reason: Instruction limit
% 7.19/1.36 % (2118579)Termination phase: Saturation
% 7.19/1.36 % (2118579)Time elapsed: 0.070 s
% 7.19/1.36 % (2118579)Peak memory usage: 13 MB
% 7.19/1.36 % (2118579)Instructions burned: 132 (million)
% 7.19/1.36 % (2118585)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=556377495:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 7.19/1.36 % TRYING [6]
% 7.19/1.36 % TRYING [6]
% 7.19/1.36 % (2118577)Instruction limit reached!
% 7.19/1.36 % (2118577)------------------------------
% 7.19/1.36 % (2118577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118577)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118577)Termination reason: Instruction limit
% 7.19/1.36 % (2118577)Termination phase: Finite model building constraint generation
% 7.19/1.36 % (2118577)Time elapsed: 0.158 s
% 7.19/1.36 % (2118577)Peak memory usage: 28 MB
% 7.19/1.36 % (2118577)Instructions burned: 716 (million)
% 7.19/1.36 % (2118583)Instruction limit reached!
% 7.19/1.36 % (2118583)------------------------------
% 7.19/1.36 % (2118583)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118583)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118583)Termination reason: Instruction limit
% 7.19/1.36 % (2118583)Termination phase: Saturation
% 7.19/1.36 % (2118583)Time elapsed: 0.092 s
% 7.19/1.36 % (2118583)Peak memory usage: 13 MB
% 7.19/1.36 % (2118583)Instructions burned: 182 (million)
% 7.19/1.36 % (2118587)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4243823304:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.19/1.36 % TRYING [1]
% 7.19/1.36 % TRYING [2]
% 7.19/1.36 % TRYING [3]
% 7.19/1.36 % (2118589)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1660228351:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 7.19/1.36 % TRYING [4]
% 7.19/1.36 % TRYING [5]
% 7.19/1.36 % (2118587)Instruction limit reached!
% 7.19/1.36 % (2118587)------------------------------
% 7.19/1.36 % (2118587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118587)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118587)Termination reason: Instruction limit
% 7.19/1.36 % (2118587)Termination phase: Finite model building SAT solving
% 7.19/1.36 % (2118587)Time elapsed: 0.182 s
% 7.19/1.36 % (2118587)Peak memory usage: 23 MB
% 7.19/1.36 % (2118587)Instructions burned: 867 (million)
% 7.19/1.36 % (2118591)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=883807046:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 7.19/1.36 % TRYING [7]
% 7.19/1.36 % (2118580)Instruction limit reached!
% 7.19/1.36 % (2118580)------------------------------
% 7.19/1.36 % (2118580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118580)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118580)Termination reason: Instruction limit
% 7.19/1.36 % (2118580)Termination phase: Saturation
% 7.19/1.36 % (2118580)Time elapsed: 0.377 s
% 7.19/1.36 % (2118580)Peak memory usage: 21 MB
% 7.19/1.36 % (2118580)Instructions burned: 685 (million)
% 7.19/1.36 % TRYING [14]
% 7.19/1.36 % (2118593)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=3357604627:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 7.19/1.36 % (2118585)Instruction limit reached!
% 7.19/1.36 % (2118585)------------------------------
% 7.19/1.36 % (2118585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118585)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118585)Termination reason: Instruction limit
% 7.19/1.36 % (2118585)Termination phase: Saturation
% 7.19/1.36 % (2118585)Time elapsed: 0.324 s
% 7.19/1.36 % (2118585)Peak memory usage: 14 MB
% 7.19/1.36 % (2118585)Instructions burned: 478 (million)
% 7.19/1.36 % (2118595)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3723943361:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 7.19/1.36 % (2118591)Instruction limit reached!
% 7.19/1.36 % (2118591)------------------------------
% 7.19/1.36 % (2118591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118591)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118591)Termination reason: Instruction limit
% 7.19/1.36 % (2118591)Termination phase: Finite model building constraint generation
% 7.19/1.36 % (2118591)Time elapsed: 0.177 s
% 7.19/1.36 % (2118591)Peak memory usage: 70 MB
% 7.19/1.36 % (2118591)Instructions burned: 892 (million)
% 7.19/1.36 % (2118597)fmb+10_1_sil=64000:random_seed=3887797238:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 7.19/1.36 % TRYING [1]
% 7.19/1.36 % TRYING [2]
% 7.19/1.36 % TRYING [3]
% 7.19/1.36 % TRYING [4]
% 7.19/1.36 % TRYING [5]
% 7.19/1.36 % (2118593)Instruction limit reached!
% 7.19/1.36 % (2118593)------------------------------
% 7.19/1.36 % (2118593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118593)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118593)Termination reason: Instruction limit
% 7.19/1.36 % (2118593)Termination phase: Saturation
% 7.19/1.36 % (2118593)Time elapsed: 0.385 s
% 7.19/1.36 % (2118593)Peak memory usage: 24 MB
% 7.19/1.36 % (2118593)Instructions burned: 694 (million)
% 7.19/1.36 % TRYING [6]
% 7.19/1.36 % (2118589)Instruction limit reached!
% 7.19/1.36 % (2118589)------------------------------
% 7.19/1.36 % (2118589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118589)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118589)Termination reason: Instruction limit
% 7.19/1.36 % (2118589)Termination phase: Saturation
% 7.19/1.36 % (2118589)Time elapsed: 0.650 s
% 7.19/1.36 % (2118589)Peak memory usage: 28 MB
% 7.19/1.36 % (2118589)Instructions burned: 1179 (million)
% 7.19/1.36 % (2118599)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2779649761:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 7.19/1.36 % TRYING [20]
% 7.19/1.36 % (2118600)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1730820688:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 7.19/1.36 % TRYING [8]
% 7.19/1.36 % TRYING [8]
% 7.19/1.36 % (2118595)Instruction limit reached!
% 7.19/1.36 % (2118595)------------------------------
% 7.19/1.36 % (2118595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118595)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118595)Termination reason: Instruction limit
% 7.19/1.36 % (2118595)Termination phase: Saturation
% 7.19/1.36 % (2118595)Time elapsed: 0.471 s
% 7.19/1.36 % (2118595)Peak memory usage: 22 MB
% 7.19/1.36 % (2118595)Instructions burned: 881 (million)
% 7.19/1.36 % (2118603)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=817782191:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 7.19/1.36 % (2118603) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2118558-2118603"...
% 7.19/1.36 % (2118603)...printing done.
% 7.19/1.36 % (2118603)Refutation found. Thanks to Tanya!
% 7.19/1.36 % SZS status Theorem for theBenchmark
% 7.19/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 7.19/1.36 % (2118603)------------------------------
% 7.19/1.36 % (2118603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.19/1.36 % (2118603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.36 % (2118603)CaDiCaL version: 2.1.3
% 7.19/1.36 % (2118603)Termination reason: Refutation
% 7.19/1.36 % (2118603)Time elapsed: 0.057 s
% 7.19/1.36 % (2118603)Peak memory usage: 13 MB
% 7.19/1.36 % (2118603)Instructions burned: 103 (million)
% 7.19/1.36 % (2118558)Success in time 1.119 s
% 7.19/1.36 % Vampire exiting
%------------------------------------------------------------------------------