%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO207^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 : Wed Sep 30 08:47:11 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 58 ( 23 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 22 ( 10 ~; 8 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 54 ( 30 fml; 24 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 10 ( 6 !; 4 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
sK0: $o ).
tff(func_def_1,type,
sK1: $o ).
tff(pred_def_1,type,
sP2: $o > $o ).
tff(pred_def_2,type,
sP3: $o > $o ).
tff(pred_def_3,type,
sP4: $o > $o ).
tff(f1,conjecture,
! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X1) = (X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT26) ).
tff(f2,negated_conjecture,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X1) = (X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
<=> ( (X0) = (X1) ) ),
inference(fool_elimination,[],[f2]) ).
tff(f4,plain,
? [X0: $o,X1: $o] :
( ( (X0) = (X1) )
<~> ( (X0) = (X1) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f5,plain,
? [X0: $o,X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f6,plain,
( ( ( sK0 != sK1 )
| ( sK0 != sK1 ) )
& ( ( sK0 = sK1 )
| ( sK0 = sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).
tff(f7,plain,
( ( sK0 = sK1 )
| ( sK0 = sK1 ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f8,plain,
( ( sK0 != sK1 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f13,definition,
~ sP3(sK0),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
tff(f14,definition,
~ sP4(sK0),
introduced(definition,[new_symbols(definition,[sP4])],[inequality_splitting_name_introduction]) ).
tff(f15,plain,
( sP3(sK1)
| sP4(sK1) ),
inference(inequality_splitting,[],[f8,f14,f13]) ).
tff(f16,plain,
sK0 = sK1,
inference(duplicate_literal_removal,[],[f7]) ).
tff(f17,plain,
( sP3(sK0)
| sP4(sK1) ),
inference(forward_demodulation,[],[f15,f16]) ).
tff(f18,plain,
sP4(sK1),
inference(forward_subsumption_resolution,[],[f17,f13]) ).
tff(f19,plain,
sP4(sK0),
inference(forward_demodulation,[],[f18,f16]) ).
tff(f20,plain,
$false,
inference(forward_subsumption_resolution,[],[f19,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO207^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n002.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 16:42:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.26 % (1522509)Detected formulas, will run a generic FOF schedule.
% 0.09/0.26 % (1522516)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=1017441642:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_2999 on theBenchmark for (2999ds/261632Mi)
% 0.09/0.26 % (1522516) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1522509-1522516"...
% 0.09/0.26 % (1522516)...printing done.
% 0.09/0.26 % (1522516)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (1522516)------------------------------
% 0.09/0.26 % (1522516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (1522516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (1522516)CaDiCaL version: 2.1.3
% 0.09/0.26 % (1522516)Termination reason: Refutation
% 0.09/0.26 % (1522516)Time elapsed: 0.001 s
% 0.09/0.26 % (1522516)Peak memory usage: 12 MB
% 0.09/0.26 % (1522509)Success in time 0.032 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------