%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM761^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 : n017.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:48 AM UTC 2026
% Result : Theorem 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 16 unt; 0 typ; 2 def)
% Number of atoms : 234 ( 63 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 375 ( 47 ~; 38 |; 0 &; 272 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?; 64 :)
% 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,
u: frac ).
thf(func_def_4,type,
moref: frac > frac > $o ).
thf(func_def_5,type,
eq: frac > frac > $o ).
thf(func_def_7,type,
pf: frac > frac > frac ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
moref @ z @ u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f4,axiom,
! [X0: frac,X3: frac,X1: frac,X2: frac] :
( ( eq @ X0 @ X1 )
=> ( ( moref @ X2 @ X3 )
=> ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62g) ).
thf(f5,axiom,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( moref @ X0 @ X1 )
=> ( ( moref @ X2 @ X3 )
=> ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz64) ).
thf(f6,conjecture,
moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).
thf(f7,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
thf(f8,plain,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X1 @ X2 )
=> ( ( moref @ X0 @ X3 )
=> ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
! [X2: frac,X3: frac,X1: frac,X0: frac] :
( ( $true
= ( moref @ X1 @ X2 ) )
=> ( ( ( moref @ X0 @ X3 )
= $true )
=> ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) )
= $true ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X0 @ X2 )
=> ( ( moref @ X3 @ X1 )
=> ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f13,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( ( eq @ X0 @ X2 )
= $true )
=> ( ( ( moref @ X3 @ X1 )
= $true )
=> ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f15,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[],[f14]) ).
thf(f18,plain,
moref @ z @ u,
inference(rectify,[],[f2]) ).
thf(f19,plain,
( ( moref @ z @ u )
= $true ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(flattening,[],[f9]) ).
thf(f21,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f15]) ).
thf(f23,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) )
= $true )
| ( ( moref @ X3 @ X1 )
!= $true )
| ( ( eq @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f24,plain,
! [X3: frac,X1: frac,X0: frac,X2: frac] :
( ( ( eq @ X0 @ X2 )
!= $true )
| ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) )
= $true )
| ( ( moref @ X3 @ X1 )
!= $true ) ),
inference(flattening,[],[f23]) ).
thf(f26,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f27,plain,
! [X2: frac,X3: frac,X1: frac,X0: frac] :
( ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( moref @ X0 @ X3 )
!= $true )
| ( $true
!= ( moref @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f28,plain,
! [X1: frac,X3: frac,X2: frac,X0: frac] :
( ( $true
!= ( moref @ X1 @ X2 ) )
| ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( moref @ X0 @ X3 )
!= $true ) ),
inference(flattening,[],[f27]) ).
thf(f29,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ X0 @ X2 )
!= $true )
| ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) )
= $true )
| ( ( moref @ X3 @ X1 )
!= $true ) ),
inference(rectify,[],[f28]) ).
thf(f30,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ X2 @ X3 )
!= $true )
| ( ( moref @ ( pf @ X2 @ X0 ) @ ( pf @ X3 @ X1 ) )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(rectify,[],[f24]) ).
thf(f31,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ X3 @ X1 )
!= $true )
| ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X2 @ X1 ) )
= $true )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f32,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( eq @ X2 @ X3 )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true )
| ( ( moref @ ( pf @ X2 @ X0 ) @ ( pf @ X3 @ X1 ) )
= $true ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f33,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f20]) ).
thf(f34,plain,
( ( moref @ z @ u )
= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f35,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f41,definition,
( spl0_1
<=> ( ( eq @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f43,plain,
( ( ( eq @ x @ y )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f45,definition,
( spl0_2
<=> ( ( moref @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f47,plain,
( ( ( moref @ x @ y )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f48,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f35,f45,f41]) ).
thf(f49,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( moref @ ( pf @ X0 @ z ) @ ( pf @ X1 @ u ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f31,f34]) ).
thf(f52,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( moref @ ( pf @ X0 @ z ) @ ( pf @ X1 @ u ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f66,plain,
( ( $true != $true )
| ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f52,f47]) ).
thf(f69,plain,
( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f66]) ).
thf(f73,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f69,f33]) ).
thf(f74,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f73]) ).
thf(f83,plain,
( ! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( $true
= ( moref @ ( pf @ x @ X0 ) @ ( pf @ y @ X1 ) ) )
| ( $true != $true ) )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f32,f43]) ).
thf(f84,plain,
( ! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( $true
= ( moref @ ( pf @ x @ X0 ) @ ( pf @ y @ X1 ) ) ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f85,plain,
( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true )
| ( $true != $true )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f84,f34]) ).
thf(f90,plain,
( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f91,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f90,f33]) ).
thf(f92,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f91]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f48]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f74]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f92]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f93,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM761^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.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 12:48:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.18/0.27 % (287606)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.18/0.27 % (287611)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2996602136:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.18/0.27 % (287611) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-287606-287611"...
% 0.18/0.27 % (287611)...printing done.
% 0.18/0.27 % (287611)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (287611)------------------------------
% 0.18/0.27 % (287611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (287611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (287611)CaDiCaL version: 2.1.3
% 0.18/0.27 % (287611)Termination reason: Refutation
% 0.18/0.27 % (287611)Time elapsed: 0.003 s
% 0.18/0.27 % (287611)Peak memory usage: 13 MB
% 0.18/0.27 % (287611)Instructions burned: 7 (million)
% 0.18/0.27 % (287606)Success in time 0.031 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------