%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT081_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:05 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 21 ( 5 atm; 0 fun; 8 num; 8 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 : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 10 !; 1 ?; 11 :)
% 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_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_11,type,
sK0: ( $int * list ) > $int ).
tff(func_def_12,type,
sK1: ( $int * list ) > list ).
tff(func_def_13,type,
sK2: ( $int * list ) > $int ).
tff(func_def_14,type,
sK3: ( $int * list ) > list ).
tff(func_def_15,type,
sK4: ( $int * list ) > $int ).
tff(func_def_16,type,
sK5: ( $int * list ) > list ).
tff(func_def_17,type,
sK6: $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f9,axiom,
! [X0: $int] : ( count(X0,nil) = 0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).
tff(f14,axiom,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> $greater(count(X0,X1),0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_8) ).
tff(f15,conjecture,
! [X0: $int] : ~ in(X0,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f16,negated_conjecture,
~ ! [X0: $int] : ~ in(X0,nil),
inference(negated_conjecture,[status(cth)],[f15]) ).
tff(f18,plain,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> $less(0,count(X0,X1)) ),
inference(theory_normalization,[],[f14]) ).
tff(f36,plain,
? [X0: $int] : in(X0,nil),
inference(ennf_transformation,[],[f16]) ).
tff(f55,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f61,plain,
! [X0: $int,X1: list] :
( ~ in(X0,X1)
| $less(0,count(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
tff(f62,plain,
in(sK6,nil),
inference(cnf_transformation,[],[f36]) ).
tff(f89,plain,
$less(0,count(sK6,nil)),
inference(resolution,[],[f61,f62]) ).
tff(f93,plain,
$less(0,0),
inference(forward_demodulation,[],[f89,f55]) ).
tff(f94,plain,
$false,
inference(evaluation,[],[f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT081_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n009.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 00:08:00 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.22 Running first-order model finding
% 0.09/0.22 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.20/0.27 % (3622629)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (3622652)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3189156652:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (3622652) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3622629-3622652"...
% 0.20/0.27 % (3622652)...printing done.
% 0.20/0.27 % (3622649)% WARNING: option uhcvi not known.
% 0.20/0.27 % (3622652)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (3622652)------------------------------
% 0.20/0.27 % (3622652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3622652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3622652)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3622652)Termination reason: Refutation
% 0.20/0.27 % (3622652)Time elapsed: 0.002 s
% 0.20/0.27 % (3622652)Peak memory usage: 12 MB
% 0.20/0.27 % (3622652)Instructions burned: 4 (million)
% 0.20/0.27 % (3622629)Success in time 0.038 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------