%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM796^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 : n002.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:55 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 215 ( 63 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 303 ( 34 ~; 26 |; 0 &; 228 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 0 ^; 70 !; 0 ?; 70 :)
% 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,
z0: rat ).
thf(func_def_3,type,
u0: rat ).
thf(func_def_4,type,
less: rat > rat > $o ).
thf(func_def_6,type,
lessis: rat > rat > $o ).
thf(func_def_7,type,
pl: rat > rat > rat ).
thf(func_def_8,type,
more: rat > rat > $o ).
thf(func_def_9,type,
moreis: rat > rat > $o ).
thf(f1,axiom,
less @ x0 @ y0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f2,axiom,
lessis @ z0 @ u0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz82) ).
thf(f4,axiom,
! [X3: rat,X0: rat,X1: rat,X2: rat] :
( ( more @ X0 @ X1 )
=> ( ( moreis @ X2 @ X3 )
=> ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz99b) ).
thf(f5,axiom,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz83) ).
thf(f6,axiom,
! [X0: rat,X1: rat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz85) ).
thf(f7,conjecture,
less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz99d) ).
thf(f8,negated_conjecture,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f9,plain,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
inference(rectify,[],[f5]) ).
thf(f10,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
=> ( ( more @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: rat,X1: rat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f12,plain,
! [X1: rat,X0: rat] :
( ( ( lessis @ X0 @ X1 )
= $true )
=> ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
lessis @ z0 @ u0,
inference(rectify,[],[f2]) ).
thf(f14,plain,
( ( lessis @ z0 @ u0 )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f16,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
less @ x0 @ y0,
inference(rectify,[],[f1]) ).
thf(f18,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(rectify,[],[f8]) ).
thf(f20,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(fool_elimination,[],[f19]) ).
thf(f21,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( more @ X1 @ X2 )
=> ( ( moreis @ X3 @ X0 )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f22,plain,
! [X1: rat,X3: rat,X0: rat,X2: rat] :
( ( ( more @ X1 @ X2 )
= $true )
=> ( ( ( moreis @ X3 @ X0 )
= $true )
=> ( ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f23,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(flattening,[],[f20]) ).
thf(f24,plain,
! [X1: rat,X0: rat] :
( ( ( more @ X1 @ X0 )
= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f25,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f26,plain,
! [X1: rat,X0: rat] :
( ( ( moreis @ X1 @ X0 )
= $true )
| ( ( lessis @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f27,plain,
! [X1: rat,X3: rat,X0: rat,X2: rat] :
( ( ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X0 ) )
= $true )
| ( ( moreis @ X3 @ X0 )
!= $true )
| ( ( more @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f22]) ).
thf(f28,plain,
! [X3: rat,X2: rat,X0: rat,X1: rat] :
( ( ( moreis @ X3 @ X0 )
!= $true )
| ( ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X0 ) )
= $true )
| ( ( more @ X1 @ X2 )
!= $true ) ),
inference(flattening,[],[f27]) ).
thf(f29,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( $true
!= ( moreis @ X0 @ X2 ) )
| ( ( more @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) )
= $true )
| ( ( more @ X3 @ X1 )
!= $true ) ),
inference(rectify,[],[f28]) ).
thf(f30,plain,
! [X0: rat,X1: rat] :
( ( $true
= ( moreis @ X0 @ X1 ) )
| ( ( lessis @ X1 @ X0 )
!= $true ) ),
inference(rectify,[],[f26]) ).
thf(f31,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(rectify,[],[f24]) ).
thf(f32,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(cnf_transformation,[],[f23]) ).
thf(f33,plain,
! [X2: rat,X3: rat,X0: rat,X1: rat] :
( ( ( more @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) )
= $true )
| ( $true
!= ( moreis @ X0 @ X2 ) )
| ( ( more @ X3 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f34,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f35,plain,
! [X0: rat,X1: rat] :
( ( ( lessis @ X1 @ X0 )
!= $true )
| ( $true
= ( moreis @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f36,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f37,plain,
( ( lessis @ z0 @ u0 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f38,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
!= $true )
| ( ( more @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f40,plain,
( ( ( moreis @ u0 @ z0 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f35,f37]) ).
thf(f41,plain,
( ( moreis @ u0 @ z0 )
= $true ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f42,plain,
( ( ( more @ y0 @ x0 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f38,f34]) ).
thf(f43,plain,
( ( more @ y0 @ x0 )
= $true ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f46,plain,
! [X2: rat,X3: rat,X0: rat,X1: rat] :
( ( $true != $true )
| ( $true
= ( less @ ( pl @ X2 @ X3 ) @ ( pl @ X0 @ X1 ) ) )
| ( ( more @ X0 @ X2 )
!= $true )
| ( $true
!= ( moreis @ X1 @ X3 ) ) ),
inference(superposition,[],[f36,f33]) ).
thf(f47,plain,
! [X2: rat,X3: rat,X0: rat,X1: rat] :
( ( $true
= ( less @ ( pl @ X2 @ X3 ) @ ( pl @ X0 @ X1 ) ) )
| ( ( more @ X0 @ X2 )
!= $true )
| ( $true
!= ( moreis @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f48,plain,
( ( ( moreis @ u0 @ z0 )
!= $true )
| ( $true != $true )
| ( ( more @ y0 @ x0 )
!= $true ) ),
inference(superposition,[],[f32,f47]) ).
thf(f51,plain,
( ( ( moreis @ u0 @ z0 )
!= $true )
| ( ( more @ y0 @ x0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f52,plain,
( ( more @ y0 @ x0 )
!= $true ),
inference(forward_subsumption_resolution,[],[f51,f41]) ).
thf(f53,plain,
$false,
inference(forward_subsumption_resolution,[],[f52,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM796^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.09/0.19 % Computer : n002.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:02:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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.28 % (1236675)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (1236684)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1417710488:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (1236684) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1236675-1236684"...
% 0.20/0.28 % (1236684)...printing done.
% 0.20/0.28 % (1236684)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (1236684)------------------------------
% 0.20/0.28 % (1236684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1236684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1236684)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1236684)Termination reason: Refutation
% 0.20/0.28 % (1236684)Time elapsed: 0.002 s
% 0.20/0.28 % (1236684)Peak memory usage: 12 MB
% 0.20/0.28 % (1236684)Instructions burned: 4 (million)
% 0.20/0.28 % (1236675)Success in time 0.034 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------