%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU150+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 : n002.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.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 6 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
singleton(sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0] :
( singleton(X0) != singleton(sK2)
| sK3 = X0 ),
inference(superposition,[],[f12,f13]) ).
fof(f17,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X1) != singleton(X2)
| X1 = X2 ),
inference(superposition,[],[f12,f9]) ).
fof(f18,plain,
sK2 = sK3,
inference(equality_resolution,[],[f15]) ).
fof(f19,plain,
! [X0] :
( singleton(X0) != singleton(sK2)
| sK4 = X0 ),
inference(superposition,[],[f17,f13]) ).
fof(f22,plain,
! [X0] :
( singleton(X0) != singleton(sK3)
| sK4 = X0 ),
inference(forward_demodulation,[],[f19,f18]) ).
fof(f24,plain,
sK3 = sK4,
inference(equality_resolution,[],[f22]) ).
fof(f25,plain,
$false,
inference(forward_subsumption_resolution,[],[f24,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU150+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.11/0.39 % Computer : n002.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:48:52 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.19/0.46 % (4129493)Will run a generic schedule for satisfiability detection.
% 0.19/0.46 % (4129502)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=920908503:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.46 % (4129502) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4129493-4129502"...
% 0.19/0.46 % (4129502)...printing done.
% 0.19/0.46 % (4129502)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (4129502)------------------------------
% 0.19/0.46 % (4129502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46 % (4129502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46 % (4129502)CaDiCaL version: 2.1.3
% 0.19/0.46 % (4129502)Termination reason: Refutation
% 0.19/0.46 % (4129502)Time elapsed: 0.001 s
% 0.19/0.46 % (4129502)Peak memory usage: 12 MB
% 0.19/0.46 % (4129502)Instructions burned: 1 (million)
% 0.19/0.46 % (4129493)Success in time 0.03 s
% 0.19/0.46 % Vampire exiting
%------------------------------------------------------------------------------