%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM770^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:50 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 141 ( 41 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 244 ( 23 ~; 18 |; 0 &; 194 @)
% ( 0 <=>; 9 =>; 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 : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 0 ^; 44 !; 0 ?; 44 :)
% 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,
v: frac ).
thf(func_def_3,type,
moref: frac > frac > $o ).
thf(func_def_5,type,
eq: frac > frac > $o ).
thf(func_def_6,type,
pf: frac > frac > frac ).
thf(func_def_7,type,
mf: frac > frac > frac ).
thf(f1,axiom,
moref @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
eq @ ( pf @ y @ v ) @ x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).
thf(f3,axiom,
! [X0: frac,X2: frac,X1: frac,X3: frac] :
( ( eq @ ( pf @ X1 @ X2 ) @ X0 )
=> ( ( eq @ ( pf @ X1 @ X3 ) @ X0 )
=> ( eq @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67b) ).
thf(f4,axiom,
! [X1: frac,X0: frac] :
( ( moref @ X0 @ X1 )
=> ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67c) ).
thf(f5,conjecture,
eq @ v @ ( mf @ x @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67e) ).
thf(f6,negated_conjecture,
~ ( eq @ v @ ( mf @ x @ y ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ ( pf @ X2 @ X1 ) @ X0 )
=> ( ( eq @ ( pf @ X2 @ X3 ) @ X0 )
=> ( eq @ X1 @ X3 ) ) ),
inference(rectify,[],[f3]) ).
thf(f8,plain,
! [X0: frac,X1: frac,X3: frac,X2: frac] :
( ( ( eq @ ( pf @ X2 @ X1 ) @ X0 )
= $true )
=> ( ( ( eq @ ( pf @ X2 @ X3 ) @ X0 )
= $true )
=> ( $true
= ( eq @ X1 @ X3 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
eq @ ( pf @ y @ v ) @ x,
inference(rectify,[],[f2]) ).
thf(f10,plain,
( ( eq @ ( pf @ y @ v ) @ x )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: frac,X1: frac] :
( ( moref @ X1 @ X0 )
=> ( eq @ ( pf @ X0 @ ( mf @ X1 @ X0 ) ) @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f12,plain,
! [X1: frac,X0: frac] :
( ( $true
= ( moref @ X1 @ X0 ) )
=> ( $true
= ( eq @ ( pf @ X0 @ ( mf @ X1 @ X0 ) ) @ X1 ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
moref @ x @ y,
inference(rectify,[],[f1]) ).
thf(f14,plain,
( ( moref @ x @ y )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( eq @ v @ ( mf @ x @ y ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
( ( eq @ v @ ( mf @ x @ y ) )
!= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ( eq @ v @ ( mf @ x @ y ) )
!= $true ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
! [X0: frac,X1: frac,X3: frac,X2: frac] :
( ( $true
= ( eq @ X1 @ X3 ) )
| ( ( eq @ ( pf @ X2 @ X3 ) @ X0 )
!= $true )
| ( ( eq @ ( pf @ X2 @ X1 ) @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f19,plain,
! [X0: frac,X2: frac,X1: frac,X3: frac] :
( ( ( eq @ ( pf @ X2 @ X1 ) @ X0 )
!= $true )
| ( $true
= ( eq @ X1 @ X3 ) )
| ( ( eq @ ( pf @ X2 @ X3 ) @ X0 )
!= $true ) ),
inference(flattening,[],[f18]) ).
thf(f20,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( moref @ X1 @ X0 ) )
| ( $true
= ( eq @ ( pf @ X0 @ ( mf @ X1 @ X0 ) ) @ X1 ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f21,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ ( pf @ X1 @ X2 ) @ X0 )
!= $true )
| ( ( eq @ X2 @ X3 )
= $true )
| ( ( eq @ ( pf @ X1 @ X3 ) @ X0 )
!= $true ) ),
inference(rectify,[],[f19]) ).
thf(f22,plain,
( ( eq @ ( pf @ y @ v ) @ x )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
( ( eq @ v @ ( mf @ x @ y ) )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f24,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( eq @ ( pf @ X1 @ X3 ) @ X0 )
!= $true )
| ( ( eq @ ( pf @ X1 @ X2 ) @ X0 )
!= $true )
| ( ( eq @ X2 @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f25,plain,
! [X0: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X0 @ ( mf @ X1 @ X0 ) ) @ X1 ) )
| ( $true
!= ( moref @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f26,plain,
( ( moref @ x @ y )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f29,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( $true != $true )
| ( $true
!= ( eq @ ( pf @ X0 @ X2 ) @ X1 ) )
| ( ( eq @ X2 @ ( mf @ X1 @ X0 ) )
= $true )
| ( $true
!= ( moref @ X1 @ X0 ) ) ),
inference(superposition,[],[f24,f25]) ).
thf(f31,plain,
! [X2: frac,X0: frac,X1: frac] :
( ( $true
!= ( eq @ ( pf @ X0 @ X2 ) @ X1 ) )
| ( $true
!= ( moref @ X1 @ X0 ) )
| ( ( eq @ X2 @ ( mf @ X1 @ X0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f37,plain,
( ( $true != $true )
| ( ( eq @ v @ ( mf @ x @ y ) )
= $true )
| ( ( moref @ x @ y )
!= $true ) ),
inference(superposition,[],[f31,f22]) ).
thf(f41,plain,
( ( ( moref @ x @ y )
!= $true )
| ( ( eq @ v @ ( mf @ x @ y ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f42,plain,
( ( eq @ v @ ( mf @ x @ y ) )
= $true ),
inference(forward_subsumption_resolution,[],[f41,f26]) ).
thf(f43,plain,
$false,
inference(forward_subsumption_resolution,[],[f42,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM770^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:00:50 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.20/0.26 % (1199703)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.26 % (1199712)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3169267232:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.26 % (1199712) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1199703-1199712"...
% 0.20/0.26 % (1199712)...printing done.
% 0.20/0.26 % (1199712)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (1199712)------------------------------
% 0.20/0.26 % (1199712)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (1199712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (1199712)CaDiCaL version: 2.1.3
% 0.20/0.26 % (1199712)Termination reason: Refutation
% 0.20/0.26 % (1199712)Time elapsed: 0.002 s
% 0.20/0.26 % (1199712)Peak memory usage: 12 MB
% 0.20/0.26 % (1199712)Instructions burned: 4 (million)
% 0.20/0.26 % (1199703)Success in time 0.024 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------