%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET072+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:39:57 PM UTC 2026
% Result : Theorem 3.73s 1.53s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 67 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 61 ( 20 ~; 18 |; 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 : 29 ( 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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/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(f46,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(f47,plain,
? [X0,X1,X2] :
( X0 != X1
& member(X0,universal_class)
& member(X1,universal_class)
& unordered_pair(X0,X2) = unordered_pair(X1,X2) ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
( sK0 != sK1
& member(sK0,universal_class)
& member(sK1,universal_class)
& unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f47]) ).
fof(f49,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(f50,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,[],[f49]) ).
fof(f53,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2),
inference(cnf_transformation,[],[f48]) ).
fof(f54,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f48]) ).
fof(f55,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f48]) ).
fof(f56,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f48]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f50]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X1 ),
inference(cnf_transformation,[],[f50]) ).
fof(f71,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f63]) ).
fof(f76,plain,
( member(sK1,unordered_pair(sK0,sK2))
| ~ member(sK1,universal_class) ),
inference(superposition,[],[f71,f53]) ).
fof(f77,plain,
member(sK1,unordered_pair(sK0,sK2)),
inference(forward_subsumption_resolution,[],[f76,f54]) ).
fof(f83,plain,
( sK1 = sK2
| sK0 = sK1 ),
inference(resolution,[],[f60,f77]) ).
fof(f85,plain,
sK1 = sK2,
inference(forward_subsumption_resolution,[],[f83,f56]) ).
fof(f87,plain,
unordered_pair(sK0,sK2) = unordered_pair(sK2,sK2),
inference(superposition,[],[f53,f85]) ).
fof(f88,plain,
sK0 != sK2,
inference(superposition,[],[f56,f85]) ).
fof(f98,plain,
( member(sK0,unordered_pair(sK2,sK2))
| ~ member(sK0,universal_class) ),
inference(superposition,[],[f71,f87]) ).
fof(f101,plain,
member(sK0,unordered_pair(sK2,sK2)),
inference(forward_subsumption_resolution,[],[f98,f55]) ).
fof(f109,plain,
( sK0 = sK2
| sK0 = sK2 ),
inference(resolution,[],[f101,f60]) ).
fof(f111,plain,
sK0 = sK2,
inference(duplicate_literal_removal,[],[f109]) ).
fof(f112,plain,
$false,
inference(forward_subsumption_resolution,[],[f111,f88]) ).
%------------------------------------------------------------------------------
%----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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 % Computer : n016.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Mon Sep 28 00:35:03 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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
% 3.73/1.53 % (3150295)Detected formulas, will run a generic FOF schedule.
% 3.73/1.53 % (3150301)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=294899793:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.73/1.53 % (3150305)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1498277046:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.73/1.53 % (3150306)dis-21_1_sil=8000:lcm=predicate:random_seed=1089848991: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)
% 3.73/1.53 % (3150304)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4194882879:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.73/1.53 % (3150300)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=785273628:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.73/1.53 % (3150303)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3704758921:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.73/1.53 % (3150302)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=1812933443:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.73/1.53 % (3150303)Also succeeded, but the first one will report.
% 3.73/1.53 % (3150304)First to succeed.
% 3.73/1.53 % (3150304)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3150295"
% 3.73/1.53 % (3150305)Also succeeded, but the first one will report.
% 3.73/1.53 % (3150306)Instruction limit reached!
% 3.73/1.53 % (3150306)------------------------------
% 3.73/1.53 % (3150306)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.53 % (3150306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.53 % (3150306)CaDiCaL version: 2.1.3
% 3.73/1.53 % (3150306)Termination reason: Instruction limit
% 3.73/1.53 % (3150306)Termination phase: Saturation
% 3.73/1.53 % (3150306)Time elapsed: 0.077 s
% 3.73/1.53 % (3150306)Peak memory usage: 89 MB
% 3.73/1.53 % (3150306)Instructions burned: 130 (million)
% 3.73/1.53 % (3150314)lrs+10_1_sil=8000:sp=occurrence:random_seed=1156583394:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.73/1.53 % (3150304)Refutation found. Thanks to Tanya!
% 3.73/1.53 % SZS status Theorem for theBenchmark
% 3.73/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.53 % (3150304)------------------------------
% 3.73/1.53 % (3150304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.53 % (3150304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.53 % (3150304)CaDiCaL version: 2.1.3
% 3.73/1.53 % (3150304)Termination reason: Refutation
% 3.73/1.53 % (3150304)Time elapsed: 0.003 s
% 3.73/1.53 % (3150304)Peak memory usage: 88 MB
% 3.73/1.53 % (3150304)Instructions burned: 2 (million)
% 3.73/1.53 % (3150304)------------------------------
% 3.73/1.53 % (3150304)------------------------------
% 3.73/1.53 % (3150295)Success in time 0.436 s
% 3.73/1.53 % Vampire exiting
%------------------------------------------------------------------------------