%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM793^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:33 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 188 ( 54 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 206 ( 24 ~; 19 |; 0 &; 148 @)
% ( 0 <=>; 15 =>; 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 : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 0 ^; 50 !; 0 ?; 50 :)
% 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,
z0: rat ).
thf(func_def_3,type,
more: rat > rat > $o ).
thf(func_def_5,type,
moreis: rat > rat > $o ).
thf(func_def_6,type,
less: rat > rat > $o ).
thf(func_def_7,type,
lessis: rat > rat > $o ).
thf(f1,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
moreis @ y0 @ z0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz83) ).
thf(f4,axiom,
! [X0: rat,X1: rat,X2: rat] :
( ( lessis @ X0 @ X1 )
=> ( ( less @ X1 @ X2 )
=> ( less @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz87a) ).
thf(f5,axiom,
! [X0: rat,X1: rat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz84) ).
thf(f6,axiom,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz82) ).
thf(f7,conjecture,
more @ x0 @ z0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz87d) ).
thf(f8,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f9,plain,
more @ x0 @ y0,
inference(rectify,[],[f1]) ).
thf(f10,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
moreis @ y0 @ z0,
inference(rectify,[],[f2]) ).
thf(f12,plain,
( ( moreis @ y0 @ z0 )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f14,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
=> ( ( more @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( lessis @ X0 @ X1 )
=> ( ( less @ X1 @ X2 )
=> ( less @ X0 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f16,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( ( lessis @ X0 @ X1 )
= $true )
=> ( ( ( less @ X1 @ X2 )
= $true )
=> ( ( less @ X0 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
! [X0: rat,X1: rat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
inference(rectify,[],[f5]) ).
thf(f18,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X0 @ X1 )
= $true )
=> ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f20,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f21,plain,
~ ( more @ x0 @ z0 ),
inference(rectify,[],[f8]) ).
thf(f22,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(fool_elimination,[],[f21]) ).
thf(f23,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(flattening,[],[f22]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X1 @ X0 )
= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f25,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( ( less @ X0 @ X2 )
= $true )
| ( ( less @ X1 @ X2 )
!= $true )
| ( ( lessis @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f26,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( ( less @ X0 @ X2 )
= $true )
| ( ( less @ X1 @ X2 )
!= $true )
| ( ( lessis @ X0 @ X1 )
!= $true ) ),
inference(flattening,[],[f25]) ).
thf(f27,plain,
! [X0: rat,X1: rat] :
( ( ( lessis @ X1 @ X0 )
= $true )
| ( ( moreis @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f28,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f20]) ).
thf(f29,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f30,plain,
( ( moreis @ y0 @ z0 )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f31,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f32,plain,
! [X2: rat,X0: rat,X1: rat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X2 )
!= $true )
| ( ( less @ X0 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f33,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f34,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f35,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(cnf_transformation,[],[f23]) ).
thf(f53,plain,
( ( $true != $true )
| ( $true
= ( lessis @ z0 @ y0 ) ) ),
inference(constrained_superposition,[],[f33,f30]) ).
thf(f54,plain,
( $true
= ( lessis @ z0 @ y0 ) ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f57,plain,
( ( $true != $true )
| ( $true
= ( less @ y0 @ x0 ) ) ),
inference(constrained_superposition,[],[f34,f29]) ).
thf(f59,plain,
( $true
= ( less @ y0 @ x0 ) ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f64,plain,
! [X0: rat] :
( ( $true != $true )
| ( $true
!= ( less @ y0 @ X0 ) )
| ( $true
= ( less @ z0 @ X0 ) ) ),
inference(constrained_superposition,[],[f32,f54]) ).
thf(f65,plain,
! [X0: rat] :
( ( $true
!= ( less @ y0 @ X0 ) )
| ( $true
= ( less @ z0 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f105,plain,
( ( $true != $true )
| ( $true
= ( less @ z0 @ x0 ) ) ),
inference(constrained_superposition,[],[f65,f59]) ).
thf(f109,plain,
( $true
= ( less @ z0 @ x0 ) ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f125,plain,
( ( $true != $true )
| ( ( more @ x0 @ z0 )
= $true ) ),
inference(constrained_superposition,[],[f31,f109]) ).
thf(f126,plain,
( ( more @ x0 @ z0 )
= $true ),
inference(trivial_inequality_removal,[],[f125]) ).
thf(f130,plain,
$false,
inference(forward_subsumption_resolution,[],[f126,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM793^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n016.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 13:04:02 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.22/0.29 % (306647)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (306655)dis+10_1_sil=32000:sp=arity:random_seed=3339082924:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.29 % (306655) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306647-306655"...
% 0.22/0.29 % (306655)...printing done.
% 0.22/0.29 % (306655)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (306655)------------------------------
% 0.22/0.29 % (306655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (306655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (306655)CaDiCaL version: 2.1.3
% 0.22/0.29 % (306655)Termination reason: Refutation
% 0.22/0.29 % (306655)Time elapsed: 0.005 s
% 0.22/0.29 % (306655)Peak memory usage: 12 MB
% 0.22/0.29 % (306655)Instructions burned: 8 (million)
% 0.22/0.29 % (306647)Success in time 0.037 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------