TSTP Solution File: DAT091_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT091_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/sandbox2/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 : Sun May 5 05:04:33 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 32 ( 6 unt; 12 typ; 0 def)
% Number of atoms : 34 ( 24 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 36 ( 22 ~; 6 |; 0 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 27 ( 0 atm; 0 fun; 0 num; 27 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 17 ( 10 >; 7 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?; 52 :)
% 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_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(pred_def_6,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_7,type,
sQ1_eqProxy: ( list * list ) > $o ).
tff(f52,plain,
$false,
inference(resolution,[],[f51,f50]) ).
tff(f50,plain,
! [X2: list,X0: $int,X1: $int] : ~ sQ0_eqProxy(count(X0,cons(X1,X2)),count(X0,nil)),
inference(resolution,[],[f42,f45]) ).
tff(f45,plain,
! [X0: $int,X1: list] : ~ sQ1_eqProxy(cons(X0,X1),nil),
inference(equality_proxy_replacement,[],[f39,f41]) ).
tff(f41,plain,
! [X0: list,X1: list] :
( sQ1_eqProxy(X0,X1)
<=> ( X0 = X1 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
tff(f39,plain,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/tmp/tmp.iOQjZ5zZRY/Vampire---4.8_27240',l4) ).
tff(f42,plain,
! [X2: $int,X0: list,X1: list] :
( sQ1_eqProxy(X0,X1)
| ~ sQ0_eqProxy(count(X2,X0),count(X2,X1)) ),
inference(equality_proxy_replacement,[],[f36,f40,f41]) ).
tff(f40,plain,
! [X0: $int,X1: $int] :
( sQ0_eqProxy(X0,X1)
<=> ( X0 = X1 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f36,plain,
! [X2: $int,X0: list,X1: list] :
( ( count(X2,X0) != count(X2,X1) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: list,X1: list] :
( ! [X2: $int] : ( count(X2,X0) != count(X2,X1) )
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: list,X1: list] :
( ( X0 != X1 )
=> ! [X2: $int] : ( count(X2,X0) != count(X2,X1) ) ),
inference(flattening,[],[f31]) ).
tff(f31,plain,
~ ~ ! [X0: list,X1: list] :
( ( X0 != X1 )
=> ! [X2: $int] : ( count(X2,X0) != count(X2,X1) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X7: list,X8: list] :
( ( X7 != X8 )
=> ! [X5: $int] : ( count(X5,X7) != count(X5,X8) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X7: list,X8: list] :
( ( X7 != X8 )
=> ! [X5: $int] : ( count(X5,X7) != count(X5,X8) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iOQjZ5zZRY/Vampire---4.8_27240',c) ).
tff(f51,plain,
! [X0: $int,X1: $int] : sQ0_eqProxy(X0,X1),
inference(resolution,[],[f50,f43]) ).
tff(f43,plain,
! [X2: list,X0: $int,X1: $int] :
( sQ0_eqProxy(count(X0,cons(X1,X2)),count(X0,X2))
| sQ0_eqProxy(X0,X1) ),
inference(equality_proxy_replacement,[],[f37,f40,f40]) ).
tff(f37,plain,
! [X2: list,X0: $int,X1: $int] :
( ( count(X0,cons(X1,X2)) = count(X0,X2) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: $int,X1: $int,X2: list] :
( ( count(X0,cons(X1,X2)) = count(X0,X2) )
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 != X1 )
=> ( count(X0,cons(X1,X2)) = count(X0,X2) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X0: $int,X3: $int,X4: list,X5: $int] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iOQjZ5zZRY/Vampire---4.8_27240',a_3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : DAT091_1 : TPTP v8.1.2. Released v6.1.0.
% 0.14/0.15 % 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.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:35:01 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 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/tmp/tmp.iOQjZ5zZRY/Vampire---4.8_27240
% 0.58/0.75 % (27604)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.58/0.75 % (27597)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.58/0.75 % (27599)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.58/0.75 % (27604)First to succeed.
% 0.58/0.75 % (27598)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.58/0.75 % (27601)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.58/0.75 % (27600)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.58/0.75 % (27602)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.58/0.75 % (27603)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.58/0.75 % (27604)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27502"
% 0.58/0.75 % (27604)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (27604)------------------------------
% 0.58/0.75 % (27604)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (27604)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (27604)Memory used [KB]: 967
% 0.58/0.75 % (27604)Time elapsed: 0.002 s
% 0.58/0.75 % (27604)Instructions burned: 3 (million)
% 0.58/0.75 % (27502)Success in time 0.379 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------