TSTP Solution File: DAT067_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT067_1 : TPTP v8.2.0. Released v5.5.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 : n009.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 : Mon May 20 19:49:31 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 26 ( 4 unt; 11 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 6 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 46 ( 0 atm; 14 fun; 14 num; 18 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 : 27 ( 21 !; 6 ?; 27 :)
% 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: $int ).
tff(func_def_12,type,
sK2: heap ).
tff(pred_def_1,type,
lsls: ( heap * heap ) > $o ).
tff(f58,plain,
$false,
inference(subsumption_resolution,[],[f57,f43]) ).
tff(f43,plain,
sK1 != $sum(1,length(sK2)),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
( ( sK1 != $sum(1,length(sK2)) )
& ( sel(app(sK2,sK0),sK1) != sel(sK2,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f35,f38]) ).
tff(f38,plain,
( ? [X0: $int,X1: $int,X2: heap] :
( ( $sum(1,length(X2)) != X1 )
& ( sel(app(X2,X0),X1) != sel(X2,X1) ) )
=> ( ( sK1 != $sum(1,length(sK2)) )
& ( sel(app(sK2,sK0),sK1) != sel(sK2,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f35,plain,
? [X0: $int,X1: $int,X2: heap] :
( ( $sum(1,length(X2)) != X1 )
& ( sel(app(X2,X0),X1) != sel(X2,X1) ) ),
inference(ennf_transformation,[],[f29]) ).
tff(f29,plain,
~ ! [X0: $int,X1: $int,X2: heap] :
( ( $sum(1,length(X2)) = X1 )
| ( sel(app(X2,X0),X1) = sel(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/sandbox/benchmark/theBenchmark.p',th_2) ).
tff(f57,plain,
sK1 = $sum(1,length(sK2)),
inference(trivial_inequality_removal,[],[f56]) ).
tff(f56,plain,
( ( sel(sK2,sK1) != sel(sK2,sK1) )
| ( sK1 = $sum(1,length(sK2)) ) ),
inference(superposition,[],[f42,f44]) ).
tff(f44,plain,
! [X2: $int,X0: $int,X1: heap] :
( ( sel(app(X1,X0),X2) = sel(X1,X2) )
| ( $sum(1,length(X1)) = X2 ) ),
inference(cnf_transformation,[],[f36]) ).
tff(f36,plain,
! [X0: $int,X1: heap,X2: $int] :
( ( sel(app(X1,X0),X2) = sel(X1,X2) )
| ( $sum(1,length(X1)) = X2 ) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: $int,X1: heap,X2: $int] :
( ( $sum(1,length(X1)) != X2 )
=> ( sel(app(X1,X0),X2) = sel(X1,X2) ) ),
inference(rectify,[],[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(f42,plain,
sel(app(sK2,sK0),sK1) != sel(sK2,sK1),
inference(cnf_transformation,[],[f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT067_1 : TPTP v8.2.0. Released v5.5.0.
% 0.12/0.13 % 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.13/0.34 % Computer : n009.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 : Sun May 19 23:07:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF0_THM_EQU_ARI problem
% 0.13/0.35 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/benchmark/theBenchmark.p
% 0.56/0.73 % (22874)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.73 % (22867)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 theBenchmark for (2996ds/34Mi)
% 0.56/0.73 % (22869)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73 % (22871)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 theBenchmark for (2996ds/34Mi)
% 0.56/0.73 % (22868)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 theBenchmark for (2996ds/51Mi)
% 0.56/0.73 % (22870)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.73 % (22872)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.73 % (22873)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 theBenchmark for (2996ds/83Mi)
% 0.56/0.73 % (22872)First to succeed.
% 0.56/0.73 % (22867)Also succeeded, but the first one will report.
% 0.56/0.73 % (22871)Also succeeded, but the first one will report.
% 0.56/0.73 % (22872)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22865"
% 0.56/0.73 % (22870)Also succeeded, but the first one will report.
% 0.56/0.74 % (22873)Also succeeded, but the first one will report.
% 0.56/0.74 % (22872)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for theBenchmark
% 0.56/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.74 % (22872)------------------------------
% 0.56/0.74 % (22872)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (22872)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (22872)Memory used [KB]: 1051
% 0.56/0.74 % (22872)Time elapsed: 0.004 s
% 0.56/0.74 % (22872)Instructions burned: 4 (million)
% 0.56/0.74 % (22865)Success in time 0.378 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------