%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT098_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 : Tue Sep 29 09:48:07 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 19 |; 6 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 78 ( 16 atm; 0 fun; 49 num; 13 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 18 !; 4 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_11,type,
sK0: ( $int * list ) > $int ).
tff(func_def_12,type,
sK1: ( $int * list ) > list ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(f5,axiom,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> ( ( X1 = nil )
| ? [X2: $int,X3: list] :
( ( X1 = cons(X2,X3) )
& $lesseq(0,X2)
& $less(X2,X0)
& inRange(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f6,conjecture,
inRange(4,cons(1,cons(3,cons(2,nil)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f7,negated_conjecture,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> ( ( X1 = nil )
| ? [X2: $int,X3: list] :
( ( X1 = cons(X2,X3) )
& ~ $less(X2,0)
& $less(X2,X0)
& inRange(X0,X3) ) ) ),
inference(theory_normalization,[],[f5]) ).
tff(f21,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(flattening,[],[f7]) ).
tff(f26,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 )
| inRange(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tff(f31,plain,
! [X0: $int,X1: list] :
( ( nil != X1 )
| inRange(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tff(f32,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(cnf_transformation,[],[f21]) ).
tff(f33,plain,
! [X0: $int] : inRange(X0,nil),
inference(equality_resolution,[],[f31]) ).
tff(f34,plain,
! [X2: $int,X3: list,X0: $int] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| inRange(X0,cons(X2,X3)) ),
inference(equality_resolution,[],[f26]) ).
tff(f35,plain,
! [X0: $int] : ~ inRange(X0,nil),
inference(consistent_polarity_flipping,[],[f33]) ).
tff(f40,plain,
! [X2: $int,X3: list,X0: $int] :
( ~ inRange(X0,cons(X2,X3))
| ~ $less(X2,X0)
| $less(X2,0)
| inRange(X0,X3) ),
inference(consistent_polarity_flipping,[],[f34]) ).
tff(f41,plain,
inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(consistent_polarity_flipping,[],[f32]) ).
tff(f158,plain,
( ~ $less(1,4)
| $less(1,0)
| inRange(4,cons(3,cons(2,nil))) ),
inference(resolution,[],[f40,f41]) ).
tff(f162,plain,
inRange(4,cons(3,cons(2,nil))),
inference(evaluation,[],[f158]) ).
tff(f169,plain,
( ~ $less(3,4)
| $less(3,0)
| inRange(4,cons(2,nil)) ),
inference(resolution,[],[f162,f40]) ).
tff(f170,plain,
inRange(4,cons(2,nil)),
inference(evaluation,[],[f169]) ).
tff(f171,plain,
( ~ $less(2,4)
| $less(2,0)
| inRange(4,nil) ),
inference(resolution,[],[f170,f40]) ).
tff(f172,plain,
inRange(4,nil),
inference(evaluation,[],[f171]) ).
tff(f173,plain,
$false,
inference(forward_subsumption_resolution,[],[f172,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT098_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17 % Computer : n026.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 00:11:12 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 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.24 % (218943)Will run a generic schedule for satisfiability detection.
% 0.09/0.24 % (218949)% WARNING: option uhcvi not known.
% 0.09/0.24 % (218949)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1206119394:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.24 % (218951)dis+10_1_sil=32000:sp=arity:random_seed=7465902:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.24 % (218950)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1147667214:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.24 % (218948)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3191217837_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.24 % (218953)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1565316885:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.24 % (218952)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2885015587:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.24 % (218954)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3483962835:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.24 % (218948)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.09/0.24 % (218948)Terminated due to inappropriate strategy.
% 0.09/0.24 % (218948)------------------------------
% 0.09/0.24 % (218948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24 % (218948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24 % (218948)CaDiCaL version: 2.1.3
% 0.09/0.24 % (218948)Termination reason: Inappropriate
% 0.09/0.24 % (218948)Time elapsed: 0.001 s
% 0.09/0.24 % (218948)Peak memory usage: 10 MB
% 0.09/0.24 % (218949) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-218943-218949"...
% 0.09/0.24 % (218948)------------------------------
% 0.09/0.24 % (218948)------------------------------
% 0.09/0.24 % (218949)...printing done.
% 0.09/0.24 % (218949)Refutation found. Thanks to Tanya!
% 0.09/0.24 % SZS status Theorem for theBenchmark
% 0.09/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.24 % (218949)------------------------------
% 0.09/0.24 % (218949)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24 % (218949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24 % (218949)CaDiCaL version: 2.1.3
% 0.09/0.24 % (218949)Termination reason: Refutation
% 0.09/0.24 % (218949)Time elapsed: 0.004 s
% 0.09/0.24 % (218949)Peak memory usage: 12 MB
% 0.09/0.24 % (218949)Instructions burned: 7 (million)
% 0.09/0.24 % (218943)Success in time 0.033 s
% 0.09/0.24 % Vampire exiting
%------------------------------------------------------------------------------