%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:47:26 PM UTC 2026
% Result : Theorem 2.51s 1.22s
% Output : Refutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 132 ( 90 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 158 ( 59 ~; 62 |; 31 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 74 ( 66 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
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(f64,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f73,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f74,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f73]) ).
fof(f103,plain,
? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f74]) ).
fof(f119,plain,
( sK3 != sK4
& singleton(sK2) = unordered_pair(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f103]) ).
fof(f120,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,[],[f7]) ).
fof(f121,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,[],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK5(X0,X1) != X0
| ~ in(sK5(X0,X1),X1) )
& ( sK5(X0,X1) = X0
| in(sK5(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f121]) ).
fof(f149,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f149]) ).
fof(f151,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f150]) ).
fof(f152,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK13(X0,X1,X2) != X0
& sK13(X0,X1,X2) != X1 )
| ~ in(sK13(X0,X1,X2),X2) )
& ( sK13(X0,X1,X2) = X0
| sK13(X0,X1,X2) = X1
| in(sK13(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X3,sK13(X0,X1,X2))],[f151]) ).
fof(f186,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f193,plain,
singleton(sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f119]) ).
fof(f194,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f119]) ).
fof(f195,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f122]) ).
fof(f248,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f152]) ).
fof(f249,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f152]) ).
fof(f270,plain,
unordered_pair(sK3,sK4) = unordered_pair(sK2,sK2),
inference(definition_unfolding,[],[f193,f186]) ).
fof(f274,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f195,f186]) ).
fof(f290,plain,
! [X3,X0] :
( ~ in(X3,unordered_pair(X0,X0))
| X0 = X3 ),
inference(equality_resolution,[],[f274]) ).
fof(f305,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f249]) ).
fof(f306,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f305]) ).
fof(f307,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f248]) ).
fof(f308,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f307]) ).
fof(f314,plain,
in(sK3,unordered_pair(sK2,sK2)),
inference(superposition,[],[f306,f270]) ).
fof(f315,plain,
in(sK4,unordered_pair(sK2,sK2)),
inference(superposition,[],[f308,f270]) ).
fof(f454,plain,
sK2 = sK3,
inference(resolution,[],[f290,f314]) ).
fof(f455,plain,
sK2 = sK4,
inference(resolution,[],[f290,f315]) ).
fof(f467,plain,
sK2 != sK3,
inference(superposition,[],[f194,f455]) ).
fof(f468,plain,
$false,
inference(forward_subsumption_resolution,[],[f467,f454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 03:47:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.51/1.22 % (1164370)Detected formulas, will run a generic FOF schedule.
% 2.51/1.22 % (1164379)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3901753805:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.51/1.22 % (1164379)First to succeed.
% 2.51/1.22 % (1164379)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1164370"
% 2.51/1.22 % (1164377)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=790969196:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.51/1.22 % (1164375)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=1803402486:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.51/1.22 % (1164376)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=2861198834:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.51/1.22 % (1164378)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1445333381:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.51/1.22 % (1164380)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3111502640:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.51/1.22 % (1164378)Also succeeded, but the first one will report.
% 2.51/1.22 % (1164380)Also succeeded, but the first one will report.
% 2.51/1.22 % (1164381)dis-21_1_sil=8000:lcm=predicate:random_seed=2779916063: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)
% 2.51/1.22 % (1164381)Instruction limit reached!
% 2.51/1.22 % (1164381)------------------------------
% 2.51/1.22 % (1164381)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.22 % (1164381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.22 % (1164381)CaDiCaL version: 2.1.3
% 2.51/1.22 % (1164381)Termination reason: Instruction limit
% 2.51/1.22 % (1164381)Termination phase: Saturation
% 2.51/1.22 % (1164381)Time elapsed: 0.084 s
% 2.51/1.22 % (1164381)Peak memory usage: 89 MB
% 2.51/1.22 % (1164381)Instructions burned: 130 (million)
% 2.51/1.22 % (1164379)Refutation found. Thanks to Tanya!
% 2.51/1.22 % SZS status Theorem for theBenchmark
% 2.51/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 2.51/1.22 % (1164379)------------------------------
% 2.51/1.22 % (1164379)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.51/1.22 % (1164379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.51/1.22 % (1164379)CaDiCaL version: 2.1.3
% 2.51/1.22 % (1164379)Termination reason: Refutation
% 2.51/1.22 % (1164379)Time elapsed: 0.004 s
% 2.51/1.22 % (1164379)Peak memory usage: 88 MB
% 2.51/1.22 % (1164379)Instructions burned: 9 (million)
% 2.51/1.22 % (1164379)------------------------------
% 2.51/1.22 % (1164379)------------------------------
% 2.51/1.22 % (1164370)Success in time 0.287 s
% 2.51/1.22 % Vampire exiting
%------------------------------------------------------------------------------