%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET891+1 : 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 : n006.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:44:56 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] : union(unordered_pair(X0,X1)) = set_union2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l52_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1] : union(unordered_pair(singleton(X0),singleton(X1))) = unordered_pair(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] : union(unordered_pair(singleton(X0),singleton(X1))) = unordered_pair(X0,X1),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,axiom,
! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_enumset1) ).
fof(f15,plain,
? [X0,X1] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))),
inference(ennf_transformation,[],[f10]) ).
fof(f21,plain,
! [X0,X1] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f6]) ).
fof(f24,plain,
unordered_pair(sK2,sK3) != union(unordered_pair(singleton(sK2),singleton(sK3))),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f26,plain,
! [X0,X1] : set_union2(X0,X1) = union(set_union2(singleton(X0),singleton(X1))),
inference(definition_unfolding,[],[f21,f25]) ).
fof(f28,plain,
set_union2(singleton(sK2),singleton(sK3)) != union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK3)))),
inference(definition_unfolding,[],[f24,f25,f25]) ).
fof(f38,plain,
set_union2(singleton(sK2),singleton(sK3)) != set_union2(singleton(sK2),singleton(sK3)),
inference(superposition,[],[f28,f26]) ).
fof(f39,plain,
$false,
inference(trivial_inequality_removal,[],[f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET891+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:06:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.41 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.10/0.44 % (3544726)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (3544735)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2200710457:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (3544735) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3544726-3544735"...
% 0.10/0.44 % (3544735)...printing done.
% 0.10/0.44 % (3544735)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (3544735)------------------------------
% 0.10/0.44 % (3544735)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (3544735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (3544735)CaDiCaL version: 2.1.3
% 0.10/0.44 % (3544735)Termination reason: Refutation
% 0.10/0.44 % (3544735)Time elapsed: 0.001 s
% 0.10/0.44 % (3544735)Peak memory usage: 12 MB
% 0.10/0.44 % (3544735)Instructions burned: 1 (million)
% 0.10/0.44 % (3544726)Success in time 0.026 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------