%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET513-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:41:05 PM UTC 2026
% Result : Unsatisfiable 11.75s 2.33s
% Output : Refutation 12.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 32
% Syntax : Number of formulae : 181 ( 48 unt; 13 def)
% Number of atoms : 388 ( 121 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 340 ( 133 ~; 199 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 202 ( 0 sgn 202 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subclass(X0,X1)
| member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( member(not_subclass_element(X0,X1),X0)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( ~ member(not_subclass_element(X0,X1),X1)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members2) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',class_elements_are_sets) ).
fof(f7,axiom,
! [X0,X1] :
( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_implies_equal) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f10,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair3) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',ordered_pair) ).
fof(f21,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).
fof(f28,axiom,
! [X2,X0,X1] : intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',restriction1) ).
fof(f30,axiom,
! [X0,X1] :
( restrict(X0,singleton(X1),universal_class) != null_class
| ~ member(X1,domain_of(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).
fof(f67,axiom,
! [X0] :
( X0 = null_class
| member(regular(X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity1) ).
fof(f68,plain,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f67]) ).
fof(f69,axiom,
! [X0] :
( X0 = null_class
| intersection(X0,regular(X0)) = null_class ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity2) ).
fof(f70,plain,
! [X0] :
( null_class = intersection(X0,regular(X0))
| null_class = X0 ),
inference(reorient_equations,[],[f69]) ).
fof(f122,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_3_to_property_1_of_ordered_pair_1) ).
fof(f127,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(f143,plain,
! [X0,X1] :
( null_class != intersection(X0,cross_product(unordered_pair(X1,X1),universal_class))
| ~ member(X1,domain_of(X0)) ),
inference(definition_unfolding,[],[f30,f28,f12]) ).
fof(f185,plain,
unordered_pair(unordered_pair(universal_class,universal_class),unordered_pair(universal_class,unordered_pair(universal_class,universal_class))) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(definition_unfolding,[],[f122,f127,f12]) ).
fof(f190,definition,
sF0 = unordered_pair(universal_class,universal_class),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f191,plain,
unordered_pair(universal_class,universal_class) = sF0,
inference(reorient_equations,[],[f190]) ).
fof(f192,definition,
sF1 = unordered_pair(universal_class,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f193,plain,
unordered_pair(universal_class,sF0) = sF1,
inference(reorient_equations,[],[f192]) ).
fof(f194,definition,
sF2 = unordered_pair(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f195,plain,
unordered_pair(sF0,sF1) = sF2,
inference(reorient_equations,[],[f194]) ).
fof(f196,definition,
sF3 = unordered_pair(null_class,null_class),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f197,plain,
unordered_pair(null_class,null_class) = sF3,
inference(reorient_equations,[],[f196]) ).
fof(f198,definition,
sF4 = unordered_pair(null_class,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f199,plain,
unordered_pair(null_class,sF3) = sF4,
inference(reorient_equations,[],[f198]) ).
fof(f200,plain,
sF2 != sF4,
inference(definition_folding,[],[f185,f199,f197,f195,f193,f191,f191]) ).
fof(f203,plain,
( member(null_class,sF3)
| ~ member(null_class,universal_class) ),
inference(superposition,[],[f9,f197]) ).
fof(f204,plain,
( member(universal_class,sF0)
| ~ member(universal_class,universal_class) ),
inference(superposition,[],[f9,f191]) ).
fof(f207,definition,
( spl5_1
<=> member(universal_class,universal_class) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f209,plain,
( ~ member(universal_class,universal_class)
| spl5_1 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f211,definition,
( spl5_2
<=> member(universal_class,sF1) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f212,plain,
( ~ member(universal_class,sF1)
| spl5_2 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f213,plain,
( member(universal_class,sF1)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f216,definition,
( spl5_3
<=> member(universal_class,sF0) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f218,plain,
( member(universal_class,sF0)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f219,plain,
( ~ spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f204,f216,f207]) ).
fof(f221,definition,
( spl5_4
<=> member(null_class,universal_class) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f223,plain,
( ~ member(null_class,universal_class)
| spl5_4 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f225,definition,
( spl5_5
<=> member(null_class,sF3) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f227,plain,
( member(null_class,sF3)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f228,plain,
( ~ spl5_4
| spl5_5 ),
inference(avatar_split_clause,[],[f203,f225,f221]) ).
fof(f235,definition,
( spl5_7
<=> member(sF0,universal_class) ),
introduced(definition,[new_symbols(definition,[spl5_7])],[avatar_definition]) ).
fof(f236,plain,
( member(sF0,universal_class)
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f237,plain,
( ~ member(sF0,universal_class)
| spl5_7 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f275,plain,
! [X2,X0,X1] :
( subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X0
| not_subclass_element(unordered_pair(X0,X1),X2) = X1 ),
inference(resolution,[],[f2,f8]) ).
fof(f282,plain,
! [X2,X0,X1] :
( member(not_subclass_element(X0,X2),X1)
| ~ subclass(X0,X1)
| subclass(X0,X2) ),
inference(resolution,[],[f1,f2]) ).
fof(f287,plain,
member(sF0,universal_class),
inference(superposition,[],[f11,f191]) ).
fof(f291,plain,
( $false
| spl5_7 ),
inference(forward_subsumption_resolution,[],[f287,f237]) ).
fof(f292,plain,
spl5_7,
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f301,plain,
! [X0,X1] :
( regular(unordered_pair(X0,X1)) = X1
| regular(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(resolution,[],[f68,f8]) ).
fof(f318,definition,
( spl5_16
<=> null_class = sF0 ),
introduced(definition,[new_symbols(definition,[spl5_16])],[avatar_definition]) ).
fof(f319,plain,
( null_class != sF0
| spl5_16 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f320,plain,
( null_class = sF0
| ~ spl5_16 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f337,plain,
! [X0,X1] :
( X0 != X1
| regular(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(equality_factoring,[],[f301]) ).
fof(f395,plain,
! [X0] :
( regular(unordered_pair(X0,X0)) = X0
| unordered_pair(X0,X0) = null_class ),
inference(equality_resolution,[],[f337]) ).
fof(f399,plain,
! [X2,X0,X1] :
( member(not_subclass_element(intersection(X0,X1),X2),X0)
| subclass(intersection(X0,X1),X2) ),
inference(resolution,[],[f21,f2]) ).
fof(f415,plain,
! [X2,X0,X1] :
( member(not_subclass_element(intersection(X0,X1),X2),X1)
| subclass(intersection(X0,X1),X2) ),
inference(resolution,[],[f22,f2]) ).
fof(f448,plain,
! [X0,X1] :
( subclass(intersection(X0,X1),X0)
| subclass(intersection(X0,X1),X0) ),
inference(resolution,[],[f399,f3]) ).
fof(f458,plain,
! [X0,X1] : subclass(intersection(X0,X1),X0),
inference(duplicate_literal_removal,[],[f448]) ).
fof(f470,plain,
! [X0,X1] :
( subclass(intersection(X0,X1),X1)
| subclass(intersection(X0,X1),X1) ),
inference(resolution,[],[f415,f3]) ).
fof(f480,plain,
! [X0,X1] : subclass(intersection(X0,X1),X1),
inference(duplicate_literal_removal,[],[f470]) ).
fof(f493,plain,
! [X0] :
( subclass(null_class,X0)
| null_class = X0 ),
inference(superposition,[],[f458,f70]) ).
fof(f511,definition,
( spl5_27
<=> sF1 = sF3 ),
introduced(definition,[new_symbols(definition,[spl5_27])],[avatar_definition]) ).
fof(f512,plain,
( sF1 != sF3
| spl5_27 ),
inference(avatar_component_clause,[],[f511]) ).
fof(f513,plain,
( sF1 = sF3
| ~ spl5_27 ),
inference(avatar_component_clause,[],[f511]) ).
fof(f599,plain,
! [X0] :
( null_class = X0
| ~ subclass(X0,null_class)
| null_class = X0 ),
inference(resolution,[],[f493,f7]) ).
fof(f601,plain,
! [X0] :
( ~ subclass(X0,null_class)
| null_class = X0 ),
inference(duplicate_literal_removal,[],[f599]) ).
fof(f614,plain,
! [X0] :
( null_class = intersection(unordered_pair(X0,X0),X0)
| unordered_pair(X0,X0) = null_class
| unordered_pair(X0,X0) = null_class ),
inference(superposition,[],[f70,f395]) ).
fof(f615,plain,
! [X0] :
( null_class = intersection(unordered_pair(X0,X0),X0)
| unordered_pair(X0,X0) = null_class ),
inference(duplicate_literal_removal,[],[f614]) ).
fof(f721,plain,
! [X2,X3,X0,X1] :
( ~ subclass(intersection(X2,X1),X3)
| ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,X3) ),
inference(resolution,[],[f23,f1]) ).
fof(f722,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X2)
| ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2)) ),
inference(resolution,[],[f23,f3]) ).
fof(f742,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,universal_class) ),
inference(resolution,[],[f721,f4]) ).
fof(f748,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,X1),X2)
| member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1) ),
inference(resolution,[],[f742,f2]) ).
fof(f796,plain,
! [X0,X1] :
( member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1)
| subclass(X0,X1) ),
inference(resolution,[],[f748,f2]) ).
fof(f806,plain,
! [X0,X1] :
( member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1) ),
inference(duplicate_literal_removal,[],[f796]) ).
fof(f1021,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2))
| ~ subclass(X0,X2)
| subclass(X0,intersection(X1,X2)) ),
inference(resolution,[],[f722,f282]) ).
fof(f1029,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2))
| ~ subclass(X0,X2) ),
inference(duplicate_literal_removal,[],[f1021]) ).
fof(f1708,plain,
( ! [X0] :
( ~ member(universal_class,X0)
| member(universal_class,universal_class) )
| ~ spl5_2 ),
inference(resolution,[],[f213,f742]) ).
fof(f2205,plain,
! [X0] : null_class = intersection(null_class,X0),
inference(resolution,[],[f601,f458]) ).
fof(f2227,plain,
! [X0] :
( null_class != null_class
| ~ member(X0,domain_of(null_class)) ),
inference(superposition,[],[f143,f2205]) ).
fof(f2228,plain,
! [X0] : ~ member(X0,domain_of(null_class)),
inference(trivial_inequality_removal,[],[f2227]) ).
fof(f2303,plain,
null_class = domain_of(null_class),
inference(resolution,[],[f2228,f68]) ).
fof(f2314,plain,
! [X0] : ~ member(X0,null_class),
inference(superposition,[],[f2228,f2303]) ).
fof(f2359,plain,
( member(sF0,sF3)
| ~ spl5_5
| ~ spl5_16 ),
inference(superposition,[],[f227,f320]) ).
fof(f2371,plain,
( ! [X0] : ~ member(X0,sF0)
| ~ spl5_16 ),
inference(superposition,[],[f2314,f320]) ).
fof(f2425,plain,
( sF3 = unordered_pair(sF0,sF0)
| ~ spl5_16 ),
inference(superposition,[],[f197,f320]) ).
fof(f2643,plain,
( $false
| ~ spl5_3
| ~ spl5_16 ),
inference(resolution,[],[f2371,f218]) ).
fof(f2654,plain,
( ~ spl5_3
| ~ spl5_16 ),
inference(avatar_contradiction_clause,[],[f2643]) ).
fof(f2660,plain,
( ! [X0] : ~ member(universal_class,X0)
| spl5_1
| ~ spl5_2 ),
inference(forward_subsumption_resolution,[],[f1708,f209]) ).
fof(f2668,plain,
( $false
| spl5_1
| ~ spl5_2 ),
inference(resolution,[],[f2660,f213]) ).
fof(f2669,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f2668]) ).
fof(f2765,plain,
( ~ member(sF0,universal_class)
| spl5_4
| ~ spl5_16 ),
inference(forward_demodulation,[],[f223,f320]) ).
fof(f2776,plain,
( $false
| spl5_4
| ~ spl5_7
| ~ spl5_16 ),
inference(forward_subsumption_resolution,[],[f2765,f236]) ).
fof(f2777,plain,
( spl5_4
| ~ spl5_7
| ~ spl5_16 ),
inference(avatar_contradiction_clause,[],[f2776]) ).
fof(f3332,plain,
! [X0,X1] :
( subclass(X0,intersection(X0,X1))
| ~ subclass(X0,X1)
| subclass(X0,intersection(X0,X1)) ),
inference(resolution,[],[f1029,f2]) ).
fof(f3354,plain,
! [X0,X1] :
( subclass(X0,intersection(X0,X1))
| ~ subclass(X0,X1) ),
inference(duplicate_literal_removal,[],[f3332]) ).
fof(f3364,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| ~ subclass(intersection(X0,X1),X0)
| intersection(X0,X1) = X0 ),
inference(resolution,[],[f3354,f7]) ).
fof(f3383,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| intersection(X0,X1) = X0 ),
inference(forward_subsumption_resolution,[],[f3364,f458]) ).
fof(f3386,plain,
! [X0] : intersection(X0,universal_class) = X0,
inference(resolution,[],[f3383,f4]) ).
fof(f3389,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),X2) = X1
| not_subclass_element(unordered_pair(X0,X1),X2) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(resolution,[],[f3383,f275]) ).
fof(f3404,plain,
( null_class = unordered_pair(universal_class,universal_class)
| null_class = unordered_pair(universal_class,universal_class) ),
inference(superposition,[],[f3386,f615]) ).
fof(f3420,plain,
null_class = unordered_pair(universal_class,universal_class),
inference(duplicate_literal_removal,[],[f3404]) ).
fof(f3423,plain,
null_class = sF0,
inference(forward_demodulation,[],[f3420,f191]) ).
fof(f3522,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X1,X0),X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(superposition,[],[f806,f3389]) ).
fof(f3525,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| subclass(unordered_pair(X1,X0),X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(superposition,[],[f3,f3389]) ).
fof(f3529,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(superposition,[],[f806,f3389]) ).
fof(f3532,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(superposition,[],[f3,f3389]) ).
fof(f3533,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X0,X1))
| subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(superposition,[],[f2,f3389]) ).
fof(f3546,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X0,X1))
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f3533,f3383]) ).
fof(f3547,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f3532,f3383]) ).
fof(f3549,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f3529,f3383]) ).
fof(f3553,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(forward_subsumption_resolution,[],[f3525,f3383]) ).
fof(f3555,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(forward_subsumption_resolution,[],[f3522,f3383]) ).
fof(f3579,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X0,X2)) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X0,X2))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f3547,f9]) ).
fof(f3599,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X0,X2)) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X0,X2)) ),
inference(forward_subsumption_resolution,[],[f3579,f3549]) ).
fof(f3627,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X1,X2)) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(resolution,[],[f3553,f9]) ).
fof(f3647,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X1,X2)) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f3627,f3555]) ).
fof(f3819,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X1,X0),unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(superposition,[],[f806,f3599]) ).
fof(f3822,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| subclass(unordered_pair(X1,X0),unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(superposition,[],[f3,f3599]) ).
fof(f3826,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f3822,f3383]) ).
fof(f3828,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f3819,f3383]) ).
fof(f3839,plain,
! [X0,X1] :
( unordered_pair(X0,X0) = intersection(unordered_pair(X0,X0),unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f3826,f9]) ).
fof(f3868,plain,
! [X0,X1] : unordered_pair(X0,X0) = intersection(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(forward_subsumption_resolution,[],[f3839,f3828]) ).
fof(f3887,plain,
! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(superposition,[],[f480,f3868]) ).
fof(f3976,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X0,X1),unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(superposition,[],[f806,f3647]) ).
fof(f3979,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| subclass(unordered_pair(X0,X1),unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(superposition,[],[f3,f3647]) ).
fof(f3983,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f3979,f3383]) ).
fof(f3985,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f3976,f3383]) ).
fof(f3998,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f3983,f10]) ).
fof(f4025,plain,
! [X0,X1] : unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X0)),
inference(forward_subsumption_resolution,[],[f3998,f3985]) ).
fof(f4048,plain,
! [X0,X1] : subclass(unordered_pair(X0,X1),unordered_pair(X1,X0)),
inference(superposition,[],[f480,f4025]) ).
fof(f4194,plain,
! [X0,X1] :
( ~ subclass(unordered_pair(X0,X1),unordered_pair(X1,X0))
| unordered_pair(X0,X1) = unordered_pair(X1,X0) ),
inference(resolution,[],[f4048,f7]) ).
fof(f4211,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(forward_subsumption_resolution,[],[f4194,f4048]) ).
fof(f4292,plain,
sF1 = unordered_pair(sF0,universal_class),
inference(superposition,[],[f193,f4211]) ).
fof(f4334,plain,
subclass(unordered_pair(sF0,sF0),sF1),
inference(superposition,[],[f3887,f4292]) ).
fof(f4347,plain,
( subclass(sF3,sF1)
| ~ spl5_16 ),
inference(forward_demodulation,[],[f4334,f2425]) ).
fof(f4507,plain,
( ~ subclass(sF1,sF3)
| sF1 = sF3
| ~ spl5_16 ),
inference(resolution,[],[f4347,f7]) ).
fof(f4508,plain,
( ~ subclass(sF1,sF3)
| ~ spl5_16
| spl5_27 ),
inference(forward_subsumption_resolution,[],[f4507,f512]) ).
fof(f4812,plain,
! [X0] :
( member(universal_class,sF1)
| sF0 = not_subclass_element(sF1,X0)
| sF1 = intersection(sF1,X0) ),
inference(superposition,[],[f3546,f193]) ).
fof(f4821,plain,
( ! [X0] :
( sF0 = not_subclass_element(sF1,X0)
| sF1 = intersection(sF1,X0) )
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f4812,f212]) ).
fof(f6008,plain,
( ! [X0] :
( ~ member(sF0,X0)
| subclass(sF1,X0)
| sF1 = intersection(sF1,X0) )
| spl5_2 ),
inference(superposition,[],[f3,f4821]) ).
fof(f6014,plain,
( ! [X0] :
( ~ member(sF0,X0)
| sF1 = intersection(sF1,X0) )
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f6008,f3383]) ).
fof(f6036,plain,
( sF1 = intersection(sF1,sF3)
| spl5_2
| ~ spl5_5
| ~ spl5_16 ),
inference(resolution,[],[f6014,f2359]) ).
fof(f8956,plain,
( subclass(sF1,sF3)
| spl5_2
| ~ spl5_5
| ~ spl5_16 ),
inference(superposition,[],[f480,f6036]) ).
fof(f8964,plain,
( $false
| spl5_2
| ~ spl5_5
| ~ spl5_16
| spl5_27 ),
inference(forward_subsumption_resolution,[],[f8956,f4508]) ).
fof(f8965,plain,
( spl5_2
| ~ spl5_5
| ~ spl5_16
| spl5_27 ),
inference(avatar_contradiction_clause,[],[f8964]) ).
fof(f8971,plain,
( sF4 = unordered_pair(null_class,sF1)
| ~ spl5_27 ),
inference(superposition,[],[f199,f513]) ).
fof(f9042,plain,
( unordered_pair(sF0,sF1) = sF4
| ~ spl5_16
| ~ spl5_27 ),
inference(forward_demodulation,[],[f8971,f320]) ).
fof(f9051,plain,
( sF2 = sF4
| ~ spl5_16
| ~ spl5_27 ),
inference(forward_demodulation,[],[f9042,f195]) ).
fof(f9053,plain,
( $false
| ~ spl5_16
| ~ spl5_27 ),
inference(forward_subsumption_resolution,[],[f9051,f200]) ).
fof(f9054,plain,
( ~ spl5_16
| ~ spl5_27 ),
inference(avatar_contradiction_clause,[],[f9053]) ).
fof(f9124,plain,
( $false
| spl5_16 ),
inference(forward_subsumption_resolution,[],[f3423,f319]) ).
fof(f9125,plain,
spl5_16,
inference(avatar_contradiction_clause,[],[f9124]) ).
cnf(s2,plain,
( ~ spl5_1
| spl5_3 ),
inference(sat_conversion,[],[f219]) ).
cnf(s3,plain,
( ~ spl5_4
| spl5_5 ),
inference(sat_conversion,[],[f228]) ).
cnf(s9,plain,
spl5_7,
inference(sat_conversion,[],[f292]) ).
cnf(s96,plain,
( ~ spl5_3
| ~ spl5_16 ),
inference(sat_conversion,[],[f2654]) ).
cnf(s97,plain,
( spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f2669]) ).
cnf(s104,plain,
( spl5_4
| ~ spl5_7
| ~ spl5_16 ),
inference(sat_conversion,[],[f2777]) ).
cnf(s251,plain,
( spl5_2
| ~ spl5_5
| ~ spl5_16
| spl5_27 ),
inference(sat_conversion,[],[f8965]) ).
cnf(s256,plain,
( ~ spl5_16
| ~ spl5_27 ),
inference(sat_conversion,[],[f9054]) ).
cnf(s267,plain,
spl5_16,
inference(sat_conversion,[],[f9125]) ).
cnf(s312,plain,
~ spl5_27,
inference(rat,[],[s256,s267]) ).
cnf(s313,plain,
( spl5_2
| ~ spl5_5 ),
inference(rat,[],[s251,s312,s267]) ).
cnf(s401,plain,
( spl5_4
| ~ spl5_7 ),
inference(rat,[],[s104,s267]) ).
cnf(s405,plain,
~ spl5_3,
inference(rat,[],[s96,s267]) ).
cnf(s423,plain,
spl5_4,
inference(rat,[],[s401,s9]) ).
cnf(s435,plain,
spl5_5,
inference(rat,[],[s3,s423]) ).
cnf(s436,plain,
spl5_2,
inference(rat,[],[s313,s435]) ).
cnf(s438,plain,
spl5_1,
inference(rat,[],[s97,s436]) ).
cnf(s441,plain,
$false,
inference(rat,[],[s2,s405,s438]) ).
fof(f9306,plain,
$false,
inference(avatar_sat_refutation,[],[s441]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET513-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n006.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 02:01:11 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 10.36/2.07 % (3517768)Input is clausal, will run a generic CNF schedule.
% 10.36/2.07 % (3517778)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1257434366:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 10.36/2.07 % (3517774)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1327375488:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 10.36/2.07 % (3517776)lrs+10_1_sil=8000:sp=occurrence:random_seed=1180892429:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 10.36/2.07 % (3517777)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=31215529:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 10.36/2.07 % (3517775)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1142700172:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 10.36/2.07 % (3517779)dis-21_1_sil=8000:lcm=predicate:random_seed=3935443382:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 10.36/2.07 % (3517773)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=504934038:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 10.36/2.07 % (3517776)Refutation not found, incomplete strategy
% 10.36/2.07 % (3517776)------------------------------
% 10.36/2.07 % (3517776)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.36/2.07 % (3517776)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.36/2.07 % (3517776)CaDiCaL version: 2.1.3
% 10.36/2.07 % (3517776)Termination reason: Refutation not found, incomplete strategy
% 10.36/2.07 % (3517776)Time elapsed: 0.001 s
% 10.36/2.07 % (3517776)Peak memory usage: 88 MB
% 10.36/2.07 % (3517776)Instructions burned: 1 (million)
% 10.36/2.07 % (3517778)Instruction limit reached!
% 10.36/2.07 % (3517778)------------------------------
% 10.36/2.07 % (3517778)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.36/2.07 % (3517778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.36/2.07 % (3517778)CaDiCaL version: 2.1.3
% 10.36/2.07 % (3517778)Termination reason: Instruction limit
% 10.36/2.07 % (3517778)Termination phase: Saturation
% 10.36/2.07 % (3517778)Time elapsed: 0.072 s
% 10.36/2.07 % (3517778)Peak memory usage: 90 MB
% 10.36/2.07 % (3517778)Instructions burned: 182 (million)
% 10.36/2.07 % (3517777)Instruction limit reached!
% 10.36/2.07 % (3517777)------------------------------
% 10.36/2.07 % (3517777)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.36/2.07 % (3517777)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.36/2.07 % (3517777)CaDiCaL version: 2.1.3
% 10.36/2.07 % (3517777)Termination reason: Instruction limit
% 10.36/2.07 % (3517777)Termination phase: Saturation
% 10.36/2.07 % (3517777)Time elapsed: 0.066 s
% 10.36/2.07 % (3517777)Peak memory usage: 88 MB
% 10.36/2.07 % (3517777)Instructions burned: 115 (million)
% 10.36/2.07 % (3517779)Instruction limit reached!
% 10.36/2.07 % (3517779)------------------------------
% 10.36/2.07 % (3517779)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.36/2.07 % (3517779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.36/2.07 % (3517779)CaDiCaL version: 2.1.3
% 10.36/2.07 % (3517779)Termination reason: Instruction limit
% 10.36/2.07 % (3517779)Termination phase: Saturation
% 10.36/2.07 % (3517779)Time elapsed: 0.067 s
% 10.36/2.07 % (3517779)Peak memory usage: 89 MB
% 10.36/2.07 % (3517779)Instructions burned: 117 (million)
% 10.36/2.07 % (3517787)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3602629735:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 10.36/2.07 % (3517787)Refutation not found, incomplete strategy
% 10.36/2.07 % (3517787)------------------------------
% 10.36/2.07 % (3517787)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.36/2.07 % (3517787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.36/2.07 % (3517787)CaDiCaL version: 2.1.3
% 10.36/2.07 % (3517787)Termination reason: Refutation not found, incomplete strategy
% 10.36/2.07 % (3517787)Time elapsed: 0.002 s
% 10.36/2.07 % (3517787)Peak memory usage: 88 MB
% 10.36/2.07 % (3517787)Instructions burned: 3 (million)
% 10.36/2.07 % (3517788)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3050322321:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 11.75/2.33 % (3517789)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1120095657:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 11.75/2.33 % (3517789)Refutation not found, incomplete strategy
% 11.75/2.33 % (3517789)------------------------------
% 11.75/2.33 % (3517789)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517789)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517789)Termination reason: Refutation not found, incomplete strategy
% 11.75/2.33 % (3517789)Time elapsed: 0.003 s
% 11.75/2.33 % (3517789)Peak memory usage: 88 MB
% 11.75/2.33 % (3517789)Instructions burned: 3 (million)
% 11.75/2.33 % (3517776)------------------------------
% 11.75/2.33 % (3517776)------------------------------
% 11.75/2.33 % (3517787)------------------------------
% 11.75/2.33 % (3517787)------------------------------
% 11.75/2.33 % (3517788)Instruction limit reached!
% 11.75/2.33 % (3517788)------------------------------
% 11.75/2.33 % (3517788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517788)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517788)Termination reason: Instruction limit
% 11.75/2.33 % (3517788)Termination phase: Saturation
% 11.75/2.33 % (3517788)Time elapsed: 0.109 s
% 11.75/2.33 % (3517788)Peak memory usage: 91 MB
% 11.75/2.33 % (3517788)Instructions burned: 189 (million)
% 11.75/2.33 % (3517793)lrs+10_64_to=lpo:sil=8000:random_seed=1316786965:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 11.75/2.33 % (3517794)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2939089317:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 11.75/2.33 % (3517795)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3970610259:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 11.75/2.33 % (3517794)Instruction limit reached!
% 11.75/2.33 % (3517794)------------------------------
% 11.75/2.33 % (3517794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517794)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517794)Termination reason: Instruction limit
% 11.75/2.33 % (3517794)Termination phase: Saturation
% 11.75/2.33 % (3517794)Time elapsed: 0.065 s
% 11.75/2.33 % (3517794)Peak memory usage: 90 MB
% 11.75/2.33 % (3517794)Instructions burned: 197 (million)
% 11.75/2.33 % (3517789)------------------------------
% 11.75/2.33 % (3517789)------------------------------
% 11.75/2.33 % (3517793)Instruction limit reached!
% 11.75/2.33 % (3517793)------------------------------
% 11.75/2.33 % (3517793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517793)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517793)Termination reason: Instruction limit
% 11.75/2.33 % (3517793)Termination phase: Saturation
% 11.75/2.33 % (3517793)Time elapsed: 0.080 s
% 11.75/2.33 % (3517793)Peak memory usage: 89 MB
% 11.75/2.33 % (3517793)Instructions burned: 126 (million)
% 11.75/2.33 % (3517799)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2842988666:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 11.75/2.33 % (3517795)Instruction limit reached!
% 11.75/2.33 % (3517795)------------------------------
% 11.75/2.33 % (3517795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517795)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517795)Termination reason: Instruction limit
% 11.75/2.33 % (3517795)Termination phase: Saturation
% 11.75/2.33 % (3517795)Time elapsed: 0.111 s
% 11.75/2.33 % (3517795)Peak memory usage: 91 MB
% 11.75/2.33 % (3517795)Instructions burned: 158 (million)
% 11.75/2.33 % (3517800)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=4177289976:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2994 on theBenchmark for (2994ds/106Mi)
% 11.75/2.33 % (3517801)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1868906395:i=107_2993 on theBenchmark for (2993ds/107Mi)
% 11.75/2.33 % (3517801)Refutation not found, incomplete strategy
% 11.75/2.33 % (3517801)------------------------------
% 11.75/2.33 % (3517801)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517801)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517801)Termination reason: Refutation not found, incomplete strategy
% 11.75/2.33 % (3517801)Time elapsed: 0.005 s
% 11.75/2.33 % (3517801)Peak memory usage: 88 MB
% 11.75/2.33 % (3517801)Instructions burned: 8 (million)
% 11.75/2.33 % (3517800)Instruction limit reached!
% 11.75/2.33 % (3517800)------------------------------
% 11.75/2.33 % (3517800)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517800)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517800)Termination reason: Instruction limit
% 11.75/2.33 % (3517800)Termination phase: Saturation
% 11.75/2.33 % (3517800)Time elapsed: 0.067 s
% 11.75/2.33 % (3517800)Peak memory usage: 90 MB
% 11.75/2.33 % (3517800)Instructions burned: 107 (million)
% 11.75/2.33 % (3517803)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3255531564:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2993 on theBenchmark for (2993ds/242Mi)
% 11.75/2.33 % (3517806)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2016135000:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 11.75/2.33 % (3517801)------------------------------
% 11.75/2.33 % (3517801)------------------------------
% 11.75/2.33 % (3517803)Instruction limit reached!
% 11.75/2.33 % (3517803)------------------------------
% 11.75/2.33 % (3517803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517803)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517803)Termination reason: Instruction limit
% 11.75/2.33 % (3517803)Termination phase: Saturation
% 11.75/2.33 % (3517803)Time elapsed: 0.169 s
% 11.75/2.33 % (3517803)Peak memory usage: 90 MB
% 11.75/2.33 % (3517803)Instructions burned: 243 (million)
% 11.75/2.33 % (3517809)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=3049600056:i=134:sd=2:doe=on:ss=axioms:sgt=14_2990 on theBenchmark for (2990ds/134Mi)
% 11.75/2.33 % (3517810)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=1869881177:i=499:bd=all_2990 on theBenchmark for (2990ds/499Mi)
% 11.75/2.33 % (3517809)Instruction limit reached!
% 11.75/2.33 % (3517809)------------------------------
% 11.75/2.33 % (3517809)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517809)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517809)Termination reason: Instruction limit
% 11.75/2.33 % (3517809)Termination phase: Saturation
% 11.75/2.33 % (3517809)Time elapsed: 0.094 s
% 11.75/2.33 % (3517809)Peak memory usage: 90 MB
% 11.75/2.33 % (3517809)Instructions burned: 135 (million)
% 11.75/2.33 % (3517813)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=808933515:i=191:fgj=on:bd=all_2987 on theBenchmark for (2987ds/191Mi)
% 11.75/2.33 % (3517810)Instruction limit reached!
% 11.75/2.33 % (3517810)------------------------------
% 11.75/2.33 % (3517810)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517810)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517810)Termination reason: Instruction limit
% 11.75/2.33 % (3517810)Termination phase: Saturation
% 11.75/2.33 % (3517810)Time elapsed: 0.301 s
% 11.75/2.33 % (3517810)Peak memory usage: 94 MB
% 11.75/2.33 % (3517810)Instructions burned: 501 (million)
% 11.75/2.33 % (3517813)Instruction limit reached!
% 11.75/2.33 % (3517813)------------------------------
% 11.75/2.33 % (3517813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517813)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517813)Termination reason: Instruction limit
% 11.75/2.33 % (3517813)Termination phase: Saturation
% 11.75/2.33 % (3517813)Time elapsed: 0.111 s
% 11.75/2.33 % (3517813)Peak memory usage: 89 MB
% 11.75/2.33 % (3517813)Instructions burned: 193 (million)
% 11.75/2.33 % (3517773)First to succeed.
% 11.75/2.33 % (3517773)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3517768"
% 11.75/2.33 % (3517815)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=1609466008:i=264:kws=precedence:fsr=off_2985 on theBenchmark for (2985ds/264Mi)
% 11.75/2.33 % (3517816)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=1172168292:cond=on:i=156:bs=on:gtg=exists_all:er=known_2985 on theBenchmark for (2985ds/156Mi)
% 11.75/2.33 % (3517816)Instruction limit reached!
% 11.75/2.33 % (3517816)------------------------------
% 11.75/2.33 % (3517816)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.75/2.33 % (3517816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.75/2.33 % (3517816)CaDiCaL version: 2.1.3
% 11.75/2.33 % (3517816)Termination reason: Instruction limit
% 11.75/2.33 % (3517816)Termination phase: Saturation
% 11.75/2.33 % (3517816)Time elapsed: 0.106 s
% 11.75/2.33 % (3517816)Peak memory usage: 89 MB
% 11.75/2.33 % (3517816)Instructions burned: 158 (million)
% 11.75/2.33 % (3517773)Refutation found. Thanks to Tanya!
% 11.75/2.33 % SZS status Unsatisfiable for theBenchmark
% 11.75/2.33 % SZS output start Proof for theBenchmark
% See solution above
% 12.66/2.53 % (3517773)------------------------------
% 12.66/2.53 % (3517773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.66/2.53 % (3517773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.66/2.53 % (3517773)CaDiCaL version: 2.1.3
% 12.66/2.53 % (3517773)Termination reason: Refutation
% 12.66/2.53 % (3517773)Time elapsed: 1.346 s
% 12.66/2.53 % (3517773)Peak memory usage: 138 MB
% 12.66/2.53 % (3517773)Instructions burned: 2024 (million)
% 12.66/2.53 % (3517773)------------------------------
% 12.66/2.53 % (3517773)------------------------------
% 12.66/2.53 % (3517768)Success in time 1.74 s
% 12.66/2.53 % Vampire exiting
%------------------------------------------------------------------------------