%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC396+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:05:52 PM UTC 2026
% Result : Theorem 35.97s 6.41s
% Output : Refutation 35.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 17
% Syntax : Number of formulae : 143 ( 25 unt; 4 def)
% Number of atoms : 674 ( 202 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 870 ( 339 ~; 401 |; 87 &)
% ( 10 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 180 ( 150 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(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(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,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/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
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,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(f99,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(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(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
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
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(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
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(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(f234,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f235,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X4,cons(X1,X5)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f234]) ).
fof(f236,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK8(X0,X1))
& ssList(sK9(X0,X1))
& app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X4,sK8(X0,X1)),skolemize(X5,sK9(X0,X1))],[f235]) ).
fof(f243,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f244,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK12(X0,X1))
& app(sK12(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X3,sK12(X0,X1))],[f244]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f277,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f146]) ).
fof(f278,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f277]) ).
fof(f279,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f280,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f279]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& memberP(sK53,sK57)
& ~ memberP(sK54,sK57)
& ssItem(sK57)
& ( nil = sK55
| nil != sK56 )
& ( ~ neq(sK56,nil)
| ( neq(sK55,nil)
& ! [X5] :
( ~ ssList(X5)
| sK56 = X5
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| tl(sK55) != X6
| app(X6,X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(sK55) != X8
| ~ neq(nil,sK55) )
| ~ neq(nil,sK55) ) ) ) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f305,plain,
! [X2,X3,X0,X1] :
( memberP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f236]) ).
fof(f312,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| app(sK12(X0,X1),X1) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f313,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f314,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| ~ ssList(X2)
| app(X2,X1) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f397,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f415,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f278]) ).
fof(f416,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| memberP(X2,X0)
| X0 = X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f280]) ).
fof(f419,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f474,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
! [X8,X6,X7,X5] :
( ~ neq(sK56,nil)
| ~ ssList(X5)
| sK56 = X5
| ~ ssList(X6)
| ~ ssList(X7)
| tl(sK55) != X6
| app(X6,X7) != X5
| ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(sK55) != X8
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ memberP(sK54,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
memberP(sK53,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
memberP(sK55,sK57),
inference(definition_unfolding,[],[f505,f506]) ).
fof(f509,plain,
~ memberP(sK56,sK57),
inference(definition_unfolding,[],[f504,f507]) ).
fof(f510,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f507]) ).
fof(f511,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f506]) ).
fof(f513,plain,
! [X2,X3,X1] :
( memberP(app(X2,cons(X1,X3)),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssList(app(X2,cons(X1,X3))) ),
inference(equality_resolution,[],[f305]) ).
fof(f516,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f314]) ).
fof(f539,plain,
! [X8,X7,X5] :
( ~ neq(sK56,nil)
| ~ ssList(X5)
| sK56 = X5
| ~ ssList(tl(sK55))
| ~ ssList(X7)
| app(tl(sK55),X7) != X5
| ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(sK55) != X8
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(equality_resolution,[],[f500]) ).
fof(f540,plain,
! [X8,X7] :
( ~ neq(sK56,nil)
| ~ ssList(app(tl(sK55),X7))
| sK56 = app(tl(sK55),X7)
| ~ ssList(tl(sK55))
| ~ ssList(X7)
| ~ ssItem(X8)
| cons(X8,nil) != X7
| hd(sK55) != X8
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(equality_resolution,[],[f539]) ).
fof(f541,plain,
! [X8] :
( ~ neq(sK56,nil)
| ~ ssList(app(tl(sK55),cons(X8,nil)))
| sK56 = app(tl(sK55),cons(X8,nil))
| ~ ssList(tl(sK55))
| ~ ssList(cons(X8,nil))
| ~ ssItem(X8)
| hd(sK55) != X8
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(equality_resolution,[],[f540]) ).
fof(f542,plain,
( ~ neq(sK56,nil)
| ~ ssList(app(tl(sK55),cons(hd(sK55),nil)))
| sK56 = app(tl(sK55),cons(hd(sK55),nil))
| ~ ssList(tl(sK55))
| ~ ssList(cons(hd(sK55),nil))
| ~ ssItem(hd(sK55))
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(equality_resolution,[],[f541]) ).
fof(f543,definition,
sF58 = tl(sK55),
introduced(definition,[new_symbols(definition,[sF58])],[function_definition]) ).
fof(f544,plain,
tl(sK55) = sF58,
inference(reorient_equations,[],[f543]) ).
fof(f545,definition,
sF59 = hd(sK55),
introduced(definition,[new_symbols(definition,[sF59])],[function_definition]) ).
fof(f546,plain,
hd(sK55) = sF59,
inference(reorient_equations,[],[f545]) ).
fof(f547,definition,
sF60 = cons(sF59,nil),
introduced(definition,[new_symbols(definition,[sF60])],[function_definition]) ).
fof(f548,plain,
cons(sF59,nil) = sF60,
inference(reorient_equations,[],[f547]) ).
fof(f549,definition,
sF61 = app(sF58,sF60),
introduced(definition,[new_symbols(definition,[sF61])],[function_definition]) ).
fof(f550,plain,
app(sF58,sF60) = sF61,
inference(reorient_equations,[],[f549]) ).
fof(f551,plain,
( ~ neq(sK56,nil)
| ~ ssList(sF61)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55)
| ~ neq(nil,sK55) ),
inference(definition_folding,[],[f542,f546,f548,f546,f544,f550,f548,f546,f544,f550,f548,f546,f544]) ).
fof(f552,plain,
( ~ neq(sK56,nil)
| ~ ssList(sF61)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55) ),
inference(duplicate_literal_removal,[],[f551]) ).
fof(f560,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f516,f401]) ).
fof(f746,plain,
( ssList(sF60)
| ~ ssItem(sF59)
| ~ ssList(nil) ),
inference(superposition,[],[f388,f548]) ).
fof(f747,plain,
( ~ ssItem(sF59)
| ssList(sF60) ),
inference(forward_subsumption_resolution,[],[f746,f389]) ).
fof(f753,plain,
( ssItem(sF59)
| nil = sK55
| ~ ssList(sK55) ),
inference(superposition,[],[f397,f546]) ).
fof(f754,plain,
( ssItem(sF59)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f753,f511]) ).
fof(f762,plain,
( ssList(sF60)
| nil = sK55 ),
inference(resolution,[],[f754,f747]) ).
fof(f768,plain,
( ssList(sF58)
| nil = sK55
| ~ ssList(sK55) ),
inference(superposition,[],[f399,f544]) ).
fof(f769,plain,
( ssList(sF58)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f768,f511]) ).
fof(f784,plain,
( ~ ssList(sF60)
| ssList(sF61)
| ~ ssList(sF58) ),
inference(superposition,[],[f401,f550]) ).
fof(f869,plain,
( rearsegP(sF61,sF60)
| ~ ssList(sF58)
| ~ ssList(sF60) ),
inference(superposition,[],[f560,f550]) ).
fof(f883,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| ~ ssList(sF61)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55) ),
inference(resolution,[],[f387,f552]) ).
fof(f890,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55) ),
inference(forward_subsumption_resolution,[],[f883,f784]) ).
fof(f892,plain,
( nil = sK56
| ~ ssList(sK56)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55) ),
inference(forward_subsumption_resolution,[],[f890,f389]) ).
fof(f893,plain,
( nil = sK56
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssList(sF60)
| ~ ssItem(sF59)
| ~ neq(nil,sK55) ),
inference(forward_subsumption_resolution,[],[f892,f510]) ).
fof(f894,plain,
( ~ neq(nil,sK55)
| sK56 = sF61
| ~ ssList(sF58)
| ~ ssItem(sF59)
| nil = sK56 ),
inference(forward_subsumption_resolution,[],[f893,f747]) ).
fof(f1241,plain,
( nil = sK55
| sK55 = cons(hd(sK55),tl(sK55)) ),
inference(resolution,[],[f474,f511]) ).
fof(f1245,plain,
( sK55 = cons(hd(sK55),sF58)
| nil = sK55 ),
inference(forward_demodulation,[],[f1241,f544]) ).
fof(f1247,plain,
( sK55 = cons(sF59,sF58)
| nil = sK55 ),
inference(forward_demodulation,[],[f1245,f546]) ).
fof(f1438,plain,
! [X0] :
( ~ memberP(sF58,X0)
| memberP(sF61,X0)
| ~ ssList(sF60)
| ~ ssList(sF58)
| ~ ssItem(X0) ),
inference(superposition,[],[f415,f550]) ).
fof(f1917,plain,
! [X0] :
( ~ memberP(sK55,X0)
| memberP(sF58,X0)
| sF59 = X0
| ~ ssList(sF58)
| ~ ssItem(sF59)
| ~ ssItem(X0)
| nil = sK55 ),
inference(superposition,[],[f416,f1247]) ).
fof(f1920,plain,
! [X0] :
( ~ memberP(sK55,X0)
| memberP(sF58,X0)
| sF59 = X0
| ~ ssItem(sF59)
| ~ ssItem(X0)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f1917,f769]) ).
fof(f1922,plain,
! [X0] :
( ~ memberP(sK55,X0)
| memberP(sF58,X0)
| sF59 = X0
| ~ ssItem(X0)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f1920,f754]) ).
fof(f2116,plain,
! [X0] :
( memberP(app(X0,sF60),sF59)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssItem(sF59)
| ~ ssList(app(X0,sF60)) ),
inference(superposition,[],[f513,f548]) ).
fof(f2121,plain,
! [X0] :
( memberP(app(X0,sF60),sF59)
| ~ ssList(X0)
| ~ ssItem(sF59)
| ~ ssList(app(X0,sF60)) ),
inference(forward_subsumption_resolution,[],[f2116,f389]) ).
fof(f2703,plain,
( sK56 = sF61
| ~ ssList(sF58)
| ~ ssItem(sF59)
| nil = sK56
| nil = sK55
| ~ ssList(sK55)
| ~ ssList(nil) ),
inference(resolution,[],[f894,f387]) ).
fof(f2706,plain,
( sK56 = sF61
| ~ ssItem(sF59)
| nil = sK56
| nil = sK55
| ~ ssList(sK55)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2703,f769]) ).
fof(f2708,plain,
( sK56 = sF61
| nil = sK56
| nil = sK55
| ~ ssList(sK55)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2706,f754]) ).
fof(f2710,plain,
( sK56 = sF61
| nil = sK55
| ~ ssList(sK55)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2708,f502]) ).
fof(f2711,plain,
( sK56 = sF61
| nil = sK55
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2710,f511]) ).
fof(f2712,plain,
( sK56 = sF61
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f2711,f389]) ).
fof(f3613,plain,
( rearsegP(sK56,sF60)
| ~ ssList(sF58)
| ~ ssList(sF60)
| nil = sK55 ),
inference(superposition,[],[f869,f2712]) ).
fof(f3617,plain,
( rearsegP(sK56,sF60)
| ~ ssList(sF60)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f3613,f769]) ).
fof(f3621,plain,
( rearsegP(sK56,sF60)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f3617,f762]) ).
fof(f3623,plain,
( nil = sK55
| sK56 = app(sK12(sK56,sF60),sF60)
| ~ ssList(sF60)
| ~ ssList(sK56) ),
inference(resolution,[],[f3621,f312]) ).
fof(f3626,plain,
( nil = sK55
| sK56 = app(sK12(sK56,sF60),sF60)
| ~ ssList(sK56) ),
inference(forward_subsumption_resolution,[],[f3623,f762]) ).
fof(f3629,plain,
( sK56 = app(sK12(sK56,sF60),sF60)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f3626,f510]) ).
fof(f15747,plain,
( memberP(sK56,sF59)
| ~ ssList(sK12(sK56,sF60))
| ~ ssItem(sF59)
| ~ ssList(sK56)
| nil = sK55 ),
inference(superposition,[],[f2121,f3629]) ).
fof(f15784,plain,
( memberP(sK56,sF59)
| ~ ssList(sK12(sK56,sF60))
| ~ ssList(sK56)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f15747,f754]) ).
fof(f15786,plain,
( ~ ssList(sK12(sK56,sF60))
| memberP(sK56,sF59)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f15784,f510]) ).
fof(f18107,plain,
( memberP(sK56,sF59)
| nil = sK55
| ~ rearsegP(sK56,sF60)
| ~ ssList(sF60)
| ~ ssList(sK56) ),
inference(resolution,[],[f15786,f313]) ).
fof(f18108,plain,
( memberP(sK56,sF59)
| nil = sK55
| ~ ssList(sF60)
| ~ ssList(sK56) ),
inference(forward_subsumption_resolution,[],[f18107,f3621]) ).
fof(f18109,plain,
( memberP(sK56,sF59)
| nil = sK55
| ~ ssList(sK56) ),
inference(forward_subsumption_resolution,[],[f18108,f762]) ).
fof(f18110,plain,
( memberP(sK56,sF59)
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f18109,f510]) ).
fof(f43437,plain,
( memberP(sF58,sK57)
| sK57 = sF59
| ~ ssItem(sK57)
| nil = sK55 ),
inference(resolution,[],[f1922,f508]) ).
fof(f43442,plain,
( memberP(sF58,sK57)
| sK57 = sF59
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f43437,f503]) ).
fof(f43716,plain,
( sK57 = sF59
| nil = sK55
| memberP(sF61,sK57)
| ~ ssList(sF60)
| ~ ssList(sF58)
| ~ ssItem(sK57) ),
inference(resolution,[],[f43442,f1438]) ).
fof(f43778,plain,
( sK57 = sF59
| nil = sK55
| memberP(sF61,sK57)
| ~ ssList(sF58)
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f43716,f762]) ).
fof(f43809,plain,
( sK57 = sF59
| nil = sK55
| memberP(sF61,sK57)
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f43778,f769]) ).
fof(f43810,plain,
( memberP(sF61,sK57)
| nil = sK55
| sK57 = sF59 ),
inference(forward_subsumption_resolution,[],[f43809,f503]) ).
fof(f43981,plain,
( memberP(sK56,sK57)
| nil = sK55
| sK57 = sF59
| nil = sK55 ),
inference(superposition,[],[f43810,f2712]) ).
fof(f43982,plain,
( memberP(sK56,sK57)
| nil = sK55
| sK57 = sF59 ),
inference(duplicate_literal_removal,[],[f43981]) ).
fof(f43983,plain,
( sK57 = sF59
| nil = sK55 ),
inference(forward_subsumption_resolution,[],[f43982,f509]) ).
fof(f44137,plain,
( memberP(sK56,sK57)
| nil = sK55
| nil = sK55 ),
inference(superposition,[],[f18110,f43983]) ).
fof(f44170,plain,
( memberP(sK56,sK57)
| nil = sK55 ),
inference(duplicate_literal_removal,[],[f44137]) ).
fof(f44221,plain,
nil = sK55,
inference(forward_subsumption_resolution,[],[f44170,f509]) ).
fof(f44251,plain,
memberP(nil,sK57),
inference(superposition,[],[f508,f44221]) ).
fof(f44761,plain,
~ ssItem(sK57),
inference(resolution,[],[f44251,f419]) ).
fof(f44817,plain,
$false,
inference(forward_subsumption_resolution,[],[f44761,f503]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC396+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n026.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:29:41 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 13.94/2.22 % (3720657)Will run a generic schedule for satisfiability detection.
% 13.94/2.22 % (3720665)dis+10_1_sil=32000:sp=arity:random_seed=2359068897:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 13.94/2.22 % (3720663)% WARNING: option uhcvi not known.
% 13.94/2.22 % (3720662)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=828160272_2999 on theBenchmark for (2999ds/0Mi)
% 13.94/2.22 % (3720663)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=782185455:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 13.94/2.22 % (3720664)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2914511157:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 13.94/2.22 % (3720666)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=307706117:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 13.94/2.22 % (3720667)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2758094008:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 13.94/2.22 % (3720668)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3319915346:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 13.94/2.22 % TRYING [1]
% 13.94/2.22 % TRYING [2]
% 13.94/2.22 % TRYING [3]
% 13.94/2.22 % (3720665)Instruction limit reached!
% 13.94/2.22 % (3720665)------------------------------
% 13.94/2.22 % (3720665)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.94/2.22 % (3720665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.94/2.22 % (3720665)CaDiCaL version: 2.1.3
% 13.94/2.22 % (3720665)Termination reason: Instruction limit
% 13.94/2.22 % (3720665)Termination phase: Saturation
% 13.94/2.22 % (3720665)Time elapsed: 0.033 s
% 13.94/2.22 % (3720665)Peak memory usage: 13 MB
% 13.94/2.22 % (3720665)Instructions burned: 103 (million)
% 13.94/2.22 % (3720676)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=443430840:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 13.94/2.22 % TRYING [4]
% 13.94/2.22 % TRYING [1]
% 13.94/2.22 % TRYING [2]
% 13.94/2.22 % TRYING [3]
% 13.94/2.22 % TRYING [4]
% 13.94/2.22 % (3720666)Instruction limit reached!
% 13.94/2.22 % (3720666)------------------------------
% 13.94/2.22 % (3720666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.94/2.22 % (3720666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.94/2.22 % (3720666)CaDiCaL version: 2.1.3
% 13.94/2.22 % (3720666)Termination reason: Instruction limit
% 13.94/2.22 % (3720666)Termination phase: Saturation
% 13.94/2.22 % (3720666)Time elapsed: 0.070 s
% 13.94/2.22 % (3720666)Peak memory usage: 13 MB
% 13.94/2.22 % (3720666)Instructions burned: 117 (million)
% 13.94/2.22 % (3720667)Instruction limit reached!
% 13.94/2.22 % (3720667)------------------------------
% 13.94/2.22 % (3720667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.94/2.22 % (3720667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.94/2.22 % (3720667)CaDiCaL version: 2.1.3
% 13.94/2.22 % (3720667)Termination reason: Instruction limit
% 13.94/2.22 % (3720667)Termination phase: Saturation
% 13.94/2.22 % (3720667)Time elapsed: 0.074 s
% 13.94/2.22 % (3720667)Peak memory usage: 14 MB
% 13.94/2.22 % (3720667)Instructions burned: 132 (million)
% 13.94/2.22 % TRYING [5]
% 13.94/2.22 % (3720678)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=971076832:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 13.94/2.22 % TRYING [5]
% 13.94/2.22 % (3720679)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=1446300873:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 13.94/2.22 % (3720668)Instruction limit reached!
% 13.94/2.22 % (3720668)------------------------------
% 13.94/2.22 % (3720668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.94/2.22 % (3720668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.94/2.22 % (3720668)CaDiCaL version: 2.1.3
% 13.94/2.22 % (3720668)Termination reason: Instruction limit
% 13.94/2.22 % (3720668)Termination phase: Saturation
% 13.94/2.22 % (3720668)Time elapsed: 0.098 s
% 13.94/2.22 % (3720668)Peak memory usage: 14 MB
% 13.94/2.22 % (3720668)Instructions burned: 160 (million)
% 13.94/2.22 % (3720682)ott-21_1_sil=16000:fs=off:random_seed=2564670343:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 13.94/2.22 % (3720678)Instruction limit reached!
% 13.94/2.22 % (3720678)------------------------------
% 13.94/2.22 % (3720678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720678)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720678)Termination reason: Instruction limit
% 37.48/5.65 % (3720678)Termination phase: Saturation
% 37.48/5.65 % (3720678)Time elapsed: 0.073 s
% 37.48/5.65 % (3720678)Peak memory usage: 14 MB
% 37.48/5.65 % (3720678)Instructions burned: 132 (million)
% 37.48/5.65 % TRYING [6]
% 37.48/5.65 % (3720684)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=295846715:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 37.48/5.65 % (3720676)Instruction limit reached!
% 37.48/5.65 % (3720676)------------------------------
% 37.48/5.65 % (3720676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720676)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720676)Termination reason: Instruction limit
% 37.48/5.65 % (3720676)Termination phase: Finite model building constraint generation
% 37.48/5.65 % (3720676)Time elapsed: 0.156 s
% 37.48/5.65 % (3720676)Peak memory usage: 27 MB
% 37.48/5.65 % (3720676)Instructions burned: 717 (million)
% 37.48/5.65 % (3720686)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2727398903:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 37.48/5.65 % (3720682)Instruction limit reached!
% 37.48/5.65 % (3720682)------------------------------
% 37.48/5.65 % (3720682)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720682)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720682)Termination reason: Instruction limit
% 37.48/5.65 % (3720682)Termination phase: Saturation
% 37.48/5.65 % (3720682)Time elapsed: 0.091 s
% 37.48/5.65 % (3720682)Peak memory usage: 13 MB
% 37.48/5.65 % (3720682)Instructions burned: 181 (million)
% 37.48/5.65 % TRYING [1]
% 37.48/5.65 % TRYING [2]
% 37.48/5.65 % TRYING [3]
% 37.48/5.65 % TRYING [6]
% 37.48/5.65 % (3720688)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2773098610:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 37.48/5.65 % TRYING [4]
% 37.48/5.65 % TRYING [5]
% 37.48/5.65 % (3720686)Instruction limit reached!
% 37.48/5.65 % (3720686)------------------------------
% 37.48/5.65 % (3720686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720686)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720686)Termination reason: Instruction limit
% 37.48/5.65 % (3720686)Termination phase: Finite model building SAT solving
% 37.48/5.65 % (3720686)Time elapsed: 0.181 s
% 37.48/5.65 % (3720686)Peak memory usage: 24 MB
% 37.48/5.65 % (3720686)Instructions burned: 867 (million)
% 37.48/5.65 % (3720690)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=424374782:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 37.48/5.65 % TRYING [14]
% 37.48/5.65 % (3720679)Instruction limit reached!
% 37.48/5.65 % (3720679)------------------------------
% 37.48/5.65 % (3720679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720679)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720679)Termination reason: Instruction limit
% 37.48/5.65 % (3720679)Termination phase: Saturation
% 37.48/5.65 % (3720679)Time elapsed: 0.381 s
% 37.48/5.65 % (3720679)Peak memory usage: 21 MB
% 37.48/5.65 % (3720679)Instructions burned: 686 (million)
% 37.48/5.65 % (3720692)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=2884400073: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)
% 37.48/5.65 % (3720684)Instruction limit reached!
% 37.48/5.65 % (3720684)------------------------------
% 37.48/5.65 % (3720684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.48/5.65 % (3720684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.48/5.65 % (3720684)CaDiCaL version: 2.1.3
% 37.48/5.65 % (3720684)Termination reason: Instruction limit
% 37.48/5.65 % (3720684)Termination phase: Saturation
% 37.48/5.65 % (3720684)Time elapsed: 0.320 s
% 37.48/5.65 % (3720684)Peak memory usage: 14 MB
% 37.48/5.65 % (3720684)Instructions burned: 477 (million)
% 37.48/5.65 % TRYING [7]
% 37.48/5.65 % (3720694)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=896775348:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 37.48/5.65 % (3720690)Instruction limit reached!
% 35.97/6.41 % (3720690)------------------------------
% 35.97/6.41 % (3720690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720690)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720690)Termination reason: Instruction limit
% 35.97/6.41 % (3720690)Termination phase: Finite model building constraint generation
% 35.97/6.41 % (3720690)Time elapsed: 0.176 s
% 35.97/6.41 % (3720690)Peak memory usage: 70 MB
% 35.97/6.41 % (3720690)Instructions burned: 891 (million)
% 35.97/6.41 % (3720696)fmb+10_1_sil=64000:random_seed=4139807548:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 35.97/6.41 % TRYING [1]
% 35.97/6.41 % TRYING [2]
% 35.97/6.41 % TRYING [3]
% 35.97/6.41 % TRYING [4]
% 35.97/6.41 % TRYING [5]
% 35.97/6.41 % TRYING [6]
% 35.97/6.41 % (3720692)Instruction limit reached!
% 35.97/6.41 % (3720692)------------------------------
% 35.97/6.41 % (3720692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720692)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720692)Termination reason: Instruction limit
% 35.97/6.41 % (3720692)Termination phase: Saturation
% 35.97/6.41 % (3720692)Time elapsed: 0.364 s
% 35.97/6.41 % (3720692)Peak memory usage: 22 MB
% 35.97/6.41 % (3720692)Instructions burned: 693 (million)
% 35.97/6.41 % (3720698)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1625697139:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 35.97/6.41 % (3720688)Instruction limit reached!
% 35.97/6.41 % (3720688)------------------------------
% 35.97/6.41 % (3720688)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720688)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720688)Termination reason: Instruction limit
% 35.97/6.41 % (3720688)Termination phase: Saturation
% 35.97/6.41 % (3720688)Time elapsed: 0.654 s
% 35.97/6.41 % (3720688)Peak memory usage: 27 MB
% 35.97/6.41 % (3720688)Instructions burned: 1179 (million)
% 35.97/6.41 % TRYING [20]
% 35.97/6.41 % (3720700)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2399713147:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 35.97/6.41 % TRYING [8]
% 35.97/6.41 % (3720694)Instruction limit reached!
% 35.97/6.41 % (3720694)------------------------------
% 35.97/6.41 % (3720694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720694)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720694)Termination reason: Instruction limit
% 35.97/6.41 % (3720694)Termination phase: Saturation
% 35.97/6.41 % (3720694)Time elapsed: 0.464 s
% 35.97/6.41 % (3720694)Peak memory usage: 22 MB
% 35.97/6.41 % (3720694)Instructions burned: 880 (million)
% 35.97/6.41 % (3720702)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=782018768:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 35.97/6.41 % TRYING [8]
% 35.97/6.41 % TRYING [7]
% 35.97/6.41 % (3720700)Instruction limit reached!
% 35.97/6.41 % (3720700)------------------------------
% 35.97/6.41 % (3720700)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720700)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720700)Termination reason: Instruction limit
% 35.97/6.41 % (3720700)Termination phase: Finite model building constraint generation
% 35.97/6.41 % (3720700)Time elapsed: 0.338 s
% 35.97/6.41 % (3720700)Peak memory usage: 69 MB
% 35.97/6.41 % (3720700)Instructions burned: 920 (million)
% 35.97/6.41 % (3720704)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1401703739:i=1472:ins=7:fdi=8:gsp=on_2987 on theBenchmark for (2987ds/1472Mi)
% 35.97/6.41 % (3720704)Instruction limit reached!
% 35.97/6.41 % (3720704)------------------------------
% 35.97/6.41 % (3720704)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720704)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720704)Termination reason: Instruction limit
% 35.97/6.41 % (3720704)Termination phase: Saturation
% 35.97/6.41 % (3720704)Time elapsed: 0.657 s
% 35.97/6.41 % (3720704)Peak memory usage: 16 MB
% 35.97/6.41 % (3720704)Instructions burned: 1474 (million)
% 35.97/6.41 % (3720706)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=710469799:i=6324_2980 on theBenchmark for (2980ds/6324Mi)
% 35.97/6.41 % TRYING [77]
% 35.97/6.41 % TRYING [8]
% 35.97/6.41 % TRYING [9]
% 35.97/6.41 % TRYING [9]
% 35.97/6.41 % (3720702)Instruction limit reached!
% 35.97/6.41 % (3720702)------------------------------
% 35.97/6.41 % (3720702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720702)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720702)Termination reason: Instruction limit
% 35.97/6.41 % (3720702)Termination phase: Saturation
% 35.97/6.41 % (3720702)Time elapsed: 2.786 s
% 35.97/6.41 % (3720702)Peak memory usage: 55 MB
% 35.97/6.41 % (3720702)Instructions burned: 5133 (million)
% 35.97/6.41 % (3720708)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2576509913:fmbsr=2.30978:i=2174_2961 on theBenchmark for (2961ds/2174Mi)
% 35.97/6.41 % TRYING [16]
% 35.97/6.41 % (3720698)Instruction limit reached!
% 35.97/6.41 % (3720698)------------------------------
% 35.97/6.41 % (3720698)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720698)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720698)Termination reason: Instruction limit
% 35.97/6.41 % (3720698)Termination phase: Finite model building constraint generation
% 35.97/6.41 % (3720698)Time elapsed: 3.310 s
% 35.97/6.41 % (3720698)Peak memory usage: 557 MB
% 35.97/6.41 % (3720698)Instructions burned: 9515 (million)
% 35.97/6.41 % (3720710)ott-2_1_sil=16000:newcnf=on:random_seed=3847936069:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2956 on theBenchmark for (2956ds/869Mi)
% 35.97/6.41 % (3720706)Instruction limit reached!
% 35.97/6.41 % (3720706)------------------------------
% 35.97/6.41 % (3720706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720706)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720706)Termination reason: Instruction limit
% 35.97/6.41 % (3720706)Termination phase: Finite model building constraint generation
% 35.97/6.41 % (3720706)Time elapsed: 2.348 s
% 35.97/6.41 % (3720706)Peak memory usage: 517 MB
% 35.97/6.41 % (3720706)Instructions burned: 6324 (million)
% 35.97/6.41 % (3720712)ott+10_1_sil=32000:tgt=ground:random_seed=4142786478:i=5114:av=off_2956 on theBenchmark for (2956ds/5114Mi)
% 35.97/6.41 % (3720708)Instruction limit reached!
% 35.97/6.41 % (3720708)------------------------------
% 35.97/6.41 % (3720708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720708)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720708)Termination reason: Instruction limit
% 35.97/6.41 % (3720708)Termination phase: Finite model building constraint generation
% 35.97/6.41 % (3720708)Time elapsed: 0.749 s
% 35.97/6.41 % (3720708)Peak memory usage: 138 MB
% 35.97/6.41 % (3720708)Instructions burned: 2175 (million)
% 35.97/6.41 % (3720714)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=270404824:i=54282_2953 on theBenchmark for (2953ds/54282Mi)
% 35.97/6.41 % TRYING [1]
% 35.97/6.41 % TRYING [2]
% 35.97/6.41 % TRYING [3]
% 35.97/6.41 % TRYING [4]
% 35.97/6.41 % TRYING [5]
% 35.97/6.41 % (3720710)Instruction limit reached!
% 35.97/6.41 % (3720710)------------------------------
% 35.97/6.41 % (3720710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720710)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720710)Termination reason: Instruction limit
% 35.97/6.41 % (3720710)Termination phase: Saturation
% 35.97/6.41 % (3720710)Time elapsed: 0.468 s
% 35.97/6.41 % (3720710)Peak memory usage: 23 MB
% 35.97/6.41 % (3720710)Instructions burned: 869 (million)
% 35.97/6.41 % (3720716)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=3400137567:i=3512:aac=none_2952 on theBenchmark for (2952ds/3512Mi)
% 35.97/6.41 % TRYING [6]
% 35.97/6.41 % TRYING [7]
% 35.97/6.41 % TRYING [10]
% 35.97/6.41 % (3720696)Instruction limit reached!
% 35.97/6.41 % (3720696)------------------------------
% 35.97/6.41 % (3720696)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.41 % (3720696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.41 % (3720696)CaDiCaL version: 2.1.3
% 35.97/6.41 % (3720696)Termination reason: Instruction limit
% 35.97/6.41 % (3720696)Termination phase: Finite model building SAT solving
% 35.97/6.41 % (3720696)Time elapsed: 4.794 s
% 35.97/6.41 % (3720696)Peak memory usage: 154 MB
% 35.97/6.41 % (3720696)Instructions burned: 22063 (million)
% 35.97/6.41 % (3720718)dis+21_1_sil=32000:sas=cadical:random_seed=4004095163:i=3773:amm=off_2945 on theBenchmark for (2945ds/3773Mi)
% 35.97/6.41 % TRYING [8]
% 35.97/6.41 % (3720712) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3720657-3720712"...
% 35.97/6.41 % (3720712)...printing done.
% 35.97/6.41 % (3720712)Refutation found. Thanks to Tanya!
% 35.97/6.41 % SZS status Theorem for theBenchmark
% 35.97/6.41 % SZS output start Proof for theBenchmark
% See solution above
% 35.97/6.42 % (3720712)------------------------------
% 35.97/6.42 % (3720712)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.97/6.42 % (3720712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.97/6.42 % (3720712)CaDiCaL version: 2.1.3
% 35.97/6.42 % (3720712)Termination reason: Refutation
% 35.97/6.42 % (3720712)Time elapsed: 1.732 s
% 35.97/6.42 % (3720712)Peak memory usage: 48 MB
% 35.97/6.42 % (3720712)Instructions burned: 3225 (million)
% 35.97/6.42 % (3720657)Success in time 6.187 s
% 35.97/6.42 % Vampire exiting
%------------------------------------------------------------------------------