TSTP Solution File: DAT070_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT070_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_sat --cores 0 -t %d %s
% Computer : n017.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:48 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 26 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 5 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 48 ( 9 atm; 12 fun; 12 num; 15 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 16 !; 6 ?; 22 :)
% 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(f266,plain,
$false,
inference(subsumption_resolution,[],[f260,f22]) ).
tff(f22,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f260,plain,
$less(sK0,sK0),
inference(superposition,[],[f59,f255]) ).
tff(f255,plain,
sK0 = $sum(1,length(sK1)),
inference(trivial_inequality_removal,[],[f253]) ).
tff(f253,plain,
( ( sel(sK1,sK0) != sel(sK1,sK0) )
| ( sK0 = $sum(1,length(sK1)) ) ),
inference(superposition,[],[f60,f58]) ).
tff(f58,plain,
! [X2: $int,X0: $int,X1: heap] :
( ( sel(app(X1,X2),X0) = sel(X1,X0) )
| ( $sum(1,length(X1)) = X0 ) ),
inference(cnf_transformation,[],[f44]) ).
tff(f44,plain,
! [X0: $int,X1: heap,X2: $int] :
( ( $sum(1,length(X1)) = X0 )
| ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X2: $int,X1: heap,X0: $int] :
( ( $sum(1,length(X1)) != X0 )
=> ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_3) ).
tff(f60,plain,
sel(app(sK1,sK2),sK0) != sel(sK1,sK0),
inference(cnf_transformation,[],[f46]) ).
tff(f46,plain,
( ( sel(app(sK1,sK2),sK0) != sel(sK1,sK0) )
& $less(sK0,$sum(1,length(sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f43,f45]) ).
tff(f45,plain,
( ? [X0: $int,X1: heap,X2: $int] :
( ( sel(app(X1,X2),X0) != sel(X1,X0) )
& $less(X0,$sum(1,length(X1))) )
=> ( ( sel(app(sK1,sK2),sK0) != sel(sK1,sK0) )
& $less(sK0,$sum(1,length(sK1))) ) ),
introduced(choice_axiom,[]) ).
tff(f43,plain,
? [X0: $int,X1: heap,X2: $int] :
( ( sel(app(X1,X2),X0) != sel(X1,X0) )
& $less(X0,$sum(1,length(X1))) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X0: $int,X1: heap,X2: $int] :
( ( sel(app(X1,X2),X0) = sel(X1,X0) )
| ~ $less(X0,$sum(1,length(X1))) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X0: $int,X1: heap,X2: $int] :
( ( sel(app(X1,X2),X0) = sel(X1,X0) )
| ~ $less(X0,$sum(1,length(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_5) ).
tff(f59,plain,
$less(sK0,$sum(1,length(sK1))),
inference(cnf_transformation,[],[f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT070=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_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.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 19:44:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 % (9264)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.47 % (9266)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.48 % (9266)First to succeed.
% 0.19/0.49 % (9313)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.50 % (9266)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (9266)------------------------------
% 0.19/0.50 % (9266)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (9266)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (9266)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (9266)Memory used [KB]: 1151
% 0.19/0.50 % (9266)Time elapsed: 0.019 s
% 0.19/0.50 % (9266)Instructions burned: 13 (million)
% 0.19/0.50 % (9266)------------------------------
% 0.19/0.50 % (9266)------------------------------
% 0.19/0.50 % (9259)Success in time 0.136 s
%------------------------------------------------------------------------------