%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM690^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:18:33 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 188 ( 46 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 303 ( 24 ~; 18 |; 0 &; 252 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 72 ( 24 ^; 48 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
y: nat ).
thf(func_def_2,type,
z: nat ).
thf(func_def_3,type,
u: nat ).
thf(func_def_4,type,
some: ( nat > $o ) > $o ).
thf(func_def_5,type,
diffprop: nat > nat > nat > $o ).
thf(func_def_7,type,
lessis: nat > nat > $o ).
thf(func_def_8,type,
pl: nat > nat > nat ).
thf(func_def_9,type,
moreis: nat > nat > $o ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,axiom,
( some
@ ^ [X0: nat] : ( diffprop @ y @ x @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f2,axiom,
lessis @ z @ u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(f3,axiom,
! [X3: nat,X2: nat,X0: nat,X1: nat] :
( ( some
@ ^ [X3: nat] : ( diffprop @ X0 @ X1 @ X3 ) )
=> ( ( moreis @ X2 @ X3 )
=> ( some
@ ^ [X4: nat] : ( diffprop @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22b) ).
thf(f4,axiom,
! [X0: nat,X1: nat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).
thf(f5,conjecture,
( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22d) ).
thf(f6,negated_conjecture,
~ ( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( some
@ ^ [X0: nat] : ( diffprop @ y @ x @ X0 ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ y @ x @ Y0 ) )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f10,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( some
@ ^ [X4: nat] : ( diffprop @ X2 @ X3 @ X4 ) )
=> ( ( moreis @ X1 @ X0 )
=> ( some
@ ^ [X5: nat] : ( diffprop @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) @ X5 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
! [X3: nat,X0: nat,X2: nat,X1: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X3 @ Y0 ) ) )
=> ( ( ( moreis @ X1 @ X0 )
= $true )
=> ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X0 @ X1 )
= $true )
=> ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
lessis @ z @ u,
inference(rectify,[],[f2]) ).
thf(f16,plain,
( ( lessis @ z @ u )
= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(flattening,[],[f10]) ).
thf(f18,plain,
! [X1: nat,X0: nat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f19,plain,
! [X3: nat,X0: nat,X2: nat,X1: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) @ Y0 ) ) )
| ( ( moreis @ X1 @ X0 )
!= $true )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X3 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f20,plain,
! [X3: nat,X1: nat,X0: nat,X2: nat] :
( ( ( moreis @ X1 @ X0 )
!= $true )
| ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X3 @ Y0 ) ) ) ),
inference(flattening,[],[f19]) ).
thf(f21,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( moreis @ X1 @ X2 )
!= $true )
| ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X1 ) @ ( pl @ X0 @ X2 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X3 @ X0 @ Y0 ) ) ) ),
inference(rectify,[],[f20]) ).
thf(f22,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( lessis @ X1 @ X0 ) )
| ( $true
= ( moreis @ X0 @ X1 ) ) ),
inference(rectify,[],[f18]) ).
thf(f23,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ y @ x @ Y0 ) )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f24,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X1 ) @ ( pl @ X0 @ X2 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X3 @ X0 @ Y0 ) ) )
| ( ( moreis @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f25,plain,
( ( lessis @ z @ u )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f27,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( lessis @ X1 @ X0 ) )
| ( $true
= ( moreis @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f30,plain,
( $true
= ( some @ ( diffprop @ y @ x ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f31,plain,
( $true
!= ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f32,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true
!= ( some @ ( diffprop @ X3 @ X0 ) ) )
| ( $true
= ( some @ ( diffprop @ ( pl @ X3 @ X1 ) @ ( pl @ X0 @ X2 ) ) ) )
| ( ( moreis @ X1 @ X2 )
!= $true ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f33,plain,
( ( $true != $true )
| ( $true
= ( moreis @ u @ z ) ) ),
inference(constrained_superposition,[],[f27,f25]) ).
thf(f34,plain,
( $true
= ( moreis @ u @ z ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f35,plain,
! [X0: nat,X1: nat] :
( ( $true != $true )
| ( $true
!= ( moreis @ X0 @ X1 ) )
| ( ( some @ ( diffprop @ ( pl @ y @ X0 ) @ ( pl @ x @ X1 ) ) )
= $true ) ),
inference(constrained_superposition,[],[f32,f30]) ).
thf(f36,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( moreis @ X0 @ X1 ) )
| ( ( some @ ( diffprop @ ( pl @ y @ X0 ) @ ( pl @ x @ X1 ) ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f37,plain,
( ( $true
= ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f36,f34]) ).
thf(f38,plain,
( $true
= ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ) ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f39,plain,
$false,
inference(forward_subsumption_resolution,[],[f38,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM690^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n013.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 12:38:51 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.22 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.20/0.27 % (2042461)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (2042466)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=113927192:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.27 % (2042466) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2042461-2042466"...
% 0.20/0.27 % (2042466)...printing done.
% 0.20/0.27 % (2042466)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (2042466)------------------------------
% 0.20/0.27 % (2042466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (2042466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (2042466)CaDiCaL version: 2.1.3
% 0.20/0.27 % (2042466)Termination reason: Refutation
% 0.20/0.27 % (2042466)Time elapsed: 0.002 s
% 0.20/0.27 % (2042466)Peak memory usage: 12 MB
% 0.20/0.27 % (2042466)Instructions burned: 4 (million)
% 0.20/0.27 % (2042461)Success in time 0.038 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------