%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET017+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:37 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 61 ( 15 unt; 6 def)
% Number of atoms : 142 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 138 ( 57 ~; 52 |; 20 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X0,X2) )
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1,X2] :
( X1 != X2
& member(X1,universal_class)
& member(X2,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X0,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2] :
( X1 != X2
& member(X1,universal_class)
& member(X2,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X0,X2) ),
inference(flattening,[],[f60]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f67]) ).
fof(f104,plain,
( sK7 != sK8
& member(sK7,universal_class)
& member(sK8,universal_class)
& unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f61]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f114,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f192,plain,
unordered_pair(sK6,sK7) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
member(sK8,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f195,plain,
sK7 != sK8,
inference(cnf_transformation,[],[f104]) ).
fof(f236,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f114]) ).
fof(f275,plain,
( member(sK8,unordered_pair(sK6,sK7))
| ~ member(sK8,universal_class) ),
inference(superposition,[],[f236,f192]) ).
fof(f277,definition,
( spl9_1
<=> member(sK8,universal_class) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f279,plain,
( ~ member(sK8,universal_class)
| spl9_1 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f281,definition,
( spl9_2
<=> member(sK8,unordered_pair(sK6,sK7)) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f283,plain,
( member(sK8,unordered_pair(sK6,sK7))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f281]) ).
fof(f284,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f275,f281,f277]) ).
fof(f285,plain,
( $false
| spl9_1 ),
inference(resolution,[],[f279,f193]) ).
fof(f290,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f991,plain,
( sK7 = sK8
| sK6 = sK8
| ~ spl9_2 ),
inference(resolution,[],[f112,f283]) ).
fof(f998,definition,
( spl9_38
<=> sK6 = sK8 ),
introduced(definition,[new_symbols(definition,[spl9_38])],[avatar_definition]) ).
fof(f1000,plain,
( sK6 = sK8
| ~ spl9_38 ),
inference(avatar_component_clause,[],[f998]) ).
fof(f1002,definition,
( spl9_39
<=> sK7 = sK8 ),
introduced(definition,[new_symbols(definition,[spl9_39])],[avatar_definition]) ).
fof(f1004,plain,
( sK7 = sK8
| ~ spl9_39 ),
inference(avatar_component_clause,[],[f1002]) ).
fof(f1005,plain,
( spl9_38
| spl9_39
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f991,f281,f1002,f998]) ).
fof(f1007,plain,
( unordered_pair(sK6,sK7) = unordered_pair(sK6,sK6)
| ~ spl9_38 ),
inference(superposition,[],[f192,f1000]) ).
fof(f1008,plain,
( sK6 != sK7
| ~ spl9_38 ),
inference(superposition,[],[f195,f1000]) ).
fof(f1014,plain,
( member(sK7,unordered_pair(sK6,sK6))
| ~ member(sK7,universal_class)
| ~ spl9_38 ),
inference(superposition,[],[f236,f1007]) ).
fof(f1018,definition,
( spl9_40
<=> member(sK7,universal_class) ),
introduced(definition,[new_symbols(definition,[spl9_40])],[avatar_definition]) ).
fof(f1020,plain,
( ~ member(sK7,universal_class)
| spl9_40 ),
inference(avatar_component_clause,[],[f1018]) ).
fof(f1022,definition,
( spl9_41
<=> member(sK7,unordered_pair(sK6,sK6)) ),
introduced(definition,[new_symbols(definition,[spl9_41])],[avatar_definition]) ).
fof(f1024,plain,
( member(sK7,unordered_pair(sK6,sK6))
| ~ spl9_41 ),
inference(avatar_component_clause,[],[f1022]) ).
fof(f1025,plain,
( ~ spl9_40
| spl9_41
| ~ spl9_38 ),
inference(avatar_split_clause,[],[f1014,f998,f1022,f1018]) ).
fof(f1026,plain,
( $false
| spl9_40 ),
inference(resolution,[],[f1020,f194]) ).
fof(f1032,plain,
spl9_40,
inference(avatar_contradiction_clause,[],[f1026]) ).
fof(f1035,plain,
( sK7 != sK7
| ~ spl9_39 ),
inference(superposition,[],[f195,f1004]) ).
fof(f1037,plain,
( $false
| ~ spl9_39 ),
inference(trivial_inequality_removal,[],[f1035]) ).
fof(f1038,plain,
~ spl9_39,
inference(avatar_contradiction_clause,[],[f1037]) ).
fof(f1043,plain,
( sK6 = sK7
| sK6 = sK7
| ~ spl9_41 ),
inference(resolution,[],[f1024,f112]) ).
fof(f1044,plain,
( sK6 = sK7
| ~ spl9_41 ),
inference(duplicate_literal_removal,[],[f1043]) ).
fof(f1046,plain,
( sK6 != sK6
| ~ spl9_38
| ~ spl9_41 ),
inference(superposition,[],[f1008,f1044]) ).
fof(f1049,plain,
( $false
| ~ spl9_38
| ~ spl9_41 ),
inference(trivial_inequality_removal,[],[f1046]) ).
fof(f1050,plain,
( ~ spl9_38
| ~ spl9_41 ),
inference(avatar_contradiction_clause,[],[f1049]) ).
cnf(s1,plain,
( ~ spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f284]) ).
cnf(s2,plain,
spl9_1,
inference(sat_conversion,[],[f290]) ).
cnf(s47,plain,
( ~ spl9_2
| spl9_38
| spl9_39 ),
inference(sat_conversion,[],[f1005]) ).
cnf(s48,plain,
( ~ spl9_38
| ~ spl9_40
| spl9_41 ),
inference(sat_conversion,[],[f1025]) ).
cnf(s49,plain,
spl9_40,
inference(sat_conversion,[],[f1032]) ).
cnf(s50,plain,
~ spl9_39,
inference(sat_conversion,[],[f1038]) ).
cnf(s51,plain,
( ~ spl9_38
| ~ spl9_41 ),
inference(sat_conversion,[],[f1050]) ).
cnf(s52,plain,
( ~ spl9_38
| spl9_41 ),
inference(rat,[],[s48,s49]) ).
cnf(s53,plain,
( ~ spl9_2
| spl9_38 ),
inference(rat,[],[s47,s50]) ).
cnf(s57,plain,
spl9_2,
inference(rat,[],[s1,s2]) ).
cnf(s58,plain,
spl9_38,
inference(rat,[],[s53,s57]) ).
cnf(s59,plain,
~ spl9_41,
inference(rat,[],[s51,s58]) ).
cnf(s60,plain,
$false,
inference(rat,[],[s52,s59,s58]) ).
fof(f1051,plain,
$false,
inference(avatar_sat_refutation,[],[s60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET017+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n006.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 00:08:55 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.17/0.47 % (3472195)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (3472206)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3050809649:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (3472201)% WARNING: option uhcvi not known.
% 0.17/0.47 % (3472200)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3324027654_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (3472201)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=546756511:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (3472202)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3668772976:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (3472204)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3568656948:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (3472205)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3971959734:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (3472203)dis+10_1_sil=32000:sp=arity:random_seed=3851977414:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (3472206) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3472195-3472206"...
% 0.17/0.47 % (3472206)...printing done.
% 0.17/0.47 % (3472206)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (3472206)------------------------------
% 0.17/0.47 % (3472206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (3472206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (3472206)CaDiCaL version: 2.1.3
% 0.17/0.47 % (3472206)Termination reason: Refutation
% 0.17/0.47 % (3472206)Time elapsed: 0.011 s
% 0.17/0.47 % (3472206)Peak memory usage: 13 MB
% 0.17/0.47 % (3472206)Instructions burned: 26 (million)
% 0.17/0.47 % (3472195)Success in time 0.046 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------