%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET194+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 : n010.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:43:24 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 20 |; 10 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_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(f6,conjecture,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subset_of_union) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] : subset(X0,union(X0,X1)),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1] : ~ subset(X0,union(X0,X1)),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[f8]) ).
fof(f13,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,[],[f12]) ).
fof(f14,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))],[f13]) ).
fof(f18,plain,
~ subset(sK2,union(sK2,sK3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f9]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
~ subset(sK2,union(sK2,sK3)),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
member(sK0(sK2,union(sK2,sK3)),sK2),
inference(resolution,[],[f23,f31]) ).
fof(f33,plain,
! [X0] : member(sK0(sK2,union(sK2,sK3)),union(sK2,X0)),
inference(resolution,[],[f32,f21]) ).
fof(f35,plain,
subset(sK2,union(sK2,sK3)),
inference(resolution,[],[f33,f24]) ).
fof(f40,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET194+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.10/0.38 % Computer : n010.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 01:04:02 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.17/0.46 % (1470852)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (1470862)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=156069980:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (1470862) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1470852-1470862"...
% 0.17/0.46 % (1470862)...printing done.
% 0.17/0.46 % (1470862)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (1470862)------------------------------
% 0.17/0.46 % (1470862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (1470862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (1470862)CaDiCaL version: 2.1.3
% 0.17/0.46 % (1470862)Termination reason: Refutation
% 0.17/0.46 % (1470862)Time elapsed: 0.001 s
% 0.17/0.46 % (1470862)Peak memory usage: 11 MB
% 0.17/0.46 % (1470862)Instructions burned: 1 (million)
% 0.17/0.46 % (1470852)Success in time 0.034 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------