%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET510-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:43:53 PM UTC 2026
% Result : Unsatisfiable 2.29s 0.99s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 32
% Syntax : Number of formulae : 131 ( 36 unt; 10 def)
% Number of atoms : 296 ( 53 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 307 ( 142 ~; 156 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 7 con; 0-3 aty)
% Number of variables : 76 ( 0 sgn 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subclass(X0,X1)
| member(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
fof(f9,axiom,
! [X0,X1] :
( ~ member(X0,universal_class)
| member(X0,unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f21,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f25,axiom,
! [X0,X1] :
( ~ member(X0,universal_class)
| member(X0,complement(X1))
| member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f28,axiom,
! [X2,X0,X1] : intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
fof(f39,axiom,
! [X0] : domain_of(flip(cross_product(X0,universal_class))) = inverse(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inverse) ).
fof(f40,axiom,
! [X0] : domain_of(inverse(X0)) = range_of(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',range_of) ).
fof(f43,axiom,
! [X0,X1] : range_of(restrict(X0,X1,universal_class)) = image(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',image) ).
fof(f48,axiom,
! [X0] :
( member(null_class,X0)
| ~ inductive(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inductive1) ).
fof(f50,axiom,
! [X0] :
( ~ member(null_class,X0)
| ~ subclass(image(successor_relation,X0),X0)
| inductive(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inductive3) ).
fof(f51,axiom,
inductive(omega),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).
fof(f54,axiom,
! [X0] : domain_of(restrict(element_relation,universal_class,X0)) = sum_class(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',sum_class_definition) ).
fof(f67,axiom,
! [X0] :
( X0 = null_class
| member(regular(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',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/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
fof(f70,plain,
! [X0] :
( null_class = intersection(X0,regular(X0))
| null_class = X0 ),
inference(reorient_equations,[],[f69]) ).
fof(f71,axiom,
! [X0,X1] : sum_class(image(X0,singleton(X1))) = apply(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',apply) ).
fof(f73,axiom,
! [X0] :
( ~ member(X0,universal_class)
| X0 = null_class
| member(apply(choice,X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',choice2) ).
fof(f74,plain,
! [X0] :
( ~ member(X0,universal_class)
| null_class = X0
| member(apply(choice,X0),X0) ),
inference(reorient_equations,[],[f73]) ).
fof(f122,negated_conjecture,
singleton(universal_class) != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_singleton_is_null_class_1) ).
fof(f123,plain,
null_class != singleton(universal_class),
inference(reorient_equations,[],[f122]) ).
fof(f124,plain,
! [X0] : sum_class(X0) = domain_of(intersection(element_relation,cross_product(universal_class,X0))),
inference(definition_unfolding,[],[f54,f28]) ).
fof(f125,plain,
! [X0] : range_of(X0) = domain_of(domain_of(flip(cross_product(X0,universal_class)))),
inference(definition_unfolding,[],[f40,f39]) ).
fof(f126,plain,
! [X0,X1] : image(X0,X1) = domain_of(domain_of(flip(cross_product(intersection(X0,cross_product(X1,universal_class)),universal_class)))),
inference(definition_unfolding,[],[f43,f125,f28]) ).
fof(f127,plain,
! [X0,X1] : apply(X0,X1) = domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(X0,cross_product(unordered_pair(X1,X1),universal_class)),universal_class))))))),
inference(definition_unfolding,[],[f71,f124,f126,f12]) ).
fof(f153,plain,
! [X0] :
( ~ subclass(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(X0,universal_class)),universal_class)))),X0)
| ~ member(null_class,X0)
| inductive(X0) ),
inference(definition_unfolding,[],[f50,f126]) ).
fof(f163,plain,
! [X0] :
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(X0,X0),universal_class)),universal_class))))))),X0)
| null_class = X0
| ~ member(X0,universal_class) ),
inference(definition_unfolding,[],[f74,f127]) ).
fof(f186,plain,
null_class != unordered_pair(universal_class,universal_class),
inference(definition_unfolding,[],[f123,f12]) ).
fof(f191,definition,
sF0 = unordered_pair(universal_class,universal_class),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f192,plain,
unordered_pair(universal_class,universal_class) = sF0,
inference(reorient_equations,[],[f191]) ).
fof(f193,plain,
null_class != sF0,
inference(definition_folding,[],[f186,f192]) ).
fof(f194,plain,
null_class != unordered_pair(universal_class,universal_class),
inference(superposition,[],[f193,f192]) ).
fof(f195,plain,
! [X0] :
( ~ inductive(complement(X0))
| ~ member(null_class,X0) ),
inference(resolution,[],[f24,f48]) ).
fof(f206,definition,
( spl1_1
<=> universal_class = null_class ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f207,plain,
( universal_class != null_class
| spl1_1 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f208,plain,
( universal_class = null_class
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f214,definition,
( spl1_3
<=> inductive(universal_class) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f215,plain,
( inductive(universal_class)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f216,plain,
( ~ inductive(universal_class)
| spl1_3 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f251,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| member(null_class,X1)
| ~ inductive(X0) ),
inference(resolution,[],[f1,f48]) ).
fof(f252,plain,
! [X0,X1] :
( member(regular(X0),X1)
| ~ subclass(X0,X1)
| null_class = X0 ),
inference(resolution,[],[f1,f68]) ).
fof(f334,plain,
! [X0,X1] :
( ~ member(X0,null_class)
| member(X0,X1)
| null_class = X1 ),
inference(superposition,[],[f21,f70]) ).
fof(f391,plain,
! [X0,X1] :
( regular(unordered_pair(X0,X1)) = X0
| regular(unordered_pair(X0,X1)) = X1
| unordered_pair(X0,X1) = null_class ),
inference(resolution,[],[f8,f68]) ).
fof(f560,plain,
( ~ member(null_class,universal_class)
| inductive(universal_class) ),
inference(resolution,[],[f153,f4]) ).
fof(f563,plain,
( ~ member(null_class,universal_class)
| spl1_3 ),
inference(forward_subsumption_resolution,[],[f560,f216]) ).
fof(f737,plain,
! [X0] :
( universal_class = null_class
| ~ member(universal_class,universal_class)
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),complement(X0))
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),X0) ),
inference(resolution,[],[f163,f25]) ).
fof(f754,plain,
( ! [X0] :
( ~ member(universal_class,universal_class)
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),complement(X0))
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),X0) )
| spl1_1 ),
inference(forward_subsumption_resolution,[],[f737,f207]) ).
fof(f762,definition,
( spl1_55
<=> member(universal_class,universal_class) ),
introduced(definition,[new_symbols(definition,[spl1_55])],[avatar_definition]) ).
fof(f763,plain,
( member(universal_class,universal_class)
| ~ spl1_55 ),
inference(avatar_component_clause,[],[f762]) ).
fof(f764,plain,
( ~ member(universal_class,universal_class)
| spl1_55 ),
inference(avatar_component_clause,[],[f762]) ).
fof(f771,definition,
( spl1_57
<=> ! [X0] :
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),complement(X0))
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_57])],[avatar_definition]) ).
fof(f772,plain,
( ! [X0] :
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),complement(X0))
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),X0) )
| ~ spl1_57 ),
inference(avatar_component_clause,[],[f771]) ).
fof(f773,plain,
( spl1_57
| ~ spl1_55
| spl1_1 ),
inference(avatar_split_clause,[],[f754,f206,f762,f771]) ).
fof(f905,plain,
! [X0] :
( member(null_class,universal_class)
| ~ inductive(X0) ),
inference(resolution,[],[f251,f4]) ).
fof(f939,plain,
( ! [X0] : ~ inductive(X0)
| spl1_3 ),
inference(forward_subsumption_resolution,[],[f905,f563]) ).
fof(f955,plain,
( $false
| spl1_3 ),
inference(resolution,[],[f939,f51]) ).
fof(f956,plain,
spl1_3,
inference(avatar_contradiction_clause,[],[f955]) ).
fof(f1050,definition,
( spl1_79
<=> ! [X0] : ~ inductive(X0) ),
introduced(definition,[new_symbols(definition,[spl1_79])],[avatar_definition]) ).
fof(f1051,plain,
( ! [X0] : ~ inductive(X0)
| ~ spl1_79 ),
inference(avatar_component_clause,[],[f1050]) ).
fof(f1123,definition,
( spl1_91
<=> inductive(null_class) ),
introduced(definition,[new_symbols(definition,[spl1_91])],[avatar_definition]) ).
fof(f1124,plain,
( inductive(null_class)
| ~ spl1_91 ),
inference(avatar_component_clause,[],[f1123]) ).
fof(f1125,plain,
( ~ inductive(null_class)
| spl1_91 ),
inference(avatar_component_clause,[],[f1123]) ).
fof(f1160,definition,
( spl1_97
<=> member(null_class,universal_class) ),
introduced(definition,[new_symbols(definition,[spl1_97])],[avatar_definition]) ).
fof(f1162,plain,
( member(null_class,universal_class)
| ~ spl1_97 ),
inference(avatar_component_clause,[],[f1160]) ).
fof(f1163,plain,
( spl1_79
| spl1_97 ),
inference(avatar_split_clause,[],[f905,f1160,f1050]) ).
fof(f1191,plain,
( $false
| ~ spl1_79 ),
inference(resolution,[],[f1051,f51]) ).
fof(f1194,plain,
~ spl1_79,
inference(avatar_contradiction_clause,[],[f1191]) ).
fof(f2341,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(universal_class,universal_class)
| regular(unordered_pair(X0,X1)) = X0
| regular(unordered_pair(X0,X1)) = X1 ),
inference(superposition,[],[f194,f391]) ).
fof(f3990,plain,
( universal_class = regular(unordered_pair(universal_class,universal_class))
| universal_class = regular(unordered_pair(universal_class,universal_class)) ),
inference(equality_resolution,[],[f2341]) ).
fof(f3991,plain,
universal_class = regular(unordered_pair(universal_class,universal_class)),
inference(duplicate_literal_removal,[],[f3990]) ).
fof(f4006,plain,
( ~ inductive(universal_class)
| ~ spl1_1
| spl1_91 ),
inference(superposition,[],[f1125,f208]) ).
fof(f4013,plain,
( $false
| ~ spl1_1
| ~ spl1_3
| spl1_91 ),
inference(forward_subsumption_resolution,[],[f4006,f215]) ).
fof(f4014,plain,
( ~ spl1_1
| ~ spl1_3
| spl1_91 ),
inference(avatar_contradiction_clause,[],[f4013]) ).
fof(f4051,plain,
( ! [X0] : member(universal_class,unordered_pair(universal_class,X0))
| ~ spl1_55 ),
inference(resolution,[],[f763,f9]) ).
fof(f4336,plain,
! [X0] :
( member(universal_class,X0)
| ~ subclass(unordered_pair(universal_class,universal_class),X0)
| null_class = unordered_pair(universal_class,universal_class) ),
inference(superposition,[],[f252,f3991]) ).
fof(f4350,plain,
! [X0] :
( ~ subclass(unordered_pair(universal_class,universal_class),X0)
| member(universal_class,X0) ),
inference(forward_subsumption_resolution,[],[f4336,f194]) ).
fof(f4409,plain,
member(universal_class,universal_class),
inference(resolution,[],[f4350,f4]) ).
fof(f4689,definition,
( spl1_333
<=> member(universal_class,null_class) ),
introduced(definition,[new_symbols(definition,[spl1_333])],[avatar_definition]) ).
fof(f4690,plain,
( ~ member(universal_class,null_class)
| spl1_333 ),
inference(avatar_component_clause,[],[f4689]) ).
fof(f4691,plain,
( member(universal_class,null_class)
| ~ spl1_333 ),
inference(avatar_component_clause,[],[f4689]) ).
fof(f4698,definition,
( spl1_335
<=> ! [X0] :
( member(universal_class,X0)
| null_class = X0 ) ),
introduced(definition,[new_symbols(definition,[spl1_335])],[avatar_definition]) ).
fof(f4699,plain,
( ! [X0] :
( member(universal_class,X0)
| null_class = X0 )
| ~ spl1_335 ),
inference(avatar_component_clause,[],[f4698]) ).
fof(f4715,plain,
( ! [X0] :
( member(universal_class,X0)
| null_class = X0 )
| ~ spl1_333 ),
inference(resolution,[],[f4691,f334]) ).
fof(f4720,plain,
( spl1_335
| ~ spl1_333 ),
inference(avatar_split_clause,[],[f4715,f4689,f4698]) ).
fof(f4732,plain,
( ! [X0] :
( ~ member(universal_class,intersection(X0,regular(X0)))
| null_class = X0 )
| spl1_333 ),
inference(superposition,[],[f4690,f70]) ).
fof(f4833,plain,
( ~ member(universal_class,intersection(unordered_pair(universal_class,universal_class),universal_class))
| null_class = unordered_pair(universal_class,universal_class)
| spl1_333 ),
inference(superposition,[],[f4732,f3991]) ).
fof(f4841,plain,
( ~ member(universal_class,intersection(unordered_pair(universal_class,universal_class),universal_class))
| spl1_333 ),
inference(forward_subsumption_resolution,[],[f4833,f194]) ).
fof(f4842,plain,
( ~ member(universal_class,universal_class)
| ~ member(universal_class,unordered_pair(universal_class,universal_class))
| spl1_333 ),
inference(resolution,[],[f4841,f23]) ).
fof(f4844,plain,
( ~ member(universal_class,unordered_pair(universal_class,universal_class))
| ~ spl1_55
| spl1_333 ),
inference(forward_subsumption_resolution,[],[f4842,f763]) ).
fof(f4845,plain,
( $false
| ~ spl1_55
| spl1_333 ),
inference(forward_subsumption_resolution,[],[f4844,f4051]) ).
fof(f4846,plain,
( ~ spl1_55
| spl1_333 ),
inference(avatar_contradiction_clause,[],[f4845]) ).
fof(f4848,plain,
( $false
| spl1_55 ),
inference(forward_subsumption_resolution,[],[f4409,f764]) ).
fof(f4849,plain,
spl1_55,
inference(avatar_contradiction_clause,[],[f4848]) ).
fof(f4988,plain,
( ! [X0] :
( ~ member(universal_class,X0)
| complement(X0) = null_class )
| ~ spl1_335 ),
inference(resolution,[],[f4699,f24]) ).
fof(f5164,plain,
( null_class = complement(universal_class)
| ~ spl1_55
| ~ spl1_335 ),
inference(resolution,[],[f4988,f763]) ).
fof(f5174,plain,
( null_class = complement(null_class)
| ~ spl1_333
| ~ spl1_335 ),
inference(resolution,[],[f4988,f4691]) ).
fof(f5396,plain,
( inductive(complement(universal_class))
| ~ spl1_55
| ~ spl1_91
| ~ spl1_335 ),
inference(superposition,[],[f1124,f5164]) ).
fof(f5409,plain,
( ~ member(null_class,universal_class)
| ~ spl1_55
| ~ spl1_91
| ~ spl1_335 ),
inference(resolution,[],[f5396,f195]) ).
fof(f5410,plain,
( $false
| ~ spl1_55
| ~ spl1_91
| ~ spl1_97
| ~ spl1_335 ),
inference(forward_subsumption_resolution,[],[f5409,f1162]) ).
fof(f5411,plain,
( ~ spl1_55
| ~ spl1_91
| ~ spl1_97
| ~ spl1_335 ),
inference(avatar_contradiction_clause,[],[f5410]) ).
fof(f5441,plain,
( ! [X0] :
( ~ member(X0,null_class)
| ~ member(X0,null_class) )
| ~ spl1_333
| ~ spl1_335 ),
inference(superposition,[],[f24,f5174]) ).
fof(f5466,plain,
( ! [X0] : ~ member(X0,null_class)
| ~ spl1_333
| ~ spl1_335 ),
inference(duplicate_literal_removal,[],[f5441]) ).
fof(f5482,plain,
( ! [X0] : ~ member(X0,complement(universal_class))
| ~ spl1_55
| ~ spl1_333
| ~ spl1_335 ),
inference(forward_demodulation,[],[f5466,f5164]) ).
fof(f6506,plain,
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),null_class)
| member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),null_class)
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(superposition,[],[f772,f5174]) ).
fof(f6507,plain,
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),null_class)
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(duplicate_literal_removal,[],[f6506]) ).
fof(f6508,plain,
( member(domain_of(intersection(element_relation,cross_product(universal_class,domain_of(domain_of(flip(cross_product(intersection(choice,cross_product(unordered_pair(universal_class,universal_class),universal_class)),universal_class))))))),complement(universal_class))
| ~ spl1_55
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(forward_demodulation,[],[f6507,f5164]) ).
fof(f6522,plain,
( $false
| ~ spl1_55
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(forward_subsumption_resolution,[],[f6508,f5482]) ).
fof(f6523,plain,
( ~ spl1_55
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(avatar_contradiction_clause,[],[f6522]) ).
cnf(s34,plain,
( spl1_1
| ~ spl1_55
| spl1_57 ),
inference(sat_conversion,[],[f773]) ).
cnf(s41,plain,
spl1_3,
inference(sat_conversion,[],[f956]) ).
cnf(s84,plain,
( spl1_79
| spl1_97 ),
inference(sat_conversion,[],[f1163]) ).
cnf(s87,plain,
~ spl1_79,
inference(sat_conversion,[],[f1194]) ).
cnf(s270,plain,
( ~ spl1_1
| ~ spl1_3
| spl1_91 ),
inference(sat_conversion,[],[f4014]) ).
cnf(s316,plain,
( ~ spl1_333
| spl1_335 ),
inference(sat_conversion,[],[f4720]) ).
cnf(s320,plain,
( ~ spl1_55
| spl1_333 ),
inference(sat_conversion,[],[f4846]) ).
cnf(s321,plain,
spl1_55,
inference(sat_conversion,[],[f4849]) ).
cnf(s356,plain,
( ~ spl1_55
| ~ spl1_91
| ~ spl1_97
| ~ spl1_335 ),
inference(sat_conversion,[],[f5411]) ).
cnf(s400,plain,
( ~ spl1_55
| ~ spl1_57
| ~ spl1_333
| ~ spl1_335 ),
inference(sat_conversion,[],[f6523]) ).
cnf(s405,plain,
spl1_333,
inference(rat,[],[s320,s321]) ).
cnf(s408,plain,
spl1_335,
inference(rat,[],[s316,s405]) ).
cnf(s410,plain,
~ spl1_57,
inference(rat,[],[s400,s405,s321,s408]) ).
cnf(s422,plain,
spl1_97,
inference(rat,[],[s84,s87]) ).
cnf(s423,plain,
~ spl1_91,
inference(rat,[],[s356,s408,s321,s422]) ).
cnf(s426,plain,
~ spl1_1,
inference(rat,[],[s270,s423,s41]) ).
cnf(s430,plain,
$false,
inference(rat,[],[s34,s410,s321,s426]) ).
fof(f6524,plain,
$false,
inference(avatar_sat_refutation,[],[s430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET510-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n014.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 02:01:01 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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
% 2.29/0.99 % (1364584)Will run a generic schedule for satisfiability detection.
% 2.29/0.99 % (1364594)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4147546780:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.29/0.99 % (1364590)% WARNING: option uhcvi not known.
% 2.29/0.99 % (1364592)dis+10_1_sil=32000:sp=arity:random_seed=2245896744:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.29/0.99 % (1364589)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2484313988_2999 on theBenchmark for (2999ds/0Mi)
% 2.29/0.99 % (1364590)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4280006084:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.29/0.99 % (1364591)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1904906635:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.29/0.99 % (1364593)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2537951458:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.29/0.99 % (1364595)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3361152890:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.29/0.99 % (1364594)Instruction limit reached!
% 2.29/0.99 % (1364594)------------------------------
% 2.29/0.99 % (1364594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364594)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364594)Termination reason: Instruction limit
% 2.29/0.99 % (1364594)Termination phase: Saturation
% 2.29/0.99 % (1364594)Time elapsed: 0.043 s
% 2.29/0.99 % (1364594)Peak memory usage: 12 MB
% 2.29/0.99 % (1364594)Instructions burned: 131 (million)
% 2.29/0.99 % (1364603)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2030813088:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.29/0.99 % (1364592)Instruction limit reached!
% 2.29/0.99 % (1364592)------------------------------
% 2.29/0.99 % (1364592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364592)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364592)Termination reason: Instruction limit
% 2.29/0.99 % (1364592)Termination phase: Saturation
% 2.29/0.99 % (1364592)Time elapsed: 0.067 s
% 2.29/0.99 % (1364592)Peak memory usage: 13 MB
% 2.29/0.99 % (1364592)Instructions burned: 104 (million)
% 2.29/0.99 % (1364593)Instruction limit reached!
% 2.29/0.99 % (1364593)------------------------------
% 2.29/0.99 % (1364593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364593)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364593)Termination reason: Instruction limit
% 2.29/0.99 % (1364593)Termination phase: Saturation
% 2.29/0.99 % (1364593)Time elapsed: 0.072 s
% 2.29/0.99 % (1364593)Peak memory usage: 13 MB
% 2.29/0.99 % (1364593)Instructions burned: 116 (million)
% 2.29/0.99 % (1364605)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1769336025:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.29/0.99 % (1364606)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=3643666160:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.29/0.99 % (1364595)Instruction limit reached!
% 2.29/0.99 % (1364595)------------------------------
% 2.29/0.99 % (1364595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364595)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364595)Termination reason: Instruction limit
% 2.29/0.99 % (1364595)Termination phase: Saturation
% 2.29/0.99 % (1364595)Time elapsed: 0.109 s
% 2.29/0.99 % (1364595)Peak memory usage: 13 MB
% 2.29/0.99 % (1364595)Instructions burned: 160 (million)
% 2.29/0.99 % (1364609)ott-21_1_sil=16000:fs=off:random_seed=187469673:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.29/0.99 % TRYING [1]
% 2.29/0.99 % TRYING [2]
% 2.29/0.99 % TRYING [3]
% 2.29/0.99 % (1364605)Instruction limit reached!
% 2.29/0.99 % (1364605)------------------------------
% 2.29/0.99 % (1364605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364605)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364605)Termination reason: Instruction limit
% 2.29/0.99 % (1364605)Termination phase: Saturation
% 2.29/0.99 % (1364605)Time elapsed: 0.089 s
% 2.29/0.99 % (1364605)Peak memory usage: 13 MB
% 2.29/0.99 % (1364605)Instructions burned: 132 (million)
% 2.29/0.99 % (1364611)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4242357904:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.29/0.99 % TRYING [1]
% 2.29/0.99 % TRYING [2]
% 2.29/0.99 % (1364603)Instruction limit reached!
% 2.29/0.99 % (1364603)------------------------------
% 2.29/0.99 % (1364603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364603)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364603)Termination reason: Instruction limit
% 2.29/0.99 % (1364603)Termination phase: Finite model building constraint generation
% 2.29/0.99 % (1364603)Time elapsed: 0.176 s
% 2.29/0.99 % (1364603)Peak memory usage: 34 MB
% 2.29/0.99 % (1364603)Instructions burned: 718 (million)
% 2.29/0.99 % (1364609)Instruction limit reached!
% 2.29/0.99 % (1364609)------------------------------
% 2.29/0.99 % (1364609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364609)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364609)Termination reason: Instruction limit
% 2.29/0.99 % (1364609)Termination phase: Saturation
% 2.29/0.99 % (1364609)Time elapsed: 0.099 s
% 2.29/0.99 % (1364609)Peak memory usage: 12 MB
% 2.29/0.99 % (1364609)Instructions burned: 182 (million)
% 2.29/0.99 % TRYING [3]
% 2.29/0.99 % (1364613)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=474195503:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.29/0.99 % (1364614)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1811012369:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.29/0.99 % TRYING [1]
% 2.29/0.99 % TRYING [2]
% 2.29/0.99 % TRYING [4]
% 2.29/0.99 % TRYING [3]
% 2.29/0.99 % (1364613)Instruction limit reached!
% 2.29/0.99 % (1364613)------------------------------
% 2.29/0.99 % (1364613)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364613)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364613)Termination reason: Instruction limit
% 2.29/0.99 % (1364613)Termination phase: Finite model building constraint generation
% 2.29/0.99 % (1364613)Time elapsed: 0.215 s
% 2.29/0.99 % (1364613)Peak memory usage: 25 MB
% 2.29/0.99 % (1364613)Instructions burned: 870 (million)
% 2.29/0.99 % (1364617)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1887872686:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.29/0.99 % (1364614) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1364584-1364614"...
% 2.29/0.99 % (1364614)...printing done.
% 2.29/0.99 % (1364614)Refutation found. Thanks to Tanya!
% 2.29/0.99 % SZS status Unsatisfiable for theBenchmark
% 2.29/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 2.29/0.99 % (1364614)------------------------------
% 2.29/0.99 % (1364614)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.29/0.99 % (1364614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.99 % (1364614)CaDiCaL version: 2.1.3
% 2.29/0.99 % (1364614)Termination reason: Refutation
% 2.29/0.99 % (1364614)Time elapsed: 0.264 s
% 2.29/0.99 % (1364614)Peak memory usage: 16 MB
% 2.29/0.99 % (1364614)Instructions burned: 461 (million)
% 2.29/0.99 % (1364584)Success in time 0.562 s
% 2.29/0.99 % Vampire exiting
%------------------------------------------------------------------------------