%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT082_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:15 AM UTC 2026
% Result : Theorem 3.73s 1.46s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number arithmetic : 35 ( 0 atm; 7 fun; 26 num; 2 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 : 17 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 4 !; 0 ?; 4 :)
% 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_12,type,
sK0: ( list * $int ) > $int ).
tff(func_def_13,type,
sK1: ( list * $int ) > list ).
tff(func_def_14,type,
sK2: ( $int * list ) > list ).
tff(func_def_15,type,
sK3: ( $int * list ) > $int ).
tff(func_def_16,type,
sK4: ( $int * list ) > list ).
tff(func_def_17,type,
sK5: ( $int * list ) > $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f7,axiom,
length(nil) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(f8,axiom,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1) ).
tff(f15,conjecture,
length(cons(1,cons(2,nil))) = 2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f16,negated_conjecture,
( ( ~ length(cons(1,cons(2,nil))) ) = 2 ),
inference(negated_conjecture,[status(cth)],[f15]) ).
tff(f32,plain,
2 != length(cons(1,cons(2,nil))),
inference(flattening,[],[f16]) ).
tff(f57,plain,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
inference(cnf_transformation,[],[f8]) ).
tff(f58,plain,
0 = length(nil),
inference(cnf_transformation,[],[f7]) ).
tff(f60,plain,
2 != length(cons(1,cons(2,nil))),
inference(cnf_transformation,[],[f32]) ).
tff(f143,plain,
2 != $sum(1,length(cons(2,nil))),
inference(superposition,[],[f60,f57]) ).
tff(f152,plain,
2 != $sum(1,$sum(1,length(nil))),
inference(forward_demodulation,[],[f143,f57]) ).
tff(f153,plain,
2 != $sum(1,$sum(1,0)),
inference(forward_demodulation,[],[f152,f58]) ).
tff(f154,plain,
$false,
inference(evaluation,[],[f153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT082_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.24 % Computer : n004.cluster.edu
% 0.11/0.24 % Model : x86_64 x86_64
% 0.11/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24 % Memory : 8046.5625MB
% 0.11/0.24 % OS : Linux 6.8.0-71-generic
% 0.11/0.24 % CPULimit : 300
% 0.11/0.24 % WCLimit : 300
% 0.11/0.24 % DateTime : Tue Sep 29 00:07:52 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.29 Running first-order theorem proving
% 0.23/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.73/1.46 % (917047)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.73/1.46 % (917055)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3568167224:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.73/1.46 % (917058)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=2942068234:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.73/1.46 % (917055)First to succeed.
% 3.73/1.46 % (917055)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-917047"
% 3.73/1.46 % (917058)Also succeeded, but the first one will report.
% 3.73/1.46 % (917057)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=4058352261:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.73/1.46 % (917056)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3291615817:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.73/1.46 % (917052)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=4051223501:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.73/1.46 % (917053)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=671783128:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.73/1.46 % (917056)Instruction limit reached!
% 3.73/1.46 % (917056)------------------------------
% 3.73/1.46 % (917056)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.46 % (917056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.46 % (917056)CaDiCaL version: 2.1.3
% 3.73/1.46 % (917056)Termination reason: Instruction limit
% 3.73/1.46 % (917056)Termination phase: Saturation
% 3.73/1.46 % (917056)Time elapsed: 0.006 s
% 3.73/1.46 % (917056)Peak memory usage: 88 MB
% 3.73/1.46 % (917056)Instructions burned: 4 (million)
% 3.73/1.46 % (917054)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2881402258:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.73/1.46 % (917052)Instruction limit reached!
% 3.73/1.46 % (917052)------------------------------
% 3.73/1.46 % (917052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.46 % (917052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.46 % (917052)CaDiCaL version: 2.1.3
% 3.73/1.46 % (917052)Termination reason: Instruction limit
% 3.73/1.46 % (917052)Termination phase: Saturation
% 3.73/1.46 % (917052)Time elapsed: 0.043 s
% 3.73/1.46 % (917052)Peak memory usage: 115 MB
% 3.73/1.46 % (917052)Instructions burned: 12 (million)
% 3.73/1.46 % (917057)Also succeeded, but the first one will report.
% 3.73/1.46 % (917053)Also succeeded, but the first one will report.
% 3.73/1.46 % (917054)Also succeeded, but the first one will report.
% 3.73/1.46 % (917055)Refutation found. Thanks to Tanya!
% 3.73/1.46 % SZS status Theorem for theBenchmark
% 3.73/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.46 % (917055)------------------------------
% 3.73/1.46 % (917055)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.46 % (917055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.46 % (917055)CaDiCaL version: 2.1.3
% 3.73/1.46 % (917055)Termination reason: Refutation
% 3.73/1.46 % (917055)Time elapsed: 0.004 s
% 3.73/1.46 % (917055)Peak memory usage: 89 MB
% 3.73/1.46 % (917055)Instructions burned: 4 (million)
% 3.73/1.46 % (917055)------------------------------
% 3.73/1.46 % (917055)------------------------------
% 3.73/1.46 % (917047)Success in time 0.42 s
% 3.73/1.46 % Vampire exiting
%------------------------------------------------------------------------------