%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET018-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:42:39 PM UTC 2026
% Result : Unsatisfiable 1.39s 0.64s
% Output : Refutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 19
% Syntax : Number of formulae : 115 ( 22 unt; 8 def)
% Number of atoms : 256 ( 72 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 261 ( 120 ~; 133 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X2,X0,X1] :
( ~ member(X0,non_ordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',non_ordered_pair1) ).
fof(f6,axiom,
! [X2,X0,X1] :
( member(X0,non_ordered_pair(X1,X2))
| ~ little_set(X0)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',non_ordered_pair2) ).
fof(f7,axiom,
! [X2,X0,X1] :
( member(X0,non_ordered_pair(X1,X2))
| ~ little_set(X0)
| X0 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',non_ordered_pair3) ).
fof(f8,axiom,
! [X0,X1] : little_set(non_ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).
fof(f9,axiom,
! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',singleton_set) ).
fof(f10,axiom,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
fof(f163,axiom,
little_set(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_little_set) ).
fof(f164,axiom,
little_set(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_little_set) ).
fof(f165,axiom,
little_set(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_little_set) ).
fof(f166,axiom,
ordered_pair(a,b) = ordered_pair(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pair) ).
fof(f167,negated_conjecture,
b != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_second_components_equal) ).
fof(f169,plain,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)),
inference(definition_unfolding,[],[f10,f9]) ).
fof(f196,plain,
non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)) = non_ordered_pair(non_ordered_pair(c,c),non_ordered_pair(c,d)),
inference(definition_unfolding,[],[f166,f169,f169]) ).
fof(f197,plain,
! [X2,X1] :
( member(X1,non_ordered_pair(X1,X2))
| ~ little_set(X1) ),
inference(equality_resolution,[],[f6]) ).
fof(f198,plain,
! [X2,X1] :
( member(X2,non_ordered_pair(X1,X2))
| ~ little_set(X2) ),
inference(equality_resolution,[],[f7]) ).
fof(f311,plain,
( member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
| ~ little_set(non_ordered_pair(c,d)) ),
inference(superposition,[],[f198,f196]) ).
fof(f312,plain,
member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(forward_subsumption_resolution,[],[f311,f8]) ).
fof(f1353,plain,
( non_ordered_pair(a,a) = non_ordered_pair(c,d)
| non_ordered_pair(a,b) = non_ordered_pair(c,d) ),
inference(resolution,[],[f5,f312]) ).
fof(f1365,plain,
! [X0] :
( ~ member(X0,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
| non_ordered_pair(c,c) = X0
| non_ordered_pair(c,d) = X0 ),
inference(superposition,[],[f5,f196]) ).
fof(f1368,definition,
( spl0_23
<=> non_ordered_pair(a,b) = non_ordered_pair(c,d) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f1370,plain,
( non_ordered_pair(a,b) = non_ordered_pair(c,d)
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f1368]) ).
fof(f1372,definition,
( spl0_24
<=> non_ordered_pair(a,a) = non_ordered_pair(c,d) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f1374,plain,
( non_ordered_pair(a,a) = non_ordered_pair(c,d)
| ~ spl0_24 ),
inference(avatar_component_clause,[],[f1372]) ).
fof(f1375,plain,
( spl0_23
| spl0_24 ),
inference(avatar_split_clause,[],[f1353,f1372,f1368]) ).
fof(f1381,definition,
( spl0_26
<=> non_ordered_pair(a,a) = non_ordered_pair(c,c) ),
introduced(definition,[new_symbols(definition,[spl0_26])],[avatar_definition]) ).
fof(f1382,plain,
( non_ordered_pair(a,a) != non_ordered_pair(c,c)
| spl0_26 ),
inference(avatar_component_clause,[],[f1381]) ).
fof(f1383,plain,
( non_ordered_pair(a,a) = non_ordered_pair(c,c)
| ~ spl0_26 ),
inference(avatar_component_clause,[],[f1381]) ).
fof(f1391,plain,
( member(d,non_ordered_pair(a,b))
| ~ little_set(d)
| ~ spl0_23 ),
inference(superposition,[],[f198,f1370]) ).
fof(f1396,plain,
( member(d,non_ordered_pair(a,b))
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f1391,f165]) ).
fof(f1408,definition,
( spl0_27
<=> b = c ),
introduced(definition,[new_symbols(definition,[spl0_27])],[avatar_definition]) ).
fof(f1409,plain,
( b != c
| spl0_27 ),
inference(avatar_component_clause,[],[f1408]) ).
fof(f1410,plain,
( b = c
| ~ spl0_27 ),
inference(avatar_component_clause,[],[f1408]) ).
fof(f1506,plain,
( member(d,non_ordered_pair(a,c))
| ~ spl0_23
| ~ spl0_27 ),
inference(forward_demodulation,[],[f1396,f1410]) ).
fof(f1716,plain,
( a = d
| c = d
| ~ spl0_23
| ~ spl0_27 ),
inference(resolution,[],[f1506,f5]) ).
fof(f1726,definition,
( spl0_39
<=> c = d ),
introduced(definition,[new_symbols(definition,[spl0_39])],[avatar_definition]) ).
fof(f1728,plain,
( c = d
| ~ spl0_39 ),
inference(avatar_component_clause,[],[f1726]) ).
fof(f1730,definition,
( spl0_40
<=> a = d ),
introduced(definition,[new_symbols(definition,[spl0_40])],[avatar_definition]) ).
fof(f1731,plain,
( a != d
| spl0_40 ),
inference(avatar_component_clause,[],[f1730]) ).
fof(f1732,plain,
( a = d
| ~ spl0_40 ),
inference(avatar_component_clause,[],[f1730]) ).
fof(f1733,plain,
( spl0_39
| spl0_40
| ~ spl0_23
| ~ spl0_27 ),
inference(avatar_split_clause,[],[f1716,f1408,f1368,f1730,f1726]) ).
fof(f1746,plain,
( b != c
| ~ spl0_39 ),
inference(superposition,[],[f167,f1728]) ).
fof(f1757,plain,
( $false
| ~ spl0_27
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f1746,f1410]) ).
fof(f1758,plain,
( ~ spl0_27
| ~ spl0_39 ),
inference(avatar_contradiction_clause,[],[f1757]) ).
fof(f1837,plain,
( a != b
| ~ spl0_40 ),
inference(superposition,[],[f167,f1732]) ).
fof(f1851,plain,
( a != c
| ~ spl0_27
| ~ spl0_40 ),
inference(forward_demodulation,[],[f1837,f1410]) ).
fof(f2077,plain,
( member(c,non_ordered_pair(a,a))
| ~ little_set(c)
| ~ spl0_26 ),
inference(superposition,[],[f197,f1383]) ).
fof(f2081,plain,
( member(c,non_ordered_pair(a,a))
| ~ spl0_26 ),
inference(forward_subsumption_resolution,[],[f2077,f164]) ).
fof(f2085,plain,
( a = c
| a = c
| ~ spl0_26 ),
inference(resolution,[],[f2081,f5]) ).
fof(f2093,plain,
( a = c
| ~ spl0_26 ),
inference(duplicate_literal_removal,[],[f2085]) ).
fof(f2095,plain,
( $false
| ~ spl0_26
| ~ spl0_27
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f2093,f1851]) ).
fof(f2096,plain,
( ~ spl0_26
| ~ spl0_27
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f2095]) ).
fof(f2698,plain,
( ! [X0] :
( non_ordered_pair(a,a) = X0
| ~ member(X0,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
| non_ordered_pair(c,d) = X0 )
| ~ spl0_26 ),
inference(forward_demodulation,[],[f1365,f1383]) ).
fof(f2699,plain,
( ! [X0] :
( ~ member(X0,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
| non_ordered_pair(a,a) = X0
| non_ordered_pair(a,d) = X0 )
| ~ spl0_26 ),
inference(forward_demodulation,[],[f2698,f2093]) ).
fof(f2701,plain,
( non_ordered_pair(a,a) = non_ordered_pair(a,b)
| non_ordered_pair(a,b) = non_ordered_pair(a,d)
| ~ little_set(non_ordered_pair(a,b))
| ~ spl0_26 ),
inference(resolution,[],[f2699,f198]) ).
fof(f2738,plain,
( non_ordered_pair(a,a) = non_ordered_pair(a,b)
| non_ordered_pair(a,b) = non_ordered_pair(a,d)
| ~ spl0_26 ),
inference(forward_subsumption_resolution,[],[f2701,f8]) ).
fof(f2749,definition,
( spl0_96
<=> non_ordered_pair(a,b) = non_ordered_pair(a,d) ),
introduced(definition,[new_symbols(definition,[spl0_96])],[avatar_definition]) ).
fof(f2751,plain,
( non_ordered_pair(a,b) = non_ordered_pair(a,d)
| ~ spl0_96 ),
inference(avatar_component_clause,[],[f2749]) ).
fof(f2753,definition,
( spl0_97
<=> non_ordered_pair(a,a) = non_ordered_pair(a,b) ),
introduced(definition,[new_symbols(definition,[spl0_97])],[avatar_definition]) ).
fof(f2755,plain,
( non_ordered_pair(a,a) = non_ordered_pair(a,b)
| ~ spl0_97 ),
inference(avatar_component_clause,[],[f2753]) ).
fof(f2756,plain,
( spl0_96
| spl0_97
| ~ spl0_26 ),
inference(avatar_split_clause,[],[f2738,f1381,f2753,f2749]) ).
fof(f2765,plain,
( member(b,non_ordered_pair(a,a))
| ~ little_set(b)
| ~ spl0_97 ),
inference(superposition,[],[f198,f2755]) ).
fof(f2768,plain,
( member(b,non_ordered_pair(a,a))
| ~ spl0_97 ),
inference(forward_subsumption_resolution,[],[f2765,f163]) ).
fof(f2771,plain,
( a = b
| a = b
| ~ spl0_97 ),
inference(resolution,[],[f2768,f5]) ).
fof(f2779,plain,
( a = b
| ~ spl0_97 ),
inference(duplicate_literal_removal,[],[f2771]) ).
fof(f2792,plain,
( a != c
| spl0_27
| ~ spl0_97 ),
inference(superposition,[],[f1409,f2779]) ).
fof(f2796,plain,
( $false
| ~ spl0_26
| spl0_27
| ~ spl0_97 ),
inference(forward_subsumption_resolution,[],[f2792,f2093]) ).
fof(f2797,plain,
( ~ spl0_26
| spl0_27
| ~ spl0_97 ),
inference(avatar_contradiction_clause,[],[f2796]) ).
fof(f3153,plain,
( member(d,non_ordered_pair(a,b))
| ~ little_set(d)
| ~ spl0_96 ),
inference(superposition,[],[f198,f2751]) ).
fof(f3156,plain,
( member(d,non_ordered_pair(a,b))
| ~ spl0_96 ),
inference(forward_subsumption_resolution,[],[f3153,f165]) ).
fof(f3167,plain,
( a = d
| b = d
| ~ spl0_96 ),
inference(resolution,[],[f3156,f5]) ).
fof(f3176,plain,
( a = d
| ~ spl0_96 ),
inference(forward_subsumption_resolution,[],[f3167,f167]) ).
fof(f3178,plain,
( a != b
| ~ spl0_96 ),
inference(superposition,[],[f167,f3176]) ).
fof(f3188,plain,
( non_ordered_pair(a,a) = non_ordered_pair(a,b)
| ~ spl0_96 ),
inference(superposition,[],[f2751,f3176]) ).
fof(f3217,plain,
( member(b,non_ordered_pair(a,a))
| ~ little_set(b)
| ~ spl0_96 ),
inference(superposition,[],[f198,f3188]) ).
fof(f3220,plain,
( member(b,non_ordered_pair(a,a))
| ~ spl0_96 ),
inference(forward_subsumption_resolution,[],[f3217,f163]) ).
fof(f3228,plain,
( a = b
| a = b
| ~ spl0_96 ),
inference(resolution,[],[f3220,f5]) ).
fof(f3236,plain,
( a = b
| ~ spl0_96 ),
inference(duplicate_literal_removal,[],[f3228]) ).
fof(f3238,plain,
( $false
| ~ spl0_96 ),
inference(forward_subsumption_resolution,[],[f3236,f3178]) ).
fof(f3239,plain,
~ spl0_96,
inference(avatar_contradiction_clause,[],[f3238]) ).
fof(f3934,plain,
( non_ordered_pair(a,a) = non_ordered_pair(c,c)
| non_ordered_pair(a,a) = non_ordered_pair(c,d)
| ~ little_set(non_ordered_pair(a,a)) ),
inference(resolution,[],[f1365,f197]) ).
fof(f4002,plain,
( non_ordered_pair(a,a) = non_ordered_pair(c,c)
| non_ordered_pair(a,a) = non_ordered_pair(c,d) ),
inference(forward_subsumption_resolution,[],[f3934,f8]) ).
fof(f4013,plain,
( spl0_24
| spl0_26 ),
inference(avatar_split_clause,[],[f4002,f1381,f1372]) ).
fof(f4069,plain,
( member(d,non_ordered_pair(a,a))
| ~ little_set(d)
| ~ spl0_24 ),
inference(superposition,[],[f198,f1374]) ).
fof(f4070,plain,
( member(c,non_ordered_pair(a,a))
| ~ little_set(c)
| ~ spl0_24 ),
inference(superposition,[],[f197,f1374]) ).
fof(f4072,plain,
( member(c,non_ordered_pair(a,a))
| ~ spl0_24 ),
inference(forward_subsumption_resolution,[],[f4070,f164]) ).
fof(f4073,plain,
( member(d,non_ordered_pair(a,a))
| ~ spl0_24 ),
inference(forward_subsumption_resolution,[],[f4069,f165]) ).
fof(f4076,plain,
( a = c
| a = c
| ~ spl0_24 ),
inference(resolution,[],[f4072,f5]) ).
fof(f4085,plain,
( a = c
| ~ spl0_24 ),
inference(duplicate_literal_removal,[],[f4076]) ).
fof(f4171,plain,
( a = d
| a = d
| ~ spl0_24 ),
inference(resolution,[],[f4073,f5]) ).
fof(f4180,plain,
( a = d
| ~ spl0_24 ),
inference(duplicate_literal_removal,[],[f4171]) ).
fof(f4182,plain,
( $false
| ~ spl0_24
| spl0_40 ),
inference(forward_subsumption_resolution,[],[f4180,f1731]) ).
fof(f4183,plain,
( ~ spl0_24
| spl0_40 ),
inference(avatar_contradiction_clause,[],[f4182]) ).
fof(f4390,plain,
( non_ordered_pair(a,a) != non_ordered_pair(a,a)
| ~ spl0_24
| spl0_26 ),
inference(forward_demodulation,[],[f1382,f4085]) ).
fof(f4391,plain,
( $false
| ~ spl0_24
| spl0_26 ),
inference(trivial_inequality_removal,[],[f4390]) ).
fof(f4392,plain,
( ~ spl0_24
| spl0_26 ),
inference(avatar_contradiction_clause,[],[f4391]) ).
cnf(s18,plain,
( spl0_23
| spl0_24 ),
inference(sat_conversion,[],[f1375]) ).
cnf(s29,plain,
( ~ spl0_23
| ~ spl0_27
| spl0_39
| spl0_40 ),
inference(sat_conversion,[],[f1733]) ).
cnf(s30,plain,
( ~ spl0_27
| ~ spl0_39 ),
inference(sat_conversion,[],[f1758]) ).
cnf(s48,plain,
( ~ spl0_26
| ~ spl0_27
| ~ spl0_40 ),
inference(sat_conversion,[],[f2096]) ).
cnf(s98,plain,
( ~ spl0_26
| spl0_96
| spl0_97 ),
inference(sat_conversion,[],[f2756]) ).
cnf(s99,plain,
( ~ spl0_26
| spl0_27
| ~ spl0_97 ),
inference(sat_conversion,[],[f2797]) ).
cnf(s111,plain,
~ spl0_96,
inference(sat_conversion,[],[f3239]) ).
cnf(s154,plain,
( spl0_24
| spl0_26 ),
inference(sat_conversion,[],[f4013]) ).
cnf(s160,plain,
( ~ spl0_24
| spl0_40 ),
inference(sat_conversion,[],[f4183]) ).
cnf(s163,plain,
( ~ spl0_24
| spl0_26 ),
inference(sat_conversion,[],[f4392]) ).
cnf(s165,plain,
( ~ spl0_26
| spl0_97 ),
inference(rat,[],[s98,s111]) ).
cnf(s168,plain,
~ spl0_24,
inference(rat,[],[s48,s99,s165,s160,s163]) ).
cnf(s169,plain,
spl0_26,
inference(rat,[],[s154,s168]) ).
cnf(s170,plain,
spl0_23,
inference(rat,[],[s18,s168]) ).
cnf(s171,plain,
spl0_97,
inference(rat,[],[s165,s169]) ).
cnf(s172,plain,
spl0_27,
inference(rat,[],[s99,s171,s169]) ).
cnf(s173,plain,
~ spl0_40,
inference(rat,[],[s48,s169,s172]) ).
cnf(s174,plain,
~ spl0_39,
inference(rat,[],[s30,s172]) ).
cnf(s175,plain,
$false,
inference(rat,[],[s29,s170,s172,s173,s174]) ).
fof(f4393,plain,
$false,
inference(avatar_sat_refutation,[],[s175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET018-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 00:09:25 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/0.64 % (1747680)Will run a generic schedule for satisfiability detection.
% 1.39/0.64 % (1747685)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3209587568_2999 on theBenchmark for (2999ds/0Mi)
% 1.39/0.64 % (1747686)% WARNING: option uhcvi not known.
% 1.39/0.64 % (1747686)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2744982009:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.39/0.64 % (1747689)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4096125184:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.39/0.64 % (1747687)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=156806268:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.39/0.64 % (1747688)dis+10_1_sil=32000:sp=arity:random_seed=2338931635:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.39/0.64 % (1747691)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3864077669:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.39/0.64 % (1747690)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3009723771:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.39/0.64 % TRYING [1]
% 1.39/0.64 % TRYING [2]
% 1.39/0.64 % TRYING [3]
% 1.39/0.64 % (1747688)Instruction limit reached!
% 1.39/0.64 % (1747688)------------------------------
% 1.39/0.64 % (1747688)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747688)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747688)Termination reason: Instruction limit
% 1.39/0.64 % (1747688)Termination phase: Saturation
% 1.39/0.64 % (1747688)Time elapsed: 0.064 s
% 1.39/0.64 % (1747688)Peak memory usage: 13 MB
% 1.39/0.64 % (1747688)Instructions burned: 103 (million)
% 1.39/0.64 % (1747689)Instruction limit reached!
% 1.39/0.64 % (1747689)------------------------------
% 1.39/0.64 % (1747689)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747689)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747689)Termination reason: Instruction limit
% 1.39/0.64 % (1747689)Termination phase: Saturation
% 1.39/0.64 % (1747689)Time elapsed: 0.070 s
% 1.39/0.64 % (1747689)Peak memory usage: 13 MB
% 1.39/0.64 % (1747689)Instructions burned: 117 (million)
% 1.39/0.64 % (1747690)Instruction limit reached!
% 1.39/0.64 % (1747690)------------------------------
% 1.39/0.64 % (1747690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747690)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747690)Termination reason: Instruction limit
% 1.39/0.64 % (1747690)Termination phase: Saturation
% 1.39/0.64 % (1747690)Time elapsed: 0.073 s
% 1.39/0.64 % (1747690)Peak memory usage: 13 MB
% 1.39/0.64 % (1747690)Instructions burned: 131 (million)
% 1.39/0.64 % (1747699)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1915664364:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.39/0.64 % (1747700)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1199590108:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.39/0.64 % (1747701)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3762322788:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.39/0.64 % TRYING [1]
% 1.39/0.64 % (1747691)Instruction limit reached!
% 1.39/0.64 % (1747691)------------------------------
% 1.39/0.64 % (1747691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747691)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747691)Termination reason: Instruction limit
% 1.39/0.64 % (1747691)Termination phase: Saturation
% 1.39/0.64 % (1747691)Time elapsed: 0.102 s
% 1.39/0.64 % (1747691)Peak memory usage: 15 MB
% 1.39/0.64 % (1747691)Instructions burned: 159 (million)
% 1.39/0.64 % TRYING [2]
% 1.39/0.64 % TRYING [3]
% 1.39/0.64 % (1747705)ott-21_1_sil=16000:fs=off:random_seed=3069034860:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.39/0.64 % TRYING [4]
% 1.39/0.64 % (1747701) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1747680-1747701"...
% 1.39/0.64 % (1747700)Instruction limit reached!
% 1.39/0.64 % (1747700)------------------------------
% 1.39/0.64 % (1747700)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747700)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747700)Termination reason: Instruction limit
% 1.39/0.64 % (1747700)Termination phase: Saturation
% 1.39/0.64 % (1747700)Time elapsed: 0.086 s
% 1.39/0.64 % (1747700)Peak memory usage: 14 MB
% 1.39/0.64 % (1747700)Instructions burned: 134 (million)
% 1.39/0.64 % (1747701)...printing done.
% 1.39/0.64 % (1747701)Refutation found. Thanks to Tanya!
% 1.39/0.64 % SZS status Unsatisfiable for theBenchmark
% 1.39/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 1.39/0.64 % (1747701)------------------------------
% 1.39/0.64 % (1747701)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.64 % (1747701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.64 % (1747701)CaDiCaL version: 2.1.3
% 1.39/0.64 % (1747701)Termination reason: Refutation
% 1.39/0.64 % (1747701)Time elapsed: 0.083 s
% 1.39/0.64 % (1747701)Peak memory usage: 14 MB
% 1.39/0.64 % (1747701)Instructions burned: 123 (million)
% 1.39/0.64 % (1747680)Success in time 0.22 s
% 1.39/0.64 % Vampire exiting
%------------------------------------------------------------------------------