%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO087^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 : n026.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:46:35 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 13 unt; 0 typ; 4 def)
% Number of atoms : 219 ( 52 equ)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 124 ( 53 ~; 22 |; 39 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 120 ( 120 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 14 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 2 ( 0 !; 2 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
cR: $o ).
tff(func_def_1,type,
cQ: $o ).
tff(func_def_2,type,
cP: $o ).
tff(pred_def_1,type,
sP0: $o > $o ).
tff(pred_def_2,type,
sP1: $o > $o ).
tff(pred_def_3,type,
sP2: $o > $o ).
tff(pred_def_4,type,
sP3: $o > $o ).
tff(pred_def_5,type,
sP4: $o > $o ).
tff(pred_def_6,type,
sP5: $o > $o ).
tff(pred_def_7,type,
sP6: $o > $o ).
tff(pred_def_8,type,
sP7: $o > $o ).
tff(pred_def_9,type,
sP8: $o > $o ).
tff(pred_def_10,type,
sP9: $o > $o ).
tff(pred_def_11,type,
sP10: $o > $o ).
tff(f1,conjecture,
? [X0: $i] :
( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50_13) ).
tff(f2,negated_conjecture,
~ ? [X0: $i] :
( ( ( ( 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(f9,plain,
( ( cQ != $true )
| ( cQ = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
( ( cQ = $true )
| ( cR = $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(f22,definition,
~ sP1(cR),
introduced(definition,[new_symbols(definition,[sP1])],[inequality_splitting_name_introduction]) ).
tff(f23,plain,
sP1($true),
inference(inequality_splitting,[],[f17,f22]) ).
tff(f26,definition,
~ sP3(cQ),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
tff(f27,plain,
( ( cP = $true )
| sP3($true) ),
inference(inequality_splitting,[],[f15,f26]) ).
tff(f37,definition,
~ sP9(cQ),
introduced(definition,[new_symbols(definition,[sP9])],[inequality_splitting_name_introduction]) ).
tff(f38,plain,
( ( cQ = $true )
| sP9($true) ),
inference(inequality_splitting,[],[f9,f37]) ).
tff(f39,definition,
~ sP10(cP),
introduced(definition,[new_symbols(definition,[sP10])],[inequality_splitting_name_introduction]) ).
tff(f40,plain,
sP10($true),
inference(inequality_splitting,[],[f8,f39]) ).
tff(f45,plain,
( ~ sP10($true)
| sP3($true) ),
inference(superposition,[],[f39,f27]) ).
tff(f48,plain,
sP3($true),
inference(forward_subsumption_resolution,[],[f45,f40]) ).
tff(f66,plain,
( ~ sP3($true)
| sP9($true) ),
inference(superposition,[],[f26,f38]) ).
tff(f69,plain,
sP9($true),
inference(forward_subsumption_resolution,[],[f66,f48]) ).
tff(f75,plain,
( ~ sP9($true)
| ( cR = $true ) ),
inference(superposition,[],[f37,f11]) ).
tff(f76,plain,
cR = $true,
inference(forward_subsumption_resolution,[],[f75,f69]) ).
tff(f81,plain,
~ sP1($true),
inference(superposition,[],[f22,f76]) ).
tff(f82,plain,
$false,
inference(forward_subsumption_resolution,[],[f81,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO087^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 : n026.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:36:13 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 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.21/0.27 % (822977)Detected formulas, will run a generic FOF schedule.
% 0.21/0.27 % (822983)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=2584390620:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_2999 on theBenchmark for (2999ds/261632Mi)
% 0.21/0.27 % (822983) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-822977-822983"...
% 0.21/0.27 % (822983)...printing done.
% 0.21/0.27 % (822983)Refutation found. Thanks to Tanya!
% 0.21/0.27 % SZS status Theorem for theBenchmark
% 0.21/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (822983)------------------------------
% 0.21/0.27 % (822983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (822983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (822983)CaDiCaL version: 2.1.3
% 0.21/0.27 % (822983)Termination reason: Refutation
% 0.21/0.27 % (822983)Time elapsed: 0.001 s
% 0.21/0.27 % (822983)Peak memory usage: 12 MB
% 0.21/0.27 % (822983)Instructions burned: 2 (million)
% 0.21/0.27 % (822977)Success in time 0.03 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------