%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT079_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 : n011.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.07s 0.23s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 24 ( 10 ~; 8 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 33 ( 0 atm; 0 fun; 19 num; 14 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 20 !; 8 ?; 28 :)
% 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_13,type,
sK0: ( $int * list ) > $int ).
tff(func_def_14,type,
sK1: ( $int * list ) > list ).
tff(func_def_15,type,
sK2: ( $int * list ) > $int ).
tff(func_def_16,type,
sK3: ( $int * list ) > list ).
tff(func_def_17,type,
sK4: ( $int * list ) > $int ).
tff(func_def_18,type,
sK5: ( $int * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f5,axiom,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( ( X1 = cons(X2,X3) )
& ( X0 = X2 ) )
| ? [X2: $int,X3: list] :
( ( X1 = cons(X2,X3) )
& in(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_conv) ).
tff(f15,conjecture,
in(2,cons(1,cons(2,cons(3,nil)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f16,negated_conjecture,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(negated_conjecture,[status(cth)],[f15]) ).
tff(f31,plain,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( ( X1 = cons(X2,X3) )
& ( X0 = X2 ) )
| ? [X4: $int,X5: list] :
( ( cons(X4,X5) = X1 )
& in(X0,X5) ) ) ),
inference(rectify,[],[f5]) ).
tff(f34,plain,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(flattening,[],[f16]) ).
tff(f41,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tff(f46,plain,
! [X0: $int,X1: list,X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tff(f62,plain,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(cnf_transformation,[],[f34]) ).
tff(f63,plain,
! [X0: $int,X4: $int,X5: list] :
( in(X0,cons(X4,X5))
| ~ in(X0,X5) ),
inference(equality_resolution,[],[f46]) ).
tff(f64,plain,
! [X2: $int,X3: list,X1: list] :
( ( cons(X2,X3) != X1 )
| in(X2,X1) ),
inference(equality_resolution,[],[f41]) ).
tff(f65,plain,
! [X2: $int,X3: list] : in(X2,cons(X2,X3)),
inference(equality_resolution,[],[f64]) ).
tff(f91,plain,
~ in(2,cons(2,cons(3,nil))),
inference(resolution,[],[f63,f62]) ).
tff(f93,plain,
$false,
inference(forward_subsumption_resolution,[],[f91,f65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT079_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.07/0.18 % Computer : n011.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 00:08:01 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/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.07/0.23 % (3915761)Will run a generic schedule for satisfiability detection.
% 0.07/0.23 % (3915767)% WARNING: option uhcvi not known.
% 0.07/0.23 % (3915767)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3406437448:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.23 % (3915767) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3915761-3915767"...
% 0.07/0.23 % (3915767)...printing done.
% 0.07/0.23 % (3915767)Refutation found. Thanks to Tanya!
% 0.07/0.23 % SZS status Theorem for theBenchmark
% 0.07/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.23 % (3915767)------------------------------
% 0.07/0.23 % (3915767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.23 % (3915767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.23 % (3915767)CaDiCaL version: 2.1.3
% 0.07/0.23 % (3915767)Termination reason: Refutation
% 0.07/0.23 % (3915767)Time elapsed: 0.002 s
% 0.07/0.23 % (3915767)Peak memory usage: 12 MB
% 0.07/0.23 % (3915767)Instructions burned: 3 (million)
% 0.07/0.23 % (3915761)Success in time 0.016 s
% 0.07/0.23 % Vampire exiting
%------------------------------------------------------------------------------