%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET920+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 : 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:42:19 PM UTC 2026
% Result : Theorem 2.41s 1.21s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 145 ( 61 equ)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 188 ( 67 ~; 72 |; 43 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 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 : 72 ( 63 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
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,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
=> in(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
=> in(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
? [X0,X1,X2] :
( ~ in(X0,X2)
& set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,plain,
( ~ in(sK0,sK2)
& unordered_pair(sK0,sK1) = set_intersection2(unordered_pair(sK0,sK1),sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
fof(f15,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(f16,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,[],[f15]) ).
fof(f17,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,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK3(X0,X1,X2) != X0
& sK3(X0,X1,X2) != X1 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X0
| sK3(X0,X1,X2) = X1
| in(sK3(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,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& in(sK4(X0,X1,X2),X1) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f21]) ).
fof(f23,plain,
unordered_pair(sK0,sK1) = set_intersection2(unordered_pair(sK0,sK1),sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
~ in(sK0,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f22]) ).
fof(f41,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f27]) ).
fof(f42,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f41]) ).
fof(f48,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f32]) ).
fof(f49,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK0,sK1))
| in(X0,sK2) ),
inference(superposition,[],[f48,f23]) ).
fof(f53,plain,
in(sK0,sK2),
inference(resolution,[],[f49,f42]) ).
fof(f57,plain,
$false,
inference(forward_subsumption_resolution,[],[f53,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET920+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.11/0.38 % Computer : n009.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:10:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.42 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.41/1.21 % (2628516)Detected formulas, will run a generic FOF schedule.
% 2.41/1.21 % (2628524)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=508570841:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.41/1.21 % (2628524)First to succeed.
% 2.41/1.21 % (2628524)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2628516"
% 2.41/1.21 % (2628525)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4292909931:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.41/1.21 % (2628527)dis-21_1_sil=8000:lcm=predicate:random_seed=3871055910: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.41/1.21 % (2628523)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=2258992029:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.41/1.21 % (2628522)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=736472719:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.41/1.21 % (2628521)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=3432713150:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.41/1.21 % (2628526)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2630615564:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.41/1.21 % (2628525)Also succeeded, but the first one will report.
% 2.41/1.21 % (2628526)Also succeeded, but the first one will report.
% 2.41/1.21 % (2628527)Instruction limit reached!
% 2.41/1.21 % (2628527)------------------------------
% 2.41/1.21 % (2628527)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.41/1.21 % (2628527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.41/1.21 % (2628527)CaDiCaL version: 2.1.3
% 2.41/1.21 % (2628527)Termination reason: Instruction limit
% 2.41/1.21 % (2628527)Termination phase: Saturation
% 2.41/1.21 % (2628527)Time elapsed: 0.073 s
% 2.41/1.21 % (2628527)Peak memory usage: 89 MB
% 2.41/1.21 % (2628527)Instructions burned: 129 (million)
% 2.41/1.21 % (2628524)Refutation found. Thanks to Tanya!
% 2.41/1.21 % SZS status Theorem for theBenchmark
% 2.41/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 2.41/1.21 % (2628524)------------------------------
% 2.41/1.21 % (2628524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.41/1.21 % (2628524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.41/1.21 % (2628524)CaDiCaL version: 2.1.3
% 2.41/1.21 % (2628524)Termination reason: Refutation
% 2.41/1.21 % (2628524)Time elapsed: 0.002 s
% 2.41/1.21 % (2628524)Peak memory usage: 89 MB
% 2.41/1.21 % (2628524)Instructions burned: 2 (million)
% 2.41/1.21 % (2628524)------------------------------
% 2.41/1.21 % (2628524)------------------------------
% 2.41/1.21 % (2628516)Success in time 0.267 s
% 2.41/1.22 % Vampire exiting
%------------------------------------------------------------------------------