%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET072+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 : n014.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:57 PM UTC 2026
% Result : Theorem 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 68 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 22 ~; 20 |; 20 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 25 !; 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(X0,universal_class)
& member(X1,universal_class)
& unordered_pair(X0,X2) = unordered_pair(X1,X2) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_cancellation) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,universal_class)
& member(X1,universal_class)
& unordered_pair(X0,X2) = unordered_pair(X1,X2) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1,X2] :
( X0 != X1
& member(X0,universal_class)
& member(X1,universal_class)
& unordered_pair(X0,X2) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2] :
( X0 != X1
& member(X0,universal_class)
& member(X1,universal_class)
& unordered_pair(X0,X2) = unordered_pair(X1,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,
( sK6 != sK7
& member(sK6,universal_class)
& member(sK7,universal_class)
& unordered_pair(sK7,sK8) = 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(f115,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f192,plain,
unordered_pair(sK7,sK8) = unordered_pair(sK6,sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
member(sK6,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f195,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f104]) ).
fof(f235,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f115]) ).
fof(f281,plain,
( member(sK7,unordered_pair(sK6,sK8))
| ~ member(sK7,universal_class) ),
inference(superposition,[],[f235,f192]) ).
fof(f282,plain,
member(sK7,unordered_pair(sK6,sK8)),
inference(forward_subsumption_resolution,[],[f281,f193]) ).
fof(f407,plain,
( sK7 = sK8
| sK6 = sK7 ),
inference(resolution,[],[f112,f282]) ).
fof(f413,plain,
sK7 = sK8,
inference(forward_subsumption_resolution,[],[f407,f195]) ).
fof(f417,plain,
unordered_pair(sK6,sK7) = unordered_pair(sK7,sK7),
inference(superposition,[],[f192,f413]) ).
fof(f434,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK6,sK7))
| sK7 = X0
| sK7 = X0 ),
inference(superposition,[],[f112,f417]) ).
fof(f439,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK6,sK7))
| sK7 = X0 ),
inference(duplicate_literal_removal,[],[f434]) ).
fof(f448,plain,
( sK6 = sK7
| ~ member(sK6,universal_class) ),
inference(resolution,[],[f439,f235]) ).
fof(f473,plain,
~ member(sK6,universal_class),
inference(forward_subsumption_resolution,[],[f448,f195]) ).
fof(f474,plain,
$false,
inference(forward_subsumption_resolution,[],[f473,f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET072+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.11/0.41 % Computer : n014.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8046.5625MB
% 0.11/0.41 % OS : Linux 6.8.0-71-generic
% 0.11/0.42 % CPULimit : 300
% 0.11/0.42 % WCLimit : 300
% 0.11/0.42 % DateTime : Mon Sep 28 00:30:02 UTC 2026
% 0.11/0.42 % CPUTime :
% 0.11/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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.50 % (1315859)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (1315866)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2306919441:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50 % (1315865)% WARNING: option uhcvi not known.
% 0.17/0.50 % (1315869)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2211767768:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % (1315864)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2064479945_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50 % (1315865)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=273404498:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50 % (1315867)dis+10_1_sil=32000:sp=arity:random_seed=3620982332:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50 % (1315868)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1992463988:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50 % (1315870)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=835792467:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50 % (1315867) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1315859-1315867"...
% 0.17/0.50 % (1315865) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1315859-1315865"...
% 0.17/0.50 % (1315868) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1315859-1315868"...
% 0.17/0.50 % (1315867)...printing done.
% 0.17/0.50 % (1315865)...printing done.
% 0.17/0.50 % (1315868)...printing done.
% 0.17/0.50 % (1315867)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (1315867)------------------------------
% 0.17/0.50 % (1315867)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50 % (1315867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50 % (1315867)CaDiCaL version: 2.1.3
% 0.17/0.50 % (1315867)Termination reason: Refutation
% 0.17/0.50 % (1315867)Time elapsed: 0.009 s
% 0.17/0.50 % (1315867)Peak memory usage: 11 MB
% 0.17/0.50 % (1315867)Instructions burned: 12 (million)
% 0.17/0.50 % (1315859)Success in time 0.047 s
% 0.17/0.50 % Vampire exiting
%------------------------------------------------------------------------------