%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET885+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 : n012.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:14 PM UTC 2026
% Result : Theorem 2.00s 0.87s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 8 unt; 1 def)
% Number of atoms : 139 ( 75 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 169 ( 63 ~; 64 |; 31 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 79 ( 71 !; 8 ?)
% 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(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),singleton(X2))
=> X0 = X2 ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f14,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f15,plain,
? [X0,X1,X2] :
( X0 != X2
& subset(unordered_pair(X0,X1),singleton(X2)) ),
inference(ennf_transformation,[],[f10]) ).
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)
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f17]) ).
fof(f19,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,[],[f4]) ).
fof(f20,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,[],[f19]) ).
fof(f21,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,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X1 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X1
| in(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f21]) ).
fof(f25,plain,
( sK4 != sK6
& subset(unordered_pair(sK4,sK5),singleton(sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f15]) ).
fof(f28,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
subset(unordered_pair(sK4,sK5),singleton(sK6)),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
sK4 != sK6,
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f28]) ).
fof(f47,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f34]) ).
fof(f48,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f47]) ).
fof(f52,definition,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ7_eqProxy])],[equality_proxy_definition]) ).
fof(f56,plain,
! [X3,X0] :
( sQ7_eqProxy(X0,X3)
| ~ in(X3,singleton(X0)) ),
inference(equality_proxy_replacement,[],[f46,f52]) ).
fof(f61,plain,
~ sQ7_eqProxy(sK4,sK6),
inference(equality_proxy_replacement,[],[f43,f52]) ).
fof(f63,plain,
! [X0,X1] :
( sQ7_eqProxy(X1,X0)
| ~ sQ7_eqProxy(X0,X1) ),
inference(equality_proxy_axiom,[],[f52]) ).
fof(f65,plain,
~ sQ7_eqProxy(sK6,sK4),
inference(resolution,[],[f63,f61]) ).
fof(f68,plain,
~ in(sK4,singleton(sK6)),
inference(resolution,[],[f56,f65]) ).
fof(f69,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK4,sK5))
| in(X0,singleton(sK6)) ),
inference(resolution,[],[f38,f42]) ).
fof(f94,plain,
in(sK4,singleton(sK6)),
inference(resolution,[],[f69,f48]) ).
fof(f100,plain,
$false,
inference(resolution,[],[f94,f68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET885+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 28 03:06:04 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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
% 2.00/0.87 % (2979981)Detected formulas, will run a generic FOF schedule.
% 2.00/0.87 % (2979992)dis-21_1_sil=8000:lcm=predicate:random_seed=2004801056: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.00/0.87 % (2979992)First to succeed.
% 2.00/0.87 % (2979988)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=3594753561:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.00/0.87 % (2979990)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4208860157:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.00/0.87 % (2979989)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3494400627:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.00/0.87 % (2979986)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=4258367594:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.00/0.87 % (2979987)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=548890590:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.00/0.87 % (2979992)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2979981"
% 2.00/0.87 % (2979989)Also succeeded, but the first one will report.
% 2.00/0.87 % (2979990)Also succeeded, but the first one will report.
% 2.00/0.87 % (2979991)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2189772609:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.00/0.87 % (2979991)Also succeeded, but the first one will report.
% 2.00/0.87 % (2979992)Refutation found. Thanks to Tanya!
% 2.00/0.87 % SZS status Theorem for theBenchmark
% 2.00/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 2.00/0.87 % (2979992)------------------------------
% 2.00/0.87 % (2979992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.00/0.87 % (2979992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.00/0.87 % (2979992)CaDiCaL version: 2.1.3
% 2.00/0.87 % (2979992)Termination reason: Refutation
% 2.00/0.87 % (2979992)Time elapsed: 0.002 s
% 2.00/0.87 % (2979992)Peak memory usage: 88 MB
% 2.00/0.87 % (2979992)Instructions burned: 3 (million)
% 2.00/0.87 % (2979992)------------------------------
% 2.00/0.87 % (2979992)------------------------------
% 2.00/0.87 % (2979981)Success in time 0.26 s
% 2.00/0.87 % Vampire exiting
%------------------------------------------------------------------------------