%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM740^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:19:25 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 154 ( 38 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 179 ( 35 ~; 18 |; 1 &; 108 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 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_3,type,
eq: frac > frac > $o ).
thf(func_def_5,type,
lessf: frac > frac > $o ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: frac,X1: frac] :
( ( eq @ X0 @ X1 )
=> ( eq @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).
thf(f3,axiom,
! [X0: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( lessf @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz42) ).
thf(f4,conjecture,
( ~ ( lessf @ y @ x )
=> ( eq @ y @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz48) ).
thf(f5,negated_conjecture,
~ ( ~ ( lessf @ y @ x )
=> ( eq @ y @ x ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ 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 )
=> ( lessf @ X1 @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( ~ ( lessf @ y @ x )
=> ( eq @ y @ x ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( ( lessf @ y @ x )
!= $true )
=> ( ( eq @ y @ x )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f7]) ).
thf(f15,plain,
~ ( ( ( lessf @ y @ x )
!= $true )
=> ( ( eq @ y @ x )
= $true ) ),
inference(flattening,[],[f13]) ).
thf(f16,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f17,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X1 @ X0 )
= $true )
| ( ( eq @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f18,plain,
! [X0: frac,X1: frac] :
( ( ( lessf @ X1 @ X0 )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f19,plain,
( ( ( eq @ y @ x )
!= $true )
& ( ( lessf @ y @ x )
!= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f20,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
! [X0: frac,X1: frac] :
( ( ( eq @ X0 @ X1 )
!= $true )
| ( ( eq @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f22,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f23,plain,
( ( lessf @ y @ x )
!= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f24,plain,
( ( eq @ y @ x )
!= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f28,definition,
( spl0_1
<=> ( ( moref @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f30,plain,
( ( ( moref @ x @ y )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f32,definition,
( spl0_2
<=> ( ( eq @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f34,plain,
( ( ( eq @ x @ y )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f35,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f20,f32,f28]) ).
thf(f51,plain,
( ( $true != $true )
| ( ( eq @ y @ x )
= $true )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f21,f34]) ).
thf(f53,plain,
( ( ( eq @ y @ x )
= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f55,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f53,f24]) ).
thf(f56,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f55]) ).
thf(f63,plain,
( ( $true != $true )
| ( ( lessf @ y @ x )
= $true )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f22,f30]) ).
thf(f64,plain,
( ( ( lessf @ y @ x )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f66,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f64,f23]) ).
thf(f67,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f66]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f35]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f56]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f67]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f68,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM740^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n001.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 12:53:35 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.26 % (1188071)Will run a generic schedule for satisfiability detection.
% 0.20/0.26 % (1188076)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1527119474_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.26 % Exception at run slice level
% 0.20/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.26 % (1188077)% WARNING: option uhcvi not known.
% 0.20/0.26 % (1188077)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4048655507:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.26 % (1188078)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3424877919:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.26 % (1188079)dis+10_1_sil=32000:sp=arity:random_seed=2869189403:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.26 % (1188080)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1365670038:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.26 % (1188077)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.26 % (1188077)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.26 % (1188082)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1487806981:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.26 % (1188081)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4190603779:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.26 % (1188080)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.26 % (1188077) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188077"...
% 0.20/0.26 % (1188079) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188079"...
% 0.20/0.26 % (1188080) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188080"...
% 0.20/0.26 % (1188084)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2563764653:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.26 % (1188081) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188081"...
% 0.20/0.26 % (1188082) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188082"...
% 0.20/0.26 % Exception at run slice level
% 0.20/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.26 % (1188078) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1188071-1188078"...
% 0.20/0.26 % (1188077)...printing done.
% 0.20/0.26 % (1188079)...printing done.
% 0.20/0.26 % (1188080)...printing done.
% 0.20/0.26 % (1188081)...printing done.
% 0.20/0.26 % (1188082)...printing done.
% 0.20/0.26 % (1188078)...printing done.
% 0.20/0.26 % (1188077)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 % (1188077)------------------------------
% 0.20/0.26 % (1188077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (1188077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (1188077)CaDiCaL version: 2.1.3
% 0.20/0.26 % (1188077)Termination reason: Refutation
% 0.20/0.26 % (1188077)Time elapsed: 0.004 s
% 0.20/0.26 % (1188077)Peak memory usage: 13 MB
% 0.20/0.26 % (1188077)Instructions burned: 3 (million)
% 0.20/0.26 % (1188071)Success in time 0.043 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------