TSTP Solution File: DAT017_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT017_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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 May 1 02:18:34 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of formulae : 62 ( 15 unt; 8 typ; 0 def)
% Number of atoms : 109 ( 69 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 91 ( 36 ~; 36 |; 12 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 141 ( 6 atm; 39 fun; 49 num; 47 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 7 usr; 8 con; 0-3 aty)
% Number of variables : 62 ( 45 !; 17 ?; 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_6,type,
sK0: array ).
tff(func_def_7,type,
sK1: array ).
tff(func_def_8,type,
sK2: $int ).
tff(func_def_9,type,
sK3: $int ).
tff(func_def_10,type,
sK4: $int ).
tff(f133,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f89,f116,f123,f132]) ).
tff(f132,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f131]) ).
tff(f131,plain,
( $false
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f130,f31]) ).
tff(f31,plain,
0 = read(sK1,sK2),
inference(superposition,[],[f28,f24]) ).
tff(f24,plain,
! [X5: $int] : ( read(sK0,X5) = read(sK1,X5) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ! [X5: $int] : ( read(sK0,X5) = read(sK1,X5) )
& ( sK0 = write(write(write(sK1,sK3,0),sK4,$sum(read(sK1,sK4),1)),sK2,0) )
& ( read(sK1,sK2) != read(sK1,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f19,f20]) ).
tff(f20,plain,
( ? [X0: array,X1: array,X2: $int,X3: $int,X4: $int] :
( ! [X5: $int] : ( read(X0,X5) = read(X1,X5) )
& ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 )
& ( read(X1,X2) != read(X1,X3) ) )
=> ( ! [X5: $int] : ( read(sK0,X5) = read(sK1,X5) )
& ( sK0 = write(write(write(sK1,sK3,0),sK4,$sum(read(sK1,sK4),1)),sK2,0) )
& ( read(sK1,sK2) != read(sK1,sK3) ) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
? [X0: array,X1: array,X2: $int,X3: $int,X4: $int] :
( ! [X5: $int] : ( read(X0,X5) = read(X1,X5) )
& ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 )
& ( read(X1,X2) != read(X1,X3) ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
? [X0: array,X1: array,X2: $int,X3: $int,X4: $int] :
( ! [X5: $int] : ( read(X0,X5) = read(X1,X5) )
& ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 )
& ( read(X1,X2) != read(X1,X3) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array,X2: $int,X3: $int,X4: $int] :
( ( ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 )
& ( read(X1,X2) != read(X1,X3) ) )
=> ? [X5: $int] : ( read(X0,X5) != read(X1,X5) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X0: array,X1: array,X2: $int,X3: $int,X4: $int] :
( ( ( write(write(write(X1,X3,0),X4,$sum(read(X1,X4),1)),X2,0) = X0 )
& ( read(X1,X2) != read(X1,X3) ) )
=> ? [X5: $int] : ( read(X0,X5) != read(X1,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.g7F9AChe2G/Vampire---4.8_926',co1) ).
tff(f28,plain,
0 = read(sK0,sK2),
inference(superposition,[],[f26,f27]) ).
tff(f27,plain,
sK0 = write(write(write(sK1,sK3,0),sK4,$sum(1,read(sK1,sK4))),sK2,0),
inference(forward_demodulation,[],[f23,f5]) ).
tff(f5,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f23,plain,
sK0 = write(write(write(sK1,sK3,0),sK4,$sum(read(sK1,sK4),1)),sK2,0),
inference(cnf_transformation,[],[f21]) ).
tff(f26,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.g7F9AChe2G/Vampire---4.8_926',ax1) ).
tff(f130,plain,
( ( 0 != read(sK1,sK2) )
| ~ spl5_3 ),
inference(superposition,[],[f22,f108]) ).
tff(f108,plain,
( ( 0 = read(sK1,sK3) )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f106]) ).
tff(f106,plain,
( spl5_3
<=> ( 0 = read(sK1,sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f22,plain,
read(sK1,sK2) != read(sK1,sK3),
inference(cnf_transformation,[],[f21]) ).
tff(f123,plain,
~ spl5_4,
inference(avatar_contradiction_clause,[],[f122]) ).
tff(f122,plain,
( $false
| ~ spl5_4 ),
inference(trivial_inequality_removal,[],[f121]) ).
tff(f121,plain,
( ( read(sK1,sK2) != read(sK1,sK2) )
| ~ spl5_4 ),
inference(superposition,[],[f22,f112]) ).
tff(f112,plain,
( ( sK2 = sK3 )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f110]) ).
tff(f110,plain,
( spl5_4
<=> ( sK2 = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f116,plain,
( spl5_3
| spl5_4
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f115,f38,f110,f106]) ).
tff(f38,plain,
( spl5_1
<=> ( sK2 = sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
tff(f115,plain,
( ( sK2 = sK3 )
| ( 0 = read(sK1,sK3) )
| ~ spl5_1 ),
inference(duplicate_literal_removal,[],[f114]) ).
tff(f114,plain,
( ( sK2 = sK3 )
| ( 0 = read(sK1,sK3) )
| ( sK2 = sK3 )
| ~ spl5_1 ),
inference(forward_demodulation,[],[f102,f40]) ).
tff(f40,plain,
( ( sK2 = sK4 )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
tff(f102,plain,
( ( 0 = read(sK1,sK3) )
| ( sK2 = sK3 )
| ( sK3 = sK4 ) ),
inference(superposition,[],[f26,f33]) ).
tff(f33,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(sK1,sK3,0),X0) )
| ( sK2 = X0 )
| ( sK4 = X0 ) ),
inference(superposition,[],[f30,f25]) ).
tff(f25,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: array,X4: $int,X5: $int,X6: $int] :
( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
| ( X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.g7F9AChe2G/Vampire---4.8_926',ax2) ).
tff(f30,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(write(sK1,sK3,0),sK4,$sum(1,read(sK1,sK4))),X0) )
| ( sK2 = X0 ) ),
inference(forward_demodulation,[],[f29,f24]) ).
tff(f29,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,sK3,0),sK4,$sum(1,read(sK1,sK4))),X0) )
| ( sK2 = X0 ) ),
inference(superposition,[],[f25,f27]) ).
tff(f89,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f88]) ).
tff(f88,plain,
( $false
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f85,f10]) ).
tff(f10,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f85,plain,
( $less(read(sK1,sK4),read(sK1,sK4))
| ~ spl5_2 ),
inference(factoring,[],[f71]) ).
tff(f71,plain,
( ! [X0: $int] :
( $less(read(sK1,sK4),X0)
| $less(X0,read(sK1,sK4)) )
| ~ spl5_2 ),
inference(superposition,[],[f14,f67]) ).
tff(f67,plain,
( ( read(sK1,sK4) = $sum(read(sK1,sK4),1) )
| ~ spl5_2 ),
inference(evaluation,[],[f65]) ).
tff(f65,plain,
( ( $uminus($uminus(read(sK1,sK4))) = $sum($uminus($uminus(read(sK1,sK4))),$uminus(-1)) )
| ~ spl5_2 ),
inference(superposition,[],[f8,f54]) ).
tff(f54,plain,
( ( $uminus(read(sK1,sK4)) = $sum(-1,$uminus(read(sK1,sK4))) )
| ~ spl5_2 ),
inference(superposition,[],[f53,f5]) ).
tff(f53,plain,
( ( $uminus(read(sK1,sK4)) = $sum($uminus(read(sK1,sK4)),-1) )
| ~ spl5_2 ),
inference(evaluation,[],[f51]) ).
tff(f51,plain,
( ( $uminus(read(sK1,sK4)) = $sum($uminus(read(sK1,sK4)),$uminus(1)) )
| ~ spl5_2 ),
inference(superposition,[],[f8,f44]) ).
tff(f44,plain,
( ( read(sK1,sK4) = $sum(1,read(sK1,sK4)) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f42]) ).
tff(f42,plain,
( spl5_2
<=> ( read(sK1,sK4) = $sum(1,read(sK1,sK4)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
tff(f8,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(theory_axiom_139,[]) ).
tff(f14,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f46,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f36,f42,f38]) ).
tff(f36,plain,
( ( read(sK1,sK4) = $sum(1,read(sK1,sK4)) )
| ( sK2 = sK4 ) ),
inference(superposition,[],[f26,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : DAT017_1 : TPTP v8.1.2. Released v5.0.0.
% 0.02/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 17:08:56 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TF0_THM_EQU_ARI problem
% 0.09/0.30 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.g7F9AChe2G/Vampire---4.8_926
% 0.60/0.78 % (1076)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.78 % (1079)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.78 % (1077)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.78 % (1075)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.78 % (1078)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.78 % (1080)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.78 % (1081)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.78 % (1082)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.78 % (1075)Refutation not found, incomplete strategy% (1075)------------------------------
% 0.60/0.78 % (1075)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (1075)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (1075)Memory used [KB]: 996
% 0.60/0.78 % (1075)Time elapsed: 0.004 s
% 0.60/0.78 % (1075)Instructions burned: 3 (million)
% 0.60/0.78 % (1075)------------------------------
% 0.60/0.78 % (1075)------------------------------
% 0.60/0.78 % (1078)Refutation not found, incomplete strategy% (1078)------------------------------
% 0.60/0.78 % (1078)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (1078)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (1078)Memory used [KB]: 990
% 0.60/0.78 % (1078)Time elapsed: 0.004 s
% 0.60/0.78 % (1078)Instructions burned: 3 (million)
% 0.60/0.78 % (1078)------------------------------
% 0.60/0.78 % (1078)------------------------------
% 0.60/0.78 % (1080)First to succeed.
% 0.60/0.78 % (1081)Also succeeded, but the first one will report.
% 0.60/0.78 % (1083)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.60/0.78 % (1080)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for Vampire---4
% 0.60/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.78 % (1080)------------------------------
% 0.60/0.78 % (1080)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (1080)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (1080)Memory used [KB]: 1081
% 0.60/0.78 % (1080)Time elapsed: 0.007 s
% 0.60/0.78 % (1080)Instructions burned: 9 (million)
% 0.60/0.78 % (1080)------------------------------
% 0.60/0.78 % (1080)------------------------------
% 0.60/0.78 % (1073)Success in time 0.475 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------