%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU156+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:08 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 16
% Syntax : Number of formulae : 148 ( 21 unt; 8 def)
% Number of atoms : 383 ( 158 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 409 ( 174 ~; 217 |; 6 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 104 ( 1 sgn 100 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f9,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f10,axiom,
! [X0,X1,X2,X3] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f11,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f14,axiom,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f17,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f9]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f12]) ).
fof(f20,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
( ( sK2 != sK4
| sK3 != sK5 )
& ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f19]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f27,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f31,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
ordered_pair(sK2,sK3) = ordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f25]) ).
fof(f34,plain,
( sK2 != sK4
| sK3 != sK5 ),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f36,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(singleton(X0),singleton(X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f27,f35]) ).
fof(f41,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK5),unordered_pair(sK4,sK4)),
inference(definition_unfolding,[],[f33,f39,f39]) ).
fof(f42,plain,
! [X0,X1] :
( ~ subset(unordered_pair(X0,X0),unordered_pair(X1,X1))
| X0 = X1 ),
inference(definition_unfolding,[],[f36,f35,f35]) ).
fof(f44,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f38,f35]) ).
fof(f46,definition,
( spl6_1
<=> sK3 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f47,plain,
( sK3 = sK5
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f48,plain,
( sK3 != sK5
| spl6_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f50,definition,
( spl6_2
<=> sK2 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f51,plain,
( sK2 = sK4
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f52,plain,
( sK2 != sK4
| spl6_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f53,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f34,f50,f46]) ).
fof(f57,plain,
unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)) = unordered_pair(unordered_pair(sK4,sK4),unordered_pair(sK4,sK5)),
inference(superposition,[],[f41,f26]) ).
fof(f58,plain,
unordered_pair(unordered_pair(sK4,sK4),unordered_pair(sK4,sK5)) = unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)),
inference(forward_demodulation,[],[f57,f26]) ).
fof(f83,definition,
( spl6_3
<=> unordered_pair(sK4,sK5) = unordered_pair(sK4,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f84,plain,
( unordered_pair(sK4,sK5) != unordered_pair(sK4,sK4)
| spl6_3 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f85,plain,
( unordered_pair(sK4,sK5) = unordered_pair(sK4,sK4)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f99,definition,
( spl6_5
<=> sK4 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f100,plain,
( sK4 != sK5
| spl6_5 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f101,plain,
( sK4 = sK5
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f107,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,[],[f32,f41]) ).
fof(f108,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,[],[f32,f58]) ).
fof(f110,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[],[f32,f26]) ).
fof(f112,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,[],[f32,f58]) ).
fof(f117,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,[],[f107,f26]) ).
fof(f120,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[],[f117]) ).
fof(f122,definition,
( spl6_7
<=> unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f123,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK5)
| spl6_7 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f124,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f126,definition,
( spl6_8
<=> unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f128,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f129,plain,
( spl6_7
| spl6_8 ),
inference(avatar_split_clause,[],[f120,f126,f122]) ).
fof(f130,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f84,f124]) ).
fof(f138,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK2,sK3)
| sK4 = sK5 )
| ~ spl6_7 ),
inference(superposition,[],[f44,f124]) ).
fof(f154,definition,
( spl6_12
<=> ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).
fof(f155,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK3)
| ~ spl6_12 ),
inference(avatar_component_clause,[],[f154]) ).
fof(f156,plain,
( spl6_5
| spl6_12
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f138,f122,f154,f99]) ).
fof(f169,plain,
( sK3 != sK4
| spl6_1
| ~ spl6_5 ),
inference(superposition,[],[f48,f101]) ).
fof(f172,plain,
( unordered_pair(sK4,sK4) != unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_5 ),
inference(superposition,[],[f84,f101]) ).
fof(f174,plain,
( $false
| spl6_3
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f172]) ).
fof(f175,plain,
( spl6_3
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f174]) ).
fof(f203,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,[],[f110,f41]) ).
fof(f204,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK4,sK4) = X1
| unordered_pair(sK4,sK5) = X1 ),
inference(superposition,[],[f110,f58]) ).
fof(f209,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,[],[f203,f26]) ).
fof(f212,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK2,sK2)
| spl6_7
| ~ spl6_8 ),
inference(superposition,[],[f123,f128]) ).
fof(f221,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK4 = sK5 )
| ~ spl6_8 ),
inference(superposition,[],[f44,f128]) ).
fof(f229,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| spl6_5
| ~ spl6_8 ),
inference(forward_subsumption_resolution,[],[f221,f100]) ).
fof(f235,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK3) = unordered_pair(sK4,sK4) ),
inference(equality_resolution,[],[f108]) ).
fof(f237,plain,
( $false
| spl6_5
| ~ spl6_8 ),
inference(equality_resolution,[],[f229]) ).
fof(f238,plain,
( spl6_5
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[],[f237]) ).
fof(f243,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| spl6_3
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f235,f130]) ).
fof(f248,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK4 = X0
| sK4 = X1 )
| ~ spl6_7 ),
inference(superposition,[],[f32,f124]) ).
fof(f249,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK4 = X0
| sK5 = X0 )
| ~ spl6_7 ),
inference(superposition,[],[f32,f124]) ).
fof(f257,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK2,sK3)
| sK5 = X0
| sK5 = X1 )
| ~ spl6_7 ),
inference(superposition,[],[f110,f124]) ).
fof(f268,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK5) ),
inference(equality_resolution,[],[f112]) ).
fof(f299,plain,
( ! [X0] :
( ~ subset(unordered_pair(sK2,sK2),unordered_pair(X0,X0))
| sK4 = X0 )
| spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f42,f243]) ).
fof(f339,plain,
( sK2 = sK4
| sK3 = sK4
| ~ spl6_7 ),
inference(equality_resolution,[],[f248]) ).
fof(f341,definition,
( spl6_13
<=> sK3 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).
fof(f343,plain,
( sK3 = sK4
| ~ spl6_13 ),
inference(avatar_component_clause,[],[f341]) ).
fof(f344,plain,
( spl6_13
| spl6_2
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f339,f122,f50,f341]) ).
fof(f385,plain,
( sK2 = sK4
| sK2 = sK5
| ~ spl6_7 ),
inference(equality_resolution,[],[f249]) ).
fof(f388,plain,
( sK2 = sK4
| spl6_3
| ~ spl6_7 ),
inference(resolution,[],[f299,f31]) ).
fof(f394,plain,
( sK2 = sK5
| sK3 = sK5
| ~ spl6_7 ),
inference(equality_resolution,[],[f257]) ).
fof(f396,plain,
( sK2 = sK5
| spl6_1
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f394,f48]) ).
fof(f402,plain,
( unordered_pair(sK4,sK4) != unordered_pair(sK4,sK2)
| spl6_1
| spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f84,f396]) ).
fof(f404,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK4,sK2)
| spl6_1
| ~ spl6_7 ),
inference(superposition,[],[f124,f396]) ).
fof(f409,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK4)
| spl6_1
| ~ spl6_7 ),
inference(forward_demodulation,[],[f404,f26]) ).
fof(f412,plain,
( unordered_pair(sK4,sK4) != unordered_pair(sK2,sK4)
| spl6_1
| spl6_3
| ~ spl6_7 ),
inference(forward_demodulation,[],[f402,f26]) ).
fof(f416,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2)
| spl6_1
| ~ spl6_2
| ~ spl6_7 ),
inference(forward_demodulation,[],[f409,f51]) ).
fof(f417,plain,
( unordered_pair(sK2,sK2) != unordered_pair(sK2,sK2)
| spl6_1
| ~ spl6_2
| spl6_3
| ~ spl6_7 ),
inference(forward_demodulation,[],[f412,f51]) ).
fof(f418,plain,
( $false
| spl6_1
| ~ spl6_2
| spl6_3
| ~ spl6_7 ),
inference(trivial_inequality_removal,[],[f417]) ).
fof(f419,plain,
( spl6_1
| ~ spl6_2
| spl6_3
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f418]) ).
fof(f437,plain,
( sK2 != sK3
| spl6_1
| ~ spl6_2
| ~ spl6_5 ),
inference(forward_demodulation,[],[f169,f51]) ).
fof(f444,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| ~ spl6_12 ),
inference(forward_subsumption_resolution,[],[f235,f155]) ).
fof(f586,plain,
( ~ spl6_13
| spl6_1
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f169,f99,f46,f341]) ).
fof(f590,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_3 ),
inference(forward_demodulation,[],[f204,f85]) ).
fof(f591,plain,
( ! [X0,X1] :
( unordered_pair(sK4,sK4) = X1
| unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) )
| ~ spl6_3 ),
inference(duplicate_literal_removal,[],[f590]) ).
fof(f594,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| ~ spl6_3 ),
inference(forward_demodulation,[],[f268,f85]) ).
fof(f595,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK4,sK4)
| ~ spl6_3 ),
inference(duplicate_literal_removal,[],[f594]) ).
fof(f602,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK2,sK2) = X1 )
| ~ spl6_3
| ~ spl6_12 ),
inference(forward_demodulation,[],[f591,f444]) ).
fof(f647,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2)
| ~ spl6_3
| ~ spl6_12 ),
inference(equality_resolution,[],[f602]) ).
fof(f649,plain,
( $false
| ~ spl6_3
| ~ spl6_12 ),
inference(forward_subsumption_resolution,[],[f647,f155]) ).
fof(f650,plain,
( ~ spl6_3
| ~ spl6_12 ),
inference(avatar_contradiction_clause,[],[f649]) ).
fof(f659,plain,
( $false
| spl6_2
| spl6_3
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f388,f52]) ).
fof(f660,plain,
( spl6_2
| spl6_3
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f659]) ).
fof(f685,plain,
( sK2 = sK5
| spl6_2
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f385,f52]) ).
fof(f764,plain,
( sK2 != sK3
| spl6_2
| ~ spl6_13 ),
inference(superposition,[],[f52,f343]) ).
fof(f825,plain,
( sK2 = sK3
| ~ spl6_1
| spl6_2
| ~ spl6_7 ),
inference(superposition,[],[f685,f47]) ).
fof(f837,plain,
( $false
| ~ spl6_1
| spl6_2
| ~ spl6_7
| ~ spl6_13 ),
inference(forward_subsumption_resolution,[],[f825,f764]) ).
fof(f838,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_7
| ~ spl6_13 ),
inference(avatar_contradiction_clause,[],[f837]) ).
fof(f920,plain,
( ! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| sK2 = sK3 )
| spl6_1
| ~ spl6_2
| ~ spl6_7 ),
inference(superposition,[],[f44,f416]) ).
fof(f931,plain,
( ! [X0] : unordered_pair(X0,X0) != unordered_pair(sK2,sK2)
| spl6_1
| ~ spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(forward_subsumption_resolution,[],[f920,f437]) ).
fof(f942,plain,
( $false
| spl6_1
| ~ spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(equality_resolution,[],[f931]) ).
fof(f943,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f942]) ).
fof(f985,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_3 ),
inference(forward_demodulation,[],[f209,f85]) ).
fof(f986,plain,
( ! [X0,X1] :
( unordered_pair(sK4,sK4) = X1
| unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3)) )
| ~ spl6_3 ),
inference(duplicate_literal_removal,[],[f985]) ).
fof(f993,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,sK3))
| unordered_pair(sK2,sK2) = X1 )
| ~ spl6_3 ),
inference(forward_demodulation,[],[f986,f595]) ).
fof(f1038,plain,
( unordered_pair(sK2,sK3) = unordered_pair(sK2,sK2)
| ~ spl6_3 ),
inference(equality_resolution,[],[f993]) ).
fof(f1040,plain,
( $false
| ~ spl6_3
| spl6_7
| ~ spl6_8 ),
inference(forward_subsumption_resolution,[],[f1038,f212]) ).
fof(f1041,plain,
( ~ spl6_3
| spl6_7
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[],[f1040]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f53]) ).
cnf(s5,plain,
( spl6_7
| spl6_8 ),
inference(sat_conversion,[],[f129]) ).
cnf(s7,plain,
( spl6_5
| ~ spl6_7
| spl6_12 ),
inference(sat_conversion,[],[f156]) ).
cnf(s8,plain,
( spl6_3
| ~ spl6_5 ),
inference(sat_conversion,[],[f175]) ).
cnf(s12,plain,
( spl6_5
| ~ spl6_8 ),
inference(sat_conversion,[],[f238]) ).
cnf(s13,plain,
( spl6_2
| ~ spl6_7
| spl6_13 ),
inference(sat_conversion,[],[f344]) ).
cnf(s16,plain,
( spl6_1
| ~ spl6_2
| spl6_3
| ~ spl6_7 ),
inference(sat_conversion,[],[f419]) ).
cnf(s22,plain,
( spl6_1
| ~ spl6_5
| ~ spl6_13 ),
inference(sat_conversion,[],[f586]) ).
cnf(s23,plain,
( ~ spl6_3
| ~ spl6_12 ),
inference(sat_conversion,[],[f650]) ).
cnf(s24,plain,
( spl6_2
| spl6_3
| ~ spl6_7 ),
inference(sat_conversion,[],[f660]) ).
cnf(s27,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_7
| ~ spl6_13 ),
inference(sat_conversion,[],[f838]) ).
cnf(s30,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_5
| ~ spl6_7 ),
inference(sat_conversion,[],[f943]) ).
cnf(s33,plain,
( ~ spl6_3
| spl6_7
| ~ spl6_8 ),
inference(sat_conversion,[],[f1041]) ).
cnf(s34,plain,
( spl6_3
| spl6_2 ),
inference(rat,[],[s5,s12,s24,s8]) ).
cnf(s35,plain,
( spl6_5
| spl6_12 ),
inference(rat,[],[s5,s7,s12]) ).
cnf(s36,plain,
( spl6_7
| ~ spl6_3 ),
inference(rat,[],[s5,s33]) ).
cnf(s37,plain,
( spl6_2
| spl6_1 ),
inference(rat,[],[s36,s13,s22,s35,s23,s34]) ).
cnf(s38,plain,
( ~ spl6_3
| spl6_1 ),
inference(rat,[],[s30,s35,s36,s23,s37]) ).
cnf(s39,plain,
spl6_1,
inference(rat,[],[s5,s12,s16,s8,s38,s37]) ).
cnf(s40,plain,
~ spl6_2,
inference(rat,[],[s1,s39]) ).
cnf(s41,plain,
spl6_3,
inference(rat,[],[s34,s40]) ).
cnf(s43,plain,
spl6_7,
inference(rat,[],[s36,s41]) ).
cnf(s45,plain,
spl6_13,
inference(rat,[],[s13,s40,s43]) ).
cnf(s46,plain,
$false,
inference(rat,[],[s27,s40,s39,s43,s45]) ).
fof(f1048,plain,
$false,
inference(avatar_sat_refutation,[],[s46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU156+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:47:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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
% 0.10/0.45 % (2642287)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (2642297)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3037940094:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (2642293)% WARNING: option uhcvi not known.
% 0.10/0.45 % (2642292)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1725813538_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (2642298)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=431816046:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (2642294)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3877378809:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (2642295)dis+10_1_sil=32000:sp=arity:random_seed=3996381942:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (2642296)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3027648805:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % TRYING [1]
% 0.10/0.45 % TRYING [2]
% 0.10/0.45 % (2642293)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1739867003:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % TRYING [3]
% 0.10/0.45 % TRYING [4]
% 0.10/0.45 % (2642297) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2642287-2642297"...
% 0.10/0.45 % TRYING [5]
% 0.10/0.45 % (2642297)...printing done.
% 0.10/0.45 % (2642297)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (2642297)------------------------------
% 0.10/0.46 % (2642297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (2642297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (2642297)CaDiCaL version: 2.1.3
% 0.10/0.46 % (2642297)Termination reason: Refutation
% 0.10/0.46 % (2642297)Time elapsed: 0.013 s
% 0.10/0.46 % (2642297)Peak memory usage: 12 MB
% 0.10/0.46 % (2642297)Instructions burned: 41 (million)
% 0.10/0.46 % (2642287)Success in time 0.039 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------