TSTP Solution File: DAT103_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT103_1 : TPTP v8.2.0. Released v6.1.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Mon May 20 19:49:39 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 40 ( 19 unt; 10 typ; 0 def)
% Number of atoms : 59 ( 21 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 47 ( 18 ~; 9 |; 17 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 104 ( 24 atm; 35 fun; 18 num; 27 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 27 !; 14 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_9,type,
sK0: list ).
tff(func_def_10,type,
sK1: $int ).
tff(func_def_11,type,
sK2: ( $int * list ) > $int ).
tff(func_def_12,type,
sK3: ( $int * list ) > list ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(f972,plain,
$false,
inference(subsumption_resolution,[],[f941,f369]) ).
tff(f369,plain,
$less(sK1,$sum(1,head(sK0))),
inference(evaluation,[],[f360]) ).
tff(f360,plain,
$less($sum(sK1,0),$sum(1,$uminus($uminus(head(sK0))))),
inference(superposition,[],[f98,f14]) ).
tff(f14,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_140,[]) ).
tff(f98,plain,
! [X0: $int] : $less($sum(sK1,$sum($uminus(head(sK0)),X0)),$sum(1,X0)),
inference(forward_demodulation,[],[f94,f11]) ).
tff(f11,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(theory_axiom_136,[]) ).
tff(f94,plain,
! [X0: $int] : $less($sum($sum(sK1,$uminus(head(sK0))),X0),$sum(1,X0)),
inference(unit_resulting_resolution,[],[f27,f18]) ).
tff(f18,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_145,[]) ).
tff(f27,plain,
$less($sum(sK1,$uminus(head(sK0))),1),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
? [X0: list,X1: $int] :
( $less($sum(X1,$uminus(head(X0))),1)
& inRange(X1,X0)
& ( nil != X0 ) ),
inference(rectify,[],[f9]) ).
tff(f9,plain,
? [X1: list,X2: $int] :
( $less($sum(X2,$uminus(head(X1))),1)
& inRange(X2,X1)
& ( nil != X1 ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ~ ? [X1: list,X2: $int] :
( $less($difference(X2,head(X1)),1)
& inRange(X2,X1)
& ( nil != X1 ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
~ ? [X1: list,X2: $int] :
( $less($difference(X2,head(X1)),1)
& inRange(X2,X1)
& ( nil != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f941,plain,
~ $less(sK1,$sum(1,head(sK0))),
inference(superposition,[],[f70,f214]) ).
tff(f214,plain,
head(sK0) = sK2(sK1,sK0),
inference(superposition,[],[f36,f41]) ).
tff(f41,plain,
sK0 = cons(sK2(sK1,sK0),sK3(sK1,sK0)),
inference(unit_resulting_resolution,[],[f25,f26,f30]) ).
tff(f30,plain,
! [X0: $int,X1: list] :
( ~ inRange(X0,X1)
| ( cons(sK2(X0,X1),sK3(X0,X1)) = X1 )
| ( nil = X1 ) ),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 ) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
! [X2: $int,X1: list] :
( inRange(X2,X1)
<=> ( ? [X0: $int,X3: list] :
( inRange(X2,X3)
& $less(X0,X2)
& ~ $less(X0,0)
& ( cons(X0,X3) = X1 ) )
| ( nil = X1 ) ) ),
inference(theory_normalization,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( inRange(X2,X1)
<=> ( ? [X0: $int,X3: list] :
( inRange(X2,X3)
& $less(X0,X2)
& $lesseq(0,X0)
& ( cons(X0,X3) = X1 ) )
| ( nil = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f26,plain,
inRange(sK1,sK0),
inference(cnf_transformation,[],[f22]) ).
tff(f25,plain,
nil != sK0,
inference(cnf_transformation,[],[f22]) ).
tff(f36,plain,
! [X0: $int,X1: list] : ( head(cons(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: $int,X1: list] : ( head(cons(X0,X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1) ).
tff(f70,plain,
~ $less(sK1,$sum(1,sK2(sK1,sK0))),
inference(forward_demodulation,[],[f62,f10]) ).
tff(f10,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f62,plain,
~ $less(sK1,$sum(sK2(sK1,sK0),1)),
inference(unit_resulting_resolution,[],[f43,f21]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f43,plain,
$less(sK2(sK1,sK0),sK1),
inference(unit_resulting_resolution,[],[f25,f26,f32]) ).
tff(f32,plain,
! [X0: $int,X1: list] :
( ~ inRange(X0,X1)
| $less(sK2(X0,X1),X0)
| ( nil = X1 ) ),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT103_1 : TPTP v8.2.0. Released v6.1.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 23:06:38 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.74 % (909)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.74 % (902)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.74 % (905)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.74 % (906)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.74 % (907)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.74 % (908)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.74 % (904)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.74 % (908)Refutation not found, incomplete strategy% (908)------------------------------
% 0.56/0.74 % (908)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (908)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (908)Memory used [KB]: 972
% 0.56/0.74 % (908)Time elapsed: 0.003 s
% 0.56/0.74 % (908)Instructions burned: 3 (million)
% 0.56/0.74 % (908)------------------------------
% 0.56/0.74 % (908)------------------------------
% 0.56/0.74 % (911)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 theBenchmark for (2996ds/55Mi)
% 0.56/0.75 % (909)First to succeed.
% 0.56/0.75 % (909)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-899"
% 0.56/0.75 % (909)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for theBenchmark
% 0.56/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.75 % (909)------------------------------
% 0.56/0.75 % (909)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (909)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (909)Memory used [KB]: 1197
% 0.56/0.75 % (909)Time elapsed: 0.013 s
% 0.56/0.75 % (909)Instructions burned: 31 (million)
% 0.56/0.75 % (899)Success in time 0.39 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------