TSTP Solution File: DAT017_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT017_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 : n027.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:38 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 28
% Syntax : Number of formulae : 69 ( 30 unt; 15 typ; 0 def)
% Number of atoms : 90 ( 83 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 54 ( 18 ~; 17 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 123 ( 6 atm; 13 fun; 45 num; 59 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 14 usr; 14 con; 0-3 aty)
% Number of variables : 80 ( 57 !; 23 ?; 80 :)
% 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_6,type,
sK0: array ).
tff(func_def_7,type,
sK1: $int ).
tff(func_def_8,type,
sK2: $int ).
tff(func_def_9,type,
sK3: array ).
tff(func_def_10,type,
sK4: $int ).
tff(func_def_11,type,
sF5: array ).
tff(func_def_12,type,
sF6: $int ).
tff(func_def_13,type,
sF7: $int ).
tff(func_def_14,type,
sF8: array ).
tff(func_def_15,type,
sF9: array ).
tff(func_def_16,type,
sF10: $int ).
tff(func_def_17,type,
sF11: $int ).
tff(f235,plain,
$false,
inference(subsumption_resolution,[],[f234,f62]) ).
tff(f62,plain,
0 != sF10,
inference(backward_demodulation,[],[f39,f61]) ).
tff(f61,plain,
0 = sF11,
inference(backward_demodulation,[],[f38,f60]) ).
tff(f60,plain,
0 = read(sK0,sK2),
inference(superposition,[],[f30,f55]) ).
tff(f55,plain,
0 = read(sK3,sK2),
inference(superposition,[],[f27,f40]) ).
tff(f40,plain,
sK3 = write(sF8,sK2,0),
inference(forward_demodulation,[],[f35,f36]) ).
tff(f36,plain,
sK3 = sF9,
inference(definition_folding,[],[f29,f35,f34,f33,f32,f31]) ).
tff(f31,plain,
sF5 = write(sK0,sK1,0),
introduced(function_definition,[]) ).
tff(f32,plain,
sF6 = read(sK0,sK4),
introduced(function_definition,[]) ).
tff(f33,plain,
sF7 = $sum(sF6,1),
introduced(function_definition,[]) ).
tff(f34,plain,
sF8 = write(sF5,sK4,sF7),
introduced(function_definition,[]) ).
tff(f29,plain,
sK3 = write(write(write(sK0,sK1,0),sK4,$sum(read(sK0,sK4),1)),sK2,0),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
( ! [X5: $int] : ( read(sK0,X5) = read(sK3,X5) )
& ( sK3 = write(write(write(sK0,sK1,0),sK4,$sum(read(sK0,sK4),1)),sK2,0) )
& ( read(sK0,sK1) != read(sK0,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f23,f24]) ).
tff(f24,plain,
( ? [X0: array,X1: $int,X2: $int,X3: array,X4: $int] :
( ! [X5: $int] : ( read(X3,X5) = read(X0,X5) )
& ( write(write(write(X0,X1,0),X4,$sum(read(X0,X4),1)),X2,0) = X3 )
& ( read(X0,X1) != read(X0,X2) ) )
=> ( ! [X5: $int] : ( read(sK0,X5) = read(sK3,X5) )
& ( sK3 = write(write(write(sK0,sK1,0),sK4,$sum(read(sK0,sK4),1)),sK2,0) )
& ( read(sK0,sK1) != read(sK0,sK2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f23,plain,
? [X0: array,X1: $int,X2: $int,X3: array,X4: $int] :
( ! [X5: $int] : ( read(X3,X5) = read(X0,X5) )
& ( write(write(write(X0,X1,0),X4,$sum(read(X0,X4),1)),X2,0) = X3 )
& ( read(X0,X1) != read(X0,X2) ) ),
inference(rectify,[],[f21]) ).
tff(f21,plain,
? [X0: array,X2: $int,X3: $int,X4: array,X1: $int] :
( ! [X5: $int] : ( read(X0,X5) = read(X4,X5) )
& ( write(write(write(X0,X2,0),X1,$sum(read(X0,X1),1)),X3,0) = X4 )
& ( read(X0,X2) != read(X0,X3) ) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
? [X2: $int,X4: array,X0: array,X3: $int,X1: $int] :
( ! [X5: $int] : ( read(X0,X5) = read(X4,X5) )
& ( write(write(write(X0,X2,0),X1,$sum(read(X0,X1),1)),X3,0) = X4 )
& ( read(X0,X2) != read(X0,X3) ) ),
inference(ennf_transformation,[],[f18]) ).
tff(f18,plain,
~ ! [X2: $int,X4: array,X0: array,X3: $int,X1: $int] :
( ( ( write(write(write(X0,X2,0),X1,$sum(read(X0,X1),1)),X3,0) = X4 )
& ( read(X0,X2) != read(X0,X3) ) )
=> ? [X5: $int] : ( read(X0,X5) != read(X4,X5) ) ),
inference(rectify,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X1: array,X4: $int,X3: $int,X2: $int,X0: array] :
( ( ( read(X1,X2) != read(X1,X3) )
& ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 ) )
=> ? [X5: $int] : ( read(X0,X5) != read(X1,X5) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X1: array,X4: $int,X3: $int,X2: $int,X0: array] :
( ( ( read(X1,X2) != read(X1,X3) )
& ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 ) )
=> ? [X5: $int] : ( read(X0,X5) != read(X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f35,plain,
write(sF8,sK2,0) = sF9,
introduced(function_definition,[]) ).
tff(f27,plain,
! [X2: $int,X0: $int,X1: array] : ( read(write(X1,X2,X0),X2) = X0 ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: $int,X1: array,X2: $int] : ( read(write(X1,X2,X0),X2) = X0 ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f30,plain,
! [X5: $int] : ( read(sK0,X5) = read(sK3,X5) ),
inference(cnf_transformation,[],[f25]) ).
tff(f38,plain,
sF11 = read(sK0,sK2),
introduced(function_definition,[]) ).
tff(f39,plain,
sF11 != sF10,
inference(definition_folding,[],[f28,f38,f37]) ).
tff(f37,plain,
read(sK0,sK1) = sF10,
introduced(function_definition,[]) ).
tff(f28,plain,
read(sK0,sK1) != read(sK0,sK2),
inference(cnf_transformation,[],[f25]) ).
tff(f234,plain,
0 = sF10,
inference(backward_demodulation,[],[f37,f227]) ).
tff(f227,plain,
0 = read(sK0,sK1),
inference(backward_demodulation,[],[f60,f224]) ).
tff(f224,plain,
sK1 = sK2,
inference(subsumption_resolution,[],[f223,f62]) ).
tff(f223,plain,
( ( 0 = sF10 )
| ( sK1 = sK2 ) ),
inference(superposition,[],[f37,f220]) ).
tff(f220,plain,
( ( 0 = read(sK0,sK1) )
| ( sK1 = sK2 ) ),
inference(superposition,[],[f171,f56]) ).
tff(f56,plain,
0 = read(sF5,sK1),
inference(superposition,[],[f27,f31]) ).
tff(f171,plain,
! [X1: $int] :
( ( read(sK0,X1) = read(sF5,X1) )
| ( sK2 = X1 ) ),
inference(duplicate_literal_removal,[],[f166]) ).
tff(f166,plain,
! [X1: $int] :
( ( read(sK0,X1) = read(sF5,X1) )
| ( sK2 = X1 )
| ( sK2 = X1 ) ),
inference(superposition,[],[f138,f130]) ).
tff(f130,plain,
! [X0: $int] :
( ( read(sF8,X0) = read(sK0,X0) )
| ( sK2 = X0 ) ),
inference(forward_demodulation,[],[f125,f30]) ).
tff(f125,plain,
! [X0: $int] :
( ( sK2 = X0 )
| ( read(sK3,X0) = read(sF8,X0) ) ),
inference(superposition,[],[f26,f40]) ).
tff(f26,plain,
! [X2: $int,X3: array,X0: $int,X1: $int] :
( ( read(write(X3,X0,X2),X1) = read(X3,X1) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int,X2: $int,X3: array] :
( ( X0 = X1 )
| ( read(write(X3,X0,X2),X1) = read(X3,X1) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
! [X3: $int,X1: $int,X0: $int,X2: array] :
( ( X1 = X3 )
| ( read(write(X2,X3,X0),X1) = read(X2,X1) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X6: $int,X5: $int,X3: array,X4: $int] :
( ( X4 = X5 )
| ( read(write(X3,X4,X6),X5) = read(X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f138,plain,
! [X2: $int] :
( ( read(sF8,X2) = read(sF5,X2) )
| ( sK2 = X2 ) ),
inference(backward_demodulation,[],[f127,f137]) ).
tff(f137,plain,
sK4 = sK2,
inference(subsumption_resolution,[],[f135,f10]) ).
tff(f10,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f135,plain,
( ( sK4 = sK2 )
| $less(sF6,sF6) ),
inference(superposition,[],[f75,f133]) ).
tff(f133,plain,
( ( sF7 = sF6 )
| ( sK4 = sK2 ) ),
inference(forward_demodulation,[],[f131,f32]) ).
tff(f131,plain,
( ( sF7 = read(sK0,sK4) )
| ( sK4 = sK2 ) ),
inference(superposition,[],[f130,f57]) ).
tff(f57,plain,
sF7 = read(sF8,sK4),
inference(superposition,[],[f27,f34]) ).
tff(f75,plain,
$less(sF6,sF7),
inference(superposition,[],[f50,f33]) ).
tff(f50,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f14,f10]) ).
tff(f14,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_152,[]) ).
tff(f127,plain,
! [X2: $int] :
( ( read(sF8,X2) = read(sF5,X2) )
| ( sK4 = X2 ) ),
inference(superposition,[],[f26,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : DAT017=1 : TPTP v8.1.0. Released v5.0.0.
% 0.12/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 : n027.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:31:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (381)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.47 % (373)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.48 % (389)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.49 % (391)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.49 % (381)First to succeed.
% 0.19/0.49 % (381)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (381)------------------------------
% 0.19/0.50 % (381)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (381)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (381)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (381)Memory used [KB]: 1151
% 0.19/0.50 % (381)Time elapsed: 0.116 s
% 0.19/0.50 % (381)Instructions burned: 13 (million)
% 0.19/0.50 % (381)------------------------------
% 0.19/0.50 % (381)------------------------------
% 0.19/0.50 % (365)Success in time 0.148 s
%------------------------------------------------------------------------------