%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET616+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:44:10 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 102 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 106 ( 41 ~; 40 |; 18 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 56 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f7,conjecture,
! [X0,X1] :
( difference(X0,X1) = difference(X1,X0)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th90) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( difference(X0,X1) = difference(X1,X0)
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0,X1] :
( X0 != X1
& difference(X0,X1) = difference(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f22]) ).
fof(f24,plain,
( sK3 != sK4
& difference(sK3,sK4) = difference(sK4,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f11]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f41,plain,
difference(sK3,sK4) = difference(sK4,sK3),
inference(cnf_transformation,[],[f24]) ).
fof(f42,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f24]) ).
fof(f48,plain,
! [X0] :
( ~ member(X0,difference(sK3,sK4))
| member(X0,sK4) ),
inference(superposition,[],[f28,f41]) ).
fof(f49,plain,
! [X0] : ~ member(X0,difference(sK3,sK4)),
inference(forward_subsumption_resolution,[],[f48,f27]) ).
fof(f64,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,sK4) ),
inference(resolution,[],[f29,f49]) ).
fof(f67,plain,
! [X0] :
( member(X0,difference(sK3,sK4))
| ~ member(X0,sK4)
| member(X0,sK3) ),
inference(superposition,[],[f29,f41]) ).
fof(f69,plain,
! [X0] :
( ~ member(X0,sK4)
| member(X0,sK3) ),
inference(forward_subsumption_resolution,[],[f67,f28]) ).
fof(f79,plain,
! [X0] :
( member(sK2(sK4,X0),sK3)
| subset(sK4,X0) ),
inference(resolution,[],[f69,f38]) ).
fof(f85,plain,
! [X0] :
( member(sK2(sK3,X0),sK4)
| subset(sK3,X0) ),
inference(resolution,[],[f64,f38]) ).
fof(f105,plain,
( subset(sK4,sK3)
| subset(sK4,sK3) ),
inference(resolution,[],[f79,f39]) ).
fof(f106,plain,
subset(sK4,sK3),
inference(duplicate_literal_removal,[],[f105]) ).
fof(f117,plain,
( ~ subset(sK3,sK4)
| sK3 = sK4 ),
inference(resolution,[],[f106,f32]) ).
fof(f118,plain,
~ subset(sK3,sK4),
inference(forward_subsumption_resolution,[],[f117,f42]) ).
fof(f152,plain,
( subset(sK3,sK4)
| subset(sK3,sK4) ),
inference(resolution,[],[f85,f39]) ).
fof(f155,plain,
subset(sK3,sK4),
inference(duplicate_literal_removal,[],[f152]) ).
fof(f156,plain,
$false,
inference(forward_subsumption_resolution,[],[f155,f118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET616+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.35 % Computer : n019.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 28 02:19:18 UTC 2026
% 0.15/0.36 % CPUTime :
% 0.15/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.39 Running first-order model finding
% 0.15/0.39 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45 % (3600835)Will run a generic schedule for satisfiability detection.
% 0.15/0.45 % (3600848)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4173465357_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.45 % TRYING [1]
% 0.15/0.45 % TRYING [2]
% 0.15/0.45 % TRYING [3]
% 0.15/0.45 % TRYING [4]
% 0.15/0.45 % TRYING [5]
% 0.15/0.45 % TRYING [6]
% 0.15/0.45 % (3600850)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1061236432:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.45 % (3600851)dis+10_1_sil=32000:sp=arity:random_seed=2727666605:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.45 % (3600854)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1779970918:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.45 % (3600852)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=73834723:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.45 % (3600853)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=95276852:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.45 % (3600849)% WARNING: option uhcvi not known.
% 0.15/0.45 % TRYING [7]
% 0.15/0.45 % (3600854) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3600835-3600854"...
% 0.15/0.45 % (3600851) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3600835-3600851"...
% 0.15/0.45 % (3600849)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2946465281:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.45 % (3600851)...printing done.
% 0.15/0.45 % (3600854)...printing done.
% 0.15/0.45 % (3600851)Refutation found. Thanks to Tanya!
% 0.15/0.45 % SZS status Theorem for theBenchmark
% 0.15/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.45 % (3600851)------------------------------
% 0.15/0.45 % (3600851)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.45 % (3600851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.45 % (3600851)CaDiCaL version: 2.1.3
% 0.15/0.45 % (3600851)Termination reason: Refutation
% 0.15/0.45 % (3600851)Time elapsed: 0.005 s
% 0.15/0.45 % (3600851)Peak memory usage: 11 MB
% 0.15/0.45 % (3600851)Instructions burned: 6 (million)
% 0.15/0.45 % (3600835)Success in time 0.047 s
% 0.15/0.45 % Vampire exiting
%------------------------------------------------------------------------------