%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC409+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:03:51 PM UTC 2026
% Result : Theorem 3.07s 1.10s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 7
% Syntax : Number of formulae : 79 ( 14 unt; 0 def)
% Number of atoms : 393 ( 114 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 508 ( 194 ~; 235 |; 54 &)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 121 ( 101 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
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/theBenchmark.p',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/theBenchmark.p',ax37) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) != X2
& app(cons(X4,nil),X5) = X3 ) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| memberP(X0,X6) ) )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
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)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) != X2
& app(cons(X4,nil),X5) = X3 ) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| memberP(X0,X6) ) )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2
| app(cons(X4,nil),X5) != X3 ) )
& ? [X6] :
( memberP(X1,X6)
& ~ memberP(X0,X6)
& ssItem(X6) )
& ( nil = X2
| nil != X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2
| app(cons(X4,nil),X5) != X3 ) )
& ? [X6] :
( memberP(X1,X6)
& ~ memberP(X0,X6)
& ssItem(X6) )
& ( nil = X2
| nil != X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f102,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f119,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(f120,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(f122,plain,
( sK1 = sK3
& sK0 = sK2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X5,cons(X4,nil)) = sK2
| app(cons(X4,nil),X5) != sK3 ) )
& memberP(sK1,sK4)
& ~ memberP(sK0,sK4)
& ssItem(sK4)
& ( nil = sK2
| nil != sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X6,sK4)],[f99]) ).
fof(f124,plain,
! [X0] :
( nil = X0
| ( ssList(sK7(X0))
& ssItem(sK8(X0))
& cons(sK8(X0),sK7(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0))],[f102]) ).
fof(f127,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,[],[f119]) ).
fof(f128,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,[],[f127]) ).
fof(f129,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,[],[f120]) ).
fof(f130,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,[],[f129]) ).
fof(f137,plain,
ssList(sK3),
inference(cnf_transformation,[],[f122]) ).
fof(f138,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f122]) ).
fof(f139,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f140,plain,
~ memberP(sK0,sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f141,plain,
memberP(sK1,sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f142,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK3
| ~ ssList(X5)
| app(X5,cons(X4,nil)) = sK2
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f122]) ).
fof(f143,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f122]) ).
fof(f144,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f149,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f150,plain,
! [X0] :
( ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f151,plain,
! [X0] :
( ssList(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f155,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f161,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f167,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| memberP(X2,X0)
| X0 = X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f171,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f173,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f174,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f179,plain,
memberP(sK3,sK4),
inference(definition_unfolding,[],[f141,f144]) ).
fof(f180,plain,
~ memberP(sK2,sK4),
inference(definition_unfolding,[],[f140,f143]) ).
fof(f185,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f171]) ).
fof(f187,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f185]) ).
fof(f208,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f142,f161]) ).
fof(f215,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f208]) ).
fof(f219,plain,
! [X0] :
( sK3 != X0
| ~ ssList(sK7(X0))
| sK2 = app(sK7(X0),cons(sK8(X0),nil))
| ~ ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f215,f149]) ).
fof(f220,plain,
! [X0] :
( sK3 != X0
| sK2 = app(sK7(X0),cons(sK8(X0),nil))
| ~ ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f219,f151]) ).
fof(f221,plain,
! [X0] :
( sK3 != X0
| sK2 = app(sK7(X0),cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f220,f150]) ).
fof(f222,plain,
( sK2 = app(sK7(sK3),cons(sK8(sK3),nil))
| nil = sK3
| ~ ssList(sK3) ),
inference(equality_resolution,[],[f221]) ).
fof(f223,plain,
( sK2 = app(sK7(sK3),cons(sK8(sK3),nil))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f222,f137]) ).
fof(f230,plain,
! [X0] :
( ~ memberP(cons(sK8(sK3),nil),X0)
| memberP(sK2,X0)
| ~ ssList(cons(sK8(sK3),nil))
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3 ),
inference(superposition,[],[f173,f223]) ).
fof(f237,plain,
! [X0] :
( ~ ssList(cons(sK8(sK3),nil))
| ~ memberP(sK7(sK3),X0)
| memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3 ),
inference(superposition,[],[f174,f223]) ).
fof(f261,plain,
! [X0] :
( ~ memberP(sK7(sK3),X0)
| memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3
| ~ ssItem(sK8(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f237,f155]) ).
fof(f262,plain,
! [X0] :
( ~ memberP(sK7(sK3),X0)
| memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3
| ~ ssItem(sK8(sK3)) ),
inference(forward_subsumption_resolution,[],[f261,f167]) ).
fof(f331,plain,
( memberP(sK2,sK8(sK3))
| ~ ssList(cons(sK8(sK3),nil))
| ~ ssList(sK7(sK3))
| ~ ssItem(sK8(sK3))
| nil = sK3
| ~ ssList(nil)
| ~ ssItem(sK8(sK3)) ),
inference(resolution,[],[f230,f187]) ).
fof(f336,plain,
( memberP(sK2,sK8(sK3))
| ~ ssList(cons(sK8(sK3),nil))
| ~ ssList(sK7(sK3))
| ~ ssItem(sK8(sK3))
| nil = sK3
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f331]) ).
fof(f338,plain,
( memberP(sK2,sK8(sK3))
| ~ ssList(sK7(sK3))
| ~ ssItem(sK8(sK3))
| nil = sK3
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f336,f155]) ).
fof(f339,plain,
( memberP(sK2,sK8(sK3))
| ~ ssList(sK7(sK3))
| ~ ssItem(sK8(sK3))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f338,f167]) ).
fof(f396,plain,
! [X0,X1] :
( ~ memberP(X0,X1)
| memberP(sK7(X0),X1)
| sK8(X0) = X1
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(X1)
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f169,f149]) ).
fof(f399,plain,
! [X0,X1] :
( ~ memberP(X0,X1)
| memberP(sK7(X0),X1)
| sK8(X0) = X1
| ~ ssItem(sK8(X0))
| ~ ssItem(X1)
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f396,f151]) ).
fof(f401,plain,
! [X0,X1] :
( memberP(sK7(X0),X1)
| ~ memberP(X0,X1)
| sK8(X0) = X1
| ~ ssItem(X1)
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f399,f150]) ).
fof(f1642,plain,
! [X0] :
( ~ memberP(sK3,X0)
| sK8(sK3) = X0
| ~ ssItem(X0)
| nil = sK3
| ~ ssList(sK3)
| memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3
| ~ ssItem(sK8(sK3)) ),
inference(resolution,[],[f401,f262]) ).
fof(f1645,plain,
! [X0] :
( ~ memberP(sK3,X0)
| sK8(sK3) = X0
| ~ ssItem(X0)
| nil = sK3
| ~ ssList(sK3)
| memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(sK8(sK3)) ),
inference(duplicate_literal_removal,[],[f1642]) ).
fof(f1646,plain,
! [X0] :
( ~ memberP(sK3,X0)
| sK8(sK3) = X0
| ~ ssItem(X0)
| nil = sK3
| ~ ssList(sK3)
| memberP(sK2,X0)
| ~ ssItem(sK8(sK3)) ),
inference(forward_subsumption_resolution,[],[f1645,f151]) ).
fof(f1647,plain,
! [X0] :
( ~ memberP(sK3,X0)
| sK8(sK3) = X0
| ~ ssItem(X0)
| nil = sK3
| ~ ssList(sK3)
| memberP(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f1646,f150]) ).
fof(f1648,plain,
! [X0] :
( sK8(sK3) = X0
| ~ memberP(sK3,X0)
| ~ ssItem(X0)
| nil = sK3
| memberP(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f1647,f137]) ).
fof(f1668,plain,
! [X0] :
( memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3
| ~ memberP(sK3,X0)
| ~ ssItem(X0)
| nil = sK3
| memberP(sK2,X0) ),
inference(superposition,[],[f339,f1648]) ).
fof(f1711,plain,
! [X0] :
( memberP(sK2,X0)
| ~ ssList(sK7(sK3))
| ~ ssItem(X0)
| nil = sK3
| ~ memberP(sK3,X0) ),
inference(duplicate_literal_removal,[],[f1668]) ).
fof(f1722,plain,
( ~ ssList(sK7(sK3))
| ~ ssItem(sK4)
| nil = sK3
| ~ memberP(sK3,sK4) ),
inference(resolution,[],[f1711,f180]) ).
fof(f1723,plain,
( ~ ssList(sK7(sK3))
| nil = sK3
| ~ memberP(sK3,sK4) ),
inference(forward_subsumption_resolution,[],[f1722,f139]) ).
fof(f1724,plain,
( ~ ssList(sK7(sK3))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f1723,f179]) ).
fof(f1737,plain,
( nil = sK3
| nil = sK3
| ~ ssList(sK3) ),
inference(resolution,[],[f1724,f151]) ).
fof(f1738,plain,
( nil = sK3
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f1737]) ).
fof(f1739,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f1738,f137]) ).
fof(f1740,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(superposition,[],[f138,f1739]) ).
fof(f1760,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f1740]) ).
fof(f1762,plain,
memberP(sK2,sK4),
inference(superposition,[],[f179,f1760]) ).
fof(f1822,plain,
$false,
inference(forward_subsumption_resolution,[],[f1762,f180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC409+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n010.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:32:02 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.10 % (1799997)Detected formulas, will run a generic FOF schedule.
% 3.07/1.10 % (1800005)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3720618206:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.07/1.10 % (1800007)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2764713140:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.07/1.10 % (1800006)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=551467974:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.07/1.10 % (1800008)dis-21_1_sil=8000:lcm=predicate:random_seed=3933263631:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.07/1.10 % (1800002)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2302055081:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.07/1.10 % (1800004)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2076914998:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.07/1.10 % (1800003)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=32599351:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.07/1.10 % (1800005)Instruction limit reached!
% 3.07/1.10 % (1800005)------------------------------
% 3.07/1.10 % (1800005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.10 % (1800005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.10 % (1800005)CaDiCaL version: 2.1.3
% 3.07/1.10 % (1800005)Termination reason: Instruction limit
% 3.07/1.10 % (1800005)Termination phase: Saturation
% 3.07/1.10 % (1800005)Time elapsed: 0.036 s
% 3.07/1.10 % (1800005)Peak memory usage: 89 MB
% 3.07/1.10 % (1800005)Instructions burned: 109 (million)
% 3.07/1.10 % (1800006)First to succeed.
% 3.07/1.10 % (1800006)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1799997"
% 3.07/1.10 % (1800008)Instruction limit reached!
% 3.07/1.10 % (1800008)------------------------------
% 3.07/1.10 % (1800008)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.10 % (1800008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.10 % (1800008)CaDiCaL version: 2.1.3
% 3.07/1.10 % (1800008)Termination reason: Instruction limit
% 3.07/1.10 % (1800008)Termination phase: Saturation
% 3.07/1.10 % (1800008)Time elapsed: 0.071 s
% 3.07/1.10 % (1800008)Peak memory usage: 90 MB
% 3.07/1.10 % (1800008)Instructions burned: 130 (million)
% 3.07/1.10 % (1800007)Instruction limit reached!
% 3.07/1.10 % (1800007)------------------------------
% 3.07/1.10 % (1800007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.10 % (1800007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.10 % (1800007)CaDiCaL version: 2.1.3
% 3.07/1.10 % (1800007)Termination reason: Instruction limit
% 3.07/1.10 % (1800007)Termination phase: Saturation
% 3.07/1.10 % (1800007)Time elapsed: 0.093 s
% 3.07/1.10 % (1800007)Peak memory usage: 90 MB
% 3.07/1.10 % (1800007)Instructions burned: 140 (million)
% 3.07/1.10 % (1800016)lrs+10_1_sil=8000:sp=occurrence:random_seed=4271725729:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.07/1.10 % (1800016)Instruction limit reached!
% 3.07/1.10 % (1800016)------------------------------
% 3.07/1.10 % (1800016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.10 % (1800016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.10 % (1800016)CaDiCaL version: 2.1.3
% 3.07/1.10 % (1800016)Termination reason: Instruction limit
% 3.07/1.10 % (1800016)Termination phase: Saturation
% 3.07/1.10 % (1800016)Time elapsed: 0.092 s
% 3.07/1.10 % (1800016)Peak memory usage: 92 MB
% 3.07/1.10 % (1800016)Instructions burned: 286 (million)
% 3.07/1.10 % (1800017)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1934865487:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.07/1.10 % (1800018)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1375697759:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.07/1.10 % (1800017)Instruction limit reached!
% 3.07/1.10 % (1800017)------------------------------
% 3.07/1.10 % (1800017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.10 % (1800017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.10 % (1800017)CaDiCaL version: 2.1.3
% 3.07/1.10 % (1800017)Termination reason: Instruction limit
% 3.07/1.10 % (1800017)Termination phase: Saturation
% 3.07/1.10 % (1800017)Time elapsed: 0.077 s
% 3.07/1.10 % (1800017)Peak memory usage: 93 MB
% 3.07/1.10 % (1800017)Instructions burned: 158 (million)
% 3.07/1.10 % (1800006)Refutation found. Thanks to Tanya!
% 3.07/1.10 % SZS status Theorem for theBenchmark
% 3.07/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.20 % (1800006)------------------------------
% 0.18/1.20 % (1800006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.20 % (1800006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.20 % (1800006)CaDiCaL version: 2.1.3
% 0.18/1.20 % (1800006)Termination reason: Refutation
% 0.18/1.20 % (1800006)Time elapsed: 0.042 s
% 0.18/1.20 % (1800006)Peak memory usage: 89 MB
% 0.18/1.20 % (1800006)Instructions burned: 72 (million)
% 0.18/1.20 % (1800006)------------------------------
% 0.18/1.20 % (1800006)------------------------------
% 0.18/1.20 % (1799997)Success in time 0.449 s
% 0.18/1.20 % Vampire exiting
%------------------------------------------------------------------------------