TSTP Solution File: DAT067_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT067_1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n024.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:04 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 28 ( 4 unt; 11 typ; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 7 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 54 ( 0 atm; 16 fun; 16 num; 22 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 24 !; 9 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
heap: $tType ).
tff(func_def_0,type,
empty: heap ).
tff(func_def_1,type,
toop: heap > $int ).
tff(func_def_2,type,
sel: ( heap * $int ) > $int ).
tff(func_def_3,type,
length: heap > $int ).
tff(func_def_4,type,
app: ( heap * $int ) > heap ).
tff(func_def_5,type,
get: heap > heap ).
tff(func_def_10,type,
sK0: $int ).
tff(func_def_11,type,
sK1: heap ).
tff(func_def_12,type,
sK2: $int ).
tff(pred_def_1,type,
lsls: ( heap * heap ) > $o ).
tff(f85,plain,
$false,
inference(subsumption_resolution,[],[f84,f72]) ).
tff(f72,plain,
$sum(1,length(sK1)) != sK2,
inference(cnf_transformation,[],[f56]) ).
tff(f56,plain,
( ( $sum(1,length(sK1)) != sK2 )
& ( sel(app(sK1,sK0),sK2) != sel(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f54,f55]) ).
tff(f55,plain,
( ? [X0: $int,X1: heap,X2: $int] :
( ( $sum(1,length(X1)) != X2 )
& ( sel(app(X1,X0),X2) != sel(X1,X2) ) )
=> ( ( $sum(1,length(sK1)) != sK2 )
& ( sel(app(sK1,sK0),sK2) != sel(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f54,plain,
? [X0: $int,X1: heap,X2: $int] :
( ( $sum(1,length(X1)) != X2 )
& ( sel(app(X1,X0),X2) != sel(X1,X2) ) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
? [X0: $int,X2: heap,X1: $int] :
( ( $sum(1,length(X2)) != X1 )
& ( sel(app(X2,X0),X1) != sel(X2,X1) ) ),
inference(ennf_transformation,[],[f41]) ).
tff(f41,plain,
~ ! [X1: $int,X0: $int,X2: heap] :
( ( sel(app(X2,X0),X1) = sel(X2,X1) )
| ( $sum(1,length(X2)) = X1 ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X2: $int,X0: $int,X1: heap] :
( ( $sum(1,length(X1)) = X0 )
| ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X2: $int,X0: $int,X1: heap] :
( ( $sum(1,length(X1)) = X0 )
| ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_2) ).
tff(f84,plain,
$sum(1,length(sK1)) = sK2,
inference(trivial_inequality_removal,[],[f83]) ).
tff(f83,plain,
( ( $sum(1,length(sK1)) = sK2 )
| ( sel(sK1,sK2) != sel(sK1,sK2) ) ),
inference(superposition,[],[f71,f60]) ).
tff(f60,plain,
! [X2: heap,X0: $int,X1: $int] :
( ( sel(X2,X0) = sel(app(X2,X1),X0) )
| ( $sum(1,length(X2)) = X0 ) ),
inference(cnf_transformation,[],[f47]) ).
tff(f47,plain,
! [X0: $int,X1: $int,X2: heap] :
( ( sel(X2,X0) = sel(app(X2,X1),X0) )
| ( $sum(1,length(X2)) = X0 ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X1: $int,X2: $int,X0: heap] :
( ( sel(X0,X1) = sel(app(X0,X2),X1) )
| ( $sum(1,length(X0)) = X1 ) ),
inference(ennf_transformation,[],[f37]) ).
tff(f37,plain,
! [X1: $int,X0: heap,X2: $int] :
( ( $sum(1,length(X0)) != X1 )
=> ( sel(X0,X1) = sel(app(X0,X2),X1) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: heap,X0: $int,X2: $int] :
( ( $sum(1,length(X1)) != X0 )
=> ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_3) ).
tff(f71,plain,
sel(app(sK1,sK0),sK2) != sel(sK1,sK2),
inference(cnf_transformation,[],[f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT067=1 : TPTP v8.1.0. Released v5.5.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n024.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 21:49:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 % (18307)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.20/0.49 % (18315)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.49 % (18323)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.49 % (18307)First to succeed.
% 0.20/0.49 % (18307)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (18307)------------------------------
% 0.20/0.49 % (18307)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (18307)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (18307)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (18307)Memory used [KB]: 5500
% 0.20/0.49 % (18307)Time elapsed: 0.090 s
% 0.20/0.49 % (18307)Instructions burned: 2 (million)
% 0.20/0.49 % (18307)------------------------------
% 0.20/0.49 % (18307)------------------------------
% 0.20/0.49 % (18305)Success in time 0.14 s
%------------------------------------------------------------------------------