%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU156+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:52:09 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 17
% Syntax : Number of formulae : 138 ( 22 unt; 9 def)
% Number of atoms : 348 ( 140 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 363 ( 153 ~; 192 |; 5 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 96 ( 1 sgn 92 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f2,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f6,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f8,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f11,axiom,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f14,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f6]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f19,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f25,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
( sK3 != sK5
| sK2 != sK4 ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f30,plain,
! [X0,X1] :
( ~ subset(singleton(X0),singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f21,f29]) ).
fof(f35,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK5),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f28,f33,f33]) ).
fof(f36,plain,
! [X0,X1] :
( ~ subset(unordered_pair(X0,X0),unordered_pair(X1,X1))
| X0 = X1 ),
inference(definition_unfolding,[],[f30,f29,f29]) ).
fof(f38,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f32,f29]) ).
fof(f40,definition,
( spl6_1
<=> sK2 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f41,plain,
( sK2 = sK4
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f42,plain,
( sK2 != sK4
| spl6_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f44,definition,
( spl6_2
<=> sK3 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f46,plain,
( sK3 != sK5
| spl6_2 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f47,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f27,f44,f40]) ).
fof(f51,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK4),unordered_pair(sK4,sK5)),
inference(superposition,[],[f35,f20]) ).
fof(f52,plain,
unordered_pair(unordered_pair(sK4,sK4),unordered_pair(sK4,sK5)) = unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)),
inference(forward_demodulation,[],[f51,f20]) ).
fof(f77,definition,
( spl6_3
<=> unordered_pair(sK4,sK5) = unordered_pair(sK4,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f78,plain,
( unordered_pair(sK4,sK5) != unordered_pair(sK4,sK4)
| spl6_3 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f79,plain,
( unordered_pair(sK4,sK5) = unordered_pair(sK4,sK4)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f89,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK4,sK4)
| sK4 = sK5 )
| ~ spl6_3 ),
inference(superposition,[],[f38,f79]) ).
fof(f93,definition,
( spl6_5
<=> sK4 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f94,plain,
( sK4 != sK5
| spl6_5 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f95,plain,
( sK4 = sK5
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f97,definition,
( spl6_6
<=> ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK4,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f98,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK4,sK4)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f99,plain,
( spl6_5
| spl6_6
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f89,f77,f97,f93]) ).
fof(f101,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2))
| unordered_pair(sK4,sK5) = X0
| unordered_pair(sK4,sK5) = X1 ),
inference(superposition,[],[f26,f35]) ).
fof(f102,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK4) = X0
| unordered_pair(sK4,sK4) = X1 ),
inference(superposition,[],[f26,f52]) ).
fof(f104,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[],[f26,f20]) ).
fof(f106,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK4) = X0
| unordered_pair(sK4,sK5) = X0 ),
inference(superposition,[],[f26,f52]) ).
fof(f111,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK5) = X0
| unordered_pair(sK4,sK5) = X1 ),
inference(forward_demodulation,[],[f101,f20]) ).
fof(f114,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[],[f111]) ).
fof(f116,definition,
( spl6_7
<=> unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f117,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK5)
| spl6_7 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f118,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f120,definition,
( spl6_8
<=> unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f121,plain,
( unordered_pair(sK2,sK2) != unordered_pair(sK4,sK5)
| spl6_8 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f122,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f123,plain,
( spl6_7
| spl6_8 ),
inference(avatar_split_clause,[],[f114,f120,f116]) ).
fof(f124,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f78,f118]) ).
fof(f132,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK2,sK3)
| sK4 = sK5 )
| ~ spl6_7 ),
inference(superposition,[],[f38,f118]) ).
fof(f134,definition,
( spl6_9
<=> ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f135,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK3)
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f136,plain,
( spl6_5
| spl6_9
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f132,f116,f134,f93]) ).
fof(f149,plain,
( unordered_pair(sK4,sK4) != unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_5 ),
inference(superposition,[],[f78,f95]) ).
fof(f153,plain,
( $false
| spl6_3
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f149]) ).
fof(f154,plain,
( spl6_3
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f153]) ).
fof(f182,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2))
| unordered_pair(sK4,sK5) = X1
| unordered_pair(sK4,sK4) = X1 ),
inference(superposition,[],[f104,f35]) ).
fof(f188,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK5) = X1
| unordered_pair(sK4,sK4) = X1 ),
inference(forward_demodulation,[],[f182,f20]) ).
fof(f200,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK4 = sK5 )
| ~ spl6_8 ),
inference(superposition,[],[f38,f122]) ).
fof(f207,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| spl6_5
| ~ spl6_8 ),
inference(forward_subsumption_resolution,[],[f200,f94]) ).
fof(f212,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[],[f102]) ).
fof(f214,plain,
( $false
| spl6_5
| ~ spl6_8 ),
inference(equality_resolution,[],[f207]) ).
fof(f215,plain,
( spl6_5
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f216,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK2,sK2)
| ~ spl6_7
| spl6_8 ),
inference(forward_demodulation,[],[f121,f118]) ).
fof(f220,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f212,f124]) ).
fof(f225,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK4 = X0
| sK4 = X1 )
| ~ spl6_7 ),
inference(superposition,[],[f26,f118]) ).
fof(f226,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK4 = X0
| sK5 = X0 )
| ~ spl6_7 ),
inference(superposition,[],[f26,f118]) ).
fof(f234,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK4 = X1
| sK5 = X1 )
| ~ spl6_7 ),
inference(superposition,[],[f104,f118]) ).
fof(f242,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[],[f106]) ).
fof(f268,plain,
( ! [X0] :
( ~ subset(unordered_pair(sK2,sK2),unordered_pair(X0,X0))
| sK4 = X0 )
| spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f36,f220]) ).
fof(f298,plain,
( sK2 = sK4
| sK3 = sK4
| ~ spl6_7 ),
inference(equality_resolution,[],[f225]) ).
fof(f299,plain,
( sK3 = sK4
| spl6_1
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f298,f42]) ).
fof(f317,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK4)
| spl6_1
| ~ spl6_7
| ~ spl6_9 ),
inference(superposition,[],[f135,f299]) ).
fof(f339,plain,
( sK2 = sK4
| sK2 = sK5
| ~ spl6_7 ),
inference(equality_resolution,[],[f226]) ).
fof(f340,plain,
( sK2 = sK5
| spl6_1
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f339,f42]) ).
fof(f399,plain,
( sK3 = sK4
| sK3 = sK5
| ~ spl6_7 ),
inference(equality_resolution,[],[f234]) ).
fof(f427,plain,
( sK2 = sK4
| spl6_3
| ~ spl6_7 ),
inference(resolution,[],[f268,f25]) ).
fof(f428,plain,
( $false
| spl6_1
| spl6_3
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f427,f42]) ).
fof(f429,plain,
( spl6_1
| spl6_3
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f428]) ).
fof(f436,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5)
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f242,f98]) ).
fof(f468,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK2)
| spl6_1
| ~ spl6_6
| ~ spl6_7 ),
inference(forward_demodulation,[],[f436,f340]) ).
fof(f487,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK2,sK4)
| spl6_1
| ~ spl6_6
| ~ spl6_7 ),
inference(forward_demodulation,[],[f468,f20]) ).
fof(f493,plain,
( $false
| spl6_1
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9 ),
inference(forward_subsumption_resolution,[],[f487,f317]) ).
fof(f494,plain,
( spl6_1
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f493]) ).
fof(f504,plain,
( sK3 = sK4
| spl6_2
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f399,f46]) ).
fof(f520,plain,
( sK2 = sK3
| ~ spl6_1
| spl6_2
| ~ spl6_7 ),
inference(forward_demodulation,[],[f504,f41]) ).
fof(f570,plain,
( unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2)
| ~ spl6_1
| spl6_2
| ~ spl6_7
| spl6_8 ),
inference(forward_demodulation,[],[f216,f520]) ).
fof(f571,plain,
( $false
| ~ spl6_1
| spl6_2
| ~ spl6_7
| spl6_8 ),
inference(trivial_inequality_removal,[],[f570]) ).
fof(f572,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_7
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f571]) ).
fof(f712,plain,
( sK2 = sK4
| spl6_1
| ~ spl6_5
| ~ spl6_7 ),
inference(superposition,[],[f340,f95]) ).
fof(f725,plain,
( $false
| spl6_1
| ~ spl6_5
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f712,f42]) ).
fof(f726,plain,
( spl6_1
| ~ spl6_5
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f725]) ).
fof(f740,plain,
( sK3 != sK4
| spl6_2
| ~ spl6_5 ),
inference(forward_demodulation,[],[f46,f95]) ).
fof(f769,plain,
( sK2 != sK3
| ~ spl6_1
| spl6_2
| ~ spl6_5 ),
inference(forward_demodulation,[],[f740,f41]) ).
fof(f785,plain,
( $false
| ~ spl6_1
| spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f769,f520]) ).
fof(f786,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f785]) ).
fof(f795,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4)
| ~ spl6_5
| spl6_7 ),
inference(forward_demodulation,[],[f117,f95]) ).
fof(f798,plain,
( ! [X0,X1] :
( unordered_pair(sK4,sK4) = X1
| unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK4) = X1 )
| ~ spl6_5 ),
inference(forward_demodulation,[],[f188,f95]) ).
fof(f799,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK4) = X1 )
| ~ spl6_5 ),
inference(duplicate_literal_removal,[],[f798]) ).
fof(f864,definition,
( spl6_15
<=> unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_15])],[avatar_definition]) ).
fof(f865,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4)
| spl6_15 ),
inference(avatar_component_clause,[],[f864]) ).
fof(f882,plain,
( ~ spl6_15
| ~ spl6_5
| spl6_7 ),
inference(avatar_split_clause,[],[f795,f116,f93,f864]) ).
fof(f890,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4)
| ~ spl6_5 ),
inference(equality_resolution,[],[f799]) ).
fof(f892,plain,
( $false
| ~ spl6_5
| spl6_15 ),
inference(forward_subsumption_resolution,[],[f890,f865]) ).
fof(f893,plain,
( ~ spl6_5
| spl6_15 ),
inference(avatar_contradiction_clause,[],[f892]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f47]) ).
cnf(s4,plain,
( ~ spl6_3
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f99]) ).
cnf(s5,plain,
( spl6_7
| spl6_8 ),
inference(sat_conversion,[],[f123]) ).
cnf(s6,plain,
( spl6_5
| ~ spl6_7
| spl6_9 ),
inference(sat_conversion,[],[f136]) ).
cnf(s7,plain,
( spl6_3
| ~ spl6_5 ),
inference(sat_conversion,[],[f154]) ).
cnf(s11,plain,
( spl6_5
| ~ spl6_8 ),
inference(sat_conversion,[],[f215]) ).
cnf(s12,plain,
( spl6_1
| spl6_3
| ~ spl6_7 ),
inference(sat_conversion,[],[f429]) ).
cnf(s17,plain,
( spl6_1
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9 ),
inference(sat_conversion,[],[f494]) ).
cnf(s21,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_7
| spl6_8 ),
inference(sat_conversion,[],[f572]) ).
cnf(s24,plain,
( spl6_1
| ~ spl6_5
| ~ spl6_7 ),
inference(sat_conversion,[],[f726]) ).
cnf(s25,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(sat_conversion,[],[f786]) ).
cnf(s29,plain,
( ~ spl6_5
| spl6_7
| ~ spl6_15 ),
inference(sat_conversion,[],[f882]) ).
cnf(s31,plain,
( ~ spl6_5
| spl6_15 ),
inference(sat_conversion,[],[f893]) ).
cnf(s32,plain,
( spl6_3
| spl6_1 ),
inference(rat,[],[s11,s5,s7,s12]) ).
cnf(s33,plain,
( spl6_5
| spl6_1 ),
inference(rat,[],[s6,s17,s5,s4,s11,s32]) ).
cnf(s34,plain,
spl6_1,
inference(rat,[],[s24,s29,s31,s33]) ).
cnf(s35,plain,
~ spl6_2,
inference(rat,[],[s1,s34]) ).
cnf(s36,plain,
spl6_8,
inference(rat,[],[s21,s5,s34,s35]) ).
cnf(s37,plain,
spl6_5,
inference(rat,[],[s11,s36]) ).
cnf(s38,plain,
spl6_15,
inference(rat,[],[s31,s37]) ).
cnf(s40,plain,
spl6_7,
inference(rat,[],[s29,s38,s37]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s25,s35,s34,s37,s40]) ).
fof(f898,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 03:47:30 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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
% 0.17/0.46 % (2999101)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (2999110)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4184513989:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (2999107)% WARNING: option uhcvi not known.
% 0.17/0.46 % (2999106)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2913997319_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (2999107)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3243077420:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (2999111)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1237369727:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (2999108)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=94693796:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (2999109)dis+10_1_sil=32000:sp=arity:random_seed=2978252157:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (2999112)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3012954208:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % (2999110) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2999101-2999110"...
% 0.17/0.46 % TRYING [5]
% 0.17/0.46 % (2999110)...printing done.
% 0.17/0.46 % (2999110)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (2999110)------------------------------
% 0.17/0.46 % (2999110)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (2999110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (2999110)CaDiCaL version: 2.1.3
% 0.17/0.46 % (2999110)Termination reason: Refutation
% 0.17/0.46 % (2999110)Time elapsed: 0.013 s
% 0.17/0.46 % (2999110)Peak memory usage: 12 MB
% 0.17/0.46 % (2999110)Instructions burned: 40 (million)
% 0.17/0.46 % (2999101)Success in time 0.044 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------