%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO086^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:48:56 AM UTC 2026
% Result : Theorem 0.09s 0.16s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 0 typ; 3 def)
% Number of atoms : 195 ( 49 equ)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 123 ( 51 ~; 20 |; 39 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 98 ( 98 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 6 usr; 8 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
cR: $o ).
tff(func_def_1,type,
cQ: $o ).
tff(func_def_2,type,
cP: $o ).
tff(f1,conjecture,
( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50_11) ).
tff(f2,negated_conjecture,
~ ( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ( ( ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) )
=> ( ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
=> ( cR = $true ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
~ ( ( ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) )
=> ( ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
=> ( cR = $true ) ) ),
inference(flattening,[],[f4]) ).
tff(f6,plain,
( ( cR != $true )
& ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
& ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f7,plain,
( ( cR != $true )
& ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
& ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) ),
inference(flattening,[],[f6]) ).
tff(f8,plain,
cP != $true,
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
( ( cR = $true )
| ( cQ = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
( ( cQ != $true )
| ( cP = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f17,plain,
cR != $true,
inference(cnf_transformation,[],[f7]) ).
tff(f21,definition,
( spl0_1
<=> ( cR = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
tff(f25,definition,
( spl0_2
<=> ( cQ = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
tff(f29,plain,
( spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f11,f21,f25]) ).
tff(f31,definition,
( spl0_3
<=> ( cP = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
tff(f35,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f15,f25,f31]) ).
tff(f36,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f17,f21]) ).
tff(f37,plain,
~ spl0_3,
inference(avatar_split_clause,[],[f8,f31]) ).
cnf(s2,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f29]) ).
cnf(s4,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f35]) ).
cnf(s5,plain,
~ spl0_1,
inference(sat_conversion,[],[f36]) ).
cnf(s6,plain,
~ spl0_3,
inference(sat_conversion,[],[f37]) ).
cnf(s7,plain,
~ spl0_2,
inference(rat,[],[s4,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s2,s7,s5]) ).
tff(f38,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYO086^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 16:33:04 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.13 Running first-order model finding
% 0.09/0.13 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.09/0.16 % (325014)Will run a generic schedule for satisfiability detection.
% 0.09/0.16 % (325020)% WARNING: option uhcvi not known.
% 0.09/0.16 % (325022)dis+10_1_sil=32000:sp=arity:random_seed=580406047:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.16 % (325019)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3263225173_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.16 % (325020)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1384059153:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.16 % Detected minimum model sizes of [1]
% 0.09/0.16 % Detected maximum model sizes of [5]
% 0.09/0.16 % TRYING [1]
% 0.09/0.16 % (325020) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-325014-325020"...
% 0.09/0.16 % (325022) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-325014-325022"...
% 0.09/0.16 % TRYING [2]
% 0.09/0.16 % TRYING [3]
% 0.09/0.16 % TRYING [4]
% 0.09/0.16 % TRYING [5]
% 0.09/0.16 % (325019) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-325014-325019"...
% 0.09/0.16 % (325020)...printing done.
% 0.09/0.16 % (325022)...printing done.
% 0.09/0.16 % (325019)...printing done.
% 0.09/0.16 % (325022)Refutation found. Thanks to Tanya!
% 0.09/0.16 % SZS status Theorem for theBenchmark
% 0.09/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.16 % (325022)------------------------------
% 0.09/0.16 % (325022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.16 % (325022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.16 % (325022)CaDiCaL version: 2.1.3
% 0.09/0.16 % (325022)Termination reason: Refutation
% 0.09/0.16 % (325022)Time elapsed: 0.001 s
% 0.09/0.16 % (325022)Peak memory usage: 12 MB
% 0.09/0.16 % (325022)Instructions burned: 1 (million)
% 0.09/0.16 % (325014)Success in time 0.029 s
% 0.09/0.16 % Vampire exiting
%------------------------------------------------------------------------------