%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU159+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:10 PM UTC 2026
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 7 unt; 5 def)
% Number of atoms : 157 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 149 ( 58 ~; 75 |; 3 &)
% ( 11 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 49 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f13,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X0,X2)
& in(X1,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f19,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| X0 = X3
| ~ in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f20,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( X0 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
( ~ in(sK5,sK6)
| ~ in(sK4,sK6)
| ~ subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
( in(sK5,sK6)
| subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
( in(sK4,sK6)
| subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f13]) ).
fof(f31,plain,
! [X2,X3,X1] :
( in(X3,X2)
| unordered_pair(X3,X1) != X2 ),
inference(equality_resolution,[],[f21]) ).
fof(f32,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f31]) ).
fof(f33,plain,
! [X2,X3,X0] :
( in(X3,X2)
| unordered_pair(X0,X3) != X2 ),
inference(equality_resolution,[],[f20]) ).
fof(f34,plain,
! [X3,X0] : in(X3,unordered_pair(X0,X3)),
inference(equality_resolution,[],[f33]) ).
fof(f35,plain,
! [X3,X0,X1] :
( ~ in(X3,unordered_pair(X0,X1))
| X0 = X3
| X1 = X3 ),
inference(equality_resolution,[],[f19]) ).
fof(f37,definition,
( spl7_1
<=> subset(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f38,plain,
( subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f39,plain,
( ~ subset(unordered_pair(sK4,sK5),sK6)
| spl7_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f41,definition,
( spl7_2
<=> in(sK4,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f42,plain,
( in(sK4,sK6)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f43,plain,
( ~ in(sK4,sK6)
| spl7_2 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f45,definition,
( spl7_3
<=> in(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f46,plain,
( in(sK5,sK6)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f47,plain,
( ~ in(sK5,sK6)
| spl7_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f48,plain,
( ~ spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f28,f45,f41,f37]) ).
fof(f49,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f29,f45,f37]) ).
fof(f50,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f30,f41,f37]) ).
fof(f59,plain,
( in(sK1(unordered_pair(sK4,sK5),sK6),unordered_pair(sK4,sK5))
| spl7_1 ),
inference(resolution,[],[f23,f39]) ).
fof(f68,plain,
( sK4 = sK1(unordered_pair(sK4,sK5),sK6)
| sK5 = sK1(unordered_pair(sK4,sK5),sK6)
| spl7_1 ),
inference(resolution,[],[f35,f59]) ).
fof(f72,definition,
( spl7_4
<=> sK5 = sK1(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f74,plain,
( sK5 = sK1(unordered_pair(sK4,sK5),sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f76,definition,
( spl7_5
<=> sK4 = sK1(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f78,plain,
( sK4 = sK1(unordered_pair(sK4,sK5),sK6)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,plain,
( spl7_4
| spl7_5
| spl7_1 ),
inference(avatar_split_clause,[],[f68,f37,f76,f72]) ).
fof(f80,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK4,sK5))
| in(X0,sK6) )
| ~ spl7_1 ),
inference(resolution,[],[f38,f22]) ).
fof(f81,plain,
( in(sK4,sK6)
| ~ spl7_1 ),
inference(resolution,[],[f80,f32]) ).
fof(f82,plain,
( in(sK5,sK6)
| ~ spl7_1 ),
inference(resolution,[],[f80,f34]) ).
fof(f83,plain,
( $false
| ~ spl7_1
| spl7_3 ),
inference(forward_subsumption_resolution,[],[f82,f47]) ).
fof(f84,plain,
( ~ spl7_1
| spl7_3 ),
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f85,plain,
( $false
| ~ spl7_1
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f81,f43]) ).
fof(f86,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f91,plain,
( ~ in(sK1(unordered_pair(sK4,sK5),sK6),sK6)
| spl7_1 ),
inference(resolution,[],[f39,f24]) ).
fof(f94,plain,
( ~ in(sK5,sK6)
| spl7_1
| ~ spl7_4 ),
inference(forward_demodulation,[],[f91,f74]) ).
fof(f95,plain,
( $false
| spl7_1
| ~ spl7_3
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f94,f46]) ).
fof(f96,plain,
( spl7_1
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f95]) ).
fof(f98,plain,
( ~ in(sK4,sK6)
| spl7_1
| ~ spl7_5 ),
inference(forward_demodulation,[],[f91,f78]) ).
fof(f99,plain,
( $false
| spl7_1
| ~ spl7_2
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f98,f42]) ).
fof(f100,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f99]) ).
cnf(s1,plain,
( ~ spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f48]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f49]) ).
cnf(s3,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f50]) ).
cnf(s4,plain,
( spl7_1
| spl7_4
| spl7_5 ),
inference(sat_conversion,[],[f79]) ).
cnf(s5,plain,
( ~ spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f84]) ).
cnf(s6,plain,
( ~ spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f86]) ).
cnf(s7,plain,
( spl7_1
| ~ spl7_3
| ~ spl7_4 ),
inference(sat_conversion,[],[f96]) ).
cnf(s8,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_5 ),
inference(sat_conversion,[],[f100]) ).
cnf(s9,plain,
spl7_1,
inference(rat,[],[s4,s7,s8,s2,s3]) ).
cnf(s10,plain,
spl7_2,
inference(rat,[],[s6,s9]) ).
cnf(s11,plain,
spl7_3,
inference(rat,[],[s5,s9]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s11,s10,s9]) ).
fof(f101,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n004.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 03:48:22 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/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.49 % (4130783)Will run a generic schedule for satisfiability detection.
% 0.18/0.49 % (4130788)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=291795934_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.49 % TRYING [1]
% 0.18/0.49 % TRYING [2]
% 0.18/0.49 % TRYING [3]
% 0.18/0.49 % TRYING [4]
% 0.18/0.49 % (4130789)% WARNING: option uhcvi not known.
% 0.18/0.49 % TRYING [5]
% 0.18/0.49 % (4130789)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=121837263:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.49 % (4130790)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=449703529:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.49 % TRYING [6]
% 0.18/0.49 % (4130791)dis+10_1_sil=32000:sp=arity:random_seed=3306389041:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.49 % (4130792)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1197883100:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49 % (4130793)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3593558544:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.49 % (4130794)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3202064992:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49 % (4130792) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4130783-4130792"...
% 0.18/0.49 % (4130789) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4130783-4130789"...
% 0.18/0.49 % (4130792)...printing done.
% 0.18/0.49 % (4130791) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4130783-4130791"...
% 0.18/0.49 % (4130789)...printing done.
% 0.18/0.49 % (4130792)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (4130792)------------------------------
% 0.18/0.49 % (4130792)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (4130792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (4130792)CaDiCaL version: 2.1.3
% 0.18/0.49 % (4130792)Termination reason: Refutation
% 0.18/0.49 % (4130792)Time elapsed: 0.004 s
% 0.18/0.49 % (4130792)Peak memory usage: 12 MB
% 0.18/0.49 % (4130792)Instructions burned: 4 (million)
% 0.18/0.49 % (4130783)Success in time 0.046 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------