%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO080^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:34 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 100 ( 23 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 43 ( 12 ~; 8 |; 3 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 52 ( 52 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
cB: $o ).
tff(func_def_1,type,
cA: $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(f1,conjecture,
( ( ( ( ( cA
=> cB )
=> cA )
=> cA )
=> cB )
=> cB ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM200) ).
tff(f2,negated_conjecture,
~ ( ( ( ( ( cA
=> cB )
=> cA )
=> cA )
=> cB )
=> cB ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ( ( ( ( cA
=> cB )
=> cA )
=> cA )
=> cB )
=> cB ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ( ( ( ( ( ( cA = $true )
=> ( cB = $true ) )
=> ( cA = $true ) )
=> ( cA = $true ) )
=> ( cB = $true ) )
=> ( cB = $true ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
( ( cB != $true )
& ( ( cB = $true )
| ( ( cA != $true )
& ( ( cA = $true )
| ( ( cB != $true )
& ( cA = $true ) ) ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ( cB = $true )
| ( cA = $true )
| ( cA = $true ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f8,plain,
( ( cB = $true )
| ( cA != $true ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f9,plain,
cB != $true,
inference(cnf_transformation,[],[f5]) ).
tff(f14,definition,
~ sP1(cB),
introduced(definition,[new_symbols(definition,[sP1])],[inequality_splitting_name_introduction]) ).
tff(f15,plain,
sP1($true),
inference(inequality_splitting,[],[f9,f14]) ).
tff(f16,definition,
~ sP2(cA),
introduced(definition,[new_symbols(definition,[sP2])],[inequality_splitting_name_introduction]) ).
tff(f17,plain,
( ( cB = $true )
| sP2($true) ),
inference(inequality_splitting,[],[f8,f16]) ).
tff(f20,plain,
( ( cA = $true )
| ( cB = $true ) ),
inference(duplicate_literal_removal,[],[f6]) ).
tff(f24,plain,
( ~ sP2($true)
| ( cB = $true ) ),
inference(superposition,[],[f16,f20]) ).
tff(f25,plain,
cB = $true,
inference(forward_subsumption_resolution,[],[f24,f17]) ).
tff(f27,plain,
~ sP1($true),
inference(superposition,[],[f14,f25]) ).
tff(f28,plain,
$false,
inference(forward_subsumption_resolution,[],[f27,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO080^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n015.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:36:18 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.26 % (3750432)Detected formulas, will run a generic FOF schedule.
% 0.09/0.26 % (3750438)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=36287935:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_3000 on theBenchmark for (3000ds/261632Mi)
% 0.09/0.26 % (3750438) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3750432-3750438"...
% 0.09/0.26 % (3750438)...printing done.
% 0.09/0.26 % (3750438)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 % (3750438)------------------------------
% 0.09/0.26 % (3750438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (3750438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (3750438)CaDiCaL version: 2.1.3
% 0.09/0.26 % (3750438)Termination reason: Refutation
% 0.09/0.26 % (3750438)Time elapsed: 0.001 s
% 0.09/0.26 % (3750438)Peak memory usage: 12 MB
% 0.09/0.26 % (3750438)Instructions burned: 1 (million)
% 0.09/0.26 % (3750432)Success in time 0.017 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------