%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM652^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 : 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:13 AM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 14 unt; 0 typ; 2 def)
% Number of atoms : 150 ( 55 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 201 ( 67 ~; 18 |; 4 &; 86 @)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 16 :)
% 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,
more: nat > nat > $o ).
thf(func_def_4,type,
less: nat > nat > $o ).
thf(func_def_7,type,
vNOT: $o > $o ).
thf(f1,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f3,axiom,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ( X0 != X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
thf(f4,conjecture,
~ ( less @ x @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10c) ).
thf(f5,negated_conjecture,
~ ~ ( less @ x @ y ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f6]) ).
thf(f10,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ( X0 != X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( X0 != X1 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ~ ( less @ x @ y ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( ( less @ x @ y )
!= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f7]) ).
thf(f16,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( X0 != X1 ) ) ) ),
inference(flattening,[],[f11]) ).
thf(f17,plain,
( ( less @ x @ y )
= $true ),
inference(flattening,[],[f13]) ).
thf(f18,plain,
( ( x = y )
| ( ( more @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( ( less @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( more @ X0 @ X1 )
!= $true )
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( ( less @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( more @ X0 @ X1 )
!= $true )
| ( X0 != X1 ) ) ),
inference(flattening,[],[f20]) ).
thf(f22,plain,
( ( x = y )
| ( ( more @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f25,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f26,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f27,plain,
( ( less @ x @ y )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f31,definition,
( spl0_1
<=> ( ( more @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f33,plain,
( ( ( more @ x @ y )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f35,definition,
( spl0_2
<=> ( x = y ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f37,plain,
( ( x = y )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f38,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f22,f35,f31]) ).
thf(f50,plain,
( ( $true != $true )
| ( x != y ) ),
inference(constrained_superposition,[],[f26,f27]) ).
thf(f54,plain,
x != y,
inference(trivial_inequality_removal,[],[f50]) ).
thf(f56,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f54,f37]) ).
thf(f57,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f56]) ).
thf(f61,plain,
( ( $true != $true )
| ( ( more @ x @ y )
!= $true ) ),
inference(constrained_superposition,[],[f25,f27]) ).
thf(f62,plain,
( ( more @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f64,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f62,f33]) ).
thf(f65,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f64]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f38]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f57]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f65]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s3,s4]) ).
thf(f66,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM652^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n001.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 12:38:06 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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.19/0.26 % (1174952)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (1174965)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3481406221:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.26 % (1174965) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1174952-1174965"...
% 0.19/0.26 % (1174965)...printing done.
% 0.19/0.26 % (1174961)% WARNING: option uhcvi not known.
% 0.19/0.26 % (1174965)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (1174965)------------------------------
% 0.19/0.26 % (1174965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (1174965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (1174965)CaDiCaL version: 2.1.3
% 0.19/0.26 % (1174965)Termination reason: Refutation
% 0.19/0.26 % (1174965)Time elapsed: 0.002 s
% 0.19/0.26 % (1174965)Peak memory usage: 12 MB
% 0.19/0.26 % (1174965)Instructions burned: 3 (million)
% 0.19/0.26 % (1174952)Success in time 0.028 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------