%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU151+1 : 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 : n003.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.11s 0.43s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 113 ( 83 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 131 ( 52 ~; 49 |; 28 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 62 ( 55 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,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(f5,conjecture,
! [X0,X1,X2,X3] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f8,plain,
? [X0,X1,X2,X3] :
( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X1 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X1
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f11]) ).
fof(f13,plain,
( unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4)
& sK1 != sK3
& sK1 != sK4 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4)],[f8]) ).
fof(f16,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
sK1 != sK4,
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
sK1 != sK3,
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f18]) ).
fof(f26,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f25]) ).
fof(f27,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f17]) ).
fof(f28,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f27]) ).
fof(f29,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f16]) ).
fof(f36,plain,
in(sK3,unordered_pair(sK1,sK2)),
inference(superposition,[],[f26,f24]) ).
fof(f40,plain,
in(sK4,unordered_pair(sK1,sK2)),
inference(superposition,[],[f28,f24]) ).
fof(f59,plain,
( sK2 = sK3
| sK1 = sK3 ),
inference(resolution,[],[f29,f36]) ).
fof(f60,plain,
( sK2 = sK4
| sK1 = sK4 ),
inference(resolution,[],[f29,f40]) ).
fof(f64,plain,
sK2 = sK4,
inference(forward_subsumption_resolution,[],[f60,f22]) ).
fof(f65,plain,
sK2 = sK3,
inference(forward_subsumption_resolution,[],[f59,f23]) ).
fof(f81,plain,
sK3 = sK4,
inference(superposition,[],[f65,f64]) ).
fof(f88,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK3,sK3),
inference(superposition,[],[f24,f81]) ).
fof(f93,plain,
unordered_pair(sK1,sK4) = unordered_pair(sK3,sK3),
inference(forward_demodulation,[],[f88,f64]) ).
fof(f94,plain,
unordered_pair(sK1,sK3) = unordered_pair(sK3,sK3),
inference(forward_demodulation,[],[f93,f81]) ).
fof(f99,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK1,sK3))
| sK3 = X0
| sK3 = X0 ),
inference(superposition,[],[f29,f94]) ).
fof(f102,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK1,sK3))
| sK3 = X0 ),
inference(duplicate_literal_removal,[],[f99]) ).
fof(f109,plain,
sK1 = sK3,
inference(resolution,[],[f102,f26]) ).
fof(f111,plain,
$false,
inference(forward_subsumption_resolution,[],[f109,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU151+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 03:47:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 Running first-order model finding
% 0.11/0.39 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.11/0.43 % (1164768)Will run a generic schedule for satisfiability detection.
% 0.11/0.43 % (1164775)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3739158041:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.43 % (1164775) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1164768-1164775"...
% 0.11/0.43 % (1164774)% WARNING: option uhcvi not known.
% 0.11/0.43 % (1164775)...printing done.
% 0.11/0.43 % (1164775)Refutation found. Thanks to Tanya!
% 0.11/0.43 % SZS status Theorem for theBenchmark
% 0.11/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (1164775)------------------------------
% 0.11/0.44 % (1164775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (1164775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (1164775)CaDiCaL version: 2.1.3
% 0.11/0.44 % (1164775)Termination reason: Refutation
% 0.11/0.44 % (1164775)Time elapsed: 0.002 s
% 0.11/0.44 % (1164775)Peak memory usage: 12 MB
% 0.11/0.44 % (1164775)Instructions burned: 4 (million)
% 0.11/0.44 % (1164768)Success in time 0.032 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------