TSTP Solution File: DAT069_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT069_1 : TPTP v8.1.2. 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 : n008.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 : Sun May 5 05:04:29 EDT 2024
% Result : Theorem 0.62s 0.79s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 34 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 33 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 7 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 78 ( 17 atm; 20 fun; 18 num; 23 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 : 31 ( 28 !; 3 ?; 31 :)
% 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(f108,plain,
$false,
inference(subsumption_resolution,[],[f107,f22]) ).
tff(f22,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f107,plain,
$less($sum(1,sK2),$sum(1,sK2)),
inference(forward_demodulation,[],[f101,f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f101,plain,
$less($sum(1,sK2),$sum(sK2,1)),
inference(unit_resulting_resolution,[],[f99,f26]) ).
tff(f26,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f99,plain,
~ $less(sK2,$sum(1,sK2)),
inference(forward_demodulation,[],[f98,f85]) ).
tff(f85,plain,
sK2 = $sum(1,length(sK1)),
inference(unit_resulting_resolution,[],[f44,f46]) ).
tff(f46,plain,
! [X2: $int,X0: $int,X1: heap] :
( ( sel(app(X1,X0),X2) = sel(X1,X2) )
| ( $sum(1,length(X1)) = X2 ) ),
inference(cnf_transformation,[],[f40]) ).
tff(f40,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/tmp/tmp.rtHiltWibH/Vampire---4.8_18881',ax_3) ).
tff(f44,plain,
sel(app(sK1,sK0),sK2) != sel(sK1,sK2),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
? [X0: $int,X1: heap,X2: $int] :
( ~ $less(length(X1),X2)
& ( sel(app(X1,X0),X2) != sel(X1,X2) ) ),
inference(ennf_transformation,[],[f29]) ).
tff(f29,plain,
~ ! [X0: $int,X1: heap,X2: $int] :
( $less(length(X1),X2)
| ( sel(app(X1,X0),X2) = sel(X1,X2) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X2: $int,X1: heap,X0: $int] :
( $less(length(X1),X0)
| ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X2: $int,X1: heap,X0: $int] :
( $less(length(X1),X0)
| ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.rtHiltWibH/Vampire---4.8_18881',th_4) ).
tff(f98,plain,
~ $less($sum(1,length(sK1)),$sum(1,sK2)),
inference(forward_demodulation,[],[f90,f17]) ).
tff(f90,plain,
~ $less($sum(1,length(sK1)),$sum(sK2,1)),
inference(unit_resulting_resolution,[],[f68,f28]) ).
tff(f28,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f68,plain,
$less(sK2,$sum(1,length(sK1))),
inference(forward_demodulation,[],[f65,f17]) ).
tff(f65,plain,
$less(sK2,$sum(length(sK1),1)),
inference(unit_resulting_resolution,[],[f45,f26]) ).
tff(f45,plain,
~ $less(length(sK1),sK2),
inference(cnf_transformation,[],[f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : DAT069_1 : TPTP v8.1.2. Released v5.5.0.
% 0.10/0.14 % 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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:58:12 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_EQU_ARI problem
% 0.14/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/tmp/tmp.rtHiltWibH/Vampire---4.8_18881
% 0.62/0.78 % (19003)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.62/0.78 % (19001)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.62/0.78 % (19000)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.62/0.78 % (19004)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.62/0.78 % (19002)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.62/0.78 % (19005)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.62/0.78 % (18998)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.62/0.79 % (18999)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.62/0.79 % (19003)Also succeeded, but the first one will report.
% 0.62/0.79 % (19004)First to succeed.
% 0.62/0.79 % (19004)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18997"
% 0.62/0.79 % (19004)Refutation found. Thanks to Tanya!
% 0.62/0.79 % SZS status Theorem for Vampire---4
% 0.62/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79 % (19004)------------------------------
% 0.62/0.79 % (19004)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.79 % (19004)Termination reason: Refutation
% 0.62/0.79
% 0.62/0.79 % (19004)Memory used [KB]: 1064
% 0.62/0.79 % (19004)Time elapsed: 0.005 s
% 0.62/0.79 % (19004)Instructions burned: 6 (million)
% 0.62/0.79 % (18997)Success in time 0.433 s
% 0.62/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------