%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV045^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 : n017.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:37:32 AM UTC 2026
% Result : Theorem 0.25s 0.36s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of formulae : 43 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 541 ( 162 equ; 0 cnn)
% Maximal formula atoms : 19 ( 12 avg)
% Number of connectives : 828 ( 76 ~; 70 |; 52 &; 578 @)
% ( 0 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 168 ( 0 ^; 162 !; 6 ?; 168 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
g: a > b ).
thf(func_def_1,type,
f: a > b ).
thf(func_def_2,type,
cQ: a > b > b > $o ).
thf(func_def_3,type,
cP: a > a > $o ).
thf(func_def_7,type,
sK0: a ).
thf(func_def_8,type,
sK1: a ).
thf(f1,conjecture,
( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X0: a,X2: a,X1: a] :
( ( ( cP @ X0 @ X1 )
& ( cP @ X1 @ X2 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X1: b,X3: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) )
& ! [X1: b,X2: b,X3: b] :
( ( ( cQ @ X0 @ X3 @ X1 )
& ( cQ @ X0 @ X1 @ X2 ) )
=> ( cQ @ X0 @ X3 @ X2 ) ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) ) )
=> ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM509_pme) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X0: a,X2: a,X1: a] :
( ( ( cP @ X0 @ X1 )
& ( cP @ X1 @ X2 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X1: b,X3: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) )
& ! [X1: b,X2: b,X3: b] :
( ( ( cQ @ X0 @ X3 @ X1 )
& ( cQ @ X0 @ X1 @ X2 ) )
=> ( cQ @ X0 @ X3 @ X2 ) ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) ) )
=> ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) ) )
=> ( ! [X1: a,X2: a] :
( ( cP @ X2 @ X1 )
=> ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) ) )
=> ( ( ! [X3: a,X4: a,X5: a] :
( ( ( cP @ X3 @ X5 )
& ( cP @ X5 @ X4 ) )
=> ( cP @ X3 @ X4 ) )
& ! [X6: a,X7: a] :
( ( cP @ X7 @ X6 )
=> ( cP @ X6 @ X7 ) ) )
=> ( ( ! [X8: a] :
( ( cP @ X8 @ X8 )
=> ( ! [X9: b,X10: b] :
( ( cQ @ X8 @ X10 @ X9 )
=> ( cQ @ X8 @ X9 @ X10 ) )
& ! [X11: b,X12: b,X13: b] :
( ( ( cQ @ X8 @ X13 @ X11 )
& ( cQ @ X8 @ X11 @ X12 ) )
=> ( cQ @ X8 @ X13 @ X12 ) ) ) )
& ! [X14: a,X15: a] :
( ( cP @ X15 @ X14 )
=> ( ( cQ @ X15 )
= ( cQ @ X14 ) ) ) )
=> ! [X16: a,X17: a] :
( ( cP @ X16 @ X17 )
=> ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: a] :
( ( ( cP @ X0 @ X0 )
= $true )
=> ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true ) )
=> ( ! [X2: a,X1: a] :
( ( ( cP @ X2 @ X1 )
= $true )
=> ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true ) )
=> ( ( ! [X7: a,X6: a] :
( ( ( cP @ X7 @ X6 )
= $true )
=> ( ( cP @ X6 @ X7 )
= $true ) )
& ! [X3: a,X5: a,X4: a] :
( ( ( ( cP @ X3 @ X5 )
= $true )
& ( ( cP @ X5 @ X4 )
= $true ) )
=> ( ( cP @ X3 @ X4 )
= $true ) ) )
=> ( ( ! [X8: a] :
( ( ( cP @ X8 @ X8 )
= $true )
=> ( ! [X9: b,X10: b] :
( ( ( cQ @ X8 @ X10 @ X9 )
= $true )
=> ( ( cQ @ X8 @ X9 @ X10 )
= $true ) )
& ! [X12: b,X11: b,X13: b] :
( ( ( ( cQ @ X8 @ X11 @ X12 )
= $true )
& ( ( cQ @ X8 @ X13 @ X11 )
= $true ) )
=> ( ( cQ @ X8 @ X13 @ X12 )
= $true ) ) ) )
& ! [X15: a,X14: a] :
( ( ( cP @ X15 @ X14 )
= $true )
=> ( ( cQ @ X15 )
= ( cQ @ X14 ) ) ) )
=> ! [X17: a,X16: a] :
( ( ( cP @ X16 @ X17 )
= $true )
=> ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X17: a,X16: a] :
( ( ( cP @ X16 @ X17 )
= $true )
& ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
!= $true ) )
& ! [X8: a] :
( ( ! [X10: b,X9: b] :
( ( ( cQ @ X8 @ X10 @ X9 )
!= $true )
| ( ( cQ @ X8 @ X9 @ X10 )
= $true ) )
& ! [X12: b,X11: b,X13: b] :
( ( ( cQ @ X8 @ X13 @ X12 )
= $true )
| ( ( cQ @ X8 @ X11 @ X12 )
!= $true )
| ( ( cQ @ X8 @ X13 @ X11 )
!= $true ) ) )
| ( ( cP @ X8 @ X8 )
!= $true ) )
& ! [X15: a,X14: a] :
( ( ( cP @ X15 @ X14 )
!= $true )
| ( ( cQ @ X15 )
= ( cQ @ X14 ) ) )
& ! [X6: a,X7: a] :
( ( ( cP @ X6 @ X7 )
= $true )
| ( ( cP @ X7 @ X6 )
!= $true ) )
& ! [X3: a,X5: a,X4: a] :
( ( ( cP @ X3 @ X4 )
= $true )
| ( ( cP @ X3 @ X5 )
!= $true )
| ( ( cP @ X5 @ X4 )
!= $true ) )
& ! [X2: a,X1: a] :
( ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true )
| ( ( cP @ X2 @ X1 )
!= $true ) )
& ! [X0: a] :
( ( ( cP @ X0 @ X0 )
!= $true )
| ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ? [X17: a,X16: a] :
( ( ( cP @ X16 @ X17 )
= $true )
& ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
!= $true ) )
& ! [X15: a,X14: a] :
( ( ( cP @ X15 @ X14 )
!= $true )
| ( ( cQ @ X15 )
= ( cQ @ X14 ) ) )
& ! [X2: a,X1: a] :
( ( ( cQ @ X2 @ ( f @ X2 ) @ ( f @ X1 ) )
= $true )
| ( ( cP @ X2 @ X1 )
!= $true ) )
& ! [X8: a] :
( ( ( cP @ X8 @ X8 )
!= $true )
| ( ! [X10: b,X9: b] :
( ( ( cQ @ X8 @ X10 @ X9 )
!= $true )
| ( ( cQ @ X8 @ X9 @ X10 )
= $true ) )
& ! [X12: b,X13: b,X11: b] :
( ( ( cQ @ X8 @ X13 @ X11 )
!= $true )
| ( ( cQ @ X8 @ X13 @ X12 )
= $true )
| ( ( cQ @ X8 @ X11 @ X12 )
!= $true ) ) ) )
& ! [X5: a,X3: a,X4: a] :
( ( ( cP @ X3 @ X5 )
!= $true )
| ( ( cP @ X3 @ X4 )
= $true )
| ( ( cP @ X5 @ X4 )
!= $true ) )
& ! [X0: a] :
( ( ( cP @ X0 @ X0 )
!= $true )
| ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true ) )
& ! [X6: a,X7: a] :
( ( ( cP @ X6 @ X7 )
= $true )
| ( ( cP @ X7 @ X6 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ? [X0: a,X1: a] :
( ( ( cP @ X1 @ X0 )
= $true )
& ( ( cQ @ X1 @ ( f @ X1 ) @ ( g @ X0 ) )
!= $true ) )
& ! [X2: a,X3: a] :
( ( ( cP @ X2 @ X3 )
!= $true )
| ( ( cQ @ X2 )
= ( cQ @ X3 ) ) )
& ! [X4: a,X5: a] :
( ( ( cQ @ X4 @ ( f @ X4 ) @ ( f @ X5 ) )
= $true )
| ( ( cP @ X4 @ X5 )
!= $true ) )
& ! [X6: a] :
( ( $true
!= ( cP @ X6 @ X6 ) )
| ( ! [X7: b,X8: b] :
( ( ( cQ @ X6 @ X7 @ X8 )
!= $true )
| ( ( cQ @ X6 @ X8 @ X7 )
= $true ) )
& ! [X9: b,X10: b,X11: b] :
( ( $true
!= ( cQ @ X6 @ X10 @ X11 ) )
| ( ( cQ @ X6 @ X10 @ X9 )
= $true )
| ( ( cQ @ X6 @ X11 @ X9 )
!= $true ) ) ) )
& ! [X12: a,X13: a,X14: a] :
( ( ( cP @ X13 @ X12 )
!= $true )
| ( ( cP @ X13 @ X14 )
= $true )
| ( ( cP @ X12 @ X14 )
!= $true ) )
& ! [X15: a] :
( ( ( cP @ X15 @ X15 )
!= $true )
| ( ( cQ @ X15 @ ( f @ X15 ) @ ( g @ X15 ) )
= $true ) )
& ! [X16: a,X17: a] :
( ( ( cP @ X16 @ X17 )
= $true )
| ( $true
!= ( cP @ X17 @ X16 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( ( cP @ sK1 @ sK0 )
= $true )
& ( ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) )
!= $true )
& ! [X2: a,X3: a] :
( ( ( cP @ X2 @ X3 )
!= $true )
| ( ( cQ @ X2 )
= ( cQ @ X3 ) ) )
& ! [X4: a,X5: a] :
( ( ( cQ @ X4 @ ( f @ X4 ) @ ( f @ X5 ) )
= $true )
| ( ( cP @ X4 @ X5 )
!= $true ) )
& ! [X6: a] :
( ( $true
!= ( cP @ X6 @ X6 ) )
| ( ! [X7: b,X8: b] :
( ( ( cQ @ X6 @ X7 @ X8 )
!= $true )
| ( ( cQ @ X6 @ X8 @ X7 )
= $true ) )
& ! [X9: b,X10: b,X11: b] :
( ( $true
!= ( cQ @ X6 @ X10 @ X11 ) )
| ( ( cQ @ X6 @ X10 @ X9 )
= $true )
| ( ( cQ @ X6 @ X11 @ X9 )
!= $true ) ) ) )
& ! [X12: a,X13: a,X14: a] :
( ( ( cP @ X13 @ X12 )
!= $true )
| ( ( cP @ X13 @ X14 )
= $true )
| ( ( cP @ X12 @ X14 )
!= $true ) )
& ! [X15: a] :
( ( ( cP @ X15 @ X15 )
!= $true )
| ( ( cQ @ X15 @ ( f @ X15 ) @ ( g @ X15 ) )
= $true ) )
& ! [X16: a,X17: a] :
( ( ( cP @ X16 @ X17 )
= $true )
| ( $true
!= ( cP @ X17 @ X16 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
thf(f9,plain,
! [X16: a,X17: a] :
( ( $true
!= ( cP @ X17 @ X16 ) )
| ( ( cP @ X16 @ X17 )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
! [X15: a] :
( ( ( cP @ X15 @ X15 )
!= $true )
| ( ( cQ @ X15 @ ( f @ X15 ) @ ( g @ X15 ) )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
! [X14: a,X12: a,X13: a] :
( ( ( cP @ X13 @ X12 )
!= $true )
| ( ( cP @ X12 @ X14 )
!= $true )
| ( ( cP @ X13 @ X14 )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
! [X10: b,X11: b,X6: a,X9: b] :
( ( $true
!= ( cQ @ X6 @ X10 @ X11 ) )
| ( ( cQ @ X6 @ X10 @ X9 )
= $true )
| ( ( cQ @ X6 @ X11 @ X9 )
!= $true )
| ( $true
!= ( cP @ X6 @ X6 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
! [X4: a,X5: a] :
( ( ( cP @ X4 @ X5 )
!= $true )
| ( ( cQ @ X4 @ ( f @ X4 ) @ ( f @ X5 ) )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
! [X2: a,X3: a] :
( ( ( cP @ X2 @ X3 )
!= $true )
| ( ( cQ @ X2 )
= ( cQ @ X3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
( ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
( ( cP @ sK1 @ sK0 )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
( ( $true != $true )
| ( ( cP @ sK0 @ sK1 )
= $true ) ),
inference(constrained_superposition,[],[f9,f17]) ).
thf(f21,plain,
( ( cP @ sK0 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f24,plain,
( ( $true != $true )
| ( ( cQ @ sK1 )
= ( cQ @ sK0 ) ) ),
inference(constrained_superposition,[],[f15,f17]) ).
thf(f26,plain,
( ( cQ @ sK1 )
= ( cQ @ sK0 ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f28,plain,
! [X1: b] :
( ( cQ @ sK1 @ X1 )
= ( cQ @ sK0 @ X1 ) ),
inference(argument_congruence,[],[f26]) ).
thf(f29,plain,
! [X2: b,X1: b] :
( ( cQ @ sK1 @ X1 @ X2 )
= ( cQ @ sK0 @ X1 @ X2 ) ),
inference(argument_congruence,[],[f28]) ).
thf(f30,plain,
! [X2: b,X1: b] :
( ( ( cQ @ sK0 @ X1 @ X2 )
= $false )
| ( ( cQ @ sK1 @ X1 @ X2 )
= $true ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f32,plain,
! [X0: a] :
( ( ( cP @ sK0 @ X0 )
!= $true )
| ( ( cP @ sK1 @ X0 )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f11,f17]) ).
thf(f33,plain,
! [X0: a] :
( ( ( cP @ sK0 @ X0 )
= $true )
| ( $true != $true )
| ( ( cP @ sK1 @ X0 )
!= $true ) ),
inference(constrained_superposition,[],[f11,f21]) ).
thf(f34,plain,
! [X0: a] :
( ( ( cP @ sK0 @ X0 )
!= $true )
| ( ( cP @ sK1 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f35,plain,
! [X0: a] :
( ( ( cP @ sK1 @ X0 )
!= $true )
| ( ( cP @ sK0 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f36,plain,
( ( $true != $true )
| ( ( cP @ sK1 @ sK1 )
= $true ) ),
inference(constrained_superposition,[],[f34,f21]) ).
thf(f37,plain,
( ( cP @ sK1 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f39,plain,
( ( ( cP @ sK0 @ sK0 )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f35,f17]) ).
thf(f42,plain,
( ( cP @ sK0 @ sK0 )
= $true ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f47,plain,
( ( ( cQ @ sK0 @ ( f @ sK0 ) @ ( g @ sK0 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f10,f42]) ).
thf(f48,plain,
( ( cQ @ sK0 @ ( f @ sK0 ) @ ( g @ sK0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f50,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( f @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f14,f17]) ).
thf(f55,plain,
( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( f @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f61,plain,
( ( ( cQ @ sK1 @ ( f @ sK0 ) @ ( g @ sK0 ) )
= $true )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f48,f30]) ).
thf(f66,plain,
( ( cQ @ sK1 @ ( f @ sK0 ) @ ( g @ sK0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f140,plain,
! [X0: b] :
( ( $true != $true )
| ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
= $true )
| ( ( cQ @ sK1 @ ( f @ sK0 ) @ X0 )
!= $true ) ),
inference(constrained_superposition,[],[f12,f55]) ).
thf(f157,plain,
! [X0: b] :
( ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
= $true )
| ( ( cP @ sK1 @ sK1 )
!= $true )
| ( ( cQ @ sK1 @ ( f @ sK0 ) @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f140]) ).
thf(f170,plain,
! [X0: b] :
( ( ( cQ @ sK1 @ ( f @ sK0 ) @ X0 )
!= $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ X0 )
= $true ) ),
inference(forward_subsumption_resolution,[],[f157,f37]) ).
thf(f182,plain,
( ( $true != $true )
| ( ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) )
= $true ) ),
inference(constrained_superposition,[],[f170,f66]) ).
thf(f188,plain,
( ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f182]) ).
thf(f192,plain,
$false,
inference(forward_subsumption_resolution,[],[f188,f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV045^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 % Computer : n017.cluster.edu
% 0.08/0.23 % Model : x86_64 x86_64
% 0.08/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.23 % Memory : 8046.5625MB
% 0.08/0.23 % OS : Linux 6.8.0-71-generic
% 0.08/0.23 % CPULimit : 300
% 0.08/0.23 % WCLimit : 300
% 0.08/0.23 % DateTime : Tue Sep 29 15:00:37 UTC 2026
% 0.08/0.23 % CPUTime :
% 0.08/0.23 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.28 Running higher-order theorem proving
% 0.25/0.30 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.25/0.36 % (436221)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.25/0.36 % (436228)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1433544756:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.25/0.36 % (436227)lrs+10_16_si=on:nwc=1.5:random_seed=1928018446:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.25/0.36 % (436228)Instruction limit reached!
% 0.25/0.36 % (436228)------------------------------
% 0.25/0.36 % (436228)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (436228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (436228)CaDiCaL version: 2.1.3
% 0.25/0.36 % (436228)Termination reason: Instruction limit
% 0.25/0.36 % (436228)Termination phase: Saturation
% 0.25/0.36 % (436228)Time elapsed: 0.002 s
% 0.25/0.36 % (436228)Peak memory usage: 12 MB
% 0.25/0.36 % (436228)Instructions burned: 3 (million)
% 0.25/0.36 % (436232)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.25/0.36 % (436232)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.25/0.36 % (436226)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1786882987:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.25/0.36 % (436230)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3672526678:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.25/0.36 % (436231)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1589051909:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.25/0.36 % (436229)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2685944557:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.25/0.36 % (436227)Instruction limit reached!
% 0.25/0.36 % (436227)------------------------------
% 0.25/0.36 % (436227)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (436227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (436227)CaDiCaL version: 2.1.3
% 0.25/0.36 % (436227)Termination reason: Instruction limit
% 0.25/0.36 % (436227)Termination phase: Saturation
% 0.25/0.36 % (436227)Time elapsed: 0.014 s
% 0.25/0.36 % (436227)Peak memory usage: 12 MB
% 0.25/0.36 % (436227)Instructions burned: 20 (million)
% 0.25/0.36 % (436232)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=628933622:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.25/0.36 % (436235)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=427739247:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.25/0.36 % (436235)Instruction limit reached!
% 0.25/0.36 % (436235)------------------------------
% 0.25/0.36 % (436235)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (436235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (436235)CaDiCaL version: 2.1.3
% 0.25/0.36 % (436235)Termination reason: Instruction limit
% 0.25/0.36 % (436235)Termination phase: Saturation
% 0.25/0.36 % (436235)Time elapsed: 0.003 s
% 0.25/0.36 % (436235)Peak memory usage: 12 MB
% 0.25/0.36 % (436235)Instructions burned: 6 (million)
% 0.25/0.36 % (436226) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-436221-436226"...
% 0.25/0.36 % (436226)...printing done.
% 0.25/0.36 % (436230)Instruction limit reached!
% 0.25/0.36 % (436230)------------------------------
% 0.25/0.36 % (436230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (436230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (436230)CaDiCaL version: 2.1.3
% 0.25/0.36 % (436230)Termination reason: Instruction limit
% 0.25/0.36 % (436230)Termination phase: Saturation
% 0.25/0.36 % (436230)Time elapsed: 0.022 s
% 0.25/0.36 % (436230)Peak memory usage: 11 MB
% 0.25/0.36 % (436230)Instructions burned: 24 (million)
% 0.25/0.36 % (436226)Refutation found. Thanks to Tanya!
% 0.25/0.36 % SZS status Theorem for theBenchmark
% 0.25/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.37 % (436226)------------------------------
% 0.25/0.37 % (436226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (436226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (436226)CaDiCaL version: 2.1.3
% 0.25/0.37 % (436226)Termination reason: Refutation
% 0.25/0.37 % (436226)Time elapsed: 0.020 s
% 0.25/0.37 % (436226)Peak memory usage: 12 MB
% 0.25/0.37 % (436226)Instructions burned: 20 (million)
% 0.25/0.37 % (436221)Success in time 0.057 s
% 0.25/0.37 % Vampire exiting
%------------------------------------------------------------------------------