%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM790^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 : n011.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.25s 0.37s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 110 ( 32 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 136 ( 26 ~; 9 |; 1 &; 88 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% 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_3,type,
is: rat > rat > $o ).
thf(func_def_5,type,
less: rat > rat > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(f1,axiom,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(f2,axiom,
! [X0: rat,X1: rat] :
( ~ ( is @ X0 @ X1 )
=> ( ~ ( more @ X0 @ X1 )
=> ( less @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81a) ).
thf(f4,conjecture,
less @ x0 @ y0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81j) ).
thf(f5,negated_conjecture,
~ ( less @ x0 @ y0 ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
~ ( ( ( more @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: rat,X1: rat] :
( ~ ( is @ X0 @ X1 )
=> ( ~ ( more @ X0 @ X1 )
=> ( less @ X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
!= $true )
=> ( ( ( more @ X0 @ X1 )
!= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f12,plain,
~ ( less @ x0 @ y0 ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
~ ( ( ( more @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[],[f7]) ).
thf(f15,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
!= $true )
=> ( ( ( more @ X0 @ X1 )
!= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ) ),
inference(flattening,[],[f9]) ).
thf(f17,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(flattening,[],[f13]) ).
thf(f18,plain,
( ( ( is @ x0 @ y0 )
!= $true )
& ( ( more @ x0 @ y0 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f19,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( is @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f20,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( is @ X0 @ X1 )
= $true ) ),
inference(flattening,[],[f19]) ).
thf(f22,plain,
( ( more @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f23,plain,
( ( is @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( is @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f26,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f51,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
= $true )
| ( ( is @ x0 @ y0 )
= $true ) ),
inference(constrained_superposition,[],[f26,f24]) ).
thf(f52,plain,
( ( ( more @ x0 @ y0 )
= $true )
| ( ( is @ x0 @ y0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f55,plain,
( ( is @ x0 @ y0 )
= $true ),
inference(forward_subsumption_resolution,[],[f52,f22]) ).
thf(f58,plain,
$false,
inference(forward_subsumption_resolution,[],[f55,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM790^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.25 % Computer : n011.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Tue Sep 29 12:57:01 UTC 2026
% 0.12/0.26 % CPUTime :
% 0.12/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.31 Running first-order model finding
% 0.25/0.31 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.25/0.37 % (50071)Will run a generic schedule for satisfiability detection.
% 0.25/0.37 % (50076)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3319664941_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.37 % Exception at run slice level
% 0.25/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.37 % (50079)dis+10_1_sil=32000:sp=arity:random_seed=4149079704:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.37 % (50080)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1584754233:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.37 % (50080)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.37 % (50081)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2826997975:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.37 % (50077)% WARNING: option uhcvi not known.
% 0.25/0.37 % (50078)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=746599014:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.37 % (50082)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3281565016:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.37 % (50080) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-50071-50080"...
% 0.25/0.37 % (50079) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-50071-50079"...
% 0.25/0.37 % (50084)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=147668000:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.25/0.37 % (50081) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-50071-50081"...
% 0.25/0.37 % Exception at run slice level
% 0.25/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.37 % (50082) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-50071-50082"...
% 0.25/0.37 % (50080)...printing done.
% 0.25/0.37 % (50079)...printing done.
% 0.25/0.37 % (50078) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-50071-50078"...
% 0.25/0.37 % (50081)...printing done.
% 0.25/0.37 % (50080)Refutation found. Thanks to Tanya!
% 0.25/0.37 % SZS status Theorem for theBenchmark
% 0.25/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.37 % (50080)------------------------------
% 0.25/0.37 % (50080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (50080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (50080)CaDiCaL version: 2.1.3
% 0.25/0.37 % (50080)Termination reason: Refutation
% 0.25/0.37 % (50080)Time elapsed: 0.004 s
% 0.25/0.37 % (50080)Peak memory usage: 12 MB
% 0.25/0.37 % (50080)Instructions burned: 2 (million)
% 0.25/0.37 % (50071)Success in time 0.05 s
% 0.25/0.37 % Vampire exiting
%------------------------------------------------------------------------------