%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM701^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 : n012.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:21 AM UTC 2026
% Result : Theorem 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 18 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 85 ( 9 ~; 4 |; 0 &; 69 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% 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,
less: nat > nat > $o ).
thf(func_def_3,type,
suc: nat > nat ).
thf(func_def_5,type,
lessis: nat > nat > $o ).
thf(func_def_6,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
n_1: nat ).
thf(f1,axiom,
less @ y @ ( suc @ x ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f2,axiom,
! [X0: nat,X1: nat] :
( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz26) ).
thf(f3,axiom,
! [X0: nat] :
( ( suc @ X0 )
= ( pl @ X0 @ n_1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4e) ).
thf(f4,conjecture,
lessis @ y @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz26a) ).
thf(f5,negated_conjecture,
~ ( lessis @ y @ x ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
less @ y @ ( suc @ x ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( less @ y @ ( suc @ x ) )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: nat,X1: nat] :
( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
=> ( lessis @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
= $true )
=> ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
~ ( lessis @ y @ x ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
( ( lessis @ y @ x )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( ( lessis @ y @ x )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X1 @ X0 )
= $true )
| ( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f14,plain,
( ( less @ y @ ( suc @ x ) )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X1 @ X0 )
= $true )
| ( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f17,plain,
( ( lessis @ y @ x )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( less @ X1 @ ( suc @ X0 ) ) )
| ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(forward_demodulation,[],[f15,f16]) ).
thf(f34,plain,
( ( $true != $true )
| ( ( lessis @ y @ x )
= $true ) ),
inference(constrained_superposition,[],[f20,f14]) ).
thf(f35,plain,
( ( lessis @ y @ x )
= $true ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f37,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM701^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.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 12:41:34 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.13 Running first-order model finding
% 0.08/0.13 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.08/0.16 % (49740)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (49753)% WARNING: option uhcvi not known.
% 0.08/0.16 % (49755)dis+10_1_sil=32000:sp=arity:random_seed=4051180546:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (49752)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2131883779_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (49757)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=801412072:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16 % (49753)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3116792111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (49754)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3820470487:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (49756)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1572705878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (49753)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16 % (49758)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2213897838:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % Exception at run slice level
% 0.08/0.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.16 % (49753)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.16 % (49756)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16 % (49757) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49757"...
% 0.08/0.16 % (49753) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49753"...
% 0.08/0.16 % (49755) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49755"...
% 0.08/0.16 % (49756) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49756"...
% 0.08/0.16 % (49758) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49758"...
% 0.08/0.16 % (49754) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-49740-49754"...
% 0.08/0.16 % (49757)...printing done.
% 0.08/0.16 % (49753)...printing done.
% 0.08/0.16 % (49755)...printing done.
% 0.08/0.16 % (49756)...printing done.
% 0.08/0.16 % (49758)...printing done.
% 0.08/0.16 % (49754)...printing done.
% 0.08/0.16 % (49757)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Theorem for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16 % (49757)------------------------------
% 0.08/0.16 % (49757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (49757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (49757)CaDiCaL version: 2.1.3
% 0.08/0.16 % (49757)Termination reason: Refutation
% 0.08/0.16 % (49757)Time elapsed: 0.001 s
% 0.08/0.16 % (49757)Peak memory usage: 12 MB
% 0.08/0.16 % (49757)Instructions burned: 2 (million)
% 0.08/0.16 % (49740)Success in time 0.026 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------