%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET021-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:40 PM UTC 2026
% Result : Unsatisfiable 1.32s 0.67s
% Output : Refutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 72 ( 21 unt; 4 def)
% Number of atoms : 146 ( 52 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 142 ( 68 ~; 70 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 71 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( ~ member(X0,X1)
| ~ member(X2,X3)
| member(ordered_pair(X0,X2),cross_product(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
fof(f17,axiom,
! [X2,X0,X1] :
( ~ member(X0,cross_product(X1,X2))
| ordered_pair(first(X0),second(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
fof(f137,axiom,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_member_in_singleton) ).
fof(f173,axiom,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| ~ member(X1,universal_class)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_determines_components2) ).
fof(f177,axiom,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
| first(X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
fof(f178,axiom,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
| second(X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).
fof(f179,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_1) ).
fof(f180,negated_conjecture,
second(ordered_pair(u,v)) != v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_2) ).
fof(f181,plain,
v != second(ordered_pair(u,v)),
inference(reorient_equations,[],[f180]) ).
fof(f186,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f193,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X0,X2) ),
inference(definition_unfolding,[],[f14,f186]) ).
fof(f194,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X1,X3) ),
inference(definition_unfolding,[],[f15,f186]) ).
fof(f195,plain,
! [X2,X3,X0,X1] :
( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X2,X2))),cross_product(X1,X3))
| ~ member(X2,X3)
| ~ member(X0,X1) ),
inference(definition_unfolding,[],[f16,f186]) ).
fof(f196,plain,
! [X2,X0,X1] :
( ~ member(X0,cross_product(X1,X2))
| unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ),
inference(definition_unfolding,[],[f17,f186]) ).
fof(f247,plain,
! [X0,X1] :
( ~ member(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(definition_unfolding,[],[f137,f12]) ).
fof(f271,plain,
! [X2,X3,X0,X1] :
( ~ member(X1,universal_class)
| unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))) != unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X3,X3)))
| X1 = X3 ),
inference(definition_unfolding,[],[f173,f186,f186]) ).
fof(f275,plain,
! [X0] :
( unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0
| first(X0) = X0 ),
inference(definition_unfolding,[],[f177,f186]) ).
fof(f276,plain,
! [X0] :
( unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0
| second(X0) = X0 ),
inference(definition_unfolding,[],[f178,f186]) ).
fof(f277,plain,
member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(universal_class,universal_class)),
inference(definition_unfolding,[],[f179,f186]) ).
fof(f278,plain,
v != second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),
inference(definition_unfolding,[],[f181,f186]) ).
fof(f282,plain,
member(u,universal_class),
inference(resolution,[],[f193,f277]) ).
fof(f283,plain,
member(v,universal_class),
inference(resolution,[],[f194,f277]) ).
fof(f325,definition,
( spl0_3
<=> unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f326,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) != first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| spl0_3 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f327,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f368,definition,
( spl0_5
<=> unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f369,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) != second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| spl0_5 ),
inference(avatar_component_clause,[],[f368]) ).
fof(f370,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f368]) ).
fof(f385,plain,
( v != unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))
| ~ spl0_5 ),
inference(superposition,[],[f278,f370]) ).
fof(f459,plain,
unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = unordered_pair(unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))),unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),unordered_pair(second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))))),
inference(resolution,[],[f196,f277]) ).
fof(f465,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = unordered_pair(unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))),unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),unordered_pair(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))))
| ~ spl0_5 ),
inference(forward_demodulation,[],[f459,f370]) ).
fof(f467,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = unordered_pair(unordered_pair(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),unordered_pair(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),unordered_pair(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))))
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_demodulation,[],[f465,f327]) ).
fof(f470,plain,
( ! [X0,X1] :
( ~ member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(X0,X1))
| member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),X1) )
| ~ spl0_3
| ~ spl0_5 ),
inference(superposition,[],[f194,f467]) ).
fof(f671,plain,
( ! [X0,X1] :
( member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),X0)
| ~ member(v,X0)
| ~ member(u,X1) )
| ~ spl0_3
| ~ spl0_5 ),
inference(resolution,[],[f470,f195]) ).
fof(f676,definition,
( spl0_28
<=> ! [X1] : ~ member(u,X1) ),
introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).
fof(f677,plain,
( ! [X1] : ~ member(u,X1)
| ~ spl0_28 ),
inference(avatar_component_clause,[],[f676]) ).
fof(f679,definition,
( spl0_29
<=> ! [X0] :
( member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),X0)
| ~ member(v,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
fof(f680,plain,
( ! [X0] :
( member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),X0)
| ~ member(v,X0) )
| ~ spl0_29 ),
inference(avatar_component_clause,[],[f679]) ).
fof(f681,plain,
( spl0_28
| spl0_29
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f671,f368,f325,f679,f676]) ).
fof(f682,plain,
( $false
| ~ spl0_28 ),
inference(resolution,[],[f677,f282]) ).
fof(f687,plain,
~ spl0_28,
inference(avatar_contradiction_clause,[],[f682]) ).
fof(f1047,plain,
( ! [X0] :
( ~ member(v,unordered_pair(X0,X0))
| unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = X0 )
| ~ spl0_29 ),
inference(resolution,[],[f247,f680]) ).
fof(f1727,plain,
! [X2,X0,X1] :
( unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) != unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v)))
| v = X2 ),
inference(resolution,[],[f271,f283]) ).
fof(f1789,plain,
( v = unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))
| ~ member(v,universal_class)
| ~ spl0_29 ),
inference(resolution,[],[f1047,f9]) ).
fof(f1792,plain,
( ~ member(v,universal_class)
| ~ spl0_5
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1789,f385]) ).
fof(f1795,plain,
( $false
| ~ spl0_5
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1792,f283]) ).
fof(f1796,plain,
( ~ spl0_5
| ~ spl0_29 ),
inference(avatar_contradiction_clause,[],[f1795]) ).
fof(f2008,plain,
! [X0,X1] :
( unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(v,v))) != X0
| second(X0) = v
| second(X0) = X0 ),
inference(superposition,[],[f1727,f276]) ).
fof(f2009,plain,
! [X0,X1] :
( unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(v,v))) != X0
| second(X0) = v
| first(X0) = X0 ),
inference(superposition,[],[f1727,f275]) ).
fof(f2021,plain,
! [X0] :
( unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v))) = second(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v))))
| v = second(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v)))) ),
inference(equality_resolution,[],[f2008]) ).
fof(f2031,plain,
! [X0] :
( v = second(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v))))
| unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v))) = first(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(v,v)))) ),
inference(equality_resolution,[],[f2009]) ).
fof(f3257,plain,
( unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) != unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))
| v = second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| spl0_5 ),
inference(superposition,[],[f369,f2021]) ).
fof(f3263,plain,
( v = second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| spl0_5 ),
inference(trivial_inequality_removal,[],[f3257]) ).
fof(f3264,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f3263,f278]) ).
fof(f3265,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f3264]) ).
fof(f3414,plain,
( v != v
| unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))) ),
inference(superposition,[],[f278,f2031]) ).
fof(f3423,plain,
unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))) = first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),
inference(trivial_inequality_removal,[],[f3414]) ).
fof(f3428,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f3423,f326]) ).
fof(f3429,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f3428]) ).
cnf(s18,plain,
( ~ spl0_3
| ~ spl0_5
| spl0_28
| spl0_29 ),
inference(sat_conversion,[],[f681]) ).
cnf(s19,plain,
~ spl0_28,
inference(sat_conversion,[],[f687]) ).
cnf(s88,plain,
( ~ spl0_5
| ~ spl0_29 ),
inference(sat_conversion,[],[f1796]) ).
cnf(s190,plain,
spl0_5,
inference(sat_conversion,[],[f3265]) ).
cnf(s204,plain,
spl0_3,
inference(sat_conversion,[],[f3429]) ).
cnf(s207,plain,
~ spl0_29,
inference(rat,[],[s88,s190]) ).
cnf(s219,plain,
$false,
inference(rat,[],[s18,s207,s19,s190,s204]) ).
fof(f3440,plain,
$false,
inference(avatar_sat_refutation,[],[s219]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET021-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 00:12:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.32/0.67 % (4037445)Will run a generic schedule for satisfiability detection.
% 1.32/0.67 % (4037453)dis+10_1_sil=32000:sp=arity:random_seed=1191847782:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.32/0.67 % (4037451)% WARNING: option uhcvi not known.
% 1.32/0.67 % (4037450)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=179670437_2999 on theBenchmark for (2999ds/0Mi)
% 1.32/0.67 % (4037452)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3849823186:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.32/0.67 % (4037451)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1899732646:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.32/0.67 % (4037454)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1473339970:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.32/0.67 % (4037456)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1259887683:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.32/0.67 % (4037455)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2006564105:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.32/0.67 % (4037453)Instruction limit reached!
% 1.32/0.67 % (4037453)------------------------------
% 1.32/0.67 % (4037453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037453)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037453)Termination reason: Instruction limit
% 1.32/0.67 % (4037453)Termination phase: Saturation
% 1.32/0.67 % (4037453)Time elapsed: 0.035 s
% 1.32/0.67 % (4037453)Peak memory usage: 12 MB
% 1.32/0.67 % (4037453)Instructions burned: 103 (million)
% 1.32/0.67 % (4037464)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=792833239:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.32/0.67 % (4037454)Instruction limit reached!
% 1.32/0.67 % (4037454)------------------------------
% 1.32/0.67 % (4037454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037454)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037454)Termination reason: Instruction limit
% 1.32/0.67 % (4037454)Termination phase: Saturation
% 1.32/0.67 % (4037454)Time elapsed: 0.072 s
% 1.32/0.67 % (4037454)Peak memory usage: 12 MB
% 1.32/0.67 % (4037454)Instructions burned: 117 (million)
% 1.32/0.67 % (4037455)Instruction limit reached!
% 1.32/0.67 % (4037455)------------------------------
% 1.32/0.67 % (4037455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037455)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037455)Termination reason: Instruction limit
% 1.32/0.67 % (4037455)Termination phase: Saturation
% 1.32/0.67 % (4037455)Time elapsed: 0.081 s
% 1.32/0.67 % (4037455)Peak memory usage: 13 MB
% 1.32/0.67 % (4037455)Instructions burned: 133 (million)
% 1.32/0.67 % (4037466)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1552235166:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.32/0.67 % (4037456)Instruction limit reached!
% 1.32/0.67 % (4037456)------------------------------
% 1.32/0.67 % (4037456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037456)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037456)Termination reason: Instruction limit
% 1.32/0.67 % (4037456)Termination phase: Saturation
% 1.32/0.67 % (4037456)Time elapsed: 0.098 s
% 1.32/0.67 % (4037456)Peak memory usage: 13 MB
% 1.32/0.67 % (4037456)Instructions burned: 160 (million)
% 1.32/0.67 % (4037467)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=3446395474:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.32/0.67 % (4037469)ott-21_1_sil=16000:fs=off:random_seed=1834512838:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.32/0.67 % TRYING [1]
% 1.32/0.67 % TRYING [2]
% 1.32/0.67 % TRYING [3]
% 1.32/0.67 % (4037466)Instruction limit reached!
% 1.32/0.67 % (4037466)------------------------------
% 1.32/0.67 % (4037466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037466)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037466)Termination reason: Instruction limit
% 1.32/0.67 % (4037466)Termination phase: Saturation
% 1.32/0.67 % (4037466)Time elapsed: 0.085 s
% 1.32/0.67 % (4037466)Peak memory usage: 12 MB
% 1.32/0.67 % (4037466)Instructions burned: 133 (million)
% 1.32/0.67 % TRYING [1]
% 1.32/0.67 % (4037472)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2203438370:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.32/0.67 % TRYING [2]
% 1.32/0.67 % (4037467) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4037445-4037467"...
% 1.32/0.67 % (4037467)...printing done.
% 1.32/0.67 % (4037467)Refutation found. Thanks to Tanya!
% 1.32/0.67 % SZS status Unsatisfiable for theBenchmark
% 1.32/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 1.32/0.67 % (4037467)------------------------------
% 1.32/0.67 % (4037467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (4037467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (4037467)CaDiCaL version: 2.1.3
% 1.32/0.67 % (4037467)Termination reason: Refutation
% 1.32/0.67 % (4037467)Time elapsed: 0.106 s
% 1.32/0.67 % (4037467)Peak memory usage: 14 MB
% 1.32/0.67 % (4037467)Instructions burned: 166 (million)
% 1.32/0.67 % (4037445)Success in time 0.249 s
% 1.32/0.67 % Vampire exiting
%------------------------------------------------------------------------------