%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC149+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 : n003.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:02:40 PM UTC 2026
% Result : Theorem 2.61s 1.30s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 8
% Syntax : Number of formulae : 77 ( 12 unt; 0 def)
% Number of atoms : 334 ( 100 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 443 ( 186 ~; 187 |; 47 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 131 ( 107 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
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(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(f27,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,app(X1,X0)) = app(cons(X2,X1),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax27) ).
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] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(app(cons(X4,nil),cons(X5,nil)),X6) = X3 ) ) )
| singletonP(X1) ) ) ) ) ),
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] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(app(cons(X4,nil),cons(X5,nil)),X6) = X3 ) ) )
| singletonP(X1) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != X3 ) ) )
& ~ singletonP(X1)
& 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] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != X3 ) ) )
& ~ singletonP(X1)
& 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(f116,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f121,plain,
( sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != sK3 ) ) )
& ~ singletonP(sK1)
& 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(f123,plain,
! [X0] :
( nil = X0
| ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f102]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f128,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f129,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK8(X0))
& cons(sK8(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0))],[f129]) ).
fof(f134,plain,
ssList(sK3),
inference(cnf_transformation,[],[f121]) ).
fof(f135,plain,
~ singletonP(sK1),
inference(cnf_transformation,[],[f121]) ).
fof(f136,plain,
! [X6,X4,X5] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != sK3
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f121]) ).
fof(f137,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f121]) ).
fof(f139,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f121]) ).
fof(f144,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f145,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f146,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f150,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f156,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f160,plain,
! [X2,X0,X1] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f162,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f166,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f168,plain,
! [X0] :
( cons(sK8(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f169,plain,
! [X0] :
( ssItem(sK8(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f170,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(X1)
| cons(X1,nil) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f171,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f137,f139]) ).
fof(f172,plain,
~ singletonP(sK3),
inference(definition_unfolding,[],[f135,f139]) ).
fof(f177,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f162]) ).
fof(f179,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f170]) ).
fof(f181,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f177]) ).
fof(f199,plain,
! [X2,X0,X1] :
( sK3 != app(app(cons(X1,nil),X0),X2)
| ~ ssItem(sK8(X0))
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f136,f168]) ).
fof(f207,plain,
! [X2,X0,X1] :
( sK3 != app(app(cons(X1,nil),X0),X2)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f199,f169]) ).
fof(f250,plain,
! [X2,X0,X1] :
( sK3 != app(cons(X0,X1),X2)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f207,f156]) ).
fof(f263,plain,
! [X2,X0,X1] :
( sK3 != app(cons(X0,X1),X2)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f250]) ).
fof(f397,plain,
! [X2,X0,X1] :
( sK3 != cons(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(superposition,[],[f263,f160]) ).
fof(f423,plain,
! [X2,X0,X1] :
( sK3 != cons(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f397]) ).
fof(f458,plain,
! [X2,X0,X1] :
( sK3 != cons(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f423,f156]) ).
fof(f465,plain,
! [X2,X0,X1] :
( sK3 != cons(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f458]) ).
fof(f469,plain,
! [X2,X0,X1] :
( sK3 != cons(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f465,f179]) ).
fof(f528,plain,
! [X0,X1] :
( cons(X1,X0) != sK3
| ~ ssList(sK6(X0))
| ~ ssItem(X1)
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f469,f144]) ).
fof(f530,plain,
! [X0,X1] :
( cons(X1,X0) != sK3
| ~ ssItem(X1)
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f528,f146]) ).
fof(f531,plain,
! [X0,X1] :
( cons(X1,X0) != sK3
| ~ ssItem(X1)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f530,f145]) ).
fof(f537,plain,
! [X0] :
( sK3 != X0
| ~ ssItem(sK7(X0))
| ~ ssList(cons(sK7(sK6(X0)),nil))
| nil = sK6(X0)
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f531,f144]) ).
fof(f538,plain,
! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(sK6(X0)),nil))
| nil = sK6(X0)
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f537,f145]) ).
fof(f539,plain,
! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(sK6(X0)),nil))
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f538,f146]) ).
fof(f595,plain,
( ~ ssList(cons(sK7(sK6(sK3)),nil))
| nil = sK6(sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(equality_resolution,[],[f539]) ).
fof(f596,plain,
( ~ ssList(cons(sK7(sK6(sK3)),nil))
| nil = sK6(sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f595,f134]) ).
fof(f597,plain,
( nil = sK6(sK3)
| nil = sK3
| ~ ssItem(sK7(sK6(sK3)))
| ~ ssList(nil) ),
inference(resolution,[],[f596,f150]) ).
fof(f598,plain,
( ~ ssItem(sK7(sK6(sK3)))
| nil = sK3
| nil = sK6(sK3) ),
inference(forward_subsumption_resolution,[],[f597,f166]) ).
fof(f604,plain,
( nil = sK3
| nil = sK6(sK3)
| nil = sK6(sK3)
| ~ ssList(sK6(sK3)) ),
inference(resolution,[],[f598,f145]) ).
fof(f605,plain,
( nil = sK6(sK3)
| nil = sK3
| ~ ssList(sK6(sK3)) ),
inference(duplicate_literal_removal,[],[f604]) ).
fof(f618,plain,
( sK3 = cons(sK7(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| nil = sK3
| ~ ssList(sK6(sK3)) ),
inference(superposition,[],[f144,f605]) ).
fof(f621,plain,
( sK3 = cons(sK7(sK3),nil)
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(sK6(sK3)) ),
inference(duplicate_literal_removal,[],[f618]) ).
fof(f624,plain,
( sK3 = cons(sK7(sK3),nil)
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f621,f146]) ).
fof(f625,plain,
( sK3 = cons(sK7(sK3),nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f624,f134]) ).
fof(f630,plain,
( singletonP(sK3)
| ~ ssItem(sK7(sK3))
| ~ ssList(sK3)
| nil = sK3 ),
inference(superposition,[],[f179,f625]) ).
fof(f669,plain,
( singletonP(sK3)
| ~ ssList(sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f630,f145]) ).
fof(f674,plain,
( ~ ssList(sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f669,f172]) ).
fof(f675,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f674,f134]) ).
fof(f683,plain,
neq(sK3,sK3),
inference(superposition,[],[f171,f675]) ).
fof(f696,plain,
~ ssList(sK3),
inference(resolution,[],[f683,f181]) ).
fof(f698,plain,
$false,
inference(forward_subsumption_resolution,[],[f696,f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC149+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.09/0.38 % Computer : n003.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Mon Sep 28 08:11:12 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.61/1.30 % (1424629)Detected formulas, will run a generic FOF schedule.
% 2.61/1.30 % (1424635)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=2028556291:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.61/1.30 % (1424638)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1374864775:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.61/1.30 % (1424637)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2965066710:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.61/1.30 % (1424634)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=3010148675:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.61/1.30 % (1424640)dis-21_1_sil=8000:lcm=predicate:random_seed=2005554784: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.61/1.30 % (1424636)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=263220421:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.61/1.30 % (1424639)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=93656438:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.61/1.30 % (1424638)First to succeed.
% 2.61/1.30 % (1424638)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1424629"
% 2.61/1.30 % (1424639)Also succeeded, but the first one will report.
% 2.61/1.30 % (1424637)Instruction limit reached!
% 2.61/1.30 % (1424637)------------------------------
% 2.61/1.30 % (1424637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1424637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1424637)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1424637)Termination reason: Instruction limit
% 2.61/1.30 % (1424637)Termination phase: Saturation
% 2.61/1.30 % (1424637)Time elapsed: 0.068 s
% 2.61/1.30 % (1424637)Peak memory usage: 89 MB
% 2.61/1.30 % (1424637)Instructions burned: 110 (million)
% 2.61/1.30 % (1424640)Instruction limit reached!
% 2.61/1.30 % (1424640)------------------------------
% 2.61/1.30 % (1424640)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1424640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1424640)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1424640)Termination reason: Instruction limit
% 2.61/1.30 % (1424640)Termination phase: Saturation
% 2.61/1.30 % (1424640)Time elapsed: 0.072 s
% 2.61/1.30 % (1424640)Peak memory usage: 90 MB
% 2.61/1.30 % (1424640)Instructions burned: 130 (million)
% 2.61/1.30 % (1424648)lrs+10_1_sil=8000:sp=occurrence:random_seed=1381951659:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.61/1.30 % (1424649)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1684827734:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.61/1.30 % (1424638)Refutation found. Thanks to Tanya!
% 2.61/1.30 % SZS status Theorem for theBenchmark
% 2.61/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.50 % (1424638)------------------------------
% 3.62/1.50 % (1424638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.50 % (1424638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.50 % (1424638)CaDiCaL version: 2.1.3
% 3.62/1.50 % (1424638)Termination reason: Refutation
% 3.62/1.50 % (1424638)Time elapsed: 0.014 s
% 3.62/1.50 % (1424638)Peak memory usage: 88 MB
% 3.62/1.50 % (1424638)Instructions burned: 21 (million)
% 3.62/1.50 % (1424638)------------------------------
% 3.62/1.50 % (1424638)------------------------------
% 3.62/1.50 % (1424629)Success in time 0.446 s
% 3.62/1.50 % Vampire exiting
%------------------------------------------------------------------------------