%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC311+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:24 PM UTC 2026
% Result : Theorem 3.02s 1.07s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 9
% Syntax : Number of formulae : 79 ( 12 unt; 0 def)
% Number of atoms : 425 ( 159 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 604 ( 258 ~; 259 |; 63 &)
% ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 106 ( 86 !; 20 ?)
% 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(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
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
| ( nil != X2
& nil = X3 )
| ( ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X3) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X3) = X7
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X1
& app(X9,cons(X8,nil)) = X0 ) ) ) ) ) ) ) ) ),
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
| ( nil != X2
& nil = X3 )
| ( ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X3) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X3) = X7
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X1
& app(X9,cons(X8,nil)) = X0 ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X3) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X3) != X7
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X1
| app(X9,cons(X8,nil)) != X0 ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X3) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X3) != X7
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X1
| app(X9,cons(X8,nil)) != X0 ) ) ) )
& 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(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
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
& ( nil = sK2
| nil != sK3 )
& ( ! [X4] :
( ~ ssList(X4)
| sK2 = X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(sK3) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3) )
| ~ neq(nil,sK3) ) ) )
| ~ neq(sK3,nil) )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK1
| app(X9,cons(X8,nil)) != sK0 ) ) ) )
& 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(f149,plain,
ssList(sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f150,plain,
ssList(sK3),
inference(cnf_transformation,[],[f138]) ).
fof(f152,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f138]) ).
fof(f153,plain,
! [X8,X9] :
( nil = sK1
| ~ ssItem(X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK1
| app(X9,cons(X8,nil)) != sK0 ),
inference(cnf_transformation,[],[f138]) ).
fof(f154,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f138]) ).
fof(f155,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)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f138]) ).
fof(f156,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f138]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f169,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f175,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f180,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f181,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f182,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f185,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f190,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f197,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f198,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f154,f158,f158]) ).
fof(f199,plain,
! [X8,X9] :
( app(cons(X8,nil),X9) != sK3
| ~ ssItem(X8)
| ~ ssList(X9)
| nil = sK3
| app(X9,cons(X8,nil)) != sK2 ),
inference(definition_unfolding,[],[f153,f158,f158,f157]) ).
fof(f200,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f152,f157,f158]) ).
fof(f204,plain,
! [X6,X7,X4] :
( ~ ssList(X4)
| sK2 = X4
| ~ ssList(tl(sK3))
| ~ ssList(X6)
| app(tl(sK3),X6) != X4
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f155]) ).
fof(f205,plain,
! [X6,X7] :
( ~ ssList(app(tl(sK3),X6))
| sK2 = app(tl(sK3),X6)
| ~ ssList(tl(sK3))
| ~ ssList(X6)
| ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f204]) ).
fof(f206,plain,
! [X7] :
( ~ ssList(app(tl(sK3),cons(X7,nil)))
| sK2 = app(tl(sK3),cons(X7,nil))
| ~ ssList(tl(sK3))
| ~ ssList(cons(X7,nil))
| ~ ssItem(X7)
| hd(sK3) != X7
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f205]) ).
fof(f207,plain,
( ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| sK2 = app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f206]) ).
fof(f210,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f181]) ).
fof(f213,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f210]) ).
fof(f215,plain,
( sK2 = app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f207]) ).
fof(f340,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssItem(X0)
| ~ ssList(X1)
| nil = sK3
| sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f199,f175]) ).
fof(f347,plain,
! [X0,X1] :
( sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| nil = sK3
| cons(X0,X1) != sK3 ),
inference(duplicate_literal_removal,[],[f340]) ).
fof(f351,plain,
( sK2 != sK2
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| nil = sK3
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f347,f215]) ).
fof(f361,plain,
( sK2 != sK2
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| nil = sK3
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f351]) ).
fof(f362,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| nil = sK3
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(trivial_inequality_removal,[],[f361]) ).
fof(f366,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| nil = sK3
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f362,f198]) ).
fof(f367,plain,
( sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(tl(sK3))
| nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f366,f180]) ).
fof(f697,plain,
( sK3 != sK3
| ~ ssList(tl(sK3))
| nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f367,f192]) ).
fof(f698,plain,
( sK3 != sK3
| ~ ssList(tl(sK3))
| nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f697]) ).
fof(f699,plain,
( ~ ssList(tl(sK3))
| nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f698]) ).
fof(f702,plain,
( nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f699,f197]) ).
fof(f703,plain,
( nil = sK3
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f702,f190]) ).
fof(f704,plain,
( ~ ssList(cons(hd(sK3),nil))
| nil = sK3
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f703,f150]) ).
fof(f719,plain,
( nil = sK3
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f704,f169]) ).
fof(f723,plain,
( ~ neq(nil,sK3)
| nil = sK3
| ~ ssItem(hd(sK3)) ),
inference(forward_subsumption_resolution,[],[f719,f185]) ).
fof(f725,plain,
( nil = sK3
| ~ ssItem(hd(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(resolution,[],[f723,f182]) ).
fof(f726,plain,
( nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f725]) ).
fof(f728,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f726,f190]) ).
fof(f729,plain,
( nil = sK3
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f728,f150]) ).
fof(f730,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f729,f185]) ).
fof(f743,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(superposition,[],[f156,f730]) ).
fof(f748,plain,
( sK2 != sK3
| neq(sK3,sK3) ),
inference(superposition,[],[f200,f730]) ).
fof(f758,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f743]) ).
fof(f827,plain,
neq(sK3,sK3),
inference(forward_subsumption_resolution,[],[f748,f758]) ).
fof(f828,plain,
neq(sK2,sK2),
inference(forward_demodulation,[],[f827,f758]) ).
fof(f835,plain,
~ ssList(sK2),
inference(resolution,[],[f828,f213]) ).
fof(f837,plain,
$false,
inference(forward_subsumption_resolution,[],[f835,f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC311+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.08/0.18 % Computer : n009.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:00:30 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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.02/1.07 % (2900616)Detected formulas, will run a generic FOF schedule.
% 3.02/1.07 % (2900622)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=367240985:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.02/1.07 % (2900625)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2301053415:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.02/1.07 % (2900626)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4097310255:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.02/1.07 % (2900624)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=611511599:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.02/1.07 % (2900623)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=916863362:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.02/1.07 % (2900621)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=2065398829:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.02/1.07 % (2900627)dis-21_1_sil=8000:lcm=predicate:random_seed=2950329686: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.02/1.07 % (2900625)First to succeed.
% 3.02/1.07 % (2900625)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2900616"
% 3.02/1.07 % (2900626)Also succeeded, but the first one will report.
% 3.02/1.07 % (2900624)Instruction limit reached!
% 3.02/1.07 % (2900624)------------------------------
% 3.02/1.07 % (2900624)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.07 % (2900624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.07 % (2900624)CaDiCaL version: 2.1.3
% 3.02/1.07 % (2900624)Termination reason: Instruction limit
% 3.02/1.07 % (2900624)Termination phase: Saturation
% 3.02/1.07 % (2900624)Time elapsed: 0.064 s
% 3.02/1.07 % (2900624)Peak memory usage: 89 MB
% 3.02/1.07 % (2900624)Instructions burned: 109 (million)
% 3.02/1.07 % (2900627)Instruction limit reached!
% 3.02/1.07 % (2900627)------------------------------
% 3.02/1.07 % (2900627)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.07 % (2900627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.07 % (2900627)CaDiCaL version: 2.1.3
% 3.02/1.07 % (2900627)Termination reason: Instruction limit
% 3.02/1.07 % (2900627)Termination phase: Saturation
% 3.02/1.07 % (2900627)Time elapsed: 0.073 s
% 3.02/1.07 % (2900627)Peak memory usage: 90 MB
% 3.02/1.07 % (2900627)Instructions burned: 130 (million)
% 3.02/1.07 % (2900635)lrs+10_1_sil=8000:sp=occurrence:random_seed=581555529:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.02/1.07 % (2900636)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4225421322:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.02/1.07 % (2900636)Also succeeded, but the first one will report.
% 3.02/1.07 % (2900625)Refutation found. Thanks to Tanya!
% 3.02/1.07 % SZS status Theorem for theBenchmark
% 3.02/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.27 % (2900625)------------------------------
% 3.50/1.27 % (2900625)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.27 % (2900625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.27 % (2900625)CaDiCaL version: 2.1.3
% 3.50/1.27 % (2900625)Termination reason: Refutation
% 3.50/1.27 % (2900625)Time elapsed: 0.018 s
% 3.50/1.27 % (2900625)Peak memory usage: 88 MB
% 3.50/1.27 % (2900625)Instructions burned: 31 (million)
% 3.50/1.27 % (2900625)------------------------------
% 3.50/1.27 % (2900625)------------------------------
% 3.50/1.27 % (2900616)Success in time 0.413 s
% 3.50/1.27 % Vampire exiting
%------------------------------------------------------------------------------