TSTP Solution File: DAT091_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT091_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 16:04:52 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of formulae : 40 ( 8 unt; 16 typ; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 25 ~; 11 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 39 ( 0 atm; 0 fun; 7 num; 32 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 59 !; 0 ?; 59 :)
% 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: ( list * $int ) > $int ).
tff(func_def_12,type,
sK1: ( list * $int ) > list ).
tff(func_def_13,type,
sK2: ( list * $int ) > list ).
tff(func_def_14,type,
sK3: ( list * $int ) > $int ).
tff(func_def_15,type,
sK4: ( $int * list ) > list ).
tff(func_def_16,type,
sK5: ( $int * list ) > $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f196,plain,
$false,
inference(subsumption_resolution,[],[f182,f173]) ).
tff(f173,plain,
! [X3: list,X1: list] : ( X1 = X3 ),
inference(subsumption_resolution,[],[f165,f128]) ).
tff(f128,plain,
! [X0: $int,X1: $int] : ( X0 = X1 ),
inference(trivial_inequality_removal,[],[f126]) ).
tff(f126,plain,
! [X0: $int,X1: $int] :
( ( 0 != 0 )
| ( X0 = X1 ) ),
inference(superposition,[],[f102,f85]) ).
tff(f85,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: $int] : ( 0 = count(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
tff(f102,plain,
! [X2: $int,X3: list,X1: $int] :
( ( 0 != count(X1,X3) )
| ( X1 = X2 ) ),
inference(subsumption_resolution,[],[f101,f78]) ).
tff(f78,plain,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).
tff(f101,plain,
! [X2: $int,X3: list,X1: $int] :
( ( X1 = X2 )
| ( nil = cons(X2,X3) )
| ( 0 != count(X1,X3) ) ),
inference(superposition,[],[f96,f68]) ).
tff(f68,plain,
! [X2: $int,X0: list,X1: $int] :
( ( count(X2,cons(X1,X0)) = count(X2,X0) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f49]) ).
tff(f49,plain,
! [X0: list,X1: $int,X2: $int] :
( ( count(X2,cons(X1,X0)) = count(X2,X0) )
| ( X1 = X2 ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X1: list,X2: $int,X0: $int] :
( ( count(X0,cons(X2,X1)) = count(X0,X1) )
| ( X0 = X2 ) ),
inference(ennf_transformation,[],[f38]) ).
tff(f38,plain,
! [X1: list,X2: $int,X0: $int] :
( ( X0 != X2 )
=> ( count(X0,cons(X2,X1)) = count(X0,X1) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X0: $int,X4: list,X3: $int,X5: $int] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_3) ).
tff(f96,plain,
! [X0: $int,X1: list] :
( ( 0 != count(X0,X1) )
| ( nil = X1 ) ),
inference(superposition,[],[f67,f85]) ).
tff(f67,plain,
! [X2: $int,X0: list,X1: list] :
( ( count(X2,X0) != count(X2,X1) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f45]) ).
tff(f45,plain,
! [X0: list,X1: list] :
( ( X0 = X1 )
| ! [X2: $int] : ( count(X2,X0) != count(X2,X1) ) ),
inference(ennf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: list,X1: list] :
( ( X0 != X1 )
=> ! [X2: $int] : ( count(X2,X0) != count(X2,X1) ) ),
inference(flattening,[],[f34]) ).
tff(f34,plain,
~ ~ ! [X0: list,X1: list] :
( ( X0 != X1 )
=> ! [X2: $int] : ( count(X2,X0) != count(X2,X1) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X8: list,X7: list] :
( ( X7 != X8 )
=> ! [X5: $int] : ( count(X5,X7) != count(X5,X8) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X8: list,X7: list] :
( ( X7 != X8 )
=> ! [X5: $int] : ( count(X5,X7) != count(X5,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f165,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( ( count(X0,X3) != X2 )
| ( X1 = X3 ) ),
inference(superposition,[],[f67,f128]) ).
tff(f182,plain,
! [X2: list] : ( nil != X2 ),
inference(superposition,[],[f78,f173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT091=1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 20:25:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (26233)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (26241)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.53 % (26233)First to succeed.
% 0.19/0.53 % (26258)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.53 % (26249)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.54 % (26258)Also succeeded, but the first one will report.
% 0.19/0.54 % (26233)Refutation found. Thanks to Tanya!
% 0.19/0.54 % SZS status Theorem for theBenchmark
% 0.19/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54 % (26233)------------------------------
% 0.19/0.54 % (26233)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (26233)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (26233)Termination reason: Refutation
% 0.19/0.54
% 0.19/0.54 % (26233)Memory used [KB]: 5500
% 0.19/0.54 % (26233)Time elapsed: 0.130 s
% 0.19/0.54 % (26233)Instructions burned: 6 (million)
% 0.19/0.54 % (26233)------------------------------
% 0.19/0.54 % (26233)------------------------------
% 0.19/0.54 % (26228)Success in time 0.193 s
%------------------------------------------------------------------------------