%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU148+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 : n013.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:06 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 35 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 13 ~; 9 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 27 !; 2 ?)
% 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(f31,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f64,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f66,conjecture,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f67,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f107,plain,
? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f121,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f168,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f209,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f211,plain,
subset(singleton(sK13),singleton(sK14)),
inference(cnf_transformation,[],[f107]) ).
fof(f212,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f107]) ).
fof(f222,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f121,f209]) ).
fof(f234,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f168,f209]) ).
fof(f248,plain,
subset(unordered_pair(sK13,sK13),unordered_pair(sK14,sK14)),
inference(definition_unfolding,[],[f211,f209,f209]) ).
fof(f251,plain,
! [X2,X0] :
( X0 = X2
| ~ in(X2,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f222]) ).
fof(f277,plain,
! [X2,X0] :
( in(X2,unordered_pair(X0,X0))
| X0 = X2 ),
inference(consistent_polarity_flipping,[],[f251]) ).
fof(f317,plain,
! [X0,X1] :
( ~ subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(consistent_polarity_flipping,[],[f234]) ).
fof(f432,plain,
~ in(sK13,unordered_pair(sK14,sK14)),
inference(resolution,[],[f317,f248]) ).
fof(f455,plain,
sK13 = sK14,
inference(resolution,[],[f432,f277]) ).
fof(f457,plain,
$false,
inference(forward_subsumption_resolution,[],[f455,f212]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU148+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.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:44:36 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.45 % (781432)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (781438)% WARNING: option uhcvi not known.
% 0.10/0.45 % (781438)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=727389492:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (781438) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-781432-781438"...
% 0.10/0.45 % (781438)...printing done.
% 0.10/0.45 % (781437)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3353033230_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (781438)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (781438)------------------------------
% 0.10/0.45 % (781438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (781438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (781438)CaDiCaL version: 2.1.3
% 0.10/0.45 % (781438)Termination reason: Refutation
% 0.10/0.45 % (781438)Time elapsed: 0.005 s
% 0.10/0.45 % (781438)Peak memory usage: 12 MB
% 0.10/0.45 % (781438)Instructions burned: 9 (million)
% 0.10/0.45 % (781432)Success in time 0.039 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------