%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM789^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:18:53 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 180 ( 53 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 257 ( 67 ~; 17 |; 6 &; 142 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x0: rat ).
thf(func_def_1,type,
y0: rat ).
thf(func_def_2,type,
less: rat > rat > $o ).
thf(func_def_4,type,
more: rat > rat > $o ).
thf(func_def_5,type,
is: rat > rat > $o ).
thf(f1,axiom,
less @ x0 @ y0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
~ ( ( ( is @ X0 @ X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ~ ( is @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81b) ).
thf(f4,conjecture,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81h) ).
thf(f5,negated_conjecture,
~ ~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
! [X0: rat,X1: rat] :
~ ( ( ( is @ X0 @ X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ~ ( is @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
! [X0: rat,X1: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(rectify,[],[f5]) ).
thf(f9,plain,
~ ~ ( ( ( more @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f12,plain,
less @ x0 @ y0,
inference(rectify,[],[f1]) ).
thf(f13,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
! [X1: rat,X0: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f15,plain,
( ( ( more @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[],[f9]) ).
thf(f17,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( more @ x0 @ y0 )
= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f19,plain,
! [X1: rat,X0: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f20,plain,
! [X1: rat,X0: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f19]) ).
thf(f21,plain,
! [X0: rat,X1: rat] :
( ( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( is @ X1 @ X0 ) ) )
& ( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) )
& ( ( $true
!= ( is @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f20]) ).
thf(f22,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( more @ x0 @ y0 )
= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f25,plain,
! [X0: rat,X1: rat] :
( ( $true
!= ( is @ X1 @ X0 ) )
| ( $true
!= ( less @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f26,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f31,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
!= $true ) ),
inference(superposition,[],[f24,f26]) ).
thf(f32,plain,
( ( more @ x0 @ y0 )
!= $true ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f33,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
!= $true ) ),
inference(superposition,[],[f25,f22]) ).
thf(f34,plain,
( ( ( more @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f35,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(forward_subsumption_resolution,[],[f34,f32]) ).
thf(f36,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM789^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n007.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 12:54:11 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.22/0.29 % (3317521)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (3317530)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=97303285:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29 % (3317530) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3317521-3317530"...
% 0.22/0.29 % (3317530)...printing done.
% 0.22/0.29 % (3317530)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (3317530)------------------------------
% 0.22/0.29 % (3317530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (3317530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (3317530)CaDiCaL version: 2.1.3
% 0.22/0.29 % (3317530)Termination reason: Refutation
% 0.22/0.29 % (3317530)Time elapsed: 0.001 s
% 0.22/0.29 % (3317530)Peak memory usage: 12 MB
% 0.22/0.29 % (3317530)Instructions burned: 2 (million)
% 0.22/0.29 % (3317521)Success in time 0.026 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------