%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM758^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 : n001.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:47 AM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 167 ( 49 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 269 ( 27 ~; 22 |; 0 &; 208 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 0 ^; 60 !; 0 ?; 60 :)
% 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,
z: frac ).
thf(func_def_3,type,
moref: frac > frac > $o ).
thf(func_def_4,type,
pf: frac > frac > frac ).
thf(func_def_6,type,
eq: frac > frac > $o ).
thf(f1,axiom,
moref @ ( pf @ z @ x ) @ ( pf @ z @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: frac,X2: frac,X1: frac] :
( ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
=> ( moref @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz63a) ).
thf(f3,axiom,
! [X3: frac,X1: frac,X0: frac,X2: frac] :
( ( moref @ X0 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( moref @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).
thf(f4,axiom,
! [X0: frac,X1: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz58) ).
thf(f5,conjecture,
moref @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz63d) ).
thf(f6,negated_conjecture,
~ ( moref @ x @ y ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
~ ( moref @ x @ y ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( moref @ x @ y )
!= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: frac,X1: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
=> ( moref @ X0 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f12,plain,
! [X2: frac,X1: frac,X0: frac] :
( ( $true
= ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) )
=> ( $true
= ( moref @ X0 @ X2 ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X2 @ X1 )
=> ( ( eq @ X2 @ X3 )
=> ( ( eq @ X1 @ X0 )
=> ( moref @ X3 @ X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f14,plain,
! [X1: frac,X3: frac,X0: frac,X2: frac] :
( ( ( moref @ X2 @ X1 )
= $true )
=> ( ( $true
= ( eq @ X2 @ X3 ) )
=> ( ( ( eq @ X1 @ X0 )
= $true )
=> ( ( moref @ X3 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
moref @ ( pf @ z @ x ) @ ( pf @ z @ y ),
inference(rectify,[],[f1]) ).
thf(f16,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ( moref @ x @ y )
!= $true ),
inference(flattening,[],[f8]) ).
thf(f18,plain,
! [X2: frac,X1: frac,X0: frac] :
( ( $true
!= ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) )
| ( $true
= ( moref @ X0 @ X2 ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f19,plain,
! [X1: frac,X3: frac,X0: frac,X2: frac] :
( ( ( moref @ X3 @ X0 )
= $true )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( $true
!= ( eq @ X2 @ X3 ) )
| ( ( moref @ X2 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f20,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
!= ( eq @ X2 @ X3 ) )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( ( moref @ X2 @ X1 )
!= $true )
| ( ( moref @ X3 @ X0 )
= $true ) ),
inference(flattening,[],[f19]) ).
thf(f21,plain,
! [X0: frac,X1: frac,X2: frac] :
( ( ( moref @ ( pf @ X2 @ X1 ) @ ( pf @ X0 @ X1 ) )
!= $true )
| ( ( moref @ X2 @ X0 )
= $true ) ),
inference(rectify,[],[f18]) ).
thf(f22,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X2 @ X1 ) @ ( pf @ X0 @ X1 ) )
!= $true )
| ( ( moref @ X2 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f24,plain,
( ( moref @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f25,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
!= ( eq @ X2 @ X3 ) )
| ( ( moref @ X3 @ X0 )
= $true )
| ( ( moref @ X2 @ X1 )
!= $true )
| ( ( eq @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f26,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f29,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X1 @ X0 ) @ X2 )
= $true )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( $true != $true )
| ( $true
!= ( moref @ ( pf @ X0 @ X1 ) @ X3 ) ) ),
inference(constrained_superposition,[],[f25,f22]) ).
thf(f30,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
!= ( moref @ ( pf @ X0 @ X1 ) @ X3 ) )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( ( moref @ ( pf @ X1 @ X0 ) @ X2 )
= $true ) ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f31,plain,
! [X0: frac] :
( ( $true
= ( moref @ ( pf @ x @ z ) @ X0 ) )
| ( $true != $true )
| ( ( eq @ ( pf @ z @ y ) @ X0 )
!= $true ) ),
inference(constrained_superposition,[],[f30,f26]) ).
thf(f32,plain,
! [X0: frac] :
( ( ( eq @ ( pf @ z @ y ) @ X0 )
!= $true )
| ( $true
= ( moref @ ( pf @ x @ z ) @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f33,plain,
( ( $true != $true )
| ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
= $true ) ),
inference(constrained_superposition,[],[f32,f22]) ).
thf(f34,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
= $true ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f35,plain,
( ( ( moref @ x @ y )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f23,f34]) ).
thf(f37,plain,
( ( moref @ x @ y )
= $true ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f39,plain,
$false,
inference(forward_subsumption_resolution,[],[f37,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM758^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 : n001.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:58:21 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.23 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.28 % (1195623)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.28 % (1195628)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=128920442:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.28 % (1195628) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1195623-1195628"...
% 0.22/0.28 % (1195628)...printing done.
% 0.22/0.28 % (1195628)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Theorem for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (1195628)------------------------------
% 0.22/0.28 % (1195628)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (1195628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (1195628)CaDiCaL version: 2.1.3
% 0.22/0.28 % (1195628)Termination reason: Refutation
% 0.22/0.28 % (1195628)Time elapsed: 0.002 s
% 0.22/0.28 % (1195628)Peak memory usage: 12 MB
% 0.22/0.28 % (1195628)Instructions burned: 4 (million)
% 0.22/0.28 % (1195623)Success in time 0.027 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------