%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC308+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 : n009.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:23 PM UTC 2026
% Result : Theorem 2.95s 1.08s
% Output : Refutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 9
% Syntax : Number of formulae : 80 ( 12 unt; 0 def)
% Number of atoms : 400 ( 163 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 552 ( 232 ~; 236 |; 60 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 91 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( ssItem(X1)
& hd(X0) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
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
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X0 = X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X1) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X1) = X7
& neq(nil,X1) )
& neq(nil,X1) ) ) )
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) != X2
& app(cons(X8,nil),X9) = X3 ) )
| ( 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
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X0 = X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X1) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X1) = X7
& neq(nil,X1) )
& neq(nil,X1) ) ) )
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) != X2
& app(cons(X8,nil),X9) = X3 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X0 != X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X1) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ neq(nil,X1) ) ) )
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) = X2
| app(cons(X8,nil),X9) != X3 ) )
& ( 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
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X0 != X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X1) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X1) != X7
| ~ neq(nil,X1) )
| ~ neq(nil,X1) ) ) )
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) = X2
| app(cons(X8,nil),X9) != X3 ) )
& ( nil = X2
| nil != X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f122,plain,
! [X0] :
( ? [X1] :
( ssItem(X1)
& hd(X0) = X1 )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f123,plain,
! [X0] :
( ? [X1] :
( ssItem(X1)
& hd(X0) = X1 )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f122]) ).
fof(f125,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f129,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f130,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f136,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f137,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f136]) ).
fof(f138,plain,
( sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssList(X4)
| sK0 != X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(sK1) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK1) != X7
| ~ neq(nil,sK1) )
| ~ neq(nil,sK1) ) ) )
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) = sK2
| app(cons(X8,nil),X9) != sK3 ) )
& ( nil = sK2
| nil != sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f145,plain,
! [X0] :
( ( ssItem(sK8(X0))
& hd(X0) = sK8(X0) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X1,sK8(X0))],[f123]) ).
fof(f149,plain,
ssList(sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f150,plain,
ssList(sK3),
inference(cnf_transformation,[],[f138]) ).
fof(f152,plain,
! [X8,X9] :
( app(cons(X8,nil),X9) != sK3
| ~ ssList(X9)
| app(X9,cons(X8,nil)) = sK2
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f138]) ).
fof(f153,plain,
! [X6,X7,X4,X5] :
( ~ ssList(X4)
| sK0 != X4
| ~ ssList(X5)
| ~ ssList(X6)
| tl(sK1) != X5
| app(X5,X6) != X4
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK1) != X7
| ~ neq(nil,sK1)
| ~ neq(nil,sK1) ),
inference(cnf_transformation,[],[f138]) ).
fof(f154,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f138]) ).
fof(f155,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f167,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f173,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f179,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f180,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f183,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f185,plain,
! [X0] :
( hd(X0) = sK8(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f186,plain,
! [X0] :
( ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f188,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f190,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f195,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f196,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f154,f156]) ).
fof(f197,plain,
! [X6,X7,X4,X5] :
( ~ ssList(X4)
| sK2 != X4
| ~ ssList(X5)
| ~ ssList(X6)
| tl(sK3) != X5
| app(X5,X6) != X4
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3) ),
inference(definition_unfolding,[],[f153,f155,f156,f156,f156,f156]) ).
fof(f200,plain,
! [X6,X7,X5] :
( ~ ssList(sK2)
| ~ ssList(X5)
| ~ ssList(X6)
| tl(sK3) != X5
| app(X5,X6) != sK2
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3) ),
inference(equality_resolution,[],[f197]) ).
fof(f201,plain,
! [X6,X7] :
( ~ ssList(sK2)
| ~ ssList(tl(sK3))
| ~ ssList(X6)
| sK2 != app(tl(sK3),X6)
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3) ),
inference(equality_resolution,[],[f200]) ).
fof(f202,plain,
! [X7] :
( ~ ssList(sK2)
| ~ ssList(tl(sK3))
| ~ ssList(cons(X7,nil))
| sK2 != app(tl(sK3),cons(X7,nil))
| ~ ssItem(X7)
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3) ),
inference(equality_resolution,[],[f201]) ).
fof(f203,plain,
( ~ ssList(sK2)
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| sK2 != app(tl(sK3),cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(nil,sK3) ),
inference(equality_resolution,[],[f202]) ).
fof(f206,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f179]) ).
fof(f209,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f206]) ).
fof(f211,plain,
( ~ ssList(sK2)
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| sK2 != app(tl(sK3),cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(duplicate_literal_removal,[],[f203]) ).
fof(f212,plain,
( sK2 != app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f211,f149]) ).
fof(f227,plain,
( sK2 != app(tl(sK3),cons(sK8(sK3),nil))
| ~ ssList(cons(sK8(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssItem(sK8(sK3))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f212,f185]) ).
fof(f230,plain,
( sK2 != app(tl(sK3),cons(sK8(sK3),nil))
| ~ ssList(cons(sK8(sK3),nil))
| ~ ssItem(sK8(sK3))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f227,f195]) ).
fof(f231,plain,
( sK2 != app(tl(sK3),cons(sK8(sK3),nil))
| ~ ssList(cons(sK8(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f230,f186]) ).
fof(f232,plain,
( sK2 != app(tl(sK3),cons(sK8(sK3),nil))
| ~ ssList(cons(sK8(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f231,f150]) ).
fof(f302,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f152,f173]) ).
fof(f309,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f302]) ).
fof(f311,plain,
! [X0] :
( sK3 != X0
| ~ ssList(tl(X0))
| sK2 = app(tl(X0),cons(hd(X0),nil))
| ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f309,f190]) ).
fof(f312,plain,
! [X0] :
( sK3 != X0
| sK2 = app(tl(X0),cons(hd(X0),nil))
| ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f311,f195]) ).
fof(f314,plain,
! [X0] :
( sK3 != X0
| sK2 = app(tl(X0),cons(hd(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f312,f188]) ).
fof(f316,plain,
( sK2 = app(tl(sK3),cons(hd(sK3),nil))
| nil = sK3
| ~ ssList(sK3) ),
inference(equality_resolution,[],[f314]) ).
fof(f317,plain,
( sK2 = app(tl(sK3),cons(hd(sK3),nil))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f316,f150]) ).
fof(f331,plain,
( sK2 = app(tl(sK3),cons(sK8(sK3),nil))
| nil = sK3
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f317,f185]) ).
fof(f338,plain,
( sK2 = app(tl(sK3),cons(sK8(sK3),nil))
| nil = sK3
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f331]) ).
fof(f340,plain,
( sK2 = app(tl(sK3),cons(sK8(sK3),nil))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f338,f150]) ).
fof(f363,plain,
( sK2 != sK2
| ~ ssList(cons(sK8(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| nil = sK3 ),
inference(superposition,[],[f232,f340]) ).
fof(f370,plain,
( sK2 != sK2
| ~ ssList(cons(sK8(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3 ),
inference(duplicate_literal_removal,[],[f363]) ).
fof(f371,plain,
( ~ ssList(cons(sK8(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3 ),
inference(trivial_inequality_removal,[],[f370]) ).
fof(f374,plain,
( ~ neq(nil,sK3)
| nil = sK3
| ~ ssItem(sK8(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f371,f167]) ).
fof(f375,plain,
( ~ neq(nil,sK3)
| nil = sK3
| ~ ssItem(sK8(sK3)) ),
inference(forward_subsumption_resolution,[],[f374,f183]) ).
fof(f399,plain,
( nil = sK3
| ~ ssItem(sK8(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(resolution,[],[f375,f180]) ).
fof(f400,plain,
( nil = sK3
| ~ ssItem(sK8(sK3))
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f399]) ).
fof(f402,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f400,f186]) ).
fof(f403,plain,
( nil = sK3
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f402,f150]) ).
fof(f404,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f403,f183]) ).
fof(f465,plain,
neq(sK3,sK3),
inference(superposition,[],[f196,f404]) ).
fof(f469,plain,
~ ssList(sK3),
inference(resolution,[],[f465,f209]) ).
fof(f471,plain,
$false,
inference(forward_subsumption_resolution,[],[f469,f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC308+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n009.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:00:15 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.24 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
% 2.95/1.08 % (2900192)Detected formulas, will run a generic FOF schedule.
% 2.95/1.08 % (2900198)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=1069457507:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.95/1.08 % (2900201)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3943207460:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.95/1.08 % (2900200)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1438308188:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.95/1.08 % (2900197)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=1945520254:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.95/1.08 % (2900199)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=2125539496:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.95/1.08 % (2900201)First to succeed.
% 2.95/1.08 % (2900201)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2900192"
% 2.95/1.08 % (2900203)dis-21_1_sil=8000:lcm=predicate:random_seed=2526095781: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)
% 2.95/1.08 % (2900202)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1473601384:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.95/1.08 % (2900202)Also succeeded, but the first one will report.
% 2.95/1.08 % (2900200)Instruction limit reached!
% 2.95/1.08 % (2900200)------------------------------
% 2.95/1.08 % (2900200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.08 % (2900200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.08 % (2900200)CaDiCaL version: 2.1.3
% 2.95/1.08 % (2900200)Termination reason: Instruction limit
% 2.95/1.08 % (2900200)Termination phase: Saturation
% 2.95/1.08 % (2900200)Time elapsed: 0.064 s
% 2.95/1.08 % (2900200)Peak memory usage: 89 MB
% 2.95/1.08 % (2900200)Instructions burned: 109 (million)
% 2.95/1.08 % (2900203)Instruction limit reached!
% 2.95/1.08 % (2900203)------------------------------
% 2.95/1.08 % (2900203)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.08 % (2900203)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.08 % (2900203)CaDiCaL version: 2.1.3
% 2.95/1.08 % (2900203)Termination reason: Instruction limit
% 2.95/1.08 % (2900203)Termination phase: Saturation
% 2.95/1.08 % (2900203)Time elapsed: 0.073 s
% 2.95/1.08 % (2900203)Peak memory usage: 90 MB
% 2.95/1.08 % (2900203)Instructions burned: 130 (million)
% 2.95/1.08 % (2900211)lrs+10_1_sil=8000:sp=occurrence:random_seed=786169315:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.95/1.08 % (2900212)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1787980979:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.95/1.08 % (2900201)Refutation found. Thanks to Tanya!
% 2.95/1.08 % SZS status Theorem for theBenchmark
% 2.95/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.39/1.17 % (2900201)------------------------------
% 3.39/1.17 % (2900201)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.17 % (2900201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.17 % (2900201)CaDiCaL version: 2.1.3
% 3.39/1.17 % (2900201)Termination reason: Refutation
% 3.39/1.17 % (2900201)Time elapsed: 0.010 s
% 3.39/1.17 % (2900201)Peak memory usage: 88 MB
% 3.39/1.17 % (2900201)Instructions burned: 15 (million)
% 3.39/1.17 % (2900201)------------------------------
% 3.39/1.17 % (2900201)------------------------------
% 3.39/1.17 % (2900192)Success in time 0.404 s
% 3.39/1.17 % Vampire exiting
%------------------------------------------------------------------------------