%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO207_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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 02:30:25 PM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 205 ( 75 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 102 ( 40 ~; 44 |; 10 &)
% ( 7 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 150 ( 114 fml; 36 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 12 ( 0 sgn 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
sK0: $o ).
tff(func_def_3,type,
sK1: $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) )
= ( (X1) = (X0) ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ! [X0: $o,X1: $o] :
( ( ( $true = (X0) )
<=> ( $true = (X1) ) )
<=> ( ( $true = (X1) )
<=> ( $true = (X0) ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
? [X0: $o,X1: $o] :
( ( ( $true = (X0) )
<=> ( $true = (X1) ) )
<~> ( ( $true = (X1) )
<=> ( $true = (X0) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
? [X0: $o,X1: $o] :
( ( ( ( ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( $true = (X0) )
| ( $true = (X1) ) ) )
| ( ( ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( $true = (X1) )
| ( $true = (X0) ) ) ) )
& ( ( ( ( $true = (X1) )
| ( $true != (X0) ) )
& ( ( $true = (X0) )
| ( $true != (X1) ) ) )
| ( ( ( $true = (X0) )
| ( $true != (X1) ) )
& ( ( $true = (X1) )
| ( $true != (X0) ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f7,plain,
( ( ( ( ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( $true = sK0 )
| ( $true = sK1 ) ) )
| ( ( ( $true != sK1 )
| ( $true != sK0 ) )
& ( ( $true = sK1 )
| ( $true = sK0 ) ) ) )
& ( ( ( ( $true = sK1 )
| ( $true != sK0 ) )
& ( ( $true = sK0 )
| ( $true != sK1 ) ) )
| ( ( ( $true = sK0 )
| ( $true != sK1 ) )
& ( ( $true = sK1 )
| ( $true != sK0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
tff(f9,plain,
( ( $true = sK0 )
| ( $true != sK1 )
| ( $true = sK0 )
| ( $true != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f10,plain,
( ( $true = sK1 )
| ( $true != sK0 )
| ( $true = sK1 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
( ( $true = sK0 )
| ( $true = sK1 )
| ( $true = sK1 )
| ( $true = sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
( ( $true != sK0 )
| ( $true != sK1 )
| ( $true != sK1 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f18,plain,
( ( $true = sK0 )
| ( $true != sK1 ) ),
inference(duplicate_literal_removal,[],[f9]) ).
tff(f19,plain,
( ( $true = sK1 )
| ( $true != sK0 ) ),
inference(duplicate_literal_removal,[],[f10]) ).
tff(f20,plain,
( ( $true = sK0 )
| ( $true = sK1 ) ),
inference(duplicate_literal_removal,[],[f12]) ).
tff(f21,plain,
( ( $true != sK0 )
| ( $true != sK1 ) ),
inference(duplicate_literal_removal,[],[f15]) ).
tff(f23,definition,
( spl2_1
<=> ( $true = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
tff(f27,definition,
( spl2_2
<=> ( $true = sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
tff(f30,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f18,f27,f23]) ).
tff(f31,plain,
( ~ spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f19,f23,f27]) ).
tff(f32,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f20,f27,f23]) ).
tff(f33,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f21,f27,f23]) ).
cnf(s1,plain,
( ~ spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s2,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f31]) ).
cnf(s3,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f32]) ).
cnf(s4,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f33]) ).
cnf(s5,plain,
spl2_1,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
~ spl2_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5]) ).
tff(f34,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO207_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n007.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 17:30:10 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.24 % (2593808)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (2593818)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1058026747:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.24 % (2593818) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2593808-2593818"...
% 0.08/0.24 % (2593818)...printing done.
% 0.08/0.24 % (2593818)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (2593818)------------------------------
% 0.08/0.24 % (2593818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (2593818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (2593818)CaDiCaL version: 2.1.3
% 0.08/0.24 % (2593818)Termination reason: Refutation
% 0.08/0.24 % (2593818)Time elapsed: 0.001 s
% 0.08/0.24 % (2593818)Peak memory usage: 12 MB
% 0.08/0.24 % (2593818)Instructions burned: 1 (million)
% 0.08/0.24 % (2593808)Success in time 0.028 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------