%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU230+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:30 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 27 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 7 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f28,conjecture,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f29,negated_conjecture,
~ ! [X0] : in(X0,succ(X0)),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f52,plain,
? [X0] : ~ in(X0,succ(X0)),
inference(ennf_transformation,[],[f29]) ).
fof(f63,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f64,plain,
! [X2,X0,X1] :
( X0 != X2
| in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| in(X3,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f103,plain,
~ in(sK13,succ(sK13)),
inference(cnf_transformation,[],[f52]) ).
fof(f111,plain,
~ in(sK13,set_union2(sK13,singleton(sK13))),
inference(definition_unfolding,[],[f103,f63]) ).
fof(f113,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f64]) ).
fof(f114,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f113]) ).
fof(f116,plain,
! [X3,X0,X1] :
( in(X3,set_union2(X0,X1))
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f72]) ).
fof(f175,plain,
~ in(sK13,singleton(sK13)),
inference(resolution,[],[f116,f111]) ).
fof(f183,plain,
$false,
inference(forward_subsumption_resolution,[],[f175,f114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU230+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 04:18:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 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 % (10782)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (10791)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=682573879:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (10791) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10782-10791"...
% 0.10/0.45 % (10791)...printing done.
% 0.10/0.45 % (10788)% WARNING: option uhcvi not known.
% 0.10/0.45 % (10791)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 % (10791)------------------------------
% 0.10/0.45 % (10791)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (10791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (10791)CaDiCaL version: 2.1.3
% 0.10/0.45 % (10791)Termination reason: Refutation
% 0.10/0.45 % (10791)Time elapsed: 0.002 s
% 0.10/0.45 % (10791)Peak memory usage: 12 MB
% 0.10/0.45 % (10791)Instructions burned: 4 (million)
% 0.10/0.45 % (10782)Success in time 0.038 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------