%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT019_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:47:58 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 25 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 24 ( 11 ~; 8 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 29 ( 0 atm; 0 fun; 19 num; 10 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
collection: $tType ).
tff(func_def_0,type,
empty: collection ).
tff(func_def_1,type,
add: ( $int * collection ) > collection ).
tff(func_def_2,type,
remove: ( $int * collection ) > collection ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f2,axiom,
! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax2) ).
tff(f4,axiom,
! [X0: $int,X1: collection,X2: $int] :
( ( in(X0,X1)
| ( X0 = X2 ) )
<=> in(X0,add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f6,conjecture,
in(3,add(1,add(3,add(5,empty)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f7,negated_conjecture,
~ in(3,add(1,add(3,add(5,empty)))),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
~ in(3,add(1,add(3,add(5,empty)))),
inference(flattening,[],[f7]) ).
tff(f9,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( in(X0,X1)
| ( X0 = X2 )
| ~ in(X0,add(X2,X1)) )
& ( in(X0,add(X2,X1))
| ( ~ in(X0,X1)
& ( X0 != X2 ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f10,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( in(X0,X1)
| ( X0 = X2 )
| ~ in(X0,add(X2,X1)) )
& ( in(X0,add(X2,X1))
| ( ~ in(X0,X1)
& ( X0 != X2 ) ) ) ),
inference(flattening,[],[f9]) ).
tff(f14,plain,
! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
inference(cnf_transformation,[],[f2]) ).
tff(f17,plain,
! [X2: $int,X0: $int,X1: collection] :
( in(X0,add(X2,X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tff(f22,plain,
~ in(3,add(1,add(3,add(5,empty)))),
inference(cnf_transformation,[],[f8]) ).
tff(f31,plain,
~ in(3,add(3,add(5,empty))),
inference(resolution,[],[f17,f22]) ).
tff(f32,plain,
$false,
inference(forward_subsumption_resolution,[],[f31,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT019_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n013.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 00:05:07 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.25 % (1709186)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (1709193)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=979891468:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (1709193) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1709186-1709193"...
% 0.08/0.25 % (1709193)...printing done.
% 0.08/0.25 % (1709193)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (1709193)------------------------------
% 0.08/0.25 % (1709193)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (1709193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (1709193)CaDiCaL version: 2.1.3
% 0.08/0.25 % (1709193)Termination reason: Refutation
% 0.08/0.25 % (1709193)Time elapsed: 0.001 s
% 0.08/0.25 % (1709193)Peak memory usage: 11 MB
% 0.08/0.25 % (1709193)Instructions burned: 1 (million)
% 0.08/0.25 % (1709186)Success in time 0.026 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------