%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM786^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 : n016.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:31 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 111 ( 32 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 140 ( 27 ~; 9 |; 1 &; 90 @)
% ( 0 <=>; 13 =>; 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_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',n) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
( ~ ( is @ X0 @ X1 )
=> ( ~ ( more @ X0 @ X1 )
=> ( less @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).
thf(f4,conjecture,
( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81e) ).
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 )
=> ( less @ X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
!= $true )
=> ( ( ( more @ X0 @ X1 )
!= $true )
=> ( ( less @ 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(f14,plain,
( ( more @ x0 @ y0 )
!= $true ),
inference(flattening,[],[f7]) ).
thf(f16,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
!= $true )
=> ( ( ( more @ X0 @ X1 )
!= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ) ),
inference(flattening,[],[f11]) ).
thf(f17,plain,
~ ( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[],[f13]) ).
thf(f19,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( is @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f20,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( is @ X0 @ X1 )
= $true ) ),
inference(flattening,[],[f19]) ).
thf(f21,plain,
( ( ( is @ x0 @ y0 )
!= $true )
& ( ( less @ x0 @ y0 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f22,plain,
( ( more @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X0 @ X1 )
= $true )
| ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f25,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f26,plain,
( ( is @ x0 @ y0 )
!= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f48,plain,
( ( $true != $true )
| ( ( more @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(constrained_superposition,[],[f26,f24]) ).
thf(f49,plain,
( ( ( more @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f52,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(forward_subsumption_resolution,[],[f49,f22]) ).
thf(f55,plain,
$false,
inference(forward_subsumption_resolution,[],[f52,f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM786^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16 % Computer : n016.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 13:01:19 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 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.10/0.25 % (303549)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (303554)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2462975563_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25 % Exception at run slice level
% 0.10/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.25 % (303555)% WARNING: option uhcvi not known.
% 0.10/0.25 % (303562)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2316854758:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.10/0.25 % Exception at run slice level
% 0.10/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.25 % (303555)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2239682990:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.25 % (303555)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % (303555)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.25 % (303555) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-303549-303555"...
% 0.10/0.25 % (303555)...printing done.
% 0.10/0.25 % (303555)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (303555)------------------------------
% 0.10/0.25 % (303555)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (303555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (303555)CaDiCaL version: 2.1.3
% 0.10/0.25 % (303555)Termination reason: Refutation
% 0.10/0.25 % (303555)Time elapsed: 0.003 s
% 0.10/0.25 % (303555)Peak memory usage: 12 MB
% 0.10/0.25 % (303555)Instructions burned: 2 (million)
% 0.10/0.25 % (303549)Success in time 0.056 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------