%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET893+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:42:15 PM UTC 2026
% Result : Theorem 1.74s 1.11s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 74 ( 10 unt; 7 def)
% Number of atoms : 206 ( 56 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 227 ( 95 ~; 98 |; 23 &)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 55 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
<~> ( X0 = X2
& X1 = X3 ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3
| ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) )
& ( ( X0 = X2
& X1 = X3 )
| in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3
| ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) )
& ( ( X0 = X2
& X1 = X3 )
| in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3))) ) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
( ( sK0 != sK2
| sK1 != sK3
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) )
& ( ( sK0 = sK2
& sK1 = sK3 )
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X2 = X0
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f17]) ).
fof(f19,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
( sK1 = sK3
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
( sK0 = sK2
| in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
( sK0 != sK2
| sK1 != sK3
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X1,X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X0,X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f32,definition,
~ sP5(sK0),
introduced(definition,[new_symbols(definition,[sP5])],[inequality_splitting_name_introduction]) ).
fof(f33,definition,
~ sP6(sK1),
introduced(definition,[new_symbols(definition,[sP6])],[inequality_splitting_name_introduction]) ).
fof(f34,plain,
( sP5(sK2)
| sP6(sK3)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
inference(inequality_splitting,[],[f23,f33,f32]) ).
fof(f35,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f26]) ).
fof(f36,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f35]) ).
fof(f37,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f25]) ).
fof(f39,definition,
( spl7_1
<=> in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3))) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f40,plain,
( ~ in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3)))
| spl7_1 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f41,plain,
( in(ordered_pair(sK0,sK1),cartesian_product2(singleton(sK2),singleton(sK3)))
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f43,definition,
( spl7_2
<=> sK1 = sK3 ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f44,plain,
( sK1 != sK3
| spl7_2 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f45,plain,
( sK1 = sK3
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f46,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f21,f43,f39]) ).
fof(f48,definition,
( spl7_3
<=> sK0 = sK2 ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f49,plain,
( sK0 != sK2
| spl7_3 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f50,plain,
( sK0 = sK2
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f51,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f22,f48,f39]) ).
fof(f53,definition,
( spl7_4
<=> sP6(sK3) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f57,definition,
( spl7_5
<=> sP5(sK2) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f60,plain,
( ~ spl7_1
| spl7_4
| spl7_5 ),
inference(avatar_split_clause,[],[f34,f57,f53,f39]) ).
fof(f61,plain,
( ~ sP6(sK3)
| ~ spl7_2 ),
inference(superposition,[],[f33,f45]) ).
fof(f62,plain,
( ~ spl7_4
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f61,f43,f53]) ).
fof(f63,plain,
( ~ sP5(sK2)
| ~ spl7_3 ),
inference(superposition,[],[f32,f50]) ).
fof(f64,plain,
( ~ spl7_5
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f63,f48,f57]) ).
fof(f65,plain,
( ~ in(sK0,singleton(sK2))
| ~ in(sK1,singleton(sK3))
| spl7_1 ),
inference(resolution,[],[f40,f31]) ).
fof(f70,plain,
( ~ in(sK2,singleton(sK2))
| ~ in(sK1,singleton(sK3))
| spl7_1
| ~ spl7_3 ),
inference(forward_demodulation,[],[f65,f50]) ).
fof(f71,plain,
( ~ in(sK1,singleton(sK3))
| spl7_1
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f70,f36]) ).
fof(f72,plain,
( ~ in(sK3,singleton(sK3))
| spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f71,f45]) ).
fof(f73,plain,
( $false
| spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f72,f36]) ).
fof(f74,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f83,plain,
( in(sK1,singleton(sK3))
| ~ spl7_1 ),
inference(resolution,[],[f41,f29]) ).
fof(f84,plain,
( in(sK0,singleton(sK2))
| ~ spl7_1 ),
inference(resolution,[],[f41,f30]) ).
fof(f86,plain,
( sK1 = sK3
| ~ spl7_1 ),
inference(resolution,[],[f83,f37]) ).
fof(f88,plain,
( $false
| ~ spl7_1
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f86,f44]) ).
fof(f89,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_contradiction_clause,[],[f88]) ).
fof(f93,plain,
( sK0 = sK2
| ~ spl7_1 ),
inference(resolution,[],[f84,f37]) ).
fof(f95,plain,
( $false
| ~ spl7_1
| spl7_3 ),
inference(forward_subsumption_resolution,[],[f93,f49]) ).
fof(f96,plain,
( ~ spl7_1
| spl7_3 ),
inference(avatar_contradiction_clause,[],[f95]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f46]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f51]) ).
cnf(s3,plain,
( ~ spl7_1
| spl7_4
| spl7_5 ),
inference(sat_conversion,[],[f60]) ).
cnf(s4,plain,
( ~ spl7_2
| ~ spl7_4 ),
inference(sat_conversion,[],[f62]) ).
cnf(s5,plain,
( ~ spl7_3
| ~ spl7_5 ),
inference(sat_conversion,[],[f64]) ).
cnf(s6,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f74]) ).
cnf(s8,plain,
( ~ spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f89]) ).
cnf(s10,plain,
( ~ spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f96]) ).
cnf(s11,plain,
spl7_1,
inference(rat,[],[s6,s1,s2]) ).
cnf(s12,plain,
spl7_3,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
spl7_2,
inference(rat,[],[s8,s11]) ).
cnf(s14,plain,
~ spl7_5,
inference(rat,[],[s5,s12]) ).
cnf(s15,plain,
~ spl7_4,
inference(rat,[],[s4,s13]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s3,s11,s14,s15]) ).
fof(f97,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET893+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.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:06:46 UTC 2026
% 0.14/0.37 % CPUTime :
% 0.14/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.74/1.11 % (1399751)Detected formulas, will run a generic FOF schedule.
% 1.74/1.11 % (1399759)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3754365232:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.74/1.11 % (1399759)First to succeed.
% 1.74/1.11 % (1399759)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1399751"
% 1.74/1.11 % (1399760)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3211297200:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.74/1.11 % (1399760)Also succeeded, but the first one will report.
% 1.74/1.11 % (1399761)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1319642920:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.74/1.11 % (1399758)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3132710018:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.74/1.11 % (1399757)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=498947876:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.74/1.11 % (1399756)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3968501001:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.74/1.11 % (1399761)Also succeeded, but the first one will report.
% 1.74/1.11 % (1399762)dis-21_1_sil=8000:lcm=predicate:random_seed=938774296:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.74/1.11 % (1399762)Instruction limit reached!
% 1.74/1.11 % (1399762)------------------------------
% 1.74/1.11 % (1399762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.74/1.11 % (1399762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.74/1.11 % (1399762)CaDiCaL version: 2.1.3
% 1.74/1.11 % (1399762)Termination reason: Instruction limit
% 1.74/1.11 % (1399762)Termination phase: Saturation
% 1.74/1.11 % (1399762)Time elapsed: 0.057 s
% 1.74/1.11 % (1399762)Peak memory usage: 88 MB
% 1.74/1.11 % (1399762)Instructions burned: 131 (million)
% 1.74/1.11 % (1399759)Refutation found. Thanks to Tanya!
% 1.74/1.11 % SZS status Theorem for theBenchmark
% 1.74/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/1.20 % (1399759)------------------------------
% 0.14/1.20 % (1399759)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.14/1.20 % (1399759)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/1.20 % (1399759)CaDiCaL version: 2.1.3
% 0.14/1.20 % (1399759)Termination reason: Refutation
% 0.14/1.20 % (1399759)Time elapsed: 0.002 s
% 0.14/1.20 % (1399759)Peak memory usage: 89 MB
% 0.14/1.20 % (1399759)Instructions burned: 3 (million)
% 0.14/1.20 % (1399759)------------------------------
% 0.14/1.20 % (1399759)------------------------------
% 0.14/1.20 % (1399751)Success in time 0.269 s
% 0.14/1.20 % Vampire exiting
%------------------------------------------------------------------------------