%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM664^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:15 AM UTC 2026
% Result : Theorem 0.27s 0.26s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 16 unt; 0 typ; 2 def)
% Number of atoms : 140 ( 40 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 154 ( 33 ~; 23 |; 0 &; 86 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
y: nat ).
thf(func_def_2,type,
z: nat ).
thf(func_def_3,type,
less: nat > nat > $o ).
thf(func_def_7,type,
vNOT: $o > $o ).
thf(f1,axiom,
less @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f2,axiom,
( ~ ( less @ y @ z )
=> ( y = z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(f4,axiom,
! [X0: nat,X1: nat,X2: nat] :
( ( less @ X0 @ X1 )
=> ( ( less @ X1 @ X2 )
=> ( less @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz15) ).
thf(f5,conjecture,
less @ x @ z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz16b) ).
thf(f6,negated_conjecture,
~ ( less @ x @ z ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
less @ x @ y,
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( less @ x @ y )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ~ ( less @ y @ z )
=> ( y = z ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(fool_elimination,[],[f9]) ).
thf(f13,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( less @ X0 @ X1 )
=> ( ( less @ X1 @ X2 )
=> ( less @ X0 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( less @ X0 @ X1 )
= $true )
=> ( ( ( less @ X1 @ X2 )
= $true )
=> ( ( less @ X0 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( less @ x @ z ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
( ( less @ x @ z )
!= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(flattening,[],[f10]) ).
thf(f19,plain,
( ( less @ x @ z )
!= $true ),
inference(flattening,[],[f16]) ).
thf(f20,plain,
( ( y = z )
| ( ( less @ y @ z )
= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f22,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( less @ X0 @ X2 )
= $true )
| ( ( less @ X1 @ X2 )
!= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f23,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( less @ X0 @ X2 )
= $true )
| ( ( less @ X1 @ X2 )
!= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(flattening,[],[f22]) ).
thf(f24,plain,
( ( less @ x @ y )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f25,plain,
( ( y = z )
| ( ( less @ y @ z )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f27,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ X1 @ X2 )
!= $true )
| ( ( less @ X0 @ X2 )
= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f28,plain,
( ( less @ x @ z )
!= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f33,definition,
( spl0_1
<=> ( ( less @ y @ z )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f35,plain,
( ( ( less @ y @ z )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f37,definition,
( spl0_2
<=> ( y = z ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f39,plain,
( ( y = z )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f40,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f25,f37,f33]) ).
thf(f41,plain,
( ( ( less @ x @ y )
!= $true )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f28,f39]) ).
thf(f54,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f24,f41]) ).
thf(f55,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f54]) ).
thf(f62,plain,
( ! [X0: nat] :
( ( $true != $true )
| ( $true
= ( less @ X0 @ z ) )
| ( $true
!= ( less @ X0 @ y ) ) )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f27,f35]) ).
thf(f63,plain,
( ! [X0: nat] :
( ( $true
!= ( less @ X0 @ y ) )
| ( $true
= ( less @ X0 @ z ) ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f67,plain,
( ( $true != $true )
| ( ( less @ x @ z )
= $true )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f63,f24]) ).
thf(f68,plain,
( ( ( less @ x @ z )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f70,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f68,f28]) ).
thf(f71,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f70]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f40]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f55]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f71]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f72,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM664^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.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 12:39:50 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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.27/0.26 % (1177521)Will run a generic schedule for satisfiability detection.
% 0.27/0.26 % (1177529)dis+10_1_sil=32000:sp=arity:random_seed=553914113:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.26 % (1177529) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1177521-1177529"...
% 0.27/0.26 % (1177529)...printing done.
% 0.27/0.26 % (1177527)% WARNING: option uhcvi not known.
% 0.27/0.26 % (1177529)Refutation found. Thanks to Tanya!
% 0.27/0.26 % SZS status Theorem for theBenchmark
% 0.27/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.26 % (1177529)------------------------------
% 0.27/0.26 % (1177529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.26 % (1177529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.26 % (1177529)CaDiCaL version: 2.1.3
% 0.27/0.26 % (1177529)Termination reason: Refutation
% 0.27/0.26 % (1177529)Time elapsed: 0.002 s
% 0.27/0.26 % (1177529)Peak memory usage: 12 MB
% 0.27/0.26 % (1177529)Instructions burned: 3 (million)
% 0.27/0.26 % (1177521)Success in time 0.042 s
% 0.27/0.26 % Vampire exiting
%------------------------------------------------------------------------------