%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:52:07 PM UTC 2026
% Result : Theorem 0.08s 0.46s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 44 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 12 |; 1 &)
% ( 4 <=>; 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; 3 con; 0-2 aty)
% Number of variables : 44 ( 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f64,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f73,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f74,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f73]) ).
fof(f115,plain,
? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f74]) ).
fof(f125,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f139,plain,
! [X2,X3,X0,X1] :
( X0 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f213,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f223,plain,
singleton(sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f115]) ).
fof(f224,plain,
sK14 != sK15,
inference(cnf_transformation,[],[f115]) ).
fof(f228,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f125,f213]) ).
fof(f256,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK13,sK13),
inference(definition_unfolding,[],[f223,f213]) ).
fof(f259,plain,
! [X2,X0] :
( ~ in(X2,unordered_pair(X0,X0))
| X0 = X2 ),
inference(equality_resolution,[],[f228]) ).
fof(f265,plain,
! [X2,X3,X1] :
( in(X3,X2)
| unordered_pair(X3,X1) != X2 ),
inference(equality_resolution,[],[f139]) ).
fof(f266,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f265]) ).
fof(f267,plain,
! [X2,X3,X0] :
( in(X3,X2)
| unordered_pair(X0,X3) != X2 ),
inference(equality_resolution,[],[f138]) ).
fof(f268,plain,
! [X3,X0] : in(X3,unordered_pair(X0,X3)),
inference(equality_resolution,[],[f267]) ).
fof(f293,plain,
in(sK14,unordered_pair(sK13,sK13)),
inference(superposition,[],[f266,f256]) ).
fof(f294,plain,
in(sK15,unordered_pair(sK13,sK13)),
inference(superposition,[],[f268,f256]) ).
fof(f431,plain,
sK13 = sK14,
inference(resolution,[],[f259,f293]) ).
fof(f432,plain,
sK13 = sK15,
inference(resolution,[],[f259,f294]) ).
fof(f445,plain,
sK13 != sK14,
inference(superposition,[],[f224,f432]) ).
fof(f446,plain,
$false,
inference(forward_subsumption_resolution,[],[f445,f431]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.38 % Computer : n014.cluster.edu
% 0.08/0.38 % Model : x86_64 x86_64
% 0.08/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.38 % Memory : 8046.5625MB
% 0.08/0.38 % OS : Linux 6.8.0-71-generic
% 0.08/0.38 % CPULimit : 300
% 0.08/0.38 % WCLimit : 300
% 0.08/0.38 % DateTime : Mon Sep 28 03:45:31 UTC 2026
% 0.08/0.39 % CPUTime :
% 0.08/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.41 Running first-order model finding
% 0.08/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.46 % (1414531)Will run a generic schedule for satisfiability detection.
% 0.08/0.46 % (1414540)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2486036762:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.46 % (1414537)% WARNING: option uhcvi not known.
% 0.08/0.46 % (1414540) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1414531-1414540"...
% 0.08/0.46 % (1414540)...printing done.
% 0.08/0.46 % (1414540)Refutation found. Thanks to Tanya!
% 0.08/0.46 % SZS status Theorem for theBenchmark
% 0.08/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.46 % (1414540)------------------------------
% 0.08/0.46 % (1414540)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.46 % (1414540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.46 % (1414540)CaDiCaL version: 2.1.3
% 0.08/0.46 % (1414540)Termination reason: Refutation
% 0.08/0.46 % (1414540)Time elapsed: 0.005 s
% 0.08/0.46 % (1414540)Peak memory usage: 12 MB
% 0.08/0.46 % (1414540)Instructions burned: 13 (million)
% 0.08/0.46 % (1414531)Success in time 0.04 s
% 0.08/0.46 % Vampire exiting
%------------------------------------------------------------------------------