%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM749^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 : n018.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:45 AM UTC 2026
% Result : Theorem 0.21s 0.31s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 61 ( 17 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 89 ( 10 ~; 4 |; 0 &; 72 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: frac ).
thf(func_def_1,type,
y: frac ).
thf(func_def_2,type,
less: frac > frac > $o ).
thf(func_def_3,type,
pf: frac > frac > frac ).
thf(func_def_4,type,
more: frac > frac > $o ).
thf(f1,axiom,
! [X1: frac,X0: frac] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42) ).
thf(f2,axiom,
! [X1: frac,X0: frac] : ( more @ ( pf @ X0 @ X1 ) @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60) ).
thf(f3,conjecture,
less @ x @ ( pf @ x @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60a) ).
thf(f4,negated_conjecture,
~ ( less @ x @ ( pf @ x @ y ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: frac,X1: frac] : ( more @ ( pf @ X1 @ X0 ) @ X1 ),
inference(rectify,[],[f2]) ).
thf(f6,plain,
! [X0: frac,X1: frac] :
( $true
= ( more @ ( pf @ X1 @ X0 ) @ X1 ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: frac,X1: frac] :
( ( more @ X1 @ X0 )
=> ( less @ X0 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( more @ X1 @ X0 ) )
=> ( $true
= ( less @ X0 @ X1 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( less @ x @ ( pf @ x @ y ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
( ( less @ x @ ( pf @ x @ y ) )
!= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ( less @ x @ ( pf @ x @ y ) )
!= $true ),
inference(flattening,[],[f10]) ).
thf(f12,plain,
! [X1: frac,X0: frac] :
( ( $true
!= ( more @ X1 @ X0 ) )
| ( $true
= ( less @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f13,plain,
! [X0: frac,X1: frac] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f12]) ).
thf(f14,plain,
( ( less @ x @ ( pf @ x @ y ) )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X0: frac,X1: frac] :
( $true
= ( more @ ( pf @ X1 @ X0 ) @ X1 ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f16,plain,
! [X0: frac,X1: frac] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
! [X0: frac,X1: frac] :
( ( $true != $true )
| ( ( less @ X0 @ ( pf @ X0 @ X1 ) )
= $true ) ),
inference(superposition,[],[f16,f15]) ).
thf(f19,plain,
! [X0: frac,X1: frac] :
( ( less @ X0 @ ( pf @ X0 @ X1 ) )
= $true ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f20,plain,
$true != $true,
inference(superposition,[],[f14,f19]) ).
thf(f21,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM749^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.09/0.21 % Computer : n018.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 12:52:11 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.26 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.21/0.31 % (24367)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.31 % (24377)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2435570904:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.31 % (24377) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-24367-24377"...
% 0.21/0.31 % (24377)...printing done.
% 0.21/0.31 % (24377)Refutation found. Thanks to Tanya!
% 0.21/0.31 % SZS status Theorem for theBenchmark
% 0.21/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.31 % (24377)------------------------------
% 0.21/0.31 % (24377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (24377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (24377)CaDiCaL version: 2.1.3
% 0.21/0.31 % (24377)Termination reason: Refutation
% 0.21/0.31 % (24377)Time elapsed: 0.001 s
% 0.21/0.31 % (24377)Peak memory usage: 12 MB
% 0.21/0.31 % (24377)Instructions burned: 1 (million)
% 0.21/0.31 % (24367)Success in time 0.04 s
% 0.21/0.31 % Vampire exiting
%------------------------------------------------------------------------------