TSTP Solution File: DAT013_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT013_1 : TPTP v8.1.0. Released v5.0.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 : n012.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:37 EDT 2022
% Result : Theorem 0.21s 0.59s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 43 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 111 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 125 ( 50 ~; 31 |; 30 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 238 ( 100 atm; 30 fun; 54 num; 54 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 6 usr; 6 con; 0-3 aty)
% Number of variables : 62 ( 44 !; 18 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
array: $tType ).
tff(func_def_0,type,
read: ( array * $int ) > $int ).
tff(func_def_1,type,
write: ( array * $int * $int ) > array ).
tff(func_def_7,type,
sK0: $int ).
tff(func_def_8,type,
sK1: array ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int ).
tff(f223,plain,
$false,
inference(subsumption_resolution,[],[f222,f81]) ).
tff(f81,plain,
~ $less(sK2,sK3),
inference(resolution,[],[f65,f11]) ).
tff(f11,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f65,plain,
! [X2: $int] :
( $less(X2,sK2)
| ~ $less(X2,sK3) ),
inference(resolution,[],[f12,f37]) ).
tff(f37,plain,
$less(sK3,sK2),
inference(subsumption_resolution,[],[f36,f32]) ).
tff(f32,plain,
~ $less(sK0,sK3),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
( ! [X3: $int] :
( $less(sK0,X3)
| $less(0,read(sK1,X3))
| $less(X3,sK2) )
& ~ $less(sK0,sK3)
& ~ $less(0,read(sK1,sK3))
& ~ $less(sK3,$sum(sK2,3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f26,f25]) ).
tff(f25,plain,
( ? [X0: $int,X1: array,X2: $int] :
( ! [X3: $int] :
( $less(X0,X3)
| $less(0,read(X1,X3))
| $less(X3,X2) )
& ? [X4: $int] :
( ~ $less(X0,X4)
& ~ $less(0,read(X1,X4))
& ~ $less(X4,$sum(X2,3)) ) )
=> ( ! [X3: $int] :
( $less(sK0,X3)
| $less(0,read(sK1,X3))
| $less(X3,sK2) )
& ? [X4: $int] :
( ~ $less(sK0,X4)
& ~ $less(0,read(sK1,X4))
& ~ $less(X4,$sum(sK2,3)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
( ? [X4: $int] :
( ~ $less(sK0,X4)
& ~ $less(0,read(sK1,X4))
& ~ $less(X4,$sum(sK2,3)) )
=> ( ~ $less(sK0,sK3)
& ~ $less(0,read(sK1,sK3))
& ~ $less(sK3,$sum(sK2,3)) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
? [X0: $int,X1: array,X2: $int] :
( ! [X3: $int] :
( $less(X0,X3)
| $less(0,read(X1,X3))
| $less(X3,X2) )
& ? [X4: $int] :
( ~ $less(X0,X4)
& ~ $less(0,read(X1,X4))
& ~ $less(X4,$sum(X2,3)) ) ),
inference(rectify,[],[f22]) ).
tff(f22,plain,
? [X2: $int,X1: array,X0: $int] :
( ! [X3: $int] :
( $less(X2,X3)
| $less(0,read(X1,X3))
| $less(X3,X0) )
& ? [X4: $int] :
( ~ $less(X2,X4)
& ~ $less(0,read(X1,X4))
& ~ $less(X4,$sum(X0,3)) ) ),
inference(flattening,[],[f21]) ).
tff(f21,plain,
? [X1: array,X2: $int,X0: $int] :
( ? [X4: $int] :
( ~ $less(0,read(X1,X4))
& ~ $less(X4,$sum(X0,3))
& ~ $less(X2,X4) )
& ! [X3: $int] :
( $less(0,read(X1,X3))
| $less(X2,X3)
| $less(X3,X0) ) ),
inference(ennf_transformation,[],[f18]) ).
tff(f18,plain,
~ ! [X1: array,X2: $int,X0: $int] :
( ! [X3: $int] :
( ( ~ $less(X2,X3)
& ~ $less(X3,X0) )
=> $less(0,read(X1,X3)) )
=> ! [X4: $int] :
( ( ~ $less(X4,$sum(X0,3))
& ~ $less(X2,X4) )
=> $less(0,read(X1,X4)) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
~ ! [X1: $int,X0: array,X2: $int] :
( ! [X3: $int] :
( ( ~ $less(X3,X1)
& ~ $less(X2,X3) )
=> $less(0,read(X0,X3)) )
=> ! [X4: $int] :
( ( ~ $less(X2,X4)
& ~ $less(X4,$sum(X1,3)) )
=> $less(0,read(X0,X4)) ) ),
inference(theory_normalization,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X1: $int,X0: array,X2: $int] :
( ! [X3: $int] :
( ( $lesseq(X1,X3)
& $lesseq(X3,X2) )
=> $greater(read(X0,X3),0) )
=> ! [X4: $int] :
( ( $lesseq(X4,X2)
& $lesseq($sum(X1,3),X4) )
=> $greater(read(X0,X4),0) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X1: $int,X0: array,X2: $int] :
( ! [X3: $int] :
( ( $lesseq(X1,X3)
& $lesseq(X3,X2) )
=> $greater(read(X0,X3),0) )
=> ! [X4: $int] :
( ( $lesseq(X4,X2)
& $lesseq($sum(X1,3),X4) )
=> $greater(read(X0,X4),0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f36,plain,
( $less(sK0,sK3)
| $less(sK3,sK2) ),
inference(resolution,[],[f33,f31]) ).
tff(f31,plain,
~ $less(0,read(sK1,sK3)),
inference(cnf_transformation,[],[f27]) ).
tff(f33,plain,
! [X3: $int] :
( $less(0,read(sK1,X3))
| $less(sK0,X3)
| $less(X3,sK2) ),
inference(cnf_transformation,[],[f27]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| $less(X0,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_148,[]) ).
tff(f222,plain,
$less(sK2,sK3),
inference(evaluation,[],[f218]) ).
tff(f218,plain,
( $less(sK2,sK3)
| ~ $less(0,3) ),
inference(superposition,[],[f210,f54]) ).
tff(f54,plain,
! [X0: $int] : ( $sum(0,X0) = X0 ),
inference(superposition,[],[f8,f6]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f8,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_142,[]) ).
tff(f210,plain,
! [X3: $int] :
( $less($sum(X3,sK2),sK3)
| ~ $less(X3,3) ),
inference(superposition,[],[f14,f203]) ).
tff(f203,plain,
sK3 = $sum(3,sK2),
inference(subsumption_resolution,[],[f202,f81]) ).
tff(f202,plain,
( $less(sK2,sK3)
| ( sK3 = $sum(3,sK2) ) ),
inference(evaluation,[],[f199]) ).
tff(f199,plain,
( $less(sK2,sK3)
| ( sK3 = $sum(3,sK2) )
| ~ $less(0,3) ),
inference(superposition,[],[f189,f54]) ).
tff(f189,plain,
! [X2: $int] :
( $less($sum(X2,sK2),sK3)
| ( sK3 = $sum(3,sK2) )
| ~ $less(X2,3) ),
inference(resolution,[],[f129,f14]) ).
tff(f129,plain,
! [X1: $int] :
( ~ $less(X1,$sum(3,sK2))
| $less(X1,sK3)
| ( sK3 = $sum(3,sK2) ) ),
inference(resolution,[],[f79,f12]) ).
tff(f79,plain,
( $less($sum(3,sK2),sK3)
| ( sK3 = $sum(3,sK2) ) ),
inference(resolution,[],[f13,f35]) ).
tff(f35,plain,
~ $less(sK3,$sum(3,sK2)),
inference(forward_demodulation,[],[f30,f6]) ).
tff(f30,plain,
~ $less(sK3,$sum(sK2,3)),
inference(cnf_transformation,[],[f27]) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f14,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_150,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT013=1 : TPTP v8.1.0. Released v5.0.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.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 20:15:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.55 % (20853)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.21/0.56 % (20852)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.21/0.57 % (20853)First to succeed.
% 0.21/0.57 % (20873)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.58 % (20865)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.21/0.58 % (20864)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.58 % (20872)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.59 % (20853)Refutation found. Thanks to Tanya!
% 0.21/0.59 % SZS status Theorem for theBenchmark
% 0.21/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.59 % (20853)------------------------------
% 0.21/0.59 % (20853)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (20853)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.59 % (20853)Termination reason: Refutation
% 0.21/0.59
% 0.21/0.59 % (20853)Memory used [KB]: 1023
% 0.21/0.59 % (20853)Time elapsed: 0.140 s
% 0.21/0.59 % (20853)Instructions burned: 11 (million)
% 0.21/0.59 % (20853)------------------------------
% 0.21/0.59 % (20853)------------------------------
% 0.21/0.59 % (20850)Success in time 0.233 s
%------------------------------------------------------------------------------