%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM665^1 : TPTP v9.3.1. Released v3.7.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:19:15 AM UTC 2026
% Result : Theorem 0.06s 0.24s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 174 ( 42 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 208 ( 22 ~; 15 |; 0 &; 162 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 55 ( 22 ^; 33 !; 0 ?; 55 :)
% 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,
moreis: nat > nat > $o ).
thf(func_def_5,type,
some: ( nat > $o ) > $o ).
thf(func_def_6,type,
diffprop: nat > nat > nat > $o ).
thf(func_def_7,type,
lessis: 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,
moreis @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
( some
@ ^ [X0: nat] : ( diffprop @ y @ z @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f3,axiom,
! [X0: nat,X1: nat,X2: nat] :
( ( some
@ ^ [X3: nat] : ( diffprop @ X1 @ X0 @ X3 ) )
=> ( ( lessis @ X1 @ X2 )
=> ( some
@ ^ [X3: nat] : ( diffprop @ X2 @ X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz16b) ).
thf(f4,axiom,
! [X0: nat,X1: nat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13) ).
thf(f5,conjecture,
( some
@ ^ [X0: nat] : ( diffprop @ x @ z @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz16c) ).
thf(f6,negated_conjecture,
~ ( some
@ ^ [X0: nat] : ( diffprop @ x @ z @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
moreis @ x @ y,
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( moreis @ x @ y )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( some
@ ^ [X0: nat] : ( diffprop @ y @ z @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ y @ z @ Y0 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( some
@ ^ [X3: nat] : ( diffprop @ X1 @ X0 @ X3 ) )
=> ( ( lessis @ X1 @ X2 )
=> ( some
@ ^ [X4: nat] : ( diffprop @ X2 @ X0 @ X4 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X1 @ X0 @ Y0 ) ) )
=> ( ( ( lessis @ X1 @ X2 )
= $true )
=> ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X0 @ X1 )
= $true )
=> ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( some
@ ^ [X0: nat] : ( diffprop @ x @ z @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ x @ z @ Y0 ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ x @ z @ Y0 ) ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X0 @ Y0 ) ) )
| ( ( lessis @ X1 @ X2 )
!= $true )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X1 @ X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f19,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X0 @ Y0 ) ) )
| ( ( lessis @ X1 @ X2 )
!= $true )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X1 @ X0 @ Y0 ) ) ) ),
inference(flattening,[],[f18]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X1 @ X0 )
= $true )
| ( ( moreis @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f21,plain,
( ( moreis @ x @ y )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f22,plain,
( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ y @ z @ Y0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X2 @ X0 @ Y0 ) ) )
| ( ( lessis @ X1 @ X2 )
!= $true )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X1 @ X0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f24,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f25,plain,
( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ x @ z @ Y0 ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f28,plain,
( $true
!= ( some @ ( diffprop @ x @ z ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f29,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
!= ( some @ ( diffprop @ X1 @ X0 ) ) )
| ( ( lessis @ X1 @ X2 )
!= $true )
| ( $true
= ( some @ ( diffprop @ X2 @ X0 ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f30,plain,
( $true
= ( some @ ( diffprop @ y @ z ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f44,plain,
( ( $true != $true )
| ( $true
= ( lessis @ y @ x ) ) ),
inference(constrained_superposition,[],[f24,f21]) ).
thf(f45,plain,
( $true
= ( lessis @ y @ x ) ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f53,plain,
! [X0: nat] :
( ( $true != $true )
| ( $true
!= ( lessis @ y @ X0 ) )
| ( $true
= ( some @ ( diffprop @ X0 @ z ) ) ) ),
inference(constrained_superposition,[],[f29,f30]) ).
thf(f54,plain,
! [X0: nat] :
( ( $true
!= ( lessis @ y @ X0 ) )
| ( $true
= ( some @ ( diffprop @ X0 @ z ) ) ) ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f57,plain,
( ( $true != $true )
| ( $true
= ( some @ ( diffprop @ x @ z ) ) ) ),
inference(constrained_superposition,[],[f54,f45]) ).
thf(f60,plain,
( $true
= ( some @ ( diffprop @ x @ z ) ) ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f64,plain,
$true != $true,
inference(constrained_superposition,[],[f28,f60]) ).
thf(f67,plain,
$false,
inference(trivial_inequality_removal,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM665^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.17 % Computer : n007.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 12:32:11 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20 Running first-order model finding
% 0.06/0.20 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
% 0.06/0.24 % (3293195)Will run a generic schedule for satisfiability detection.
% 0.06/0.24 % (3293206)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=312979641:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.24 % (3293206) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3293195-3293206"...
% 0.06/0.24 % (3293201)% WARNING: option uhcvi not known.
% 0.06/0.24 % (3293206)...printing done.
% 0.06/0.24 % (3293206)Refutation found. Thanks to Tanya!
% 0.06/0.24 % SZS status Theorem for theBenchmark
% 0.06/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.24 % (3293206)------------------------------
% 0.06/0.24 % (3293206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.24 % (3293206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.24 % (3293206)CaDiCaL version: 2.1.3
% 0.06/0.24 % (3293206)Termination reason: Refutation
% 0.06/0.24 % (3293206)Time elapsed: 0.002 s
% 0.06/0.24 % (3293206)Peak memory usage: 12 MB
% 0.06/0.24 % (3293206)Instructions burned: 4 (million)
% 0.06/0.24 % (3293195)Success in time 0.03 s
% 0.06/0.24 % Vampire exiting
%------------------------------------------------------------------------------