TSTP Solution File: DAT098_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT098_1 : TPTP v8.1.2. 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/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 : Sun May 5 05:04:34 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 103 ( 26 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 126 ( 46 ~; 41 |; 35 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 116 ( 36 atm; 0 fun; 55 num; 25 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 34 !; 14 ?; 48 :)
% 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_11,type,
sK0: ( $int * list ) > $int ).
tff(func_def_12,type,
sK1: ( $int * list ) > list ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(pred_def_4,type,
sQ2_eqProxy: ( list * list ) > $o ).
tff(pred_def_5,type,
sQ3_eqProxy: ( $int * $int ) > $o ).
tff(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f37]) ).
tff(f37,plain,
! [X0: $int] : inRange(X0,nil),
inference(equality_resolution,[],[f34]) ).
tff(f34,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
| ( nil != X1 ) ),
inference(cnf_transformation,[],[f27]) ).
tff(f27,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 ) ) )
& ( ( inRange(X0,sK1(X0,X1))
& $less(sK0(X0,X1),X0)
& ~ $less(sK0(X0,X1),0)
& ( cons(sK0(X0,X1),sK1(X0,X1)) = X1 ) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f25,f26]) ).
tff(f26,plain,
! [X0: $int,X1: list] :
( ? [X4: $int,X5: list] :
( inRange(X0,X5)
& $less(X4,X0)
& ~ $less(X4,0)
& ( cons(X4,X5) = X1 ) )
=> ( inRange(X0,sK1(X0,X1))
& $less(sK0(X0,X1),X0)
& ~ $less(sK0(X0,X1),0)
& ( cons(sK0(X0,X1),sK1(X0,X1)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f25,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 ) ) )
& ( ? [X4: $int,X5: list] :
( inRange(X0,X5)
& $less(X4,X0)
& ~ $less(X4,0)
& ( cons(X4,X5) = X1 ) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(rectify,[],[f24]) ).
tff(f24,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 ) ) )
& ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(flattening,[],[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 ) ) )
& ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f22,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/sandbox/tmp/tmp.hilBhxqEGo/Vampire---4.8_4268',inRange) ).
tff(f58,plain,
~ inRange(4,nil),
inference(evaluation,[],[f57]) ).
tff(f57,plain,
( ~ inRange(4,nil)
| ~ $less(2,4)
| $less(2,0) ),
inference(resolution,[],[f56,f36]) ).
tff(f36,plain,
! [X2: $int,X3: list,X0: $int] :
( inRange(X0,cons(X2,X3))
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0) ),
inference(equality_resolution,[],[f35]) ).
tff(f35,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( inRange(X0,X1)
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) ),
inference(cnf_transformation,[],[f27]) ).
tff(f56,plain,
~ inRange(4,cons(2,nil)),
inference(evaluation,[],[f55]) ).
tff(f55,plain,
( ~ inRange(4,cons(2,nil))
| ~ $less(3,4)
| $less(3,0) ),
inference(resolution,[],[f54,f36]) ).
tff(f54,plain,
~ inRange(4,cons(3,cons(2,nil))),
inference(evaluation,[],[f53]) ).
tff(f53,plain,
( ~ inRange(4,cons(3,cons(2,nil)))
| ~ $less(1,4)
| $less(1,0) ),
inference(resolution,[],[f28,f36]) ).
tff(f28,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(flattening,[],[f7]) ).
tff(f7,negated_conjecture,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
inRange(4,cons(1,cons(3,cons(2,nil)))),
file('/export/starexec/sandbox/tmp/tmp.hilBhxqEGo/Vampire---4.8_4268',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : DAT098_1 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.16 % 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.15/0.37 % Computer : n009.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 12:45:25 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF0_THM_EQU_ARI problem
% 0.15/0.37 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.hilBhxqEGo/Vampire---4.8_4268
% 0.59/0.76 % (4690)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 (2996ds/56Mi)
% 0.59/0.76 % (4683)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 (2996ds/34Mi)
% 0.59/0.76 % (4685)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.76 % (4684)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 (2996ds/51Mi)
% 0.59/0.76 % (4686)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.76 % (4688)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.76 % (4690)First to succeed.
% 0.59/0.76 % (4687)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 (2996ds/34Mi)
% 0.59/0.76 % (4689)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 (2996ds/83Mi)
% 0.59/0.76 % (4690)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4532"
% 0.59/0.77 % (4690)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for Vampire---4
% 0.59/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.77 % (4690)------------------------------
% 0.59/0.77 % (4690)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (4690)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (4690)Memory used [KB]: 969
% 0.59/0.77 % (4690)Time elapsed: 0.003 s
% 0.59/0.77 % (4690)Instructions burned: 4 (million)
% 0.59/0.77 % (4532)Success in time 0.384 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------