%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM788^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 : n019.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:32 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 10 unt; 0 typ; 2 def)
% Number of atoms : 186 ( 48 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 257 ( 72 ~; 22 |; 4 &; 132 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x0: rat ).
thf(func_def_1,type,
y0: rat ).
thf(func_def_2,type,
more: rat > rat > $o ).
thf(func_def_4,type,
less: rat > rat > $o ).
thf(func_def_5,type,
is: rat > rat > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(f1,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
~ ( ( ( is @ X0 @ X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ~ ( is @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81b) ).
thf(f4,conjecture,
~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81g) ).
thf(f5,negated_conjecture,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
more @ x0 @ y0,
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f10,plain,
! [X0: rat,X1: rat] :
~ ( ( ( is @ X0 @ X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ~ ( is @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: rat,X1: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ~ ( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f15,plain,
! [X0: rat,X1: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(flattening,[],[f11]) ).
thf(f16,plain,
( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[],[f13]) ).
thf(f18,plain,
! [X0: rat,X1: rat] :
( ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( less @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( more @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f19,plain,
! [X0: rat,X1: rat] :
( ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( less @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( more @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f18]) ).
thf(f20,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f21,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f23,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f26,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f31,definition,
( spl0_1
<=> ( ( less @ x0 @ y0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f33,plain,
( ( ( less @ x0 @ y0 )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f35,definition,
( spl0_2
<=> ( ( is @ x0 @ y0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f37,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f38,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f26,f35,f31]) ).
thf(f46,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f23,f37]) ).
thf(f49,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f50,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f49,f21]) ).
thf(f51,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f54,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f24,f33]) ).
thf(f57,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f58,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f57,f21]) ).
thf(f59,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f58]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f38]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f51]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f59]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f60,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM788^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.08/0.19 % Computer : n019.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:56:04 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.19/0.28 % (718539)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (718544)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=874004049_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (718545)% WARNING: option uhcvi not known.
% 0.19/0.28 % (718545)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2680676479:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (718546)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3217174230:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (718548)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2814484613:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (718549)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=929328758:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (718545)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28 % (718550)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=484259066:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % (718545)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.28 % (718548)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28 % (718547)dis+10_1_sil=32000:sp=arity:random_seed=4283680656:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (718552)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3889961711:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (718545) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718545"...
% 0.19/0.28 % (718548) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718548"...
% 0.19/0.28 % (718549) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718549"...
% 0.19/0.28 % (718550) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718550"...
% 0.19/0.28 % (718546) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718546"...
% 0.19/0.28 % (718547) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718539-718547"...
% 0.19/0.28 % (718545)...printing done.
% 0.19/0.28 % (718548)...printing done.
% 0.19/0.28 % (718549)...printing done.
% 0.19/0.28 % (718550)...printing done.
% 0.19/0.28 % (718545)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (718545)------------------------------
% 0.19/0.28 % (718545)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (718545)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (718545)CaDiCaL version: 2.1.3
% 0.19/0.28 % (718545)Termination reason: Refutation
% 0.19/0.28 % (718545)Time elapsed: 0.003 s
% 0.19/0.28 % (718545)Peak memory usage: 13 MB
% 0.19/0.28 % (718545)Instructions burned: 3 (million)
% 0.19/0.28 % (718539)Success in time 0.048 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------