%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU134+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 : n019.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:02 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 4 unt; 2 def)
% Number of atoms : 73 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 30 |; 3 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f37,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f38,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f68,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f98,plain,
! [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f103,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f104,plain,
( ( ~ subset(sK8,sK9)
| empty_set != set_difference(sK8,sK9) )
& ( subset(sK8,sK9)
| empty_set = set_difference(sK8,sK9) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f103]) ).
fof(f143,plain,
! [X0,X1] :
( empty_set != set_difference(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f144,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f162,plain,
( subset(sK8,sK9)
| empty_set = set_difference(sK8,sK9) ),
inference(cnf_transformation,[],[f104]) ).
fof(f163,plain,
( ~ subset(sK8,sK9)
| empty_set != set_difference(sK8,sK9) ),
inference(cnf_transformation,[],[f104]) ).
fof(f190,definition,
( spl12_1
<=> empty_set = set_difference(sK8,sK9) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f191,plain,
( empty_set != set_difference(sK8,sK9)
| spl12_1 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f192,plain,
( empty_set = set_difference(sK8,sK9)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f194,definition,
( spl12_2
<=> subset(sK8,sK9) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f195,plain,
( ~ subset(sK8,sK9)
| spl12_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f196,plain,
( subset(sK8,sK9)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f197,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f162,f194,f190]) ).
fof(f198,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f163,f194,f190]) ).
fof(f263,plain,
( empty_set = set_difference(sK8,sK9)
| ~ spl12_2 ),
inference(resolution,[],[f144,f196]) ).
fof(f264,plain,
( $false
| spl12_1
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f263,f191]) ).
fof(f265,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_contradiction_clause,[],[f264]) ).
fof(f266,plain,
( empty_set != empty_set
| subset(sK8,sK9)
| ~ spl12_1 ),
inference(superposition,[],[f143,f192]) ).
fof(f268,plain,
( subset(sK8,sK9)
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f266]) ).
fof(f269,plain,
( $false
| ~ spl12_1
| spl12_2 ),
inference(forward_subsumption_resolution,[],[f268,f195]) ).
fof(f270,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_contradiction_clause,[],[f269]) ).
cnf(s1,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f197]) ).
cnf(s2,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(sat_conversion,[],[f198]) ).
cnf(s3,plain,
( spl12_1
| ~ spl12_2 ),
inference(sat_conversion,[],[f265]) ).
cnf(s4,plain,
( ~ spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f270]) ).
cnf(s5,plain,
spl12_1,
inference(rat,[],[s1,s3]) ).
cnf(s6,plain,
spl12_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6,s5]) ).
fof(f271,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU134+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n019.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 03:40:49 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.18/0.47 % (3639088)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3639097)dis+10_1_sil=32000:sp=arity:random_seed=4294538916:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (3639097) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3639088-3639097"...
% 0.18/0.47 % (3639095)% WARNING: option uhcvi not known.
% 0.18/0.47 % (3639097)...printing done.
% 0.18/0.47 % (3639097)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (3639097)------------------------------
% 0.18/0.48 % (3639097)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (3639097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (3639097)CaDiCaL version: 2.1.3
% 0.18/0.48 % (3639097)Termination reason: Refutation
% 0.18/0.48 % (3639097)Time elapsed: 0.003 s
% 0.18/0.48 % (3639097)Peak memory usage: 12 MB
% 0.18/0.48 % (3639097)Instructions burned: 6 (million)
% 0.18/0.48 % (3639088)Success in time 0.033 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------