%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET076+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 : 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:39:58 PM UTC 2026
% Result : Theorem 3.54s 1.39s
% Output : Refutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 11 unt; 2 def)
% Number of atoms : 99 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 99 ( 38 ~; 32 |; 21 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_defn) ).
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,X2)
& member(X1,X2) )
=> subclass(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_is_subset) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X2)
& member(X1,X2) )
=> subclass(unordered_pair(X0,X1),X2) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f47,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f60,plain,
? [X0,X1,X2] :
( ~ subclass(unordered_pair(X0,X1),X2)
& member(X0,X2)
& member(X1,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2] :
( ~ subclass(unordered_pair(X0,X1),X2)
& member(X0,X2)
& member(X1,X2) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f63]) ).
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,
( ~ subclass(unordered_pair(sK6,sK7),sK8)
& member(sK6,sK8)
& member(sK7,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f61]) ).
fof(f106,plain,
! [X0,X1] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f107,plain,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f192,plain,
member(sK7,sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
member(sK6,sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
~ subclass(unordered_pair(sK6,sK7),sK8),
inference(cnf_transformation,[],[f104]) ).
fof(f206,plain,
member(sK0(unordered_pair(sK6,sK7),sK8),unordered_pair(sK6,sK7)),
inference(resolution,[],[f106,f194]) ).
fof(f207,plain,
~ member(sK0(unordered_pair(sK6,sK7),sK8),sK8),
inference(resolution,[],[f107,f194]) ).
fof(f377,plain,
( sK7 = sK0(unordered_pair(sK6,sK7),sK8)
| sK6 = sK0(unordered_pair(sK6,sK7),sK8) ),
inference(resolution,[],[f112,f206]) ).
fof(f386,definition,
( spl9_17
<=> sK6 = sK0(unordered_pair(sK6,sK7),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_17])],[avatar_definition]) ).
fof(f388,plain,
( sK6 = sK0(unordered_pair(sK6,sK7),sK8)
| ~ spl9_17 ),
inference(avatar_component_clause,[],[f386]) ).
fof(f390,definition,
( spl9_18
<=> sK7 = sK0(unordered_pair(sK6,sK7),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_18])],[avatar_definition]) ).
fof(f392,plain,
( sK7 = sK0(unordered_pair(sK6,sK7),sK8)
| ~ spl9_18 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f393,plain,
( spl9_17
| spl9_18 ),
inference(avatar_split_clause,[],[f377,f390,f386]) ).
fof(f395,plain,
( ~ member(sK6,sK8)
| ~ spl9_17 ),
inference(superposition,[],[f207,f388]) ).
fof(f404,plain,
( $false
| ~ spl9_17 ),
inference(forward_subsumption_resolution,[],[f395,f193]) ).
fof(f405,plain,
~ spl9_17,
inference(avatar_contradiction_clause,[],[f404]) ).
fof(f417,plain,
( ~ member(sK7,sK8)
| ~ spl9_18 ),
inference(superposition,[],[f207,f392]) ).
fof(f427,plain,
( $false
| ~ spl9_18 ),
inference(forward_subsumption_resolution,[],[f417,f192]) ).
fof(f428,plain,
~ spl9_18,
inference(avatar_contradiction_clause,[],[f427]) ).
cnf(s11,plain,
( spl9_17
| spl9_18 ),
inference(sat_conversion,[],[f393]) ).
cnf(s12,plain,
~ spl9_17,
inference(sat_conversion,[],[f405]) ).
cnf(s13,plain,
~ spl9_18,
inference(sat_conversion,[],[f428]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s11,s13,s12]) ).
fof(f429,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET076+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n019.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 00:32:19 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/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
% 3.54/1.39 % (3552607)Detected formulas, will run a generic FOF schedule.
% 3.54/1.39 % (3552612)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=3450628029:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.54/1.39 % (3552616)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3212859819:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.54/1.39 % (3552613)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=254963434:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.54/1.39 % (3552615)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=133873675:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.54/1.39 % (3552618)dis-21_1_sil=8000:lcm=predicate:random_seed=517487595: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.54/1.39 % (3552614)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=4047969408:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.54/1.39 % (3552615)Refutation not found, incomplete strategy
% 3.54/1.39 % (3552615)------------------------------
% 3.54/1.39 % (3552615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39 % (3552615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39 % (3552615)CaDiCaL version: 2.1.3
% 3.54/1.39 % (3552615)Termination reason: Refutation not found, incomplete strategy
% 3.54/1.39 % (3552615)Time elapsed: 0.002 s
% 3.54/1.39 % (3552615)Peak memory usage: 88 MB
% 3.54/1.39 % (3552615)Instructions burned: 1 (million)
% 3.54/1.39 % (3552617)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3781899282:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.54/1.39 % (3552617)First to succeed.
% 3.54/1.39 % (3552617)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3552607"
% 3.54/1.39 % (3552616)Instruction limit reached!
% 3.54/1.39 % (3552616)------------------------------
% 3.54/1.39 % (3552616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39 % (3552616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39 % (3552616)CaDiCaL version: 2.1.3
% 3.54/1.39 % (3552616)Termination reason: Instruction limit
% 3.54/1.39 % (3552616)Termination phase: Saturation
% 3.54/1.39 % (3552616)Time elapsed: 0.051 s
% 3.54/1.39 % (3552616)Peak memory usage: 87 MB
% 3.54/1.39 % (3552616)Instructions burned: 121 (million)
% 3.54/1.39 % (3552618)Instruction limit reached!
% 3.54/1.39 % (3552618)------------------------------
% 3.54/1.39 % (3552618)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39 % (3552618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39 % (3552618)CaDiCaL version: 2.1.3
% 3.54/1.39 % (3552618)Termination reason: Instruction limit
% 3.54/1.39 % (3552618)Termination phase: Saturation
% 3.54/1.39 % (3552618)Time elapsed: 0.078 s
% 3.54/1.39 % (3552618)Peak memory usage: 89 MB
% 3.54/1.39 % (3552618)Instructions burned: 130 (million)
% 3.54/1.39 % (3552626)lrs+10_1_sil=8000:sp=occurrence:random_seed=3594088890:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.54/1.39 % (3552627)lrs+10_1_sil=32000:urr=on:br=off:random_seed=725442444:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.54/1.39 % (3552615)------------------------------
% 3.54/1.39 % (3552615)------------------------------
% 3.54/1.39 % (3552626)Also succeeded, but the first one will report.
% 3.54/1.39 % (3552617)Refutation found. Thanks to Tanya!
% 3.54/1.39 % SZS status Theorem for theBenchmark
% 3.54/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 3.54/1.39 % (3552617)------------------------------
% 3.54/1.39 % (3552617)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.39 % (3552617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.39 % (3552617)CaDiCaL version: 2.1.3
% 3.54/1.39 % (3552617)Termination reason: Refutation
% 3.54/1.39 % (3552617)Time elapsed: 0.011 s
% 3.54/1.39 % (3552617)Peak memory usage: 90 MB
% 3.54/1.39 % (3552617)Instructions burned: 13 (million)
% 3.54/1.39 % (3552617)------------------------------
% 3.54/1.39 % (3552617)------------------------------
% 3.54/1.39 % (3552607)Success in time 0.433 s
% 3.54/1.39 % Vampire exiting
%------------------------------------------------------------------------------