%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW469_1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 01:40:04 PM UTC 2026
% Result : Theorem 0.26s 0.36s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 13 ~; 3 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 10 !; 7 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
state: $tType ).
tff(func_def_0,type,
sK0: state ).
tff(func_def_1,type,
sK1: state ).
tff(func_def_2,type,
sK2: state ).
tff(f1,axiom,
( hoare_1310879719gleton
<=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
tff(f5,axiom,
hoare_1310879719gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f6,conjecture,
! [X0: state] :
~ ! [X1: state] : ( X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f7,negated_conjecture,
~ ! [X0: state] :
~ ! [X1: state] : ( X1 = X0 ),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
( hoare_1310879719gleton
=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
tff(f12,plain,
( ? [X0: state,X1: state] : ( X0 != X1 )
| ~ hoare_1310879719gleton ),
inference(ennf_transformation,[],[f8]) ).
tff(f13,plain,
? [X0: state] :
! [X1: state] : ( X1 = X0 ),
inference(ennf_transformation,[],[f7]) ).
tff(f14,plain,
( ( sK0 != sK1 )
| ~ hoare_1310879719gleton ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
tff(f15,plain,
! [X1: state] : ( sK2 = X1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f13]) ).
tff(f16,plain,
( ( sK0 != sK1 )
| ~ hoare_1310879719gleton ),
inference(cnf_transformation,[],[f14]) ).
tff(f17,plain,
hoare_1310879719gleton,
inference(cnf_transformation,[],[f5]) ).
tff(f18,plain,
! [X1: state] : ( sK2 = X1 ),
inference(cnf_transformation,[],[f15]) ).
tff(f19,plain,
sK0 != sK1,
inference(forward_subsumption_resolution,[],[f16,f17]) ).
tff(f20,plain,
! [X0: state,X1: state] : ( X0 = X1 ),
inference(superposition,[],[f18,f18]) ).
tff(f24,plain,
! [X0: state] : ( sK0 != X0 ),
inference(superposition,[],[f19,f20]) ).
tff(f25,plain,
$false,
inference(forward_subsumption_resolution,[],[f24,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW469_1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.27 % Computer : n003.cluster.edu
% 0.11/0.27 % Model : x86_64 x86_64
% 0.11/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.27 % Memory : 8046.5625MB
% 0.11/0.27 % OS : Linux 6.8.0-71-generic
% 0.11/0.27 % CPULimit : 300
% 0.11/0.27 % WCLimit : 300
% 0.11/0.27 % DateTime : Mon Sep 28 14:02:27 UTC 2026
% 0.26/0.27 % CPUTime :
% 0.26/0.27 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.32 Running first-order model finding
% 0.26/0.32 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.26/0.36 % (1592190)Will run a generic schedule for satisfiability detection.
% 0.26/0.36 % (1592200)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3732157346:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.26/0.36 % (1592200) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1592190-1592200"...
% 0.26/0.36 % (1592200)...printing done.
% 0.26/0.36 % (1592200)Refutation found. Thanks to Tanya!
% 0.26/0.36 % SZS status Theorem for theBenchmark
% 0.26/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.36 % (1592200)------------------------------
% 0.26/0.36 % (1592200)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.36 % (1592200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.36 % (1592200)CaDiCaL version: 2.1.3
% 0.26/0.36 % (1592200)Termination reason: Refutation
% 0.26/0.36 % (1592200)Time elapsed: 0.001 s
% 0.26/0.36 % (1592200)Peak memory usage: 11 MB
% 0.26/0.36 % (1592190)Success in time 0.024 s
% 0.26/0.36 % Vampire exiting
%------------------------------------------------------------------------------