%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU142+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 12:47:23 PM UTC 2026
% Result : Theorem 5.10s 1.62s
% Output : Refutation 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 78 ( 18 unt; 4 def)
% Number of atoms : 253 ( 116 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 285 ( 110 ~; 125 |; 40 &)
% ( 9 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 102 ( 0 sgn 94 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f9,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f11,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f57,conjecture,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f58,negated_conjecture,
~ ! [X0] : unordered_pair(X0,X0) = singleton(X0),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f74,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f96,plain,
? [X0] : singleton(X0) != unordered_pair(X0,X0),
inference(ennf_transformation,[],[f58]) ).
fof(f102,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f103,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f102]) ).
fof(f104,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X2 = X0
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f105,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f104]) ).
fof(f106,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f105]) ).
fof(f110,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f111,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f111]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK2(X0,X1,X2) != X0
& sK2(X0,X1,X2) != X1 )
| ~ in(sK2(X0,X1,X2),X2) )
& ( sK2(X0,X1,X2) = X0
| sK2(X0,X1,X2) = X1
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f112]) ).
fof(f118,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f119,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f119]) ).
fof(f138,plain,
singleton(sK12) != unordered_pair(sK12,sK12),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f96]) ).
fof(f147,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f103]) ).
fof(f148,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f106]) ).
fof(f149,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f106]) ).
fof(f154,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f113]) ).
fof(f156,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f113]) ).
fof(f167,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f168,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f225,plain,
singleton(sK12) != unordered_pair(sK12,sK12),
inference(cnf_transformation,[],[f138]) ).
fof(f252,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f149]) ).
fof(f253,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f252]) ).
fof(f254,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f148]) ).
fof(f256,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f156]) ).
fof(f257,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f256]) ).
fof(f260,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f154]) ).
fof(f270,definition,
sF13 = singleton(sK12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f271,plain,
singleton(sK12) = sF13,
inference(reorient_equations,[],[f270]) ).
fof(f272,definition,
sF14 = unordered_pair(sK12,sK12),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f273,plain,
unordered_pair(sK12,sK12) = sF14,
inference(reorient_equations,[],[f272]) ).
fof(f274,plain,
sF13 != sF14,
inference(definition_folding,[],[f225,f273,f271]) ).
fof(f276,plain,
! [X0] :
( ~ in(X0,sF13)
| sK12 = X0 ),
inference(superposition,[],[f254,f271]) ).
fof(f278,plain,
in(sK12,sF13),
inference(superposition,[],[f253,f271]) ).
fof(f279,plain,
in(sK12,sF14),
inference(superposition,[],[f257,f273]) ).
fof(f283,plain,
! [X0] :
( ~ in(X0,sF14)
| sK12 = X0
| sK12 = X0 ),
inference(superposition,[],[f260,f273]) ).
fof(f284,plain,
! [X0] :
( ~ in(X0,sF14)
| sK12 = X0 ),
inference(duplicate_literal_removal,[],[f283]) ).
fof(f295,plain,
! [X0] :
( subset(sF13,X0)
| sK12 = sK4(sF13,X0) ),
inference(resolution,[],[f167,f276]) ).
fof(f296,plain,
! [X0] :
( subset(sF14,X0)
| sK12 = sK4(sF14,X0) ),
inference(resolution,[],[f167,f284]) ).
fof(f297,plain,
! [X0] :
( ~ subset(X0,sF14)
| sK12 = sK4(sF14,X0)
| sF14 = X0 ),
inference(resolution,[],[f296,f147]) ).
fof(f300,plain,
( sK12 = sK4(sF14,sF13)
| sF13 = sF14
| sK12 = sK4(sF13,sF14) ),
inference(resolution,[],[f297,f295]) ).
fof(f302,plain,
( sK12 = sK4(sF14,sF13)
| sK12 = sK4(sF13,sF14) ),
inference(forward_subsumption_resolution,[],[f300,f274]) ).
fof(f304,definition,
( spl15_1
<=> sK12 = sK4(sF13,sF14) ),
introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).
fof(f306,plain,
( sK12 = sK4(sF13,sF14)
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f308,definition,
( spl15_2
<=> sK12 = sK4(sF14,sF13) ),
introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).
fof(f309,plain,
( sK12 != sK4(sF14,sF13)
| spl15_2 ),
inference(avatar_component_clause,[],[f308]) ).
fof(f310,plain,
( sK12 = sK4(sF14,sF13)
| ~ spl15_2 ),
inference(avatar_component_clause,[],[f308]) ).
fof(f311,plain,
( spl15_1
| spl15_2 ),
inference(avatar_split_clause,[],[f302,f308,f304]) ).
fof(f314,plain,
( ~ in(sK12,sF13)
| subset(sF14,sF13)
| ~ spl15_2 ),
inference(superposition,[],[f168,f310]) ).
fof(f316,plain,
( subset(sF14,sF13)
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f314,f278]) ).
fof(f317,plain,
( ~ subset(sF13,sF14)
| sF13 = sF14
| ~ spl15_2 ),
inference(resolution,[],[f316,f147]) ).
fof(f318,plain,
( ~ subset(sF13,sF14)
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f317,f274]) ).
fof(f319,plain,
( sK12 = sK4(sF13,sF14)
| ~ spl15_2 ),
inference(resolution,[],[f318,f295]) ).
fof(f320,plain,
( spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f319,f308,f304]) ).
fof(f321,plain,
( ~ in(sK12,sF14)
| subset(sF13,sF14)
| ~ spl15_1 ),
inference(superposition,[],[f168,f306]) ).
fof(f323,plain,
( subset(sF13,sF14)
| ~ spl15_1 ),
inference(forward_subsumption_resolution,[],[f321,f279]) ).
fof(f324,plain,
( $false
| ~ spl15_1
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f323,f318]) ).
fof(f325,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_contradiction_clause,[],[f324]) ).
fof(f326,plain,
( sK12 = sK4(sF14,sF13)
| sF13 = sF14
| ~ spl15_1 ),
inference(resolution,[],[f323,f297]) ).
fof(f329,plain,
( sF13 = sF14
| ~ spl15_1
| spl15_2 ),
inference(forward_subsumption_resolution,[],[f326,f309]) ).
fof(f330,plain,
( $false
| ~ spl15_1
| spl15_2 ),
inference(forward_subsumption_resolution,[],[f329,f274]) ).
fof(f331,plain,
( ~ spl15_1
| spl15_2 ),
inference(avatar_contradiction_clause,[],[f330]) ).
cnf(s1,plain,
( spl15_1
| spl15_2 ),
inference(sat_conversion,[],[f311]) ).
cnf(s2,plain,
( spl15_1
| ~ spl15_2 ),
inference(sat_conversion,[],[f320]) ).
cnf(s3,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(sat_conversion,[],[f325]) ).
cnf(s4,plain,
( ~ spl15_1
| spl15_2 ),
inference(sat_conversion,[],[f331]) ).
cnf(s5,plain,
spl15_1,
inference(rat,[],[s1,s2]) ).
cnf(s6,plain,
spl15_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s3,s6,s5]) ).
fof(f332,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU142+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 03:42:15 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.10/1.62 % (2995781)Detected formulas, will run a generic FOF schedule.
% 5.10/1.62 % (2995786)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=851903534:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.10/1.62 % (2995789)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=189804465:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.10/1.62 % (2995792)dis-21_1_sil=8000:lcm=predicate:random_seed=3207986712: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)
% 5.10/1.62 % (2995790)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4233429785:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.10/1.62 % (2995788)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=2436422082:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.10/1.62 % (2995787)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=3353048579:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.10/1.62 % (2995791)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1248707865:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.10/1.62 % (2995789)Instruction limit reached!
% 5.10/1.62 % (2995789)------------------------------
% 5.10/1.62 % (2995789)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995789)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995789)Termination reason: Instruction limit
% 5.10/1.62 % (2995789)Termination phase: Saturation
% 5.10/1.62 % (2995789)Time elapsed: 0.069 s
% 5.10/1.62 % (2995789)Peak memory usage: 89 MB
% 5.10/1.62 % (2995789)Instructions burned: 109 (million)
% 5.10/1.62 % (2995790)Instruction limit reached!
% 5.10/1.62 % (2995790)------------------------------
% 5.10/1.62 % (2995790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995790)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995790)Termination reason: Instruction limit
% 5.10/1.62 % (2995790)Termination phase: Saturation
% 5.10/1.62 % (2995790)Time elapsed: 0.075 s
% 5.10/1.62 % (2995790)Peak memory usage: 88 MB
% 5.10/1.62 % (2995790)Instructions burned: 119 (million)
% 5.10/1.62 % (2995792)Instruction limit reached!
% 5.10/1.62 % (2995792)------------------------------
% 5.10/1.62 % (2995792)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995792)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995792)Termination reason: Instruction limit
% 5.10/1.62 % (2995792)Termination phase: Saturation
% 5.10/1.62 % (2995792)Time elapsed: 0.083 s
% 5.10/1.62 % (2995792)Peak memory usage: 88 MB
% 5.10/1.62 % (2995792)Instructions burned: 129 (million)
% 5.10/1.62 % (2995791)Instruction limit reached!
% 5.10/1.62 % (2995791)------------------------------
% 5.10/1.62 % (2995791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995791)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995791)Termination reason: Instruction limit
% 5.10/1.62 % (2995791)Termination phase: Saturation
% 5.10/1.62 % (2995791)Time elapsed: 0.093 s
% 5.10/1.62 % (2995791)Peak memory usage: 89 MB
% 5.10/1.62 % (2995791)Instructions burned: 139 (million)
% 5.10/1.62 % (2995800)lrs+10_1_sil=8000:sp=occurrence:random_seed=412796849:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.10/1.62 % (2995801)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3208726978:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.10/1.62 % (2995801)Refutation not found, incomplete strategy
% 5.10/1.62 % (2995801)------------------------------
% 5.10/1.62 % (2995801)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995801)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995801)Termination reason: Refutation not found, incomplete strategy
% 5.10/1.62 % (2995801)Time elapsed: 0.003 s
% 5.10/1.62 % (2995801)Peak memory usage: 89 MB
% 5.10/1.62 % (2995801)Instructions burned: 2 (million)
% 5.10/1.62 % (2995803)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=278081370:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 5.10/1.62 % (2995802)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4267622099:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 5.10/1.62 % (2995786)First to succeed.
% 5.10/1.62 % (2995786)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2995781"
% 5.10/1.62 % (2995803)Instruction limit reached!
% 5.10/1.62 % (2995803)------------------------------
% 5.10/1.62 % (2995803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995803)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995803)Termination reason: Instruction limit
% 5.10/1.62 % (2995803)Termination phase: Saturation
% 5.10/1.62 % (2995803)Time elapsed: 0.129 s
% 5.10/1.62 % (2995803)Peak memory usage: 91 MB
% 5.10/1.62 % (2995803)Instructions burned: 249 (million)
% 5.10/1.62 % (2995800)Instruction limit reached!
% 5.10/1.62 % (2995800)------------------------------
% 5.10/1.62 % (2995800)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995800)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995800)Termination reason: Instruction limit
% 5.10/1.62 % (2995800)Termination phase: Saturation
% 5.10/1.62 % (2995800)Time elapsed: 0.179 s
% 5.10/1.62 % (2995800)Peak memory usage: 90 MB
% 5.10/1.62 % (2995800)Instructions burned: 285 (million)
% 5.10/1.62 % (2995802)Instruction limit reached!
% 5.10/1.62 % (2995802)------------------------------
% 5.10/1.62 % (2995802)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.10/1.62 % (2995802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.10/1.62 % (2995802)CaDiCaL version: 2.1.3
% 5.10/1.62 % (2995802)Termination reason: Instruction limit
% 5.10/1.62 % (2995802)Termination phase: Saturation
% 5.10/1.62 % (2995802)Time elapsed: 0.210 s
% 5.10/1.62 % (2995802)Peak memory usage: 91 MB
% 5.10/1.62 % (2995802)Instructions burned: 326 (million)
% 5.10/1.62 % (2995801)------------------------------
% 5.10/1.62 % (2995801)------------------------------
% 5.10/1.62 % (2995808)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1092766122:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 5.10/1.62 % (2995787)Also succeeded, but the first one will report.
% 5.10/1.62 % (2995809)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2934958231:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 5.10/1.62 % (2995786)Refutation found. Thanks to Tanya!
% 5.10/1.62 % SZS status Theorem for theBenchmark
% 5.10/1.62 % SZS output start Proof for theBenchmark
% See solution above
% 6.10/1.82 % (2995786)------------------------------
% 6.10/1.82 % (2995786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.10/1.82 % (2995786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.10/1.82 % (2995786)CaDiCaL version: 2.1.3
% 6.10/1.82 % (2995786)Termination reason: Refutation
% 6.10/1.82 % (2995786)Time elapsed: 0.394 s
% 6.10/1.82 % (2995786)Peak memory usage: 130 MB
% 6.10/1.82 % (2995786)Instructions burned: 937 (million)
% 6.10/1.82 % (2995786)------------------------------
% 6.10/1.82 % (2995786)------------------------------
% 6.10/1.82 % (2995781)Success in time 0.776 s
% 6.10/1.82 % Vampire exiting
%------------------------------------------------------------------------------