%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU124+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:51:59 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 105 ( 13 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 125 ( 46 ~; 48 |; 26 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 62 ( 55 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f30,conjecture,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f31,negated_conjecture,
~ ! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f50,plain,
? [X0,X1] : ~ subset(X0,set_union2(X0,X1)),
inference(ennf_transformation,[],[f31]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK1(X0,X1,X2),X0)
& ~ in(sK1(X0,X1,X2),X1) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f59]) ).
fof(f61,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f62,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f62]) ).
fof(f73,plain,
~ subset(sK8,set_union2(sK8,sK9)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f50]) ).
fof(f75,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f83,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f60]) ).
fof(f89,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f90,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f119,plain,
~ subset(sK8,set_union2(sK8,sK9)),
inference(cnf_transformation,[],[f73]) ).
fof(f158,plain,
in(sK2(sK8,set_union2(sK8,sK9)),sK8),
inference(resolution,[],[f89,f119]) ).
fof(f205,plain,
! [X0,X1] :
( set_union2(X1,sK8) != X0
| in(sK2(sK8,set_union2(sK8,sK9)),X0) ),
inference(resolution,[],[f83,f158]) ).
fof(f211,plain,
! [X0] : in(sK2(sK8,set_union2(sK8,sK9)),set_union2(X0,sK8)),
inference(equality_resolution,[],[f205]) ).
fof(f221,plain,
! [X0] : in(sK2(sK8,set_union2(sK8,sK9)),set_union2(sK8,X0)),
inference(superposition,[],[f211,f75]) ).
fof(f251,plain,
subset(sK8,set_union2(sK8,sK9)),
inference(resolution,[],[f221,f90]) ).
fof(f264,plain,
$false,
inference(forward_subsumption_resolution,[],[f251,f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU124+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % 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 03:39:28 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.16/0.47 % (4003597)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (4003607)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2023503186:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (4003603)% WARNING: option uhcvi not known.
% 0.16/0.47 % (4003607) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4003597-4003607"...
% 0.16/0.47 % (4003607)...printing done.
% 0.16/0.47 % (4003607)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (4003607)------------------------------
% 0.16/0.47 % (4003607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (4003607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (4003607)CaDiCaL version: 2.1.3
% 0.16/0.47 % (4003607)Termination reason: Refutation
% 0.16/0.47 % (4003607)Time elapsed: 0.004 s
% 0.16/0.47 % (4003607)Peak memory usage: 12 MB
% 0.16/0.47 % (4003607)Instructions burned: 8 (million)
% 0.16/0.47 % (4003597)Success in time 0.04 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------