%------------------------------------------------------------------------------
% File : Vampire-SAT---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 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 : Wed Sep 30 08:38:54 AM UTC 2026
% Result : Theorem 2.34s 0.68s
% Output : Refutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 1
% Syntax : Number of formulae : 51 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 598 ( 181 equ; 0 cnn)
% Maximal formula atoms : 19 ( 11 avg)
% Number of connectives : 897 ( 85 ~; 81 |; 52 &; 627 @)
% ( 0 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 177 ( 0 ^; 171 !; 6 ?; 177 :)
% 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 ) ) )
=> ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X0: a,X1: a,X2: a] :
( ( ( cP @ X1 @ X2 )
& ( cP @ X0 @ X1 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) )
& ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X3: b,X1: b,X2: b] :
( ( ( cQ @ X0 @ X1 @ X2 )
& ( cQ @ X0 @ X3 @ X1 ) )
=> ( cQ @ X0 @ X3 @ X2 ) )
& ! [X3: b,X1: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) ) ) ) )
=> ! [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 ) ) )
=> ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cQ @ X0 @ ( f @ X0 ) @ ( f @ X1 ) ) )
=> ( ( ! [X0: a,X1: a,X2: a] :
( ( ( cP @ X1 @ X2 )
& ( cP @ X0 @ X1 ) )
=> ( cP @ X0 @ X2 ) )
& ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( cP @ X1 @ X0 ) ) )
=> ( ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
=> ( ( cQ @ X0 )
= ( cQ @ X1 ) ) )
& ! [X0: a] :
( ( cP @ X0 @ X0 )
=> ( ! [X3: b,X1: b,X2: b] :
( ( ( cQ @ X0 @ X1 @ X2 )
& ( cQ @ X0 @ X3 @ X1 ) )
=> ( cQ @ X0 @ X3 @ X2 ) )
& ! [X3: b,X1: b] :
( ( cQ @ X0 @ X3 @ X1 )
=> ( cQ @ X0 @ X1 @ X3 ) ) ) ) )
=> ! [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 @ X1 @ X2 )
=> ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) ) )
=> ( ( ! [X3: a,X4: a,X5: a] :
( ( ( cP @ X4 @ X5 )
& ( cP @ X3 @ X4 ) )
=> ( cP @ X3 @ X5 ) )
& ! [X6: a,X7: a] :
( ( cP @ X6 @ X7 )
=> ( cP @ X7 @ X6 ) ) )
=> ( ( ! [X8: a,X9: a] :
( ( cP @ X8 @ X9 )
=> ( ( cQ @ X8 )
= ( cQ @ X9 ) ) )
& ! [X10: a] :
( ( cP @ X10 @ X10 )
=> ( ! [X11: b,X12: b,X13: b] :
( ( ( cQ @ X10 @ X12 @ X13 )
& ( cQ @ X10 @ X11 @ X12 ) )
=> ( cQ @ X10 @ X11 @ X13 ) )
& ! [X14: b,X15: b] :
( ( cQ @ X10 @ X14 @ X15 )
=> ( cQ @ X10 @ X15 @ 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 ) )
=> ( ! [X1: a,X2: a] :
( ( ( cP @ X1 @ X2 )
= $true )
=> ( ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) )
= $true ) )
=> ( ( ! [X3: a,X4: a,X5: a] :
( ( ( ( cP @ X4 @ X5 )
= $true )
& ( ( cP @ X3 @ X4 )
= $true ) )
=> ( ( cP @ X3 @ X5 )
= $true ) )
& ! [X6: a,X7: a] :
( ( ( cP @ X6 @ X7 )
= $true )
=> ( ( cP @ X7 @ X6 )
= $true ) ) )
=> ( ( ! [X8: a,X9: a] :
( ( ( cP @ X8 @ X9 )
= $true )
=> ( ( cQ @ X8 )
= ( cQ @ X9 ) ) )
& ! [X10: a] :
( ( ( cP @ X10 @ X10 )
= $true )
=> ( ! [X11: b,X12: b,X13: b] :
( ( ( ( cQ @ X10 @ X12 @ X13 )
= $true )
& ( ( cQ @ X10 @ X11 @ X12 )
= $true ) )
=> ( ( cQ @ X10 @ X11 @ X13 )
= $true ) )
& ! [X14: b,X15: b] :
( ( ( cQ @ X10 @ X14 @ X15 )
= $true )
=> ( ( cQ @ X10 @ X15 @ X14 )
= $true ) ) ) ) )
=> ! [X16: a,X17: a] :
( ( ( cP @ X16 @ X17 )
= $true )
=> ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X16: a,X17: a] :
( ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
!= $true )
& ( ( cP @ X16 @ X17 )
= $true ) )
& ! [X8: a,X9: a] :
( ( ( cQ @ X8 )
= ( cQ @ X9 ) )
| ( ( cP @ X8 @ X9 )
!= $true ) )
& ! [X10: a] :
( ( ! [X11: b,X12: b,X13: b] :
( ( ( cQ @ X10 @ X11 @ X13 )
= $true )
| ( ( cQ @ X10 @ X12 @ X13 )
!= $true )
| ( ( cQ @ X10 @ X11 @ X12 )
!= $true ) )
& ! [X14: b,X15: b] :
( ( ( cQ @ X10 @ X15 @ X14 )
= $true )
| ( ( cQ @ X10 @ X14 @ X15 )
!= $true ) ) )
| ( ( cP @ X10 @ X10 )
!= $true ) )
& ! [X3: a,X4: a,X5: a] :
( ( ( cP @ X3 @ X5 )
= $true )
| ( ( cP @ X4 @ X5 )
!= $true )
| ( ( cP @ X3 @ X4 )
!= $true ) )
& ! [X6: a,X7: a] :
( ( ( cP @ X7 @ X6 )
= $true )
| ( ( cP @ X6 @ X7 )
!= $true ) )
& ! [X1: a,X2: a] :
( ( ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) )
= $true )
| ( ( cP @ X1 @ X2 )
!= $true ) )
& ! [X0: a] :
( ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true )
| ( ( cP @ X0 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ? [X16: a,X17: a] :
( ( ( cQ @ X16 @ ( f @ X16 ) @ ( g @ X17 ) )
!= $true )
& ( ( cP @ X16 @ X17 )
= $true ) )
& ! [X8: a,X9: a] :
( ( ( cQ @ X8 )
= ( cQ @ X9 ) )
| ( ( cP @ X8 @ X9 )
!= $true ) )
& ! [X10: a] :
( ( ! [X11: b,X12: b,X13: b] :
( ( ( cQ @ X10 @ X11 @ X13 )
= $true )
| ( ( cQ @ X10 @ X12 @ X13 )
!= $true )
| ( ( cQ @ X10 @ X11 @ X12 )
!= $true ) )
& ! [X14: b,X15: b] :
( ( ( cQ @ X10 @ X15 @ X14 )
= $true )
| ( ( cQ @ X10 @ X14 @ X15 )
!= $true ) ) )
| ( ( cP @ X10 @ X10 )
!= $true ) )
& ! [X3: a,X4: a,X5: a] :
( ( ( cP @ X3 @ X5 )
= $true )
| ( ( cP @ X4 @ X5 )
!= $true )
| ( ( cP @ X3 @ X4 )
!= $true ) )
& ! [X6: a,X7: a] :
( ( ( cP @ X7 @ X6 )
= $true )
| ( ( cP @ X6 @ X7 )
!= $true ) )
& ! [X1: a,X2: a] :
( ( ( cQ @ X1 @ ( f @ X1 ) @ ( f @ X2 ) )
= $true )
| ( ( cP @ X1 @ X2 )
!= $true ) )
& ! [X0: a] :
( ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X0 ) )
= $true )
| ( ( cP @ X0 @ X0 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ? [X0: a,X1: a] :
( ( ( cQ @ X0 @ ( f @ X0 ) @ ( g @ X1 ) )
!= $true )
& ( ( cP @ X0 @ X1 )
= $true ) )
& ! [X2: a,X3: a] :
( ( ( cQ @ X2 )
= ( cQ @ X3 ) )
| ( $true
!= ( cP @ X2 @ X3 ) ) )
& ! [X4: a] :
( ( ! [X5: b,X6: b,X7: b] :
( ( $true
= ( cQ @ X4 @ X5 @ X7 ) )
| ( $true
!= ( cQ @ X4 @ X6 @ X7 ) )
| ( $true
!= ( cQ @ X4 @ X5 @ X6 ) ) )
& ! [X8: b,X9: b] :
( ( $true
= ( cQ @ X4 @ X9 @ X8 ) )
| ( $true
!= ( cQ @ X4 @ X8 @ X9 ) ) ) )
| ( $true
!= ( cP @ X4 @ X4 ) ) )
& ! [X10: a,X11: a,X12: a] :
( ( $true
= ( cP @ X10 @ X12 ) )
| ( $true
!= ( cP @ X11 @ X12 ) )
| ( $true
!= ( cP @ X10 @ X11 ) ) )
& ! [X13: a,X14: a] :
( ( $true
= ( cP @ X14 @ X13 ) )
| ( $true
!= ( cP @ X13 @ X14 ) ) )
& ! [X15: a,X16: a] :
( ( $true
= ( cQ @ X15 @ ( f @ X15 ) @ ( f @ X16 ) ) )
| ( $true
!= ( cP @ X15 @ X16 ) ) )
& ! [X17: a] :
( ( $true
= ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X17 ) ) )
| ( $true
!= ( cP @ X17 @ X17 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( $true
!= ( cQ @ sK0 @ ( f @ sK0 ) @ ( g @ sK1 ) ) )
& ( $true
= ( cP @ sK0 @ sK1 ) )
& ! [X2: a,X3: a] :
( ( ( cQ @ X2 )
= ( cQ @ X3 ) )
| ( $true
!= ( cP @ X2 @ X3 ) ) )
& ! [X4: a] :
( ( ! [X5: b,X6: b,X7: b] :
( ( $true
= ( cQ @ X4 @ X5 @ X7 ) )
| ( $true
!= ( cQ @ X4 @ X6 @ X7 ) )
| ( $true
!= ( cQ @ X4 @ X5 @ X6 ) ) )
& ! [X8: b,X9: b] :
( ( $true
= ( cQ @ X4 @ X9 @ X8 ) )
| ( $true
!= ( cQ @ X4 @ X8 @ X9 ) ) ) )
| ( $true
!= ( cP @ X4 @ X4 ) ) )
& ! [X10: a,X11: a,X12: a] :
( ( $true
= ( cP @ X10 @ X12 ) )
| ( $true
!= ( cP @ X11 @ X12 ) )
| ( $true
!= ( cP @ X10 @ X11 ) ) )
& ! [X13: a,X14: a] :
( ( $true
= ( cP @ X14 @ X13 ) )
| ( $true
!= ( cP @ X13 @ X14 ) ) )
& ! [X15: a,X16: a] :
( ( $true
= ( cQ @ X15 @ ( f @ X15 ) @ ( f @ X16 ) ) )
| ( $true
!= ( cP @ X15 @ X16 ) ) )
& ! [X17: a] :
( ( $true
= ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X17 ) ) )
| ( $true
!= ( cP @ X17 @ X17 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
thf(f9,plain,
! [X17: a] :
( ( $true
!= ( cP @ X17 @ X17 ) )
| ( $true
= ( cQ @ X17 @ ( f @ X17 ) @ ( g @ X17 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
! [X16: a,X15: a] :
( ( $true
!= ( cP @ X15 @ X16 ) )
| ( $true
= ( cQ @ X15 @ ( f @ X15 ) @ ( f @ X16 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
! [X14: a,X13: a] :
( ( $true
!= ( cP @ X13 @ X14 ) )
| ( $true
= ( cP @ X14 @ X13 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
! [X10: a,X11: a,X12: a] :
( ( $true
!= ( cP @ X11 @ X12 ) )
| ( $true
= ( cP @ X10 @ X12 ) )
| ( $true
!= ( cP @ X10 @ X11 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f13,plain,
! [X8: b,X9: b,X4: a] :
( ( $true
!= ( cQ @ X4 @ X8 @ X9 ) )
| ( $true
= ( cQ @ X4 @ X9 @ X8 ) )
| ( $true
!= ( cP @ X4 @ X4 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
! [X6: b,X7: b,X4: a,X5: b] :
( ( $true
!= ( cQ @ X4 @ X6 @ X7 ) )
| ( $true
= ( cQ @ X4 @ X5 @ X7 ) )
| ( $true
!= ( cQ @ X4 @ X5 @ X6 ) )
| ( $true
!= ( cP @ X4 @ X4 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
! [X2: a,X3: a] :
( ( $true
!= ( cP @ X2 @ X3 ) )
| ( ( cQ @ X2 )
= ( cQ @ X3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
( $true
= ( cP @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
( $true
!= ( cQ @ sK0 @ ( f @ sK0 ) @ ( g @ sK1 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f20,plain,
( ( $true != $true )
| ( $true
= ( cP @ sK1 @ sK0 ) ) ),
inference(constrained_superposition,[],[f11,f16]) ).
thf(f21,plain,
( $true
= ( cP @ sK1 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f25,plain,
( ( $true != $true )
| ( ( cQ @ sK0 )
= ( cQ @ sK1 ) ) ),
inference(constrained_superposition,[],[f15,f21]) ).
thf(f26,plain,
( ( cQ @ sK0 )
= ( cQ @ sK1 ) ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f28,plain,
! [X1: b] :
( ( cQ @ sK0 @ X1 )
= ( cQ @ sK1 @ X1 ) ),
inference(argument_congruence,[],[f26]) ).
thf(f29,plain,
! [X2: b,X1: b] :
( ( cQ @ sK0 @ X1 @ X2 )
= ( cQ @ sK1 @ X1 @ X2 ) ),
inference(argument_congruence,[],[f28]) ).
thf(f30,plain,
! [X2: b,X1: b] :
( ( $true
= ( cQ @ sK0 @ X1 @ X2 ) )
| ( $false
= ( cQ @ sK1 @ X1 @ X2 ) ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f32,plain,
! [X0: a] :
( ( $true != $true )
| ( $true
= ( cP @ X0 @ sK1 ) )
| ( $true
!= ( cP @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f12,f16]) ).
thf(f33,plain,
! [X0: a] :
( ( $true != $true )
| ( $true
= ( cP @ X0 @ sK0 ) )
| ( $true
!= ( cP @ X0 @ sK1 ) ) ),
inference(constrained_superposition,[],[f12,f21]) ).
thf(f34,plain,
! [X0: a] :
( ( $true
!= ( cP @ X0 @ sK1 ) )
| ( $true
= ( cP @ X0 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f35,plain,
! [X0: a] :
( ( $true
!= ( cP @ X0 @ sK0 ) )
| ( $true
= ( cP @ X0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f36,plain,
( ( $true != $true )
| ( $true
= ( cP @ sK1 @ sK1 ) ) ),
inference(constrained_superposition,[],[f35,f21]) ).
thf(f37,plain,
( $true
= ( cP @ sK1 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f39,plain,
( ( $true != $true )
| ( $true
= ( cP @ sK0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f34,f16]) ).
thf(f42,plain,
( $true
= ( cP @ sK0 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f47,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK1 ) ) ) ),
inference(constrained_superposition,[],[f9,f37]) ).
thf(f48,plain,
( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( g @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f52,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( f @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f10,f21]) ).
thf(f55,plain,
( $true
= ( cQ @ sK1 @ ( f @ sK1 ) @ ( f @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f58,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK1 ) ) )
| ( $true
!= ( cP @ sK1 @ sK1 ) ) ),
inference(constrained_superposition,[],[f13,f48]) ).
thf(f65,plain,
( ( $true
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK1 ) ) )
| ( $true
!= ( cP @ sK1 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f69,plain,
( $true
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK1 ) ) ),
inference(forward_subsumption_resolution,[],[f65,f37]) ).
thf(f79,plain,
! [X0: b,X1: b] :
( ( $true != $true )
| ( $true
= ( cQ @ sK0 @ X1 @ X0 ) )
| ( $true
!= ( cP @ sK0 @ sK0 ) )
| ( $false
= ( cQ @ sK1 @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f13,f30]) ).
thf(f80,plain,
! [X0: b,X1: b] :
( ( $true
= ( cQ @ sK0 @ X1 @ X0 ) )
| ( $true
!= ( cP @ sK0 @ sK0 ) )
| ( $false
= ( cQ @ sK1 @ X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f82,plain,
! [X0: b,X1: b] :
( ( $true
= ( cQ @ sK0 @ X1 @ X0 ) )
| ( $false
= ( cQ @ sK1 @ X0 @ X1 ) ) ),
inference(forward_subsumption_resolution,[],[f80,f42]) ).
thf(f115,plain,
( ( $true != $true )
| ( $false
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f17,f82]) ).
thf(f121,plain,
( $false
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f115]) ).
thf(f131,plain,
! [X0: b] :
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ X0 @ ( f @ sK0 ) ) )
| ( $true
!= ( cQ @ sK1 @ X0 @ ( f @ sK1 ) ) )
| ( $true
!= ( cP @ sK1 @ sK1 ) ) ),
inference(constrained_superposition,[],[f14,f55]) ).
thf(f147,plain,
! [X0: b] :
( ( $true
= ( cQ @ sK1 @ X0 @ ( f @ sK0 ) ) )
| ( $true
!= ( cQ @ sK1 @ X0 @ ( f @ sK1 ) ) )
| ( $true
!= ( cP @ sK1 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f131]) ).
thf(f159,plain,
! [X0: b] :
( ( $true
!= ( cQ @ sK1 @ X0 @ ( f @ sK1 ) ) )
| ( $true
= ( cQ @ sK1 @ X0 @ ( f @ sK0 ) ) ) ),
inference(forward_subsumption_resolution,[],[f147,f37]) ).
thf(f263,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f159,f69]) ).
thf(f270,plain,
( $true
= ( cQ @ sK1 @ ( g @ sK1 ) @ ( f @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f263]) ).
thf(f273,plain,
$true = $false,
inference(forward_demodulation,[],[f270,f121]) ).
thf(f274,plain,
$false,
inference(trivial_inequality_removal,[],[f273]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.09/0.23 % Computer : n007.cluster.edu
% 0.09/0.23 % Model : x86_64 x86_64
% 0.09/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23 % Memory : 8046.5625MB
% 0.09/0.23 % OS : Linux 6.8.0-71-generic
% 0.09/0.24 % CPULimit : 300
% 0.09/0.24 % WCLimit : 300
% 0.09/0.24 % DateTime : Tue Sep 29 15:03:11 UTC 2026
% 0.09/0.24 % CPUTime :
% 0.09/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.29 Running first-order model finding
% 0.09/0.29 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
% 2.34/0.68 % (3474787)Will run a generic schedule for satisfiability detection.
% 2.34/0.68 % (3474793)% WARNING: option uhcvi not known.
% 2.34/0.68 % (3474793)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=188678329:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.34/0.68 % (3474793)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.34/0.68 % (3474793)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.34/0.68 % (3474794)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1353151501:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.34/0.68 % (3474795)dis+10_1_sil=32000:sp=arity:random_seed=1276904734:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.34/0.68 % (3474796)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4226450171:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.34/0.68 % (3474797)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=247305515:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.34/0.68 % (3474796)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.34/0.68 % (3474792)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2497320608_2999 on theBenchmark for (2999ds/0Mi)
% 2.34/0.68 % (3474798)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3269727564:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.34/0.68 % Exception at run slice level
% 2.34/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.34/0.68 % (3474806)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1267613042:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.34/0.68 % Exception at run slice level
% 2.34/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.34/0.68 % (3474795)Instruction limit reached!
% 2.34/0.68 % (3474795)------------------------------
% 2.34/0.68 % (3474795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474795)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474795)Termination reason: Instruction limit
% 2.34/0.68 % (3474795)Termination phase: Saturation
% 2.34/0.68 % (3474795)Time elapsed: 0.087 s
% 2.34/0.68 % (3474795)Peak memory usage: 12 MB
% 2.34/0.68 % (3474795)Instructions burned: 103 (million)
% 2.34/0.68 % (3474796)Instruction limit reached!
% 2.34/0.68 % (3474796)------------------------------
% 2.34/0.68 % (3474796)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474796)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474796)Termination reason: Instruction limit
% 2.34/0.68 % (3474796)Termination phase: Saturation
% 2.34/0.68 % (3474796)Time elapsed: 0.099 s
% 2.34/0.68 % (3474796)Peak memory usage: 12 MB
% 2.34/0.68 % (3474796)Instructions burned: 117 (million)
% 2.34/0.68 % (3474808)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3520438255:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.34/0.68 % (3474797)Instruction limit reached!
% 2.34/0.68 % (3474797)------------------------------
% 2.34/0.68 % (3474797)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474797)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474797)Termination reason: Instruction limit
% 2.34/0.68 % (3474797)Termination phase: Saturation
% 2.34/0.68 % (3474797)Time elapsed: 0.109 s
% 2.34/0.68 % (3474797)Peak memory usage: 12 MB
% 2.34/0.68 % (3474797)Instructions burned: 132 (million)
% 2.34/0.68 % (3474809)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1661095701:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.34/0.68 % (3474809)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.34/0.68 % (3474809)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.34/0.68 % (3474810)ott-21_1_sil=16000:fs=off:random_seed=2485659886:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.34/0.68 % (3474812)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2670984513:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.34/0.68 % (3474798)Instruction limit reached!
% 2.34/0.68 % (3474798)------------------------------
% 2.34/0.68 % (3474798)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474798)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474798)Termination reason: Instruction limit
% 2.34/0.68 % (3474798)Termination phase: Saturation
% 2.34/0.68 % (3474798)Time elapsed: 0.156 s
% 2.34/0.68 % (3474798)Peak memory usage: 11 MB
% 2.34/0.68 % (3474798)Instructions burned: 160 (million)
% 2.34/0.68 % (3474816)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=319190168:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.34/0.68 % Exception at run slice level
% 2.34/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.34/0.68 % (3474808)Instruction limit reached!
% 2.34/0.68 % (3474808)------------------------------
% 2.34/0.68 % (3474808)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474808)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474808)Termination reason: Instruction limit
% 2.34/0.68 % (3474808)Termination phase: Saturation
% 2.34/0.68 % (3474808)Time elapsed: 0.117 s
% 2.34/0.68 % (3474808)Peak memory usage: 12 MB
% 2.34/0.68 % (3474808)Instructions burned: 131 (million)
% 2.34/0.68 % (3474819)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3966157404:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 2.34/0.68 % Exception at run slice level
% 2.34/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.34/0.68 % (3474818)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=139438913:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.34/0.68 % (3474810)Instruction limit reached!
% 2.34/0.68 % (3474810)------------------------------
% 2.34/0.68 % (3474810)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474810)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474810)Termination reason: Instruction limit
% 2.34/0.68 % (3474810)Termination phase: Saturation
% 2.34/0.68 % (3474810)Time elapsed: 0.148 s
% 2.34/0.68 % (3474810)Peak memory usage: 12 MB
% 2.34/0.68 % (3474810)Instructions burned: 180 (million)
% 2.34/0.68 % (3474821)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1083162800:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 2.34/0.68 % (3474821)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.34/0.68 % (3474823)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2707648361:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 2.34/0.68 % (3474823)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.34/0.68 % (3474821) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3474787-3474821"...
% 2.34/0.68 % (3474821)...printing done.
% 2.34/0.68 % (3474821)Refutation found. Thanks to Tanya!
% 2.34/0.68 % SZS status Theorem for theBenchmark
% 2.34/0.68 % SZS output start Proof for theBenchmark
% See solution above
% 2.34/0.68 % (3474821)------------------------------
% 2.34/0.68 % (3474821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.68 % (3474821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.68 % (3474821)CaDiCaL version: 2.1.3
% 2.34/0.68 % (3474821)Termination reason: Refutation
% 2.34/0.68 % (3474821)Time elapsed: 0.034 s
% 2.34/0.68 % (3474821)Peak memory usage: 12 MB
% 2.34/0.68 % (3474821)Instructions burned: 35 (million)
% 2.34/0.68 % (3474787)Success in time 0.374 s
% 2.34/0.68 % Vampire exiting
%------------------------------------------------------------------------------