%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:00 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 80 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 85 ( 32 ~; 28 |; 19 &)
% ( 3 <=>; 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 43 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,conjecture,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_extensionality) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
? [X0,X1] :
( X0 != X1
& subset(X0,X1)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f8,plain,
? [X0,X1] :
( X0 != X1
& subset(X0,X1)
& subset(X1,X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f10,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f9]) ).
fof(f11,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,[],[f6]) ).
fof(f12,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,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f12]) ).
fof(f14,plain,
( sK1 != sK2
& subset(sK1,sK2)
& subset(sK2,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( X0 = X1
| subset(X0,X1)
| subset(X1,X0) ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ member(sK0(X0,X1),X0) ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,X1)
| member(X0,X2)
| subset(X2,X1) ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f31,plain,
~ subset(sK1,sK2),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f32,plain,
~ subset(sK2,sK1),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f38,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f27,f28,f29,f30,f24,f31,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 02:13:07 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.45 % (4080178)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (4080183)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=149381112_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % (4080183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4080178-4080183"...
% 0.11/0.45 % (4080183)...printing done.
% 0.11/0.45 % (4080183)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (4080183)------------------------------
% 0.11/0.45 % (4080183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (4080183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (4080183)CaDiCaL version: 2.1.3
% 0.11/0.45 % (4080183)Termination reason: Refutation
% 0.11/0.45 % (4080183)Time elapsed: 0.001 s
% 0.11/0.45 % (4080183)Peak memory usage: 11 MB
% 0.11/0.45 % (4080183)Instructions burned: 1 (million)
% 0.11/0.45 % (4080178)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------