%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM660^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 : n018.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:14 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 77 ( 31 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 90 ( 20 ~; 5 |; 1 &; 52 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% 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(f1,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: nat,X1: nat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz11) ).
thf(f3,conjecture,
( ~ ( less @ y @ x )
=> ( y = x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13) ).
thf(f4,negated_conjecture,
~ ( ~ ( less @ y @ x )
=> ( y = x ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: nat,X1: nat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( ~ ( less @ y @ x )
=> ( y = x ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( ( less @ y @ x )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f6]) ).
thf(f12,plain,
~ ( ( ( less @ y @ x )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f10]) ).
thf(f13,plain,
( ( x = y )
| ( ( more @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f15,plain,
( ( x != y )
& ( ( less @ y @ x )
!= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f16,plain,
( ( x = y )
| ( ( more @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f18,plain,
( ( less @ y @ x )
!= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f19,plain,
x != y,
inference(cnf_transformation,[],[f15]) ).
thf(f22,plain,
( ( more @ x @ y )
= $true ),
inference(global_subsumption,[],[f16,f19]) ).
thf(f79,plain,
( ( $true != $true )
| ( ( less @ y @ x )
= $true ) ),
inference(constrained_superposition,[],[f17,f22]) ).
thf(f80,plain,
( ( less @ y @ x )
= $true ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f82,plain,
$false,
inference(forward_subsumption_resolution,[],[f80,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM660^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.09/0.19 % Computer : n018.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 12:35:11 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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.09/0.26 % (14858)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (14865)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=98454730:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (14865) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-14858-14865"...
% 0.09/0.26 % (14865)...printing done.
% 0.09/0.26 % (14865)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (14865)------------------------------
% 0.20/0.26 % (14865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (14865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (14865)CaDiCaL version: 2.1.3
% 0.20/0.26 % (14865)Termination reason: Refutation
% 0.20/0.26 % (14865)Time elapsed: 0.002 s
% 0.20/0.26 % (14865)Peak memory usage: 12 MB
% 0.20/0.26 % (14865)Instructions burned: 2 (million)
% 0.20/0.26 % (14858)Success in time 0.024 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------