%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM769^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:19:30 AM UTC 2026
% Result : Theorem 0.06s 0.20s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 83 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 151 ( 11 ~; 6 |; 0 &; 128 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 ^; 20 !; 0 ?; 20 :)
% 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,
moref: frac > frac > $o ).
thf(func_def_4,type,
eq: frac > frac > $o ).
thf(func_def_5,type,
pf: frac > frac > frac ).
thf(func_def_6,type,
mf: frac > frac > frac ).
thf(f1,axiom,
moref @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: frac,X1: frac] :
( ( eq @ X0 @ X1 )
=> ( eq @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz38) ).
thf(f3,axiom,
! [X0: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67c) ).
thf(f4,conjecture,
eq @ x @ ( pf @ y @ ( mf @ x @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67d) ).
thf(f5,negated_conjecture,
~ ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
moref @ x @ y,
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( moref @ x @ y )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: frac,X1: frac] :
( ( eq @ X0 @ X1 )
=> ( eq @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
= $true )
=> ( ( eq @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
! [X0: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 )
= $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
( ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) )
!= $true ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) )
!= $true ),
inference(flattening,[],[f13]) ).
thf(f15,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X1 @ X0 )
= $true )
| ( ( eq @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f16,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f17,plain,
( ( moref @ x @ y )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( eq @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f19,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( eq @ ( pf @ X1 @ ( mf @ X0 @ X1 ) ) @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f20,plain,
( ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f50,plain,
( ( $true != $true )
| ( $true
= ( eq @ ( pf @ y @ ( mf @ x @ y ) ) @ x ) ) ),
inference(constrained_superposition,[],[f19,f17]) ).
thf(f51,plain,
( $true
= ( eq @ ( pf @ y @ ( mf @ x @ y ) ) @ x ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f55,plain,
( ( $true != $true )
| ( ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) )
= $true ) ),
inference(constrained_superposition,[],[f18,f51]) ).
thf(f56,plain,
( ( eq @ x @ ( pf @ y @ ( mf @ x @ y ) ) )
= $true ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f59,plain,
$false,
inference(forward_subsumption_resolution,[],[f56,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM769^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.15 % Computer : n012.cluster.edu
% 0.06/0.15 % Model : x86_64 x86_64
% 0.06/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.15 % Memory : 8046.5625MB
% 0.06/0.15 % OS : Linux 6.8.0-71-generic
% 0.06/0.15 % CPULimit : 300
% 0.06/0.15 % WCLimit : 300
% 0.06/0.15 % DateTime : Tue Sep 29 12:54:19 UTC 2026
% 0.06/0.15 % CPUTime :
% 0.06/0.15 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.17 Running first-order model finding
% 0.06/0.17 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.20 % (64269)Will run a generic schedule for satisfiability detection.
% 0.06/0.20 % (64275)% WARNING: option uhcvi not known.
% 0.06/0.20 % (64274)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3222012110_3000 on theBenchmark for (3000ds/0Mi)
% 0.06/0.20 % (64275)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1688665081:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.06/0.20 % (64277)dis+10_1_sil=32000:sp=arity:random_seed=1956326250:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.06/0.20 % (64278)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3909353399:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.06/0.20 % (64276)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4168998478:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.06/0.20 % (64279)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4263590004:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.06/0.20 % (64278)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.20 % (64275)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.20 % (64280)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1430801394:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.06/0.20 % (64275)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.06/0.20 % Exception at run slice level
% 0.06/0.20 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.06/0.20 % (64279) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-64269-64279"...
% 0.06/0.20 % (64277) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-64269-64277"...
% 0.06/0.20 % (64275) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-64269-64275"...
% 0.06/0.20 % (64280) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-64269-64280"...
% 0.06/0.20 % (64278) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-64269-64278"...
% 0.06/0.20 % (64277)...printing done.
% 0.06/0.20 % (64275)...printing done.
% 0.06/0.20 % (64279)...printing done.
% 0.06/0.20 % (64280)...printing done.
% 0.06/0.20 % (64278)...printing done.
% 0.06/0.20 % (64277)Refutation found. Thanks to Tanya!
% 0.06/0.20 % SZS status Theorem for theBenchmark
% 0.06/0.20 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.20 % (64277)------------------------------
% 0.06/0.20 % (64277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.20 % (64277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.20 % (64277)CaDiCaL version: 2.1.3
% 0.06/0.20 % (64277)Termination reason: Refutation
% 0.06/0.20 % (64277)Time elapsed: 0.003 s
% 0.06/0.20 % (64277)Peak memory usage: 12 MB
% 0.06/0.20 % (64277)Instructions burned: 4 (million)
% 0.06/0.20 % (64269)Success in time 0.023 s
% 0.06/0.20 % Vampire exiting
%------------------------------------------------------------------------------