%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU156+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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.16s 0.54s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 135 ( 26 unt; 10 def)
% Number of atoms : 304 ( 124 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 304 ( 135 ~; 146 |; 5 &)
% ( 15 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 111 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f16,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(f35,axiom,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f48,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(f61,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(f62,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f61]) ).
fof(f76,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f85,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f107,plain,
! [X0,X1,X2,X3] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(ennf_transformation,[],[f48]) ).
fof(f117,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f62]) ).
fof(f132,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f85]) ).
fof(f135,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f142,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f145,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f8]) ).
fof(f154,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| X0 = X3
| ~ in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f155,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f156,plain,
! [X2,X3,X0,X1] :
( X0 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f184,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f195,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f35]) ).
fof(f212,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f107]) ).
fof(f226,plain,
( sK15 != sK17
| sK14 != sK16 ),
inference(cnf_transformation,[],[f117]) ).
fof(f227,plain,
ordered_pair(sK14,sK15) = ordered_pair(sK16,sK17),
inference(cnf_transformation,[],[f117]) ).
fof(f245,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f76]) ).
fof(f255,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f132]) ).
fof(f256,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f184,f245]) ).
fof(f260,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f142,f245]) ).
fof(f272,plain,
! [X0] : empty_set != unordered_pair(X0,X0),
inference(definition_unfolding,[],[f195,f245]) ).
fof(f288,plain,
unordered_pair(unordered_pair(sK14,sK15),unordered_pair(sK14,sK14)) = unordered_pair(unordered_pair(sK16,sK17),unordered_pair(sK16,sK16)),
inference(definition_unfolding,[],[f227,f256,f256]) ).
fof(f293,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f255,f245]) ).
fof(f296,plain,
! [X2,X0] :
( X0 = X2
| ~ in(X2,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f260]) ).
fof(f302,plain,
! [X2,X3,X1] :
( in(X3,X2)
| unordered_pair(X3,X1) != X2 ),
inference(equality_resolution,[],[f156]) ).
fof(f303,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f302]) ).
fof(f304,plain,
! [X2,X3,X0] :
( in(X3,X2)
| unordered_pair(X0,X3) != X2 ),
inference(equality_resolution,[],[f155]) ).
fof(f305,plain,
! [X3,X0] : in(X3,unordered_pair(X0,X3)),
inference(equality_resolution,[],[f304]) ).
fof(f306,plain,
! [X3,X0,X1] :
( X1 = X3
| X0 = X3
| ~ in(X3,unordered_pair(X0,X1)) ),
inference(equality_resolution,[],[f154]) ).
fof(f327,plain,
! [X2,X0] :
( in(X2,unordered_pair(X0,X0))
| X0 = X2 ),
inference(consistent_polarity_flipping,[],[f296]) ).
fof(f330,plain,
! [X0] :
( ~ in(sK1(X0),X0)
| empty_set = X0 ),
inference(consistent_polarity_flipping,[],[f145]) ).
fof(f335,plain,
! [X3,X1] : ~ in(X3,unordered_pair(X3,X1)),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f336,plain,
! [X3,X0] : ~ in(X3,unordered_pair(X0,X3)),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f337,plain,
! [X3,X0,X1] :
( in(X3,unordered_pair(X0,X1))
| X0 = X3
| X1 = X3 ),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f422,definition,
( spl20_1
<=> sK14 = sK16 ),
introduced(definition,[new_symbols(definition,[spl20_1])],[avatar_definition]) ).
fof(f423,plain,
( sK14 = sK16
| ~ spl20_1 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f424,plain,
( sK14 != sK16
| spl20_1 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f426,definition,
( spl20_2
<=> sK15 = sK17 ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
fof(f428,plain,
( sK15 != sK17
| spl20_2 ),
inference(avatar_component_clause,[],[f426]) ).
fof(f429,plain,
( ~ spl20_1
| ~ spl20_2 ),
inference(avatar_split_clause,[],[f226,f426,f422]) ).
fof(f511,plain,
! [X0] :
( sK1(unordered_pair(X0,X0)) = X0
| empty_set = unordered_pair(X0,X0) ),
inference(resolution,[],[f327,f330]) ).
fof(f513,plain,
! [X0] : sK1(unordered_pair(X0,X0)) = X0,
inference(forward_subsumption_resolution,[],[f511,f272]) ).
fof(f744,definition,
( spl20_3
<=> unordered_pair(sK16,sK17) = unordered_pair(sK16,sK16) ),
introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition]) ).
fof(f745,plain,
( unordered_pair(sK16,sK17) != unordered_pair(sK16,sK16)
| spl20_3 ),
inference(avatar_component_clause,[],[f744]) ).
fof(f746,plain,
( unordered_pair(sK16,sK17) = unordered_pair(sK16,sK16)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f744]) ).
fof(f761,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK16,sK16)
| sK16 = sK17 )
| ~ spl20_3 ),
inference(superposition,[],[f293,f746]) ).
fof(f763,plain,
( ~ in(sK17,unordered_pair(sK16,sK16))
| ~ spl20_3 ),
inference(superposition,[],[f336,f746]) ).
fof(f767,definition,
( spl20_6
<=> sK16 = sK17 ),
introduced(definition,[new_symbols(definition,[spl20_6])],[avatar_definition]) ).
fof(f769,plain,
( sK16 = sK17
| ~ spl20_6 ),
inference(avatar_component_clause,[],[f767]) ).
fof(f771,definition,
( spl20_7
<=> ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK16,sK16) ),
introduced(definition,[new_symbols(definition,[spl20_7])],[avatar_definition]) ).
fof(f772,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK16,sK16)
| ~ spl20_7 ),
inference(avatar_component_clause,[],[f771]) ).
fof(f963,plain,
! [X0] :
( in(X0,unordered_pair(unordered_pair(sK14,sK15),unordered_pair(sK14,sK14)))
| unordered_pair(sK16,sK17) = X0
| unordered_pair(sK16,sK16) = X0 ),
inference(superposition,[],[f337,f288]) ).
fof(f968,plain,
! [X0] :
( in(X0,unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)))
| unordered_pair(sK16,sK17) = X0
| unordered_pair(sK16,sK16) = X0 ),
inference(forward_demodulation,[],[f963,f135]) ).
fof(f970,definition,
( spl20_8
<=> unordered_pair(sK14,sK15) = unordered_pair(sK16,sK17) ),
introduced(definition,[new_symbols(definition,[spl20_8])],[avatar_definition]) ).
fof(f972,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK17)
| ~ spl20_8 ),
inference(avatar_component_clause,[],[f970]) ).
fof(f974,definition,
( spl20_9
<=> unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
introduced(definition,[new_symbols(definition,[spl20_9])],[avatar_definition]) ).
fof(f976,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| ~ spl20_9 ),
inference(avatar_component_clause,[],[f974]) ).
fof(f983,definition,
( spl20_11
<=> unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16) ),
introduced(definition,[new_symbols(definition,[spl20_11])],[avatar_definition]) ).
fof(f985,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16)
| ~ spl20_11 ),
inference(avatar_component_clause,[],[f983]) ).
fof(f1027,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK14,sK15),unordered_pair(sK14,sK14))
| unordered_pair(sK16,sK17) = X0
| unordered_pair(sK16,sK17) = X1 ),
inference(superposition,[],[f212,f288]) ).
fof(f1251,plain,
( ~ in(sK17,unordered_pair(sK14,sK15))
| ~ spl20_8 ),
inference(superposition,[],[f336,f972]) ).
fof(f1266,plain,
( unordered_pair(sK14,sK14) != unordered_pair(sK16,sK16)
| spl20_3
| ~ spl20_9 ),
inference(superposition,[],[f745,f976]) ).
fof(f1272,plain,
( ~ in(sK16,unordered_pair(sK14,sK14))
| ~ spl20_9 ),
inference(superposition,[],[f335,f976]) ).
fof(f1434,definition,
( spl20_14
<=> sK14 = sK17 ),
introduced(definition,[new_symbols(definition,[spl20_14])],[avatar_definition]) ).
fof(f1435,plain,
( sK14 != sK17
| spl20_14 ),
inference(avatar_component_clause,[],[f1434]) ).
fof(f1436,plain,
( sK14 = sK17
| ~ spl20_14 ),
inference(avatar_component_clause,[],[f1434]) ).
fof(f1452,plain,
( sK14 = sK16
| ~ spl20_9 ),
inference(resolution,[],[f1272,f327]) ).
fof(f1549,plain,
( ! [X0] :
( unordered_pair(sK16,sK16) = X0
| in(X0,unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)))
| unordered_pair(sK16,sK16) = X0 )
| ~ spl20_6 ),
inference(forward_demodulation,[],[f968,f769]) ).
fof(f1550,plain,
( ! [X0] :
( in(X0,unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)))
| unordered_pair(sK16,sK16) = X0 )
| ~ spl20_6 ),
inference(duplicate_literal_removal,[],[f1549]) ).
fof(f1552,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK16)
| ~ spl20_6 ),
inference(resolution,[],[f1550,f336]) ).
fof(f1582,plain,
( spl20_6
| spl20_7
| ~ spl20_3 ),
inference(avatar_split_clause,[],[f761,f744,f771,f767]) ).
fof(f1644,plain,
( spl20_1
| ~ spl20_9 ),
inference(avatar_split_clause,[],[f1452,f974,f422]) ).
fof(f1667,definition,
( spl20_22
<=> unordered_pair(sK14,sK14) = unordered_pair(sK14,sK17) ),
introduced(definition,[new_symbols(definition,[spl20_22])],[avatar_definition]) ).
fof(f1668,plain,
( unordered_pair(sK14,sK14) != unordered_pair(sK14,sK17)
| spl20_22 ),
inference(avatar_component_clause,[],[f1667]) ).
fof(f1674,plain,
( sK14 != sK15
| spl20_2
| ~ spl20_14 ),
inference(superposition,[],[f428,f1436]) ).
fof(f1705,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK14,sK14)
| ~ spl20_1
| ~ spl20_6 ),
inference(forward_demodulation,[],[f1552,f423]) ).
fof(f1754,plain,
( ~ in(sK17,unordered_pair(sK14,sK14))
| ~ spl20_1
| ~ spl20_3 ),
inference(forward_demodulation,[],[f763,f423]) ).
fof(f1824,plain,
( ~ in(sK15,unordered_pair(sK14,sK14))
| ~ spl20_1
| ~ spl20_6 ),
inference(superposition,[],[f336,f1705]) ).
fof(f1883,plain,
( sK14 = sK15
| ~ spl20_1
| ~ spl20_6 ),
inference(resolution,[],[f1824,f327]) ).
fof(f1890,plain,
( $false
| ~ spl20_1
| spl20_2
| ~ spl20_6
| ~ spl20_14 ),
inference(forward_subsumption_resolution,[],[f1883,f1674]) ).
fof(f1891,plain,
( ~ spl20_1
| spl20_2
| ~ spl20_6
| ~ spl20_14 ),
inference(avatar_contradiction_clause,[],[f1890]) ).
fof(f1968,plain,
( sK14 = sK17
| ~ spl20_1
| ~ spl20_3 ),
inference(resolution,[],[f1754,f327]) ).
fof(f1975,plain,
( $false
| ~ spl20_1
| ~ spl20_3
| spl20_14 ),
inference(forward_subsumption_resolution,[],[f1968,f1435]) ).
fof(f1976,plain,
( ~ spl20_1
| ~ spl20_3
| spl20_14 ),
inference(avatar_contradiction_clause,[],[f1975]) ).
fof(f1977,plain,
( unordered_pair(sK14,sK14) != unordered_pair(sK14,sK17)
| ~ spl20_1
| spl20_3 ),
inference(forward_demodulation,[],[f745,f423]) ).
fof(f1978,plain,
( unordered_pair(sK14,sK14) != unordered_pair(sK14,sK14)
| ~ spl20_1
| spl20_3
| ~ spl20_9 ),
inference(forward_demodulation,[],[f1266,f423]) ).
fof(f1979,plain,
( $false
| ~ spl20_1
| spl20_3
| ~ spl20_9 ),
inference(trivial_inequality_removal,[],[f1978]) ).
fof(f1980,plain,
( ~ spl20_1
| spl20_3
| ~ spl20_9 ),
inference(avatar_contradiction_clause,[],[f1979]) ).
fof(f1986,plain,
( ~ spl20_22
| ~ spl20_1
| spl20_3 ),
inference(avatar_split_clause,[],[f1977,f744,f422,f1667]) ).
fof(f2022,plain,
( sK14 = sK17
| sK15 = sK17
| ~ spl20_8 ),
inference(resolution,[],[f1251,f337]) ).
fof(f2034,plain,
( sK14 = sK17
| spl20_2
| ~ spl20_8 ),
inference(forward_subsumption_resolution,[],[f2022,f428]) ).
fof(f2042,plain,
( spl20_14
| spl20_2
| ~ spl20_8 ),
inference(avatar_split_clause,[],[f2034,f970,f426,f1434]) ).
fof(f2043,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16) ),
inference(resolution,[],[f968,f335]) ).
fof(f2069,plain,
( spl20_11
| spl20_9 ),
inference(avatar_split_clause,[],[f2043,f974,f983]) ).
fof(f2095,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK17)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
inference(equality_resolution,[],[f1027]) ).
fof(f2096,plain,
( spl20_9
| spl20_8 ),
inference(avatar_split_clause,[],[f2095,f970,f974]) ).
fof(f2411,plain,
( unordered_pair(sK14,sK14) != unordered_pair(sK14,sK14)
| ~ spl20_14
| spl20_22 ),
inference(forward_demodulation,[],[f1668,f1436]) ).
fof(f2412,plain,
( $false
| ~ spl20_14
| spl20_22 ),
inference(trivial_inequality_removal,[],[f2411]) ).
fof(f2413,plain,
( ~ spl20_14
| spl20_22 ),
inference(avatar_contradiction_clause,[],[f2412]) ).
fof(f2708,plain,
( $false
| ~ spl20_7 ),
inference(equality_resolution,[],[f772]) ).
fof(f2709,plain,
~ spl20_7,
inference(avatar_contradiction_clause,[],[f2708]) ).
fof(f2749,plain,
( sK16 = sK1(unordered_pair(sK14,sK14))
| ~ spl20_11 ),
inference(superposition,[],[f513,f985]) ).
fof(f2764,plain,
( sK14 = sK16
| ~ spl20_11 ),
inference(forward_demodulation,[],[f2749,f513]) ).
fof(f2767,plain,
( $false
| spl20_1
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f2764,f424]) ).
fof(f2768,plain,
( spl20_1
| ~ spl20_11 ),
inference(avatar_contradiction_clause,[],[f2767]) ).
cnf(s1,plain,
( ~ spl20_1
| ~ spl20_2 ),
inference(sat_conversion,[],[f429]) ).
cnf(s31,plain,
( ~ spl20_3
| spl20_6
| spl20_7 ),
inference(sat_conversion,[],[f1582]) ).
cnf(s35,plain,
( spl20_1
| ~ spl20_9 ),
inference(sat_conversion,[],[f1644]) ).
cnf(s45,plain,
( ~ spl20_1
| spl20_2
| ~ spl20_6
| ~ spl20_14 ),
inference(sat_conversion,[],[f1891]) ).
cnf(s59,plain,
( ~ spl20_1
| ~ spl20_3
| spl20_14 ),
inference(sat_conversion,[],[f1976]) ).
cnf(s60,plain,
( ~ spl20_1
| spl20_3
| ~ spl20_9 ),
inference(sat_conversion,[],[f1980]) ).
cnf(s65,plain,
( ~ spl20_1
| spl20_3
| ~ spl20_22 ),
inference(sat_conversion,[],[f1986]) ).
cnf(s85,plain,
( spl20_2
| ~ spl20_8
| spl20_14 ),
inference(sat_conversion,[],[f2042]) ).
cnf(s88,plain,
( spl20_9
| spl20_11 ),
inference(sat_conversion,[],[f2069]) ).
cnf(s92,plain,
( spl20_8
| spl20_9 ),
inference(sat_conversion,[],[f2096]) ).
cnf(s103,plain,
( ~ spl20_14
| spl20_22 ),
inference(sat_conversion,[],[f2413]) ).
cnf(s111,plain,
~ spl20_7,
inference(sat_conversion,[],[f2709]) ).
cnf(s112,plain,
( spl20_1
| ~ spl20_11 ),
inference(sat_conversion,[],[f2768]) ).
cnf(s113,plain,
( ~ spl20_3
| spl20_6 ),
inference(rat,[],[s31,s111]) ).
cnf(s115,plain,
spl20_1,
inference(rat,[],[s88,s35,s112]) ).
cnf(s117,plain,
~ spl20_2,
inference(rat,[],[s1,s115]) ).
cnf(s118,plain,
spl20_3,
inference(rat,[],[s85,s92,s103,s60,s65,s117,s115]) ).
cnf(s119,plain,
spl20_14,
inference(rat,[],[s59,s115,s118]) ).
cnf(s121,plain,
spl20_6,
inference(rat,[],[s113,s118]) ).
cnf(s123,plain,
$false,
inference(rat,[],[s45,s117,s115,s119,s121]) ).
fof(f2773,plain,
$false,
inference(avatar_sat_refutation,[],[s123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n020.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 03:48:21 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.54 % (4006863)Will run a generic schedule for satisfiability detection.
% 0.16/0.54 % (4006874)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2187382734:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.54 % (4006869)% WARNING: option uhcvi not known.
% 0.16/0.54 % (4006868)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1596009569_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.54 % (4006870)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2318285305:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.54 % (4006869)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3590598729:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.54 % (4006871)dis+10_1_sil=32000:sp=arity:random_seed=3992260701:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.54 % (4006872)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4260471865:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.54 % (4006873)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1752090937:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.54 % TRYING [1]
% 0.16/0.54 % TRYING [2]
% 0.16/0.54 % TRYING [3]
% 0.16/0.54 % TRYING [4]
% 0.16/0.54 % TRYING [5]
% 0.16/0.54 % (4006874)Instruction limit reached!
% 0.16/0.54 % (4006874)------------------------------
% 0.16/0.54 % (4006874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (4006874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (4006874)CaDiCaL version: 2.1.3
% 0.16/0.54 % (4006874)Termination reason: Instruction limit
% 0.16/0.54 % (4006874)Termination phase: Saturation
% 0.16/0.54 % (4006874)Time elapsed: 0.057 s
% 0.16/0.54 % (4006874)Peak memory usage: 13 MB
% 0.16/0.54 % (4006874)Instructions burned: 160 (million)
% 0.16/0.54 % (4006882)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3515428684:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/0.54 % (4006871)Instruction limit reached!
% 0.16/0.54 % (4006871)------------------------------
% 0.16/0.54 % (4006871)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (4006871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (4006871)CaDiCaL version: 2.1.3
% 0.16/0.54 % (4006871)Termination reason: Instruction limit
% 0.16/0.54 % (4006871)Termination phase: Saturation
% 0.16/0.54 % (4006871)Time elapsed: 0.064 s
% 0.16/0.54 % (4006871)Peak memory usage: 12 MB
% 0.16/0.54 % (4006871)Instructions burned: 103 (million)
% 0.16/0.54 % TRYING [1]
% 0.16/0.54 % TRYING [2]
% 0.16/0.54 % TRYING [3]
% 0.16/0.54 % (4006872)Instruction limit reached!
% 0.16/0.54 % (4006872)------------------------------
% 0.16/0.54 % (4006872)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (4006872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (4006872)CaDiCaL version: 2.1.3
% 0.16/0.54 % (4006872)Termination reason: Instruction limit
% 0.16/0.54 % (4006872)Termination phase: Saturation
% 0.16/0.54 % (4006872)Time elapsed: 0.073 s
% 0.16/0.54 % (4006872)Peak memory usage: 13 MB
% 0.16/0.54 % (4006872)Instructions burned: 116 (million)
% 0.16/0.54 % TRYING [4]
% 0.16/0.54 % (4006869) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4006863-4006869"...
% 0.16/0.54 % (4006869)...printing done.
% 0.16/0.54 % (4006869)Refutation found. Thanks to Tanya!
% 0.16/0.54 % SZS status Theorem for theBenchmark
% 0.16/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.54 % (4006869)------------------------------
% 0.16/0.54 % (4006869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.54 % (4006869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.54 % (4006869)CaDiCaL version: 2.1.3
% 0.16/0.54 % (4006869)Termination reason: Refutation
% 0.16/0.54 % (4006869)Time elapsed: 0.077 s
% 0.16/0.54 % (4006869)Peak memory usage: 14 MB
% 0.16/0.54 % (4006869)Instructions burned: 120 (million)
% 0.16/0.54 % (4006863)Success in time 0.117 s
% 0.16/0.54 % Vampire exiting
%------------------------------------------------------------------------------